What does Provenance and Fidelity of Derivatives conclude, in numbers, about “Closing the Loop: the Provenance Hash Manifest and a Protocol for Refutation”?
Answer: Chapter 8 gives the provenance hash manifest, the Derivative Drift Provenance Checker and a pre-registered protocol. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.
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. standard-library Python only
| deriv parent depth claims match diff unknown edges cover verdict | |
| summary master | 1 6 6 0 0 0 1.000 PASS |
| slides summary | 2 3 3 0 0 0 0.500 PASS |
| podcast summary | 2 2 1 1 0 1 0.333 HOLD |
| quiz slides | 3 4 3 0 1 0 0.500 HOLD |
| podcast A1 | 0.77 != master 0.7738 |
| podcast A2>A1: reversed edge | |
| quiz A9: id not in master |
Show the full program
# Chapter 8. p81: the provenance manifest check behind the distilled tool.
# A master carries six fact atoms (subject | relation | value | unit)
# and four labelled edges. Four derivatives each name a parent, quote
# atoms by anchor id and assert edges. The check hashes every quoted
# atom in canonical form (p21) against the master hash of the same id,
# flags ids the master does not have, classifies asserted edges (p41)
# and reports coverage, depth and a PASS or HOLD verdict.
# Demonstration data built from this book's own figures.
import hashlib
import unicodedata
from decimal import Decimal
MASTER = {
"A1": ("chain of five", "share intact at clip", "0.7738", "fraction"),
"A2": ("star", "share intact per product", "0.95", "fraction"),
"A3": ("master check", "per-step fidelity", "0.995", "fraction"),
"A4": ("anchor checker", "precision", "1.000", "fraction"),
"A5": ("two readers", "share of errors left", "0.12", "fraction"),
"A6": ("ledger edit", "records flagged", "3", "count"),
}
EDGES = {("A1", "A2", "contradicts"), ("A3", "A2", "supports"),
("A5", "A3", "supports"), ("A4", "A6", "precedes")}
DERIVS = [
("summary", "master", {k: v for k, v in MASTER.items()},
[("A1", "A2", "contradicts"), ("A3", "A2", "supports")]),
("slides", "summary",
{"A1": MASTER["A1"], "A2": MASTER["A2"],
"A3": ("Master check", "per-step fidelity", "0.9950",
"fraction")},
[("A3", "A2", "supports")]),
("podcast", "summary",
{"A1": ("chain of five", "share intact at clip", "0.77",
"fraction"), "A5": MASTER["A5"]},
[("A2", "A1", "contradicts")]),
("quiz", "slides",
{"A2": MASTER["A2"], "A6": MASTER["A6"], "A4": MASTER["A4"],
"A9": ("quiz", "items", "24", "count")},
[("A4", "A6", "precedes")]),
]
def canon(atom):
subject, relation, value, unit = atom
parts = []
for s in (subject, relation, unit):
s = unicodedata.normalize("NFKC", s).lower()
parts.append(" ".join(s.split()))
v = unicodedata.normalize("NFKC", value).strip()
v = format(Decimal(v).normalize(), "f")
return "%s|%s|%s|%s" % (parts[0], parts[1], v, parts[2])
def ahash(atom):
return hashlib.sha256(canon(atom).encode("utf-8")).hexdigest()
def edge_kind(e, edges):
u, v, _ = e
if e in edges:
return "kept"
if any(a == u and b == v for a, b, _ in edges):
return "flip"
if any(a == v and b == u for a, b, _ in edges):
return "reversed"
return "invented"
def check(master, edges, derivs):
mh = {k: ahash(a) for k, a in master.items()}
depth = {"master": 0}
rows, notes = [], []
for name, parent, claims, dedges in derivs:
depth[name] = depth.get(parent, 0) + 1
match = miss = unknown = 0
for k in sorted(claims):
if k not in mh:
unknown += 1
notes.append("%s %s: id not in master" % (name, k))
elif ahash(claims[k]) == mh[k]:
match += 1
else:
miss += 1
notes.append("%s %s: %s != master %s" % (
name, k, claims[k][2], master[k][2]))
bad = 0
for e in dedges:
kind = edge_kind(e, edges)
if kind != "kept":
bad += 1
notes.append("%s %s>%s: %s edge" % (name, e[0], e[1],
kind))
cover = len([k for k in claims if k in mh]) / len(mh)
ok = miss == 0 and unknown == 0 and bad == 0
rows.append((name, parent, depth[name], len(claims), match,
miss, unknown, bad, cover,
"PASS" if ok else "HOLD"))
return rows, notes
rows, notes = check(MASTER, EDGES, DERIVS)
print("%-8s %-8s %5s %6s %5s %4s %7s %5s %6s %s" % (
"deriv", "parent", "depth", "claims", "match", "diff", "unknown",
"edges", "cover", "verdict"))
for r in rows:
print("%-8s %-8s %5d %6d %5d %4d %7d %5d %6.3f %s" % r)
for n in notes:
print(" " + n)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 8: Closing the Loop: the Provenance Hash Manifest and a Protocol for Refutation. 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 3 · What Detection Really Means: a Hash Sees Only What Was Anchored
- 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