What does Retention Algebra for Book Adaptations conclude, in numbers, about “Visual Card Compression: the Item Ceiling of a Slide, Dynamic Programming over Dependencies, and the Length of a Card”?

Answer: Chapter 3 finds that 3 points per slide keep 4.0909 points a minute and that an evenly spread card takes away most at 40 characters, 0.7113.

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.7113, 40

charson cardfront-loadedevenly spreadread to the end
100.32970.32960.32960.9972
200.55070.54600.54430.9400
300.69880.67610.66410.7988
400.79810.74760.71130.6276
500.86470.78430.71110.4717
600.90930.80260.68450.3436
800.95920.81580.60230.1797
1000.98170.81880.51870.0914
1400.99630.81970.39080.0262
median characters read in one look: 48.1
best front-loaded: 140 characters, 0.8197 taken away
best evenly spread: 40 characters, 0.7113 taken away
Show the full program
# Chapter 3. p33: how many characters a visual card should carry.
# A card compressed from a passage keeps a share f(W) = 1 - exp(-W / 25)
# of the passage's information when it carries W Chinese characters (a
# saturating coverage curve of the kind p11 produces). A viewer looks at
# a card for D seconds, lognormal with median 6 s and log-sd 0.5, and
# reads at R characters per second, lognormal with median 8 and log-sd
# 0.25, so min(W, D * R) characters get read. Two layouts: front-loaded
# (most important first, the viewer takes f of what was read) and
# evenly spread (the viewer takes the read share of f(W)).
# Fixed-seed Monte Carlo, 40,000 viewers. Every parameter illustrative.
import math
import random

rng = random.Random(20261112)
VIEWERS = 40000
READ = [math.exp(math.log(6.0) + 0.5 * rng.gauss(0.0, 1.0))
        * math.exp(math.log(8.0) + 0.25 * rng.gauss(0.0, 1.0))
        for _ in range(VIEWERS)]


def f(w):
    return 1.0 - math.exp(-w / 25.0)


print("chars  on card  front-loaded  evenly spread  read to the end")
best = {"front": (0.0, 0), "even": (0.0, 0)}
for w in (10, 20, 30, 40, 50, 60, 80, 100, 140):
    front = math.fsum(f(min(w, r)) for r in READ) / VIEWERS
    even = math.fsum(f(w) * min(1.0, r / w) for r in READ) / VIEWERS
    done = len([r for r in READ if r >= w]) / VIEWERS
    best["front"] = max(best["front"], (front, w))
    best["even"] = max(best["even"], (even, w))
    print("{:5d}  {:7.4f}  {:12.4f}  {:13.4f}  {:15.4f}".format(
        w, f(w), front, even, done))
print("median characters read in one look: {:.1f}".format(
    sorted(READ)[VIEWERS // 2]))
for k, label in (("front", "front-loaded"), ("even", "evenly spread")):
    print("best {}: {} characters, {:.4f} taken away".format(
        label, best[k][1], best[k][0]))

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 3: Visual Card Compression: the Item Ceiling of a Slide, Dynamic Programming over Dependencies, and the Length of a Card. 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