What does Causal Graphs, Suspense Entropy and Foreshadowing conclude, in numbers, about “Cross-Volume Retcons: Incremental Cycle Detection, Transitive Closure and the Author's Own Forgetting”?

Answer: Cross-volume retcons have two sources. One is implied order: in the illustrative serial a harmless-looking edge in volume six closes a cycle, contradicting a chain of 10 stated edges written between volume 2 and volume 6, and incremental cycle detection raises the alarm the moment that edge is written. The other is the author's own forgetting: under the illustrative parameters, writing from memory leaves 2.06 contradictions on average by volume 4, a setting bible brings that down to 0.51, and yet by volume 10 a share of 0.813 of the runs still contains at least one. The bible, the version check and cycle detection each guard one stretch; only together do they approach zero retcons.

Scope of the numbers: Its serials, readers and parameters are illustrative models; all calculations are generated by its programs; it is not legal, financial or investment advice, and it keeps one red line: no false suspense to win clicks. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's 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: 0.51, 0.813, 10, 2.06

volschaptersmemory: meanP(>=1)bible: meanP(>=1)
1400.080.0730.040.043
2800.420.3200.150.140
41602.060.8730.510.387
62404.560.9970.890.600
83208.401.0001.430.737
1040011.871.0001.860.813
mean gap between restatements: 100 chapters
memory error at that gap: 0.0197
Show the full program
# Chapter 2. p22: the author forgets too; contradictions grow with gaps.
# A serial keeps F facts. Each chapter restates R of them at random.
# Restating a fact last written g chapters earlier, an author working
# from memory errs with probability EMAX * (1 - exp(-g / LAM)), an
# Ebbinghaus-type rise in error with the gap; an author who looks the fact
# up in a setting bible errs with a flat EBIB. Fixed-seed Monte Carlo.
# All parameters are illustrative, not measured on any author.
import math
import random

F, R, CH_PER_VOL = 300, 3, 40
EMAX, LAM, EBIB = 0.05, 200.0, 0.002
RUNS = 300
rng = random.Random(20261112)


def run(vols, lookup):
    last = {}
    errs = []
    for ch in range(vols * CH_PER_VOL):
        for f in rng.sample(range(F), R):
            if f in last:
                g = ch - last[f]
                p = EBIB if lookup else EMAX * (1 - math.exp(-g / LAM))
                if rng.random() < p:
                    errs.append(ch // CH_PER_VOL + 1)
            last[f] = ch
    return errs


print("vols  chapters  memory: mean  P(>=1)   bible: mean  P(>=1)")
for vols in (1, 2, 4, 6, 8, 10):
    row = []
    for lookup in (False, True):
        counts = [len(run(vols, lookup)) for _ in range(RUNS)]
        mean = math.fsum(counts) / RUNS
        p1 = len([c for c in counts if c > 0]) / RUNS
        row += [mean, p1]
    print("{:>4}  {:>8}  {:>12.2f}  {:>6.3f}  {:>11.2f}  {:>6.3f}".format(
        vols, vols * CH_PER_VOL, *row))
print("mean gap between restatements: {:.0f} chapters".format(F / R))
print("memory error at that gap: {:.4f}".format(
    EMAX * (1 - math.exp(-(F / R) / LAM))))

Single source and citation

Fan, Y. (2026). Causal-DAG Validation of Long-Form Narrative, Sawtooth Scheduling of Chapter Suspense Entropy and Forgetting-Aware Foreshadowing Recovery (Version 1.0.0), Chapter 2: Cross-Volume Retcons: Incremental Cycle Detection, Transitive Closure and the Author's Own Forgetting. 5D Library. DOI pending

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

BibTeX
@book{fan2026178,
  author    = {Fan, Yafu},
  title     = {Causal-DAG Validation of Long-Form Narrative, Sawtooth Scheduling of Chapter Suspense Entropy and Forgetting-Aware Foreshadowing Recovery},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book