What does Plum-Blossom Hashes and Base Rates conclude, in numbers, about “What a Fit Found After the Fact Is Worth: Likelihood Ratios, Selective Memory and Barnum Sentences”?
Answer: Chapter 6 prices fits found after the fact by their likelihood ratios and simulates how selective memory turns even odds into a remembered fit rate of 0.795.
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.795
| true match rate | 0.500 |
| remembered match rate, expected | 0.795 |
| remembered match rate, simulated | 0.794 |
| simulated 5th and 95th percentiles 0.727 0.853 | |
| clients who recall more than 0.75 | 872 of 1,000 |
| without reinterpretation, expected | 0.727 |
Show the full program
# Chapter 6. p62: selective memory turns a coin into a reputation.
# Each of 1,000 simulated clients makes 200 readings; each reading
# matches later events with chance 0.5 (pure chance). A match is
# remembered with chance 0.8, a miss with chance 0.3, and a remembered
# miss is reinterpreted as a match with chance 0.25 ("it fitted after
# all"). All rates are illustrative. Fixed seed; exact expectation too.
import math
import random
rng = random.Random(20261112)
P_HIT, R_HIT, R_MISS, STRETCH = 0.5, 0.8, 0.3, 0.25
def main():
rates = []
for _ in range(1000):
good = bad = 0
for _ in range(200):
if rng.random() < P_HIT:
if rng.random() < R_HIT:
good += 1
elif rng.random() < R_MISS:
if rng.random() < STRETCH:
good += 1
else:
bad += 1
rates.append(good / (good + bad))
rates.sort()
mem_hit = P_HIT * R_HIT + (1 - P_HIT) * R_MISS * STRETCH
mem_all = P_HIT * R_HIT + (1 - P_HIT) * R_MISS
print("true match rate {:.3f}".format(P_HIT))
print("remembered match rate, expected {:.3f}".format(
mem_hit / mem_all))
print("remembered match rate, simulated {:.3f}".format(
math.fsum(rates) / len(rates)))
print("simulated 5th and 95th percentiles {:.3f} {:.3f}".format(
rates[49], rates[949]))
above = len([r for r in rates if r > 0.75])
print("clients who recall more than 0.75 {} of 1,000".format(above))
no_stretch = P_HIT * R_HIT / mem_all
print("without reinterpretation, expected {:.3f}".format(no_stretch))
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 6: What a Fit Found After the Fact Is Worth: Likelihood Ratios, Selective Memory and Barnum Sentences. 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
- Chapter 1 · Date-Time Casting as a Hash: Only Half of 384 Slots Are Ever Hit
- Chapter 2 · Same Double-Hour, Same Hexagram: the Birthday Problem and Crowd Degeneracy
- Chapter 3 · The Body-Use Rule Is Subtraction Modulo 5: a Five-State Automaton and Its Verdicts
- Chapter 4 · Forking Paths through Season, Nucleus and Change: How Often One Figure Supports Both Verdicts
- Chapter 5 · Base Rates of the External Omen: Partitions of Symbols, a Poisson Clock and Attention Capture
- Chapter 7 · The Sources Examined: the Plum-Viewing Case, Wang Chong on Divination and Ghosts, and Bacon's Votive Tablets
- Chapter 8 · Practice and Refutation: a Copy Checker, Pre-Registered Tests and the Conditions That Would Overturn This Book