What does Deadlines and Temporal Motivation conclude, in numbers, about “Closing the Loop: Writing Milestones, Client Instalment Deadlines and a Preregistered Test”?

Answer: Chapter 8 sets out milestone scheduling for a writing window, due dates for client instalments, a preregistered test and the distilled tool, the Deadline Scheduler. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not individual business, legal or financial advice. Marked boxes separate published evidence, runnable Python calculations (18 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 only

stageguesscum guesscum medianmilestone p80
programs6.06.08.816.1
Chinese text12.018.027.947.5
English text10.028.044.273.0
bib, yaml, kit2.030.047.577.8
gate fixes3.033.052.685.3
buffer factor on the whole guess at p80: 2.583
chance of finishing within the bare guess: 0.207
Show the full program
# Chapter 8. p81: Milestones for one volume of this book series. The
# writer's own hour guesses per stage are inflated by the planning-
# fallacy ratio R fitted in p51 (lognormal, mu 0.384, sigma 0.720), with
# a shared factor between stages (correlation 0.5). Milestones are set at
# the 80th percentile of cumulative hours. Hour guesses are illustrative.
import math
import random

MU, SIG, RHO, Q = 0.384, 0.720, 0.5, 0.80
STAGES = (("programs", 6.0), ("Chinese text", 12.0),
          ("English text", 10.0), ("bib, yaml, kit", 2.0),
          ("gate fixes", 3.0))

def simulate(n=20000, seed=20261112):
    rng = random.Random()
    rng.seed(seed)
    cums = [[] for _ in STAGES]
    for _ in range(n):
        zc = rng.gauss(0.0, 1.0)
        acc = []
        for _, h in STAGES:
            z = math.sqrt(RHO) * zc + math.sqrt(1 - RHO) * rng.gauss(0, 1)
            acc.append(h * math.exp(MU + SIG * z))
        run = 0.0
        for i, x in enumerate(acc):
            run = math.fsum((run, x))
            cums[i].append(run)
    return cums

def quantile(xs, q):
    s = sorted(xs)
    return s[min(len(s) - 1, int(q * len(s)))]

if __name__ == "__main__":
    cums = simulate()
    plan = 0.0
    print("stage            guess  cum guess  cum median  milestone p80")
    for (name, h), c in zip(STAGES, cums):
        plan += h
        print("%-15s %6.1f  %9.1f  %10.1f  %13.1f"
              % (name, h, plan, quantile(c, 0.5), quantile(c, Q)))
    last = cums[-1]
    m80 = quantile(last, Q)
    print("buffer factor on the whole guess at p80: %.3f" % (m80 / plan))
    hit = len([x for x in last if x <= plan]) / float(len(last))
    print("chance of finishing within the bare guess: %.3f" % hit)

Single source and citation

Fan, Y. (2026). Hyperbolic-Discounting Preference Reversals, Deadline Commitment Devices and the Temporal Motivation Equation (Version 1.0.0), Chapter 8: Closing the Loop: Writing Milestones, Client Instalment Deadlines and a Preregistered Test. 5D Library. DOI pending

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

BibTeX
@book{fan2026199,
  author    = {Fan, Yafu},
  title     = {Hyperbolic-Discounting Preference Reversals, Deadline Commitment Devices and the Temporal Motivation Equation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book