What does Retention Algebra for Book Adaptations conclude, in numbers, about “Spaced Review Scheduling: Optimal Gaps that Grow with the Retention Interval, the Leitner Boxes as an Absorbing Chain, and a Daily Review Cap”?
Answer: The timid schedule has the highest mean pass rate, 0.94, and needs only 5.7856 reviews per card, or 115.7 a day; but at graduation it has shown only that a card can be recalled after 5 days, so its reviews per proven day are 1.1571, the least efficient. The doubling schedule passes 0.90 on average, with 6.9351 reviews per card, 138.7 a day and 0.4334 per proven day. The bold schedule's pass rate falls to 0.82, with 9.5008 reviews per card, 190.0 a day and 0.2969 per proven day. The reckless schedule passes only 0.69, needing 17.1856 reviews per card, 12.1856 of them wrong answers, and 343.7 a day.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not legal advice and not personalised business or investment advice. Marked boxes separate published evidence, runnable Python calculations (22 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.2969, 0.4334, 0.69, 0.82, 0.90, 0.94
| schedule | pass | reviews | misses | load/day | per proven day |
|---|---|---|---|---|---|
| timid 1,1,2,3,5 | 0.94 | 5.7856 | 0.7856 | 115.7 | 1.1571 |
| doubling 1,2,4,8,16 | 0.90 | 6.9351 | 1.9351 | 138.7 | 0.4334 |
| bold 2,4,8,16,32 | 0.82 | 9.5008 | 4.5008 | 190.0 | 0.2969 |
| reckless 4,8,16,32,64 | 0.69 | 17.1856 | 12.1856 | 343.7 | 0.2685 |
Show the full program
# Chapter 5. p52: daily review load of a Leitner box schedule.
# A quiz card sits in box b = 1 to 5. In box b its memory stability is
# 2^(b - 1) days and it is reviewed after the box interval I_b; it is
# answered with probability 1 / (1 + I_b / (9 S_b)), the power law of
# p51. A pass moves it up one box, a miss sends it back to box 1, and a
# pass in box 5 retires it. The chain is absorbing; expected reviews and
# days per card follow from E_b = 1 + p_b E_(b+1) + (1 - p_b) E_1,
# solved exactly by back-substitution. With 20 new cards a day the
# steady daily load is 20 times the expected reviews (Little's law).
# A retired card has been recalled after I_5 days, its proven horizon.
# Schedules and stabilities illustrative.
import math
NEW_PER_DAY = 20
SCHEDULES = (("timid 1,1,2,3,5", (1, 1, 2, 3, 5)),
("doubling 1,2,4,8,16", (1, 2, 4, 8, 16)),
("bold 2,4,8,16,32", (2, 4, 8, 16, 32)),
("reckless 4,8,16,32,64", (4, 8, 16, 32, 64)))
def pass_prob(interval, box):
return 1.0 / (1.0 + interval / (9.0 * 2.0 ** box))
def expected(costs, probs):
# value_b = alpha_b + beta_b * value_1, built from box 5 down
alpha, beta = 0.0, 0.0
for c, p in zip(reversed(costs), reversed(probs)):
alpha, beta = (math.fsum((c, p * alpha)),
math.fsum((p * beta, 1.0 - p)))
return alpha / (1.0 - beta)
print("schedule pass reviews misses load/day "
"per proven day")
for name, iv in SCHEDULES:
probs = [pass_prob(i, b) for b, i in enumerate(iv)]
reviews = expected([1.0] * 5, probs)
print("{:21s} {:4.2f} {:7.4f} {:7.4f} {:8.1f} {:14.4f}".format(
name, math.fsum(probs) / 5, reviews, reviews - 5.0,
NEW_PER_DAY * reviews, reviews / iv[-1]))Single source and citation
Fan, Y. (2026). Content Fission Algebra: Compiling Hard-Core Monographs into Two-Host Podcasts, Study Slides and Quiz Banks (Version 1.0.0), Chapter 5: Spaced Review Scheduling: Optimal Gaps that Grow with the Retention Interval, the Leitner Boxes as an Absorbing Chain, and a Daily Review Cap. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-151 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026151,
author = {Fan, Yafu},
title = {Content Fission Algebra: Compiling Hard-Core Monographs into Two-Host Podcasts, Study Slides and Quiz Banks},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Submodular Coverage: the Greedy Algebra of Picking Sentences and the 1−1/e Guarantee
- Chapter 2 · Spoken Compression: Breadth against Repetition, Turn Length and Shannon Naming in a Two-Host Podcast
- Chapter 3 · Visual Card Compression: the Item Ceiling of a Slide, Dynamic Programming over Dependencies, and the Length of a Card
- Chapter 4 · The Pass-or-Retry Quiz Bank: Difficulty and Discrimination, Test Information at the Cut, and the Counter-Intuitive Testing Effect
- Chapter 6 · The Portfolio Algebra of One Book, Many Products: Production Hours, Fidelity Audits, the Backfire of Excess and the Copyright Red Line
- Chapter 7 · The Classics Examined: Zhu Xi on Following the Order and Reading Thoroughly, and Bacon on Books to be Tasted, Swallowed and Chewed
- Chapter 8 · Practice and Falsification: an Owner's Checklist, a Front-End Style Library and a Pre-Registered Testing Plan