What does Distilling Books into Skill Packs conclude, in numbers, about “Self-Evolution: Feedback Loops, Regression Gates, Drift and the Accumulation of a Skill Library”?

Answer: A skill pack with no golden samples decays quietly under frequent editing: in the p60 model only 0.7080 of its rules are intact after 30 rounds, and repair by complaint can hold it only at a floor of 0.6757, while a pack with nine rules in ten under sample guard keeps 0.9708 at the same point. The regression gate ties version numbers, sample results and coverage together and blocked four of ten candidate releases. Drift has to be watched per day and per conversation, and the cumulative sum raises the alarm about five days earlier than a weekly mean. Making the visible pass rate the target produces a pack with a perfect score that has got worse; a skill library becomes a mountain through an admission gate, not by heaping. Self-critique pulls a pack toward its own fixed point, and only external samples can raise that point. The next chapter, on governance, answers the other half of the question: who may change a pack, how a change is traced, and when a rule should be retired.

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. standard-library Python onlyprinted values that match the answer: 0.6757, 0.7080, 0.9708, 30

rules 40, touch 0.3, silent-break 0.08, q0.024 per rule per round, repair 0.05
round | no tests: sim formula | 90% golden coverage: sim formula
0 |1.0000 1.0000 | 1.0000 1.0000
5 |0.8963 0.8965 | 0.9892 0.9896
10 |0.8272 0.8260 | 0.9820 0.9826
15 |0.7784 0.7780 | 0.9766 0.9778
20 |0.7431 0.7454 | 0.9739 0.9745
25 |0.7225 0.7231 | 0.9713 0.9723
30 |0.7072 0.7080 | 0.9698 0.9708
an uncovered rule with no repair survives 28.5 rounds with probability 0.5
coverage 0.0: round-30 retention 0.7080, long-run 0.6757, broken at round 30 11.68 of 40
coverage 0.5: round-30 retention 0.8540, long-run 0.8378, broken at round 30 5.84 of 40
coverage 0.9: round-30 retention 0.9708, long-run 0.9676, broken at round 30 1.17 of 40
coverage 1.0: round-30 retention 1.0000, long-run 1.0000, broken at round 30 0.00 of 40
no repair at all (F0): round-30 retention, no tests 0.4825, 90% coverage 0.9482
Show the full program
# Chapter 6. p60: Rule retention of a skill pack over edit rounds, with and without golden tests.
# Model. A pack holds R rules. In each edit round every rule is touched with probability T, and a
# touched rule is silently broken with probability B, so q = T * B per rule per round. A golden test
# suite covers a fraction C of the rules; a break in a covered rule fails the regression gate and is
# reverted before release; a break in an uncovered rule ships. A shipped break is repaired when a
# customer complaint exposes it, with probability F per round. An uncovered rule is a two-state
# Markov chain, so with s = F / (q + F):
#   E[retention after n rounds] = C + (1 - C) * (s + (1 - s) * (1 - q - F)^n).
# The Monte Carlo below checks the closed form with a fixed seed.
import math
import random

R, T, B, F, ROUNDS, PACKS = 40, 0.30, 0.08, 0.05, 30, 2000


def closed(n, cover, repair=F):
    q = T * B
    s = repair / (q + repair)
    return cover + (1 - cover) * (s + (1 - s) * (1 - q - repair) ** n)


def simulate(cover, seed):
    rng = random.Random(seed)
    curve = [[] for _ in range(ROUNDS + 1)]
    for _ in range(PACKS):
        ok = [True] * R
        covered = [i < round(cover * R) for i in range(R)]
        curve[0].append(1.0)
        for n in range(1, ROUNDS + 1):
            for i in range(R):
                if ok[i]:
                    if rng.random() < T and rng.random() < B and not covered[i]:
                        ok[i] = False
                elif rng.random() < F:
                    ok[i] = True
            curve[n].append(sum(ok) / R)
    return [math.fsum(c) / PACKS for c in curve]


if __name__ == "__main__":
    q = T * B
    print("rules {}, touch {}, silent-break {}, q = {:.3f} per rule per round, repair {}".format(
        R, T, B, q, F))
    sims = {c: simulate(c, 6060 + int(c * 100)) for c in (0.0, 0.9)}
    print("round | no tests: sim  formula | 90% golden coverage: sim  formula")
    for n in (0, 5, 10, 15, 20, 25, 30):
        print("{:5d} | {:14.4f} {:8.4f} | {:25.4f} {:8.4f}".format(
            n, sims[0.0][n], closed(n, 0.0), sims[0.9][n], closed(n, 0.9)))
    half = math.log(0.5) / math.log(1 - q)
    print("an uncovered rule with no repair survives {:.1f} rounds with probability 0.5".format(half))
    for c in (0.0, 0.5, 0.9, 1.0):
        print("coverage {:.1f}: round-30 retention {:.4f}, long-run {:.4f}, broken at round 30 {:.2f} of {}"
              .format(c, closed(30, c), c + (1 - c) * F / (q + F), R * (1 - closed(30, c)), R))
    print("no repair at all (F = 0): round-30 retention, no tests {:.4f}, 90% coverage {:.4f}".format(
        closed(30, 0.0, 0.0), closed(30, 0.9, 0.0)))

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 6: Self-Evolution: Feedback Loops, Regression Gates, Drift and the Accumulation of a Skill Library. 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