What does Provenance and Fidelity of Derivatives conclude, in numbers, about “What Detection Really Means: a Hash Sees Only What Was Anchored”?
Answer: Chapter 3 splits detection into anchor coverage and structural detection and shows that checks must go against the master, not the previous layer; on a set of sentence pairs the anchor checker has a precision of 1.000.
Scope of the numbers: Parameters are illustrative and costs are accounting points, not prices; all calculations are generated by the book's programs. It is not individual legal or business advice; its "copyright chain" means only provenance and permission records for the author's own works, and publishing any derivative needs sign-off by the person in charge.
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: 1.000
| detection rate D = c + (1 - c) s | |
| c s | 0.0 s=0.3 s=0.6 |
| 0.25 | 0.250 0.475 0.700 |
| 0.50 | 0.500 0.650 0.800 |
| 0.75 | 0.750 0.825 0.900 |
| 0.90 | 0.900 0.930 0.960 |
| 1.00 | 1.000 1.000 1.000 |
| drifted facts after 3 layers | 5.71 of 40 |
| c | 0.50 s=0.3: undetected 1.997 |
| c | 0.90 s=0.6: undetected 0.228 |
| c | 1.00 s=0.0: undetected 0.000 |
| review h | 0.6: wrong facts left after layer k (of 40) |
| k vs-parent vs-master | |
| 1 | 0.800 0.800 |
| 2 | 1.584 1.104 |
| 3 | 2.352 1.220 |
| 4 | 3.105 1.263 |
| 5 | 3.843 1.280 |
| 6 | 4.566 1.286 |
Show the full program
# Chapter 3. p31: a hash only sees what was anchored.
# Detection rate of a drifted fact: D = c + (1 - c) * s, where c is the
# share of facts anchored by a provenance hash (any change to them is
# caught) and s is the share of drift in unanchored facts that a
# structure check still catches. Then: 40 facts, per-layer fidelity
# 0.95, three layers. Last, human review (catch chance 0.6 per look)
# done against the parent versus against the master.
# All parameters are illustrative.
N, P, K = 40, 0.95, 3
CS = (0.25, 0.50, 0.75, 0.90, 1.00)
SS = (0.0, 0.3, 0.6)
print("detection rate D = c + (1 - c) s")
print("c " + "".join(" s=%.1f" % s for s in SS))
for c in CS:
print("%.2f " % c + "".join(" %5.3f" % (c + (1 - c) * s)
for s in SS))
drift = N * (1 - P ** K)
print("drifted facts after %d layers: %.2f of %d" % (K, drift, N))
for c, s in ((0.50, 0.3), (0.90, 0.6), (1.00, 0.0)):
d = c + (1 - c) * s
print(" c=%.2f s=%.1f: undetected %.3f" % (c, s, drift * (1 - d)))
H, E = 0.6, 1 - P
print("review h=%.1f: wrong facts left after layer k (of %d)" % (H, N))
print("k vs-parent vs-master")
wp = wm = 0.0
for k in range(1, 7):
wp = wp + (1 - wp) * E * (1 - H)
wm = (wm + (1 - wm) * E) * (1 - H)
print("%d %9.3f %9.3f" % (k, N * wp, N * wm))Single source and citation
Fan, Y. (2026). Multimodal Derivative Compilation and Provenance Chains: A Structure-Preserving Pipeline from One Monograph to Podcasts, Slides and Quiz Banks (Version 1.0.0), Chapter 3: What Detection Really Means: a Hash Sees Only What Was Anchored. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-268 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026268,
author = {Fan, Yafu},
title = {Multimodal Derivative Compilation and Provenance Chains: A Structure-Preserving Pipeline from One Monograph to Podcasts, Slides and Quiz Banks},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Compounding of Drift: Serial Reproduction, p to the Power k, and Repair
- Chapter 2 · Provenance Hashes: Pinning Facts Down as Atoms that Compare Byte for Byte
- Chapter 4 · Structural Homomorphism: a Derivative Must Be a Homomorphic Image of the Book's Argument Graph
- Chapter 5 · Derivation Topology: Compile from the Master or from the Layer Before?
- Chapter 7 · Classical Sources East and West: Liu Xiang's Collation and Bartlett's Serial Reproduction
- Chapter 8 · Closing the Loop: the Provenance Hash Manifest and a Protocol for Refutation