What does Hundred-Volume Hypergraphs and Knowledge Scaling conclude, in numbers, about “Practice: Zero Marginal Cost, Rising Consistency Cost and a Fixity Schedule”?
Answer: Chapter 8 shows that zero marginal cost applies only to copies, as consistency checks grow from 30 pairs for 10 volumes to 3,620 for 100, and gives a preservation checklist with yearly checks. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.
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: 10, 100, 30, 3620
| volumes | pairs sharing 1+ | sharing 2+ | new pairs per volume |
| 10 | 30 | 7 | 3.0 |
| 25 | 228 | 68 | 15.0 |
| 50 | 979 | 344 | 35.4 |
| 75 | 2,024 | 642 | 46.9 |
| 100 | 3,620 | 1,269 | 68.6 |
Show the full program
# Chapter 8. p15: Zero marginal cost of copies, rising marginal cost of
# consistency. A digital copy of a finished volume costs almost nothing.
# But two volumes that use the same primitive must agree on notation,
# parameters and claims; each such pair is a consistency check. Using
# the synthetic incidence of p06 (same seed), count the volume pairs
# that share at least one or two primitives among the first n volumes,
# and the new pairs that volume n adds (average of the last ten).
import random
def incidence(rng):
w = [1 / (j + 1) ** 0.8 for j in range(15)]
vols = []
for _ in range(100):
k = rng.choice((2, 2, 3, 3, 3, 4, 4, 5))
use = set()
while len(use) < k:
use.add(rng.choices(range(15), weights=w)[0])
use = sorted(use)
if rng.random() < 0.25:
use.append(15 + rng.randrange(30))
vols.append(use)
return vols
def pairs(vols, s):
return sum(len(set(vols[i]) & set(vols[k])) >= s
for i in range(len(vols)) for k in range(i + 1, len(vols)))
if __name__ == "__main__":
vols = incidence(random.Random(100))
print(" volumes pairs sharing 1+ sharing 2+ new pairs per volume")
for n in (10, 25, 50, 75, 100):
new = (pairs(vols[:n], 1) - pairs(vols[:n - 10], 1)) / 10
print(" {:7d} {:16,d} {:10,d} {:20.1f}".format(
n, pairs(vols[:n], 1), pairs(vols[:n], 2), new))Single source and citation
Fan, Y. (2026). Hundred-Volume Knowledge Hypergraphs, Multimodal Personal Prior Compilation and Autonomous Empire Scaling (Version 1.0.0), Chapter 8: Practice: Zero Marginal Cost, Rising Consistency Cost and a Fixity Schedule. 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
- Chapter 1 · One Equation, Many Worlds: What a Cross-Disciplinary Isomorphism Is and Is Not
- Chapter 2 · Three More Primitives: Weibull Hazards, Legendre-Bregman Duality and Bayesian Updating
- Chapter 3 · Compression and Coverage: How Much Do Fifteen Primitives Really Explain?
- Chapter 4 · The Library as a Hypergraph: Degrees, Co-Use and Connected Volumes
- Chapter 5 · The Feedback Flywheel: Fisher Information, Privacy Noise and Self-Confirming Routing
- Chapter 6 · A Hundred Years: Copies, Common Shocks and What Reproducibility Can Promise
- Chapter 7 · "Store It in a Famous Mountain": Sima Qian, the Library of Alexandria and the *Taiping yulan*