What does Distilling Books into Skill Packs conclude, in numbers, about “One Specification for the Four Kits: Pricing Calculator, Front-End Style Library, Persuasive-Copy Checker and Customer-Service Closing Pack”?
Answer: The four kits share a directory tree of 10 paths and an instruction-file header of 15 fields, and release follows the gate of Chapter 1: effective retention of at least 0.90, a regression pass rate and refusal completeness of exactly 1, and a golden sample that triggers every refusal condition. The pricing calculator solves for price in exact fractions, rounds up to the lattice and refuses with four codes, E1 to E4. The front-end style library guards semantic tokens with the contrast and tap-target sizes of WCAG 2.1, and does not pass even a near miss such as the alert red at 4.43:1. The persuasive-copy checker asks only whether each sentence can be checked against data, and returns invented scarcity and invented deadlines. The customer-service closing pack follows up at 24, 72 and 168 hours, holds messages through quiet hours, sends at most 3, and stops at no. There are 5 edges among the four kits, each with a contract; version numbers are computed from contract and golden-sample diffs, and a consumer pinned to a major version reruns its own samples whenever that major version moves. Chapter 6 goes on to show how these skill packs keep from decaying through round after round of edits.
Scope of the numbers: All samples are invented; pricing and closing rules are written in general terms and are not legal or compliance advice.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 168, 24, 72
| S1 silent client | msgs 3 | pass | 24:NUDGE1 72:NUDGE2 168:CLOSE_NOTE |
| S2 quote at 23h | msgs 3 | pass | 34:NUDGE1 82:NUDGE2 178:CLOSE_NOTE |
| S3 asks a question | msgs 1 | pass | 24:NUDGE1 30:HANDOFF |
| S4 says no | msgs 0 | pass | 5:STOP |
| S5 pays | msgs 1 | pass | 24:NUDGE1 50:RECEIPT |
| S6 real hold | msgs 3 | pass | 24:NUDGE1 72:NUDGE2 96:HOLD_NOTE@120 168:CLOSE_SILENT |
| golden traces passing: 6/6 | |||
| mutant 'quiet hours removed': fails S2 | |||
| mutant 'stop list cut to one word': fails S4 |
Show the full program
# Chapter 5. p54: Golden traces of the customer-service closing kit's follow-up state machine.
# After a quote: NUDGE1 at +24 h, NUDGE2 at +72 h, then a last message at +168 h (CLOSE_NOTE), or,
# when a real reservation hold ends at H, a HOLD_NOTE at H - 24 h stating H, and the file closes at
# +168 h without a message. At most 3 automated messages per quote. Quiet hours 22:00 to 09:00 in
# the client's local time: a due message waits until 09:00. Any reply hands the thread to a person
# (HANDOFF); a reply with a stop phrase ends all contact (STOP); a payment sends a RECEIPT only.
STOP_WORDS = ("stop", "not interested", "no thanks")
def defer(offset, t0_clock):
clock = (t0_clock + offset) % 24
if clock >= 22:
return offset + (24 - clock) + 9
if clock < 9:
return offset + (9 - clock)
return offset
def plan(t0_clock, events, hold_end=None, quiet=True, stops=STOP_WORDS):
due = [(24, "NUDGE1"), (72, "NUDGE2")]
if hold_end is not None and hold_end - 24 > 72:
due.append((hold_end - 24, "HOLD_NOTE@{}".format(hold_end)))
due.append((168, "CLOSE_SILENT"))
else:
due.append((168, "CLOSE_NOTE"))
due = [(defer(t, t0_clock) if quiet and a != "CLOSE_SILENT" else t, a) for t, a in due]
out, sent = [], 0
for t, kind, text in sorted(events) + [(10 ** 6, "end", "")]:
for d, a in list(due):
if d <= t:
if a == "CLOSE_SILENT" or sent < 3:
out.append((d, a))
sent += a != "CLOSE_SILENT"
due.remove((d, a))
if kind == "reply":
stop = any(w in text.lower() for w in stops)
out.append((t, "STOP" if stop else "HANDOFF"))
return out
if kind == "paid":
out.append((t, "RECEIPT"))
return out
return out
def show(xs):
return " ".join("{}:{}".format(t, a) for t, a in xs)
SCEN = [
("S1 silent client", 15, [], None, [(24, "NUDGE1"), (72, "NUDGE2"), (168, "CLOSE_NOTE")]),
("S2 quote at 23h", 23, [], None, [(34, "NUDGE1"), (82, "NUDGE2"), (178, "CLOSE_NOTE")]),
("S3 asks a question", 15, [(30, "reply", "Can I pay in two parts?")], None,
[(24, "NUDGE1"), (30, "HANDOFF")]),
("S4 says no", 15, [(5, "reply", "No thanks, not this time")], None, [(5, "STOP")]),
("S5 pays", 15, [(50, "paid", "")], None, [(24, "NUDGE1"), (50, "RECEIPT")]),
("S6 real hold", 15, [], 120, [(24, "NUDGE1"), (72, "NUDGE2"), (96, "HOLD_NOTE@120"),
(168, "CLOSE_SILENT")]),
]
if __name__ == "__main__":
ok = 0
for name, clock, events, hold, expected in SCEN:
got = plan(clock, events, hold)
good = got == expected
ok += good
msgs = sum(1 for _, a in got if a.startswith(("NUDGE", "HOLD", "CLOSE_NOTE")))
print("{:19s} msgs {} {:5s} {}".format(name, msgs, "pass" if good else "FAIL", show(got)))
print("golden traces passing: {}/{}".format(ok, len(SCEN)))
muts = (("quiet hours removed", {"quiet": False}), ("stop list cut to one word", {"stops": ("stop",)}))
for label, kw in muts:
bad = [n.split()[0] for n, c, e, h, x in SCEN if plan(c, e, h, **kw) != x]
print("mutant '{}': fails {}".format(label, ", ".join(bad) or "none"))Single source and citation
Fan, Y. (2026). Lossless Distillation of Monographs into Agent Skill Packs, Executable Rule Compilation and Self-Evolving Systems (Version 0.1.0), Chapter 5: One Specification for the Four Kits: Pricing Calculator, Front-End Style Library, Persuasive-Copy Checker and Customer-Service Closing Pack. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-150 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026150,
author = {Fan, Yafu},
title = {Lossless Distillation of Monographs into Agent Skill Packs, Executable Rule Compilation and Self-Evolving Systems},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Method: Skill Packs, Four Retention Indicators, Evidence Grades and the Four Steps of Distillation
- Chapter 2 · Extraction: Picking the Executable Sentences out of a Manuscript One by One
- Chapter 3 · Compilation: Turning Rule Sentences into Predicates, Decision Tables and Decision Trees
- Chapter 4 · Guardrails and Validators: Banned Phrases, Required Sentences, Refusal Conditions, Lint and Golden Samples
- Chapter 6 · Self-Evolution: Feedback Loops, Regression Gates, Drift and the Accumulation of a Skill Library
- Chapter 7 · Governance: Least Privilege, Machine-Checked Red Lines, Disclaimers, Provenance and Rule Retirement
- Chapter 8 · Practice: Distilling a Twelve-Rule Pricing Book into a Pricing Calculator