What does Retrodiction and Upsell Automata conclude, in numbers, about “A Calculator for the User and a Pre-Registered Blinded Test”?
Answer: Chapter 8 gives a calculator for users and a pre-registered blinded test (152 participants). Marked boxes separate evidence, 16 runnable Python programs, classical sources and hypotheses.
Scope of the numbers: Marked boxes separate evidence, 16 runnable Python programs, classical sources and 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: 152
participants 152, reject H0 at 61 hits or more size 0.0468, power 0.9015 for H1 = 0.40 instead: 447 participants, 166 hits Reading: a fair test of retrodiction is cheap: a few hundred participants. What makes it fair is the decoys, the blinding and the registration, not the size.
Show the full program
# Chapter 8. [p16] A pre-registered blinded retrodiction test.
# Each participant gives birth data; an independent analyst runs the
# registered engine to write retrodictive statements for the
# participant and for two decoys (other participants' birth data). The
# participant, blind to the source, picks the set that fits her past.
# H0: hit rate 1/3. H1: 0.45. One-sided exact binomial test at 0.05,
# power 0.90: the smallest n and its critical number of hits.
from math import comb
def tails(n, p):
"""upper tails P(X >= k), k = 0..n, for X ~ Binomial(n, p)"""
pmf = [comb(n, j) * p ** j * (1 - p) ** (n - j) for j in range(n + 1)]
out, acc = [0.0] * (n + 2), 0.0
for j in range(n, -1, -1):
acc += pmf[j]
out[j] = acc
return out
def plan(p0, p1, alpha=0.05, power=0.90):
for n in range(20, 2000):
t0, t1 = tails(n, p0), tails(n, p1)
k = next(k for k in range(n + 1) if t0[k] <= alpha)
if t1[k] >= power:
return n, k, t0[k], t1[k]
if __name__ == "__main__":
n, k, a, b = plan(1 / 3, 0.45)
print(" participants {}, reject H0 at {} hits or more".format(n, k))
print(" size {:.4f}, power {:.4f}".format(a, b))
n2, k2, a2, b2 = plan(1 / 3, 0.40)
print(" for H1 = 0.40 instead: {} participants, {} hits".format(
n2, k2))
print("\nReading: a fair test of retrodiction is cheap: a few hundred")
print("participants. What makes it fair is the decoys, the blinding")
print("and the registration, not the size.")Single source and citation
Fan, Y. (2026). Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata (Version 1.0.0), Chapter 8: A Calculator for the User and a Pre-Registered Blinded Test. 5D Library. https://doi.org/10.5281/zenodo.24090186
DOI: 10.5281/zenodo.24090186 · Read the monograph · 5DL-B-069 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026069,
author = {Fan, Yafu},
title = {Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090186},
url = {https://doi.org/10.5281/zenodo.24090186}
}Other chapter answers in this book
- Chapter 1 · Retrodictive Statements and the "Trust Avalanche"
- Chapter 2 · Testing Retrodiction Fairly: Sequential Tests and Selective Recall
- Chapter 3 · The Commitment Ratchet: Price Ratios and Upsell Timing
- Chapter 4 · What Pain-Point Agitation Buys and Costs, and Two Guardrails
- Chapter 5 · The Three-Stage Rocket: an Absorbing Markov Chain of Reading, Academy and Licence
- Chapter 6 · Cross-Module Transition Matrices: Estimation, Cannibalization and Heterogeneity
- Chapter 7 · "Probing" and "Flying and Clamping" in the *Guiguzi*, "The Difficulties of Persuasion" in the *Han Feizi*