What does Hundred-Volume Hypergraphs and Knowledge Scaling conclude, in numbers, about “The Feedback Flywheel: Fisher Information, Privacy Noise and Self-Confirming Routing”?

Answer: Chapter 5 shows that a feedback flywheel learns linearly: with a constant 1,000 users a month the standard error after a year is 0.00418; privacy noise with buckets of 30 users keeps only 0.441 of the information; greedy routing ends favouring the worse volume in 0.385 of runs.

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. printed values that match the answer: 0.441, 1000, 30

users per bucketeps 0.1eps 0.5eps 1eps 2
10suppr.suppr.suppr.suppr.
300.0310.4410.7590.926
1000.0950.7240.9130.977
1,0000.5120.9630.9910.998
users per bucket for 0.9 of the information at eps 0.5: 343
Show the full program
# Chapter 5. p10: What de-identification costs in information. Each
# station releases only weekly bucket counts of "yes" answers from m
# users, with Laplace noise of scale 1 / eps added (differential
# privacy with parameter eps for one user's answer). For a rate of 0.3,
# the variance of a released count is m 0.3 0.7 + 2 / eps^2, so the
# share of the original information kept is m 0.21 / (m 0.21 + 2 /
# eps^2). Buckets below 20 users are suppressed (a k-anonymity rule).
if __name__ == "__main__":
    print("   users per bucket   eps 0.1   eps 0.5   eps 1    eps 2")
    for m in (10, 30, 100, 1000):
        row = []
        for eps in (0.1, 0.5, 1.0, 2.0):
            keep = m * 0.21 / (m * 0.21 + 2 / eps ** 2)
            row.append("suppr." if m < 20 else "{:.3f}".format(keep))
        print("   {:16,d}   {:>7}   {:>7}   {:>6}   {:>6}".format(m, *row))
    print("   users per bucket for 0.9 of the information at eps 0.5: {}"
          .format(round(0.9 / 0.1 * 2 / 0.5 ** 2 / 0.21)))

Single source and citation

Fan, Y. (2026). Hundred-Volume Knowledge Hypergraphs, Multimodal Personal Prior Compilation and Autonomous Empire Scaling (Version 1.0.0), Chapter 5: The Feedback Flywheel: Fisher Information, Privacy Noise and Self-Confirming Routing. 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