关于「伪造成本:追问深度、记忆负荷与检出上下界」,《推理轨迹识人与结果运气剥离》给出的定量结论是什么?

结论:第五章给出伪造成本模型:示意参数下第六层追问时表演者与真推理者的标记概率为 0.784 与 0.241,而在脚本充分、推理树狭窄的角落里命题失效,所以一次标记只能触发复查。

数据口径:事后解释常常是一套通俗理论:合成实验里,事后自述与真实权重的相关只有 -0.013,与旁观者凭常识的猜测却高达 0.826;同步出声思考保留了次序与跳跃,要求边做边解释则会改变被测过程。 核对文献后本书做了蓝图修正:人能表演推理,旁人判别真假的正确率只比抛硬币高一点,因此不主张「不可伪造的思维指纹」,只主张伪造成本随追问深度上升,并写出上下界与推翻条件;甄选效度以修订后的估计为锚,结构化访谈居首也只有 0.42 上下,单一方法有限,须按规则多方法合成。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.241, 0.784

S = 40, b = 3, q = 0.03, q_h = 0.003, notice = 0.7
depthcoverloadP(flag|perf)P(flag|genuine)ratio
11.00040.0000.0040.0
21.00080.0000.0250.0
31.000120.0000.0610.0
40.494160.2180.1112.0
50.165200.5440.1723.2
60.055240.7840.2413.3
70.018280.9130.3162.9
80.006320.9700.3932.5
查看完整验算程序
# Chapter 5. p51: forgery cost against probing depth (illustrative).
# Two "why" probes are asked at each depth k = 1..D. A performer has a
# prepared script of S = 40 nodes; the reasoning tree branches b = 3
# ways, so the script covers depth k with prob c_k = min(1, S / b^k).
# Off script, the performer must improvise an answer consistent with
# every commitment made so far (two per answer); each check fails with
# prob q = 0.03. A genuine reasoner regenerates answers from a working
# model and slips with prob q_h = 0.003 per commitment. An assessor
# notices an inconsistency with prob 0.7. P(flag) = prob of at least
# one noticed inconsistency by depth D. Memory load = commitments.
S, B, Q, QH, SENS = 40, 3, 0.03, 0.003, 0.7
PER_DEPTH, PER_ANSWER = 2, 2


def flag_curve(s, b, q, qh, sens, depth):
    clean_p, clean_g, made = 1.0, 1.0, 0
    rows = []
    for k in range(1, depth + 1):
        cover = min(1.0, s / b ** k)
        for _ in range(PER_DEPTH):
            slip_p = 1 - (1 - q) ** made
            slip_g = 1 - (1 - qh) ** made
            clean_p *= 1 - (1 - cover) * slip_p * sens
            clean_g *= 1 - slip_g * sens
            made += PER_ANSWER
        rows.append((k, cover, made, 1 - clean_p, 1 - clean_g))
    return rows


def main():
    print("S = {}, b = {}, q = {}, q_h = {}, notice = {}".format(
        S, B, Q, QH, SENS))
    print("depth  cover  load  P(flag|perf)  P(flag|genuine)  ratio")
    for k, c, m, fp, fg in flag_curve(S, B, Q, QH, SENS, 8):
        ratio = fp / fg if fg > 0 else float("inf")
        print("{:>5}{:>7.3f}{:>6}{:>14.3f}{:>17.3f}{:>7.1f}".format(
            k, c, m, fp, fg, ratio))


main()

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《思维脉络溯源识人、过程追踪博弈与剥离意图结果假象母典》第 5 章「伪造成本:追问深度、记忆负荷与检出上下界」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-385 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026385,
  author    = {Fan, Yafu},
  title     = {Reasoning-Trajectory Profiling, Process-Tracing Games and Separating Cognitive Structure from Stated Intentions and Outcome Luck},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论