关于「外应的基率:类象分划、泊松时钟与注意捕获」,《梅花易数的哈希与基率》给出的定量结论是什么?

结论:第五章说明《说卦》的类象是一组分划,一次解读平均覆盖一半以上的卦,一个维度上随手对上的概率是 0.5108,按最严格的事前指定标准,30 分钟内对上的概率也有 0.9994,注意捕获还会进一步放大匹配。

数据口径:书中的人群分布、注意率与记忆率均为示意;全部计算由书中程序生成;本书分析结构与概率,不做任何个人占断,也不构成商业、法律或理财建议。 第六章用似然比为「事后对上」定价,并模拟选择性记忆如何把一半对一半的运气变成 0.795 的回忆相符率。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.5108, 0.9994, 30

match standard p t=1 t=3 t=10 t=30
strict, named in advance0.1250 0.2212 0.5276 0.9179 0.9994
loose, one dimension0.5108 0.6400 0.9533 1.0000 1.0000
loose, two dimensions0.7506 0.7771 0.9889 1.0000 1.0000
expected matches in 30 minutes
strict, named in advance7.5
loose, one dimension30.6
loose, two dimensions45.0
median wait, strict, named in advance2.77 min
median wait, loose, one dimension0.68 min
median wait, loose, two dimensions0.46 min
查看完整验算程序
# Chapter 5. p52: how long until the world "answers"? A Poisson clock.
# A person who has just cast notices salient things at rate lam per
# minute (illustrative: 2). Each one matches the reading with chance p.
# Matches then arrive as a Poisson process of rate lam * p, so the
# chance of at least one within t minutes is 1 - exp(-lam p t). Three
# match standards: strict (one trigram named in advance, one dimension:
# 1/8), loose on one dimension (p51, D = 1) and loose on two (D = 2).
import math

LAM = 2.0
STANDARDS = (("strict, named in advance", 1 / 8),
             ("loose, one dimension", 0.5108),
             ("loose, two dimensions", 0.7506))


def main():
    print("match standard              p     t=1    t=3   t=10   t=30")
    for name, p in STANDARDS:
        row = " ".join("{:>6.4f}".format(1 - math.exp(-LAM * p * t))
                       for t in (1, 3, 10, 30))
        print("{:<26} {:>6.4f} {}".format(name, p, row))
    print("expected matches in 30 minutes")
    for name, p in STANDARDS:
        print("   {:<26} {:>6.1f}".format(name, LAM * p * 30))
    for name, p in STANDARDS:
        t = math.log(2) / (LAM * p)
        print("median wait, {:<26} {:>5.2f} min".format(name, t))


if __name__ == "__main__":
    main()

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《梅花易数体用生克自动机、年月日时哈希碰撞与外应注意捕获基率》第 5 章「外应的基率:类象分划、泊松时钟与注意捕获」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026156,
  author    = {Fan, Yafu},
  title     = {Plum-Blossom Numerology as a Body-Use Automaton, Hash Collisions in Date-Time Casting and Base Rates of Attention-Captured Omens},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论