关于「牌卡应用的审计与预注册试验」,《梦境意象、哈希牌卡与巧合基率》给出的定量结论是什么?

结论:第八章给出审计方法与一项预注册试验。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

数据口径:本书不主张梦或牌能预示任何事;意象图、事件率、记忆率与行为参数均为示意或合成模型;全部数据由书中程序生成;本书不是医疗或心理建议。 第六章的示意模型显示,牌对「行动瘫痪」的帮助(开始工作的概率从 0.584 到 0.740)与硬币相同,且不如「如果-就」计划。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

   redraws allowed 0: positive share 0.500
   redraws allowed 1: positive share 0.750
   redraws allowed 2: positive share 0.875
   redraws allowed 3: positive share 0.938
   commitment published at midnight: 29e32d586fb225d412fe1adb...
   salt matches commitment: True; doctored 25, caught 25
   positive share in the log 0.533 (fair 0.500)
查看完整验算程序
# Chapter 8. p15: Auditing a card app. (1) Redraws: if 27 of 54 cards
# read as "positive" and a user may redraw a negative card up to r
# times, the share of positive readings is 1 - 0.5**(r + 1). (2) A
# commit-reveal log: the app publishes SHA-256 of each day's salt in
# advance; afterwards anyone can recompute every top card from user,
# date, salt and question. An operator who quietly redrew a negative
# card for 5% of 1,000 users (seed 89) is caught by recomputation.
import hashlib
import random

DECK = ["{}{:02d}".format(s, r) for s in "FWAE" for r in range(1, 14)]
DECK += ["JK1", "JK2"]
POSITIVE = set(DECK[0::2])

def top_card(user, date, salt, question):
    q = hashlib.sha256(question.encode("utf-8")).hexdigest()
    seed = hashlib.sha256("{}|{}|{}|{}".format(user, date, salt, q)
                          .encode("utf-8")).digest()
    w = int.from_bytes(hashlib.sha256(seed).digest()[:4], "big")
    limit = (2 ** 32 // 54) * 54
    k = 0
    while w >= limit:
        k += 1
        w = int.from_bytes(hashlib.sha256(seed + bytes([k])).digest()[:4],
                           "big")
    return DECK[w % 54]

if __name__ == "__main__":
    for r in range(4):
        print("   redraws allowed {}: positive share {:.3f}".format(
            r, 1 - 0.5 ** (r + 1)))
    salt = "s-2026-11-09"
    commit = hashlib.sha256(salt.encode()).hexdigest()
    print("   commitment published at midnight: {}...".format(commit[:24]))
    rng = random.Random(89)
    log, doctored = [], 0
    for u in range(1000):
        user, q = "u{:04d}".format(u), "What should I start today?"
        card = top_card(user, "2026-11-09", salt, q)
        if card not in POSITIVE and rng.random() < 0.05:
            card = rng.choice(sorted(POSITIVE))
            doctored += 1
        log.append((user, q, card))
    ok = hashlib.sha256(salt.encode()).hexdigest() == commit
    bad = sum(1 for user, q, card in log
              if top_card(user, "2026-11-09", salt, q) != card)
    print("   salt matches commitment: {}; doctored {}, caught {}".format(
        ok, doctored, bad))
    pos = sum(1 for _, _, c in log if c in POSITIVE) / 1000
    print("   positive share in the log {:.3f} (fair 0.500)".format(pos))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《梦境意象二分图、确定性哈希牌卡与潜意识先验激活》第 8 章「牌卡应用的审计与预注册试验」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090233

DOI: 10.5281/zenodo.24090233 · 阅读本章所在专著 · 5DL-B-089 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026089,
  author    = {Fan, Yafu},
  title     = {Dream Motif Bipartite Graphs, Deterministic Oracle Decks and Subconscious Prior Activation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090233},
  url       = {https://doi.org/10.5281/zenodo.24090233}
}

本书其他章节结论