What does Plum-Blossom Hashes and Base Rates conclude, in numbers, about “Base Rates of the External Omen: Partitions of Symbols, a Poisson Clock and Attention Capture”?

Answer: Chapter 5 shows that the associations of the Shuo Gua are partitions, so a reading covers more than half the trigrams, a chance match along one dimension has probability 0.5108, even the strictest standard named in advance gives a match within 30 minutes with probability 0.9994, and attention capture inflates matches further.

Scope of the numbers: Population shares, attention rates and memory rates are illustrative; all calculations are generated by the book's programs; the book analyses structure and probability, makes no personal reading, and is not business, legal or financial advice. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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
Show the full program
# 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()

Single source and citation

Fan, Y. (2026). Plum-Blossom Numerology as a Body-Use Automaton, Hash Collisions in Date-Time Casting and Base Rates of Attention-Captured Omens (Version 1.0.0), Chapter 5: Base Rates of the External Omen: Partitions of Symbols, a Poisson Clock and Attention Capture. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 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}
}

Other chapter answers in this book