What does Hundred-Volume Hypergraphs and Knowledge Scaling conclude, in numbers, about “Three More Primitives: Weibull Hazards, Legendre-Bregman Duality and Bayesian Updating”?

Answer: The fits recover the shapes (0.60, 0.91 and 1.81 against true 0.60, 0.90 and 1.80) from 2,000 cases each. The hazard of the video viewer falls from 0.096 at one second to 0.038 at ten; that of the subscriber falls a little; that of the storage medium rises from 0.020 to 0.131 a year. "Retention" and "bit rot" are the same calculation with opposite shapes.

Scope of the numbers: Its synthetic library, rates and hazards are illustrative models; all calculations are generated by its programs; the book is not investment, legal, medical or technical advice. Chapter 3 finds that a shared library of primitives shortens a naive description 6.10 times but only 1.04 times against a good general compressor, and that fifteen core primitives cover 82 of the 100 volumes of a synthetic library, full coverage needing 28.

中文版

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.020, 0.038, 0.096, 0.131, 0.60, 0.90

domaintrue kfitted kfitted lammedianhazard t=1 / t=10
video watch0.600.6021.1 s11.50.096 / 0.038
subscription0.900.9113.8 mo9.20.084 / 0.068
storage medium1.801.8112.0 yr9.80.020 / 0.131
Show the full program
# Chapter 2. p03: One hazard law, three domains. Weibull survival
# S(t) = exp(-(t / lam)^k) has hazard (k / lam) (t / lam)^(k - 1):
# falling if k < 1, flat if k = 1, rising if k > 1. Synthetic data from
# three illustrative domains, 2,000 cases each: seconds a viewer stays
# with a short video (k 0.6, lam 20); months a subscriber stays (k 0.9,
# lam 14); years until a storage medium fails (k 1.8, lam 12). The same
# maximum-likelihood routine (grid over k, lam in closed form) fits
# each. Seed 100.
import random
from math import log

def fit(ts):
    n, slog = len(ts), sum(log(t) for t in ts)
    best = None
    for i in range(1, 400):
        k = i / 100
        lam = (sum(t ** k for t in ts) / n) ** (1 / k)
        ll = n * log(k) - n * k * log(lam) + (k - 1) * slog - n
        if best is None or ll > best[0]:
            best = (ll, k, lam)
    return best[1], best[2]

DOMAINS = (("video watch", "s", 0.6, 20.0), ("subscription", "mo", 0.9,
           14.0), ("storage medium", "yr", 1.8, 12.0))

if __name__ == "__main__":
    rng = random.Random(100)
    print("   domain          true k  fitted k  fitted lam  median  "
          "hazard t=1 / t=10")
    for name, unit, k, lam in DOMAINS:
        ts = [rng.weibullvariate(lam, k) for _ in range(2000)]
        fk, fl = fit(ts)
        med = fl * log(2) ** (1 / fk)
        h = lambda t: (fk / fl) * (t / fl) ** (fk - 1)
        fmt = ("   {:<14}  {:6.2f}  {:8.2f}  {:7.1f} {:<2}  {:6.1f}"
               "  {:.3f} / {:.3f}")
        print(fmt.format(name, k, fk, fl, unit, med, h(1), h(10)))

Single source and citation

Fan, Y. (2026). Hundred-Volume Knowledge Hypergraphs, Multimodal Personal Prior Compilation and Autonomous Empire Scaling (Version 1.0.0), Chapter 2: Three More Primitives: Weibull Hazards, Legendre-Bregman Duality and Bayesian Updating. 5D Library. https://doi.org/10.5281/zenodo.24090260

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

BibTeX
@book{fan2026100,
  author    = {Fan, Yafu},
  title     = {Hundred-Volume Knowledge Hypergraphs, Multimodal Personal Prior Compilation and Autonomous Empire Scaling},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090260},
  url       = {https://doi.org/10.5281/zenodo.24090260}
}

Other chapter answers in this book