What does Plum-Blossom Hashes and Base Rates conclude, in numbers, about “Practice and Refutation: a Copy Checker, Pre-Registered Tests and the Conditions That Would Overturn This Book”?

Answer: Chapter 8 gives owners a self-audit list, a persuasion-copy checker with eight rules and a pre-registered testing plan (the blind match needs 325 participants). Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.

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: 325

test                         p0      p1      n   reject if >=
T1 blind three-way match     0.3333  0.4000   325   123
   size 0.0488, power 0.8018
T2 strict omen, 1/8          0.1250  0.2000   149   26
   size 0.0490, power 0.8095
T1 normal approximation: 317.4
T3 collision audit: any n; one mismatching pair refutes p11
Show the full program
# Chapter 8. p81: sample sizes for three pre-registered tests, exact.
# T1 blind matching: each client sees the reading cast for their own
# question and two decoys cast for other times, and picks one; chance
# is 1/3, the claim to detect 0.40. T2 strict omen: a trigram and one
# dimension named in advance, chance 1/8, claim 0.20. T3 collision
# audit: n pairs who cast in the same double-hour; the rule predicts
# all identical, so one mismatch refutes it. One-sided alpha 0.05,
# power 0.80; exact binomial tails; smallest n that works.
import math


def upper_tail(n, p, c):
    lp, lq = math.log(p), math.log(1 - p)
    terms = [math.exp(math.lgamma(n + 1) - math.lgamma(k + 1)
                      - math.lgamma(n - k + 1) + k * lp + (n - k) * lq)
             for k in range(c, n + 1)]
    return math.fsum(terms)


def smallest_n(p0, p1, alpha=0.05, power=0.80):
    n = 5
    while True:
        c = math.ceil(n * p0)
        while upper_tail(n, p0, c) > alpha:
            c += 1
        if upper_tail(n, p1, c) >= power:
            return n, c
        n += 1


def main():
    print("test                         p0      p1      n   reject if >=")
    for name, p0, p1 in (("T1 blind three-way match", 1 / 3, 0.40),
                         ("T2 strict omen, 1/8", 0.125, 0.20)):
        n, c = smallest_n(p0, p1)
        print("{:<28} {:.4f}  {:.4f} {:>5}   {}".format(
            name, p0, p1, n, c))
        print("   size {:.4f}, power {:.4f}".format(
            upper_tail(n, p0, c), upper_tail(n, p1, c)))
    z_a, z_b = 1.6449, 0.8416
    p0, p1 = 1 / 3, 0.40
    approx = ((z_a * math.sqrt(p0 * (1 - p0))
               + z_b * math.sqrt(p1 * (1 - p1))) / (p1 - p0)) ** 2
    print("T1 normal approximation: {:.1f}".format(approx))
    print("T3 collision audit: any n; one mismatching pair refutes p11")


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 8: Practice and Refutation: a Copy Checker, Pre-Registered Tests and the Conditions That Would Overturn This Book. 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