What does Retrodiction and Upsell Automata conclude, in numbers, about “Retrodictive Statements and the "Trust Avalanche"”?
Answer: Chapter 1 shows that the "trust avalanche" is a transition in feeling, not in evidence: a generic retrodictive statement has a true likelihood ratio of only 1.19, and a sceptic needs 27 hits to be half convinced, but if its base rate of 0.80 is taken for 0.20, 3 suffice; among 20,000 simulated users a reader with no insight at all convinces 0.5263 within 6 generic statements, while users who update with the true ratios are almost never convinced. A "trough year" that is a shared low for a quarter of the population has a likelihood ratio of 3.60, not 13.50.
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: 1.19, 13.50, 27, 3.60
| statement h b true b seen LR true LR seen | |
| generic (Barnum) | 0.95 0.800 0.200 1.19 4.75 |
| semi-specific | 0.90 0.300 0.300 3.00 3.00 |
| trough year of 15 | 0.90 0.250 0.067 3.60 13.50 |
| checkable detail | 0.90 0.020 0.020 45.00 45.00 |
| hits needed for posterior | 0.5 (true/seen) 0.95 (true/seen) |
| generic (Barnum) | 27/3 44/5 |
| semi-specific | 5/5 7/7 |
| trough year of 15 | 4/2 6/3 |
| checkable detail | 2/2 2/2 |
| Reading: a generic statement is almost no evidence (LR 1.19); | |
| a sceptic would need 27 such hits, but if it feels personal she | |
| is half convinced after 3 and sure after 5. The trough year | |
| looks strong for the same reason. Only checkable details carry | |
| the weight they seem to. |
Key formula
Show the full program
# Chapter 1. [p01] What a retrodictive "hit" is worth: likelihood ratios.
# A sceptic gives the reader a prior probability of real insight of
# 0.01 (odds 1:99). A retrodictive statement about her past hits with
# probability h if the reader has insight and with the base rate b if
# not; a hit multiplies the odds by LR = h / b. Four kinds of
# statement. A generic statement feels personal (the Forer effect):
# the user takes its base rate to be 0.20, not 0.80. For the
# "trough year" the user believes b = 1/15 (one of
# 15 years) while the true base rate is 0.25, because in the population
# one year (a shared shock) is the worst year for a quarter of people.
# Hits needed to reach a posterior of 0.5 and of 0.95, with true and
# with perceived base rates.
import math
PRIOR = 0.01
KINDS = (("generic (Barnum)", 0.95, 0.80, 0.20),
("semi-specific", 0.90, 0.30, 0.30),
("trough year of 15", 0.90, 0.25, 1 / 15),
("checkable detail", 0.90, 0.02, 0.02))
def hits_needed(lr, target):
need = math.log(target / (1 - target)) - math.log(PRIOR / (1 - PRIOR))
return math.ceil(need / math.log(lr)) if lr > 1 else None
if __name__ == "__main__":
print(" statement h b true b seen LR true LR seen")
for name, h, b, seen in KINDS:
print(" {:19s} {:5.2f} {:8.3f} {:7.3f} {:8.2f} {:8.2f}".format(
name, h, b, seen, h / b, h / seen))
print("\n hits needed for posterior 0.5 (true/seen)"
" 0.95 (true/seen)")
for name, h, b, seen in KINDS:
print(" {:19s} {:>12s} {:>17s}".format(
name,
"{}/{}".format(hits_needed(h / b, 0.5),
hits_needed(h / seen, 0.5)),
"{}/{}".format(hits_needed(h / b, 0.95),
hits_needed(h / seen, 0.95))))
print("\nReading: a generic statement is almost no evidence (LR 1.19);")
print("a sceptic would need 27 such hits, but if it feels personal she")
print("is half convinced after 3 and sure after 5. The trough year")
print("looks strong for the same reason. Only checkable details carry")
print("the weight they seem to.")Single source and citation
Fan, Y. (2026). Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata (Version 1.0.0), Chapter 1: Retrodictive Statements and the "Trust Avalanche". 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 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*
- Chapter 8 · A Calculator for the User and a Pre-Registered Blinded Test