What does Moon Blocks, Holy Casts and Temple Verses conclude, in numbers, about “How Universal a Temple Verse Is: Scoring Barnum Statements and a Model of Acceptance”?
Answer: Chapter 4 checks Forer's classroom experiment of 1949: its mean rating of 4.26 corresponds in a toy model to a universality of 0.852 per sentence; two verse-style lines carry only 1.380 bits, while one specific statement carries 6.508.
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.852, 4.26
| u | mean | sd | rated >= 4 (of 39) |
| 0.300 | 1.509 | 0.554 | 0 |
| 0.500 | 2.515 | 0.748 | 1 |
| 0.700 | 3.501 | 0.623 | 10 |
| 0.800 | 4.004 | 0.527 | 22 |
| 0.852 | 4.201 | 0.554 | 27 |
| 0.900 | 4.507 | 0.384 | 36 |
| model mean 5u equals 4.26 at u = 0.852 | |||
| model standard error of a class mean at that u: 0.079 |
Show the full program
# Chapter 4. p41: a toy acceptance model behind a Forer-type rating.
# Model: a sketch holds 13 statements (Forer 1949 used a sketch of 13
# statements and a 0 to 5 rating; his class of 39 gave a mean of
# 4.26). A reader accepts each statement independently with chance u,
# the statement's universality, and rates the whole sketch as
# 5 x (accepted / 13). A seeded class of 39 readers is simulated for
# several u. The mapping from u to rating is an illustrative model,
# not Forer's analysis; it only shows what universality a mean of
# 4.26 would imply if the model held.
import math
import random
STATEMENTS = 13
CLASS = 39
def one_class(rng, u):
rates = []
for _ in range(CLASS):
acc = 0
for _ in range(STATEMENTS):
if rng.random() < u:
acc += 1
rates.append(5.0 * acc / STATEMENTS)
mean = math.fsum(rates) / CLASS
var = math.fsum([(r - mean) ** 2 for r in rates]) / (CLASS - 1)
high = len([r for r in rates if r >= 4.0])
return mean, math.sqrt(var), high
if __name__ == "__main__":
rng = random.Random(20261112)
print(" u mean sd rated >= 4 (of 39)")
for u in (0.30, 0.50, 0.70, 0.80, 0.852, 0.90):
m, s, hi = one_class(rng, u)
print(" {:.3f} {:.3f} {:.3f} {:>2d}".format(u, m, s, hi))
implied = 4.26 / 5.0
print("model mean 5u equals 4.26 at u = {:.3f}".format(implied))
se = math.sqrt(5.0 * 5.0 * implied * (1 - implied)
/ STATEMENTS / CLASS)
print("model standard error of a class mean at that u: {:.3f}"
.format(se))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 4: How Universal a Temple Verse Is: Scoring Barnum Statements and a Model of Acceptance. 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 2 · Three Holy Casts in a Row: One Eighth Is a Ceiling, Not a Miracle
- Chapter 3 · A Logbook of Three Hundred Casts: Three-Way Counts, a Test of Independence and the Mismatched Pair
- 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