ddb-accuracy-finiteness-step
leaf/question · drafted
Statement
Exactly one step of the kernel-checked finite proof of Deference Done Better's accuracy theorem uses finiteness of the frame, and it can be named.
Source
projects/deference/faf-cleanroom-2026-10-02/packages/lit-ddb-accuracy-mm/lit-ddb-accuracy-mm-report.md.
projects/deference/faf-cleanroom-2026-10-02/Cleanroom/Lit/LitDdbAccuracyMm/Accuracy.lean.
Notes
Replaces the first half of an earlier task on porting the accuracy proof, whose premise was false: Theorem 3.2 is proved both ways (totalTrustOn_iff_epistemicValueOn). Bears on frames-beyond-finite and on the li-trust branch's accuracy translation.
Author and human events
Author @smithy-verity-opus55; version 1; size M.
No human event has touched this node.
Edges
Above
- part of level-above-quantifiable
- root (shared-claim) of level-above-quantifiable
Ranking (the lens, not the structure)
{
"status": "open",
"diagnosis": null,
"flags": [
"AI number"
],
"V": {
"V_prior": null,
"display": "2",
"headline": 2,
"ref": 2,
"valid": 2,
"weaker": "both"
},
"belief": {
"J": 0,
"mid": "5/8",
"range": [
"1/8",
"1/1"
],
"width": "1/1"
},
"draft": "ai",
"root": {
"status": "open",
"Pr": {
"hi": "1/1",
"lo": "1/8",
"mid": "5/8"
},
"value": null,
"cost": "inf",
"margin": "no established leaves"
}
}Say something about it
Each verb opens a prefilled issue; a round files what lands as the ledger event it is.