5D Library › Diagnostic-to-Pedagogy Conversion Funnels, Mastery-Gated Curriculum Architecture and Certification Network Economics · 中文
Chapter 4. Chapter Granularity, Dropout and Twelve Gates
How finely to cut chapters
Completion rates of online courses are notoriously low. One variable a course designer controls is granularity: the same 204 hours can be cut into 12 long chapters or 400 short lessons. This chapter answers how finely to cut with a two-hazard model. The first is a boundary hazard: the end of every chapter is a door, and a learner leaves through it with fixed probability . The second is a fatigue hazard: the longer a chapter, the more likely a learner gives up partway, set to for a chapter of hours. With chapters the chance of finishing is
maximised at , where . An exam (a gate) at the end of a chapter adds a further hazard .
Note
The hazard parameters are illustrative. , and only show the shape of the model; real values must be estimated from a course’s chapter-by-chapter dropout data.
Calculation
# 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.")
# n* = 79.0 chapters of 2.58 h; S* = 0.5315
# n hours/ch S no gates S gate/subject S gate/chapter
# 12 17.00 0.1190 0.1055 0.1055
# 24 8.50 0.3210 0.2847 0.2525
# 48 4.25 0.4906 0.4351 0.3036
# 79 2.58 0.5315 0.4714 0.2412
# 120 1.70 0.5025 0.4457 0.1514
# 204 1.00 0.3913 0.3470 0.0509
# 408 0.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.The best cut is about 79 chapters of 2.58 hours each, with completion 0.5315. The optimum is flat: anywhere from 48 to 120 chapters, completion is at least 0.4906 (0.5025 at 120). The ends are what hurt: 12 long chapters (17 hours each) leave completion at only 0.1190; 408 half-hour lessons leave 0.1839.
Where the gates go matters more. One exam per subject (12 in all) lowers completion at 79 chapters from 0.5315 to 0.4714; an exam after every chapter lowers it to 0.2412. With an exam after every chapter the best cut becomes 42 chapters, with completion 0.3065. In other words, mastery gates belong at the end of subjects, not chapters: short chapters reduce fatigue, gates confirm mastery, and the two should not be stacked.
A cohort through twelve gates
Now the parts of Chapters 2 and 3 are put together: 10,000 learners take a base mastery from the population of Chapter 3, Beta(6, 3), and study the 12 subjects in the topological order of Chapter 2, in chapters of 2.58 hours (the dropout hazards of the seventh program). Finishing a subject lifts mastery by about 0.08. Under the gated regime each subject ends with the 5-question exam of Chapter 3; a failure adds a 0.15 chance of leaving; up to 3 retakes are allowed, each adding 0.03 to mastery. Under the open regime there is no exam, and watching to the end counts as finishing.
Calculation
# Chapter 4. [p08] A cohort through 12 gated subjects.
# 10,000 learners with base mastery theta ~ Beta(6, 3) study the 12
# subjects of p03 in topological order, in chapters of 2.58 hours
# (p07: hazard 0.004 per boundary plus 0.0006 h^2 per chapter). Study
# lifts mastery on a subject to theta + 0.08 + noise (sd 0.06, capped
# at 0.97). Under the GATE regime each subject ends with the exam of
# p05 (5 x 4 points, pass 16, k = 6); a failure costs a further 0.15
# chance of quitting, and up to 3 retakes add 0.03 mastery each. Under
# the OPEN regime there is no exam: a learner finishes by watching.
# Reported: completion, mean base mastery of finishers, and the share
# of finishers with base mastery >= 0.80.
import math
import random
ORDER = ["astro", "lifa", "bazi", "chenggu", "liuyao", "meihua",
"numer", "qimen", "fengshui", "uranian", "xingming", "ziwei"]
HOURS = {"lifa": 12, "numer": 6, "astro": 14, "bazi": 30, "liuyao": 18,
"ziwei": 28, "chenggu": 4, "meihua": 10, "qimen": 32,
"fengshui": 24, "xingming": 10, "uranian": 16}
A, B, CH, K = 0.004, 0.0006, 2.58, 6.0
def exam(rng, m):
s = 0
for _ in range(5):
q = rng.betavariate(K * m, K * (1 - m))
s += sum(rng.random() < q for _ in range(4))
return s >= 16
def run(rng, gate, n=10000):
done, base = 0, []
tries = 0
for _ in range(n):
th = rng.betavariate(6, 3)
alive = True
for subj in ORDER:
nch = HOURS[subj] / CH
if rng.random() > math.exp(-nch * (A + B * CH * CH)):
alive = False
break
if not gate:
continue
m = min(0.97, max(0.05, th + 0.08 + rng.gauss(0, 0.06)))
for t in range(4):
tries += 1
if exam(rng, m):
break
if t == 3 or rng.random() < 0.15:
alive = False
break
m = min(0.97, m + 0.03)
if not alive:
break
if alive:
done += 1
base.append(th)
return done / n, sum(base) / len(base), sum(
t >= 0.80 for t in base) / len(base), tries / n
if __name__ == "__main__":
rng = random.Random(74008)
print(" regime completion mean theta share >= 0.80 exams/learner")
for name, gate in (("OPEN", False), ("GATE", True)):
c, mt, hi, ex = run(rng, gate)
print(" {:6s} {:11.4f} {:11.4f} {:14.4f} {:14.2f}".format(
name, c, mt, hi, ex))
print("\nReading: twelve gates turn a course that half the cohort")
print("finishes into one that about a sixth finishes; those who do")
print("are much stronger. The gate is a filter first and a teacher")
print("second, and its price is paid in completion.")
# regime completion mean theta share >= 0.80 exams/learner
# OPEN 0.5307 0.6681 0.2093 0.00
# GATE 0.1656 0.8126 0.5694 6.89
#
# Reading: twelve gates turn a course that half the cohort
# finishes into one that about a sixth finishes; those who do
# are much stronger. The gate is a filter first and a teacher
# second, and its price is paid in completion.Under the open regime completion is 0.5307, and finishers’ mean base mastery is 0.6681, almost the same as the population; only 0.2093 of them are at or above 0.80. Under the gated regime completion falls to 0.1656, but finishers’ mean base mastery is 0.8126, and 0.5694 of them are at or above 0.80; each learner sat 6.89 exams on average.
So a gate is first a filter and only second a teaching device. In this model the “improvement” the gate brings comes mostly from screening weak learners out, not from teaching them up: each retake adds only 0.03, far too little to bring a weak learner to competence. The mastery-learning literature reports sizeable effects (Kulik et al. 1990), and Bloom even proposed that one-to-one tutoring raises achievement by two standard deviations (Bloom 1984); but those effects come from the corrective instruction that follows a gate, not from the gate itself. A course that sets gates without correction gets a few strong learners and heavy dropout.
Hypothesis · not established
The author’s interpretation (not yet tested): in the author’s courses, if every failure is followed by a corrective unit targeted at the questions missed (rather than just a retake), completion under gating can be markedly higher than 0.1656 while finishers’ mastery stays at or above 0.80. What would show this wrong: if, in a pre-registered experiment, “gate plus correction” and “gate plus plain retake” did not differ in completion or in day-90 transfer scores, the corrective unit would not work and the gate would be only a filter.
Summary
Chapter granularity has a flat optimum of about 79 chapters of 2.58 hours; both too long and too short hurt completion. Gates belong at subjects, not chapters. Twelve subject gates cut completion from 0.5307 to 0.1656, and those who finish are much stronger; in this model the gate is first a filter and only then a teacher.
References
Fan, Y. (2026). Diagnostic-to-Pedagogy Conversion Funnels, Mastery-Gated Curriculum Architecture and Certification Network Economics: Self-Cannibalization Bounds, Spaced-Retrieval Curves and Two-Sided Practitioner Licensing [诊学一体转化漏斗、掌握度门控课程与持牌人网络经济学] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090197 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).