What does Moon Blocks, Holy Casts and Temple Verses conclude, in numbers, about “Three Holy Casts in a Row: One Eighth Is a Ceiling, Not a Miracle”?
Answer: Chapter 2 corrects the project blueprint: for an identical, independent pair three holy casts come at most one time in eight, and only 0.1021 under the half-disc model; they carry at most 3.000 bits of evidence, and the more matters one asks about, the likelier a chance confirmation becomes.
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.1021
| exact at p | 1/2: q = 1/2, q^3 = 1/8, wait for 3 = 14 |
| p q q^3 | 1 in wait(3) |
| 0.4000 | 0.4800 0.1106 9.04 15.47 |
| 0.4500 | 0.4950 0.1213 8.24 14.35 |
| 0.5000 | 0.5000 0.1250 8.00 14.00 |
| 0.5500 | 0.4950 0.1213 8.24 14.35 |
| 0.6000 | 0.4800 0.1106 9.04 15.47 |
| 0.6278 | 0.4673 0.1021 9.80 16.52 |
| 0.7000 | 0.4200 0.0741 13.50 21.55 |
| 0.8000 | 0.3200 0.0328 30.52 43.41 |
| runs of k at q | 0.5 and at the half-disc q |
| k | 1 0.50000 0.46733 |
| k | 2 0.25000 0.21840 |
| k | 3 0.12500 0.10207 |
| k | 4 0.06250 0.04770 |
| k | 5 0.03125 0.02229 |
| k | 6 0.01562 0.01042 |
Show the full program
# Chapter 2. p21: three holy casts in a row, a sensitivity scan.
# Model: casts are independent; a holy cast has probability
# q = 2 p (1 - p) for an identical pair (p11 to p13). Three in a row
# has probability q^3, at most 1/8, reached only at p = 0.5. The
# expected number of casts until the first run of k holy casts is
# (1 - q^k) / ((1 - q) q^k) (a standard run result). Values of p are
# illustrative; p = 0.6278 is the half-disc value of p11.
from fractions import Fraction
def run_wait(q, k):
return (1 - q ** k) / ((1 - q) * q ** k)
if __name__ == "__main__":
half = Fraction(1, 2)
qh = 2 * half * (1 - half)
print("exact at p = 1/2: q = {}, q^3 = {}, wait for 3 = {}".format(
qh, qh ** 3, run_wait(qh, 3)))
print(" p q q^3 1 in wait(3)")
for p in (0.40, 0.45, 0.50, 0.55, 0.60, 0.6278, 0.70, 0.80):
q = 2.0 * p * (1.0 - p)
print(" {:.4f} {:.4f} {:.4f} {:6.2f} {:7.2f}".format(
p, q, q ** 3, 1.0 / q ** 3, run_wait(q, 3)))
print("runs of k at q = 0.5 and at the half-disc q")
q2 = 2.0 * 0.6278 * (1.0 - 0.6278)
for k in (1, 2, 3, 4, 5, 6):
print(" k = {} {:.5f} {:.5f}".format(k, 0.5 ** k, q2 ** k))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 2: Three Holy Casts in a Row: One Eighth Is a Ceiling, Not a Miracle. 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
- Chapter 1 · Flat Face and Convex Face: the Rigid-Body Resting Stability of a Single Moon Block
- Chapter 3 · A Logbook of Three Hundred Casts: Three-Way Counts, a Test of Independence and the Mismatched Pair
- Chapter 4 · How Universal a Temple Verse Is: Scoring Barnum Statements and a Model of Acceptance
- Chapter 5 · Matching After the Fact: Ambiguous Clauses, Time Windows and Selective Memory
- Chapter 6 · The Rite as a Protocol: Restart Rules, Stopping Rules and the Evenness of the Lot Tube
- Chapter 7 · Classical Sources East and West: the Entry on Divination Cups in the Yanfanlu and Cicero's De Divinatione
- Chapter 8 · Closing the Loop: Randomness Statements, a Controlled Experiment on Satisfaction and a Pre-Registered Protocol