What does Moon Blocks, Holy Casts and Temple Verses conclude, in numbers, about “Matching After the Fact: Ambiguous Clauses, Time Windows and Selective Memory”?

Answer: Chapter 5 shows how ambiguous clauses, open deadlines and selective memory multiply, so that 0.5330 of simulated readers sincerely remember that most lots came true.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs. Chapter 7 examines the entry on divination cups in Cheng Dachang's Yanfanlu and Cicero's De Divinatione, setting the illustrative Venus throw of four knucklebones, 0.0384, beside three holy casts.

中文版

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.5330

habremembered fit rate
0.20.80.80.2000
0.20.80.30.4000
0.20.90.20.5294
0.30.80.80.3000
0.30.80.30.5333
0.30.90.20.6585
0.50.80.80.5000
0.50.80.30.7273
0.50.90.20.8182
simulated people remembering mostly fits: 1066 of 2000
share: 0.5330
Show the full program
# Chapter 5. p52: selective memory turns a modest hit rate into a
# remembered success rate.
# Model: a reading turns out to fit with true chance h. A fitting
# reading is remembered with chance a, a non-fitting one with b.
# The remembered fit rate is a h / (a h + b (1 - h)). A seeded
# simulation follows 2000 illustrative people who each consult 20
# times, h = 0.3, a = 0.8, b = 0.3, and counts how many remember a
# majority of fits. All rates are illustrative.
import random

PEOPLE = 2000
VISITS = 20


def remembered(h, a, b):
    return a * h / (a * h + b * (1.0 - h))


if __name__ == "__main__":
    print("  h     a    b     remembered fit rate")
    for h in (0.2, 0.3, 0.5):
        for a, b in ((0.8, 0.8), (0.8, 0.3), (0.9, 0.2)):
            print(" {:.1f}   {:.1f}  {:.1f}   {:.4f}".format(
                h, a, b, remembered(h, a, b)))
    rng = random.Random(20261112)
    major = 0
    shares = []
    for _ in range(PEOPLE):
        hit_m = 0
        miss_m = 0
        for _ in range(VISITS):
            if rng.random() < 0.3:
                hit_m += rng.random() < 0.8
            else:
                miss_m += rng.random() < 0.3
        tot = hit_m + miss_m
        if tot and hit_m * 2 > tot:
            major += 1
    print("simulated people remembering mostly fits: {} of {}".format(
        major, PEOPLE))
    print("share: {:.4f}".format(major / PEOPLE))

Single source and citation

Fan, Y. (2026). Rigid-Body Landing Probabilities of Moon Blocks, the Likelihood of Three Consecutive Holy Casts and Barnum Effects in Temple Oracle Verses (Version 1.0.0), Chapter 5: Matching After the Fact: Ambiguous Clauses, Time Windows and Selective Memory. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-225 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026225,
  author    = {Fan, Yafu},
  title     = {Rigid-Body Landing Probabilities of Moon Blocks, the Likelihood of Three Consecutive Holy Casts and Barnum Effects in Temple Oracle Verses},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book