What does Funnels, Mastery Gates and Licensing conclude, in numbers, about “Chapter Granularity, Dropout and Twelve Gates”?

Answer: Chapter 4 finds a flat optimum of about 79 chapters of 2.58 hours, and twelve subject gates cut completion from 0.5307 to 0.1656.

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: 12, 2.58, 79

n*79.0 chapters of 2.58 h; S* = 0.5315
n hours/ch S no gates S gate/subject S gate/chapter
1217.00 0.1190 0.1055 0.1055
248.50 0.3210 0.2847 0.2525
484.25 0.4906 0.4351 0.3036
792.58 0.5315 0.4714 0.2412
1201.70 0.5025 0.4457 0.1514
2041.00 0.3913 0.3470 0.0509
4080.50 0.1839 0.1631 0.0031
with a gate on every chapter the best n is 42 (0.3065)
Reading: the optimum is flat - anything from about 48 to
120 chapters keeps survival within a few points of S*. Very
long chapters cost most; gating every short chapter costs
far more than gating once per subject.

Key formula

\[S(n) = \exp(-n a - b H^2/n),\]
Show the full program
# Chapter 4. [p07] Chapter granularity versus dropout hazard.
# H = 204 hours of content (p03) are cut into n chapters of h = H / n
# hours. Two hazards act on a learner: a fixed chance a of quitting at
# every chapter boundary (each break is a door out), and a fatigue
# hazard that grows with chapter length, b h^2 per chapter. Survival to
# the end is
#     S(n) = exp(-n a - n b h^2) = exp(-n a - b H^2 / n),
# maximised at n* = H sqrt(b / a), where S* = exp(-2 H sqrt(a b)).
# A gate (an exam) at a boundary adds hazard c; gating every chapter
# multiplies it by n, gating once per subject by 12.
import math

H, A, B, C = 204.0, 0.004, 0.0006, 0.010

def surv(n, gates):
    h = H / n
    return math.exp(-n * A - n * B * h * h - gates * C)

if __name__ == "__main__":
    n_star = H * math.sqrt(B / A)
    print("   n* = {:.1f} chapters of {:.2f} h; S* = {:.4f}".format(
        n_star, H / n_star, math.exp(-2 * H * math.sqrt(A * B))))
    print("       n   hours/ch   S no gates  S gate/subject  S gate/chapter")
    for n in (12, 24, 48, 79, 120, 204, 408):
        print("   {:5d} {:10.2f} {:12.4f} {:15.4f} {:15.4f}".format(
            n, H / n, surv(n, 0), surv(n, 12), surv(n, n)))
    best = max(range(1, 600), key=lambda n: surv(n, n))
    print("   with a gate on every chapter the best n is {} ({:.4f})".format(
        best, surv(best, best)))
    print("\nReading: the optimum is flat - anything from about 48 to")
    print("120 chapters keeps survival within a few points of S*. Very")
    print("long chapters cost most; gating every short chapter costs")
    print("far more than gating once per subject.")

Single source and citation

Fan, Y. (2026). Diagnostic-to-Pedagogy Conversion Funnels, Mastery-Gated Curriculum Architecture and Certification Network Economics (Version 1.0.0), Chapter 4: Chapter Granularity, Dropout and Twelve Gates. 5D Library. https://doi.org/10.5281/zenodo.24090197

DOI: 10.5281/zenodo.24090197 · Read the monograph · 5DL-B-074 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026074,
  author    = {Fan, Yafu},
  title     = {Diagnostic-to-Pedagogy Conversion Funnels, Mastery-Gated Curriculum Architecture and Certification Network Economics},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090197},
  url       = {https://doi.org/10.5281/zenodo.24090197}
}

Other chapter answers in this book