Warrant Lab
A hands-on demo of one idea: content that was derived for you (a hint, an explanation, a difficulty label, a prerequisite link) also carries the list of checks run against it. Challenge a claim, watch exactly what happens to its grade, and audit the bookkeeping. Everything happens in your browser and nothing is stored or sent.
Start here: a three-press tour
- Find Hint · hint-000 below and press "Why this grade?" — you will see the three check-families it survived and the arithmetic that turns them into a grade of 3.
- Find Difficulty · difficulty-002 (no checks yet). Press "Log a survival check": its grade moves from 0 to 1, because one declared check-family survived.
- Find Explanation · explanation-001 and press "Log a refutation". It goes dead, and the blast radius shows exactly the two claims that cited it (Prerequisite · prerequisite-004 and Hint · hint-008) dying with it — and nothing else.
The buttons only change this browser tab. Refresh the page and the frozen demo claims are back.
Warrant Lab
Every card below is a claim this platform would normally hand you without evidence: a hint, an explanation, a difficulty label, a prerequisite link. Here each one carries the list of checks run against it and the grade that comes out. Press a button on any card to add a check, see the arithmetic, or audit the bookkeeping — all in this browser tab.
Browser-session only. Nothing is stored or sent. The nine demo claims are built from a frozen fixture when the page loads; your button presses append to this tab's copy only.
What just happened
Audit redoes the arithmetic and checks the stored link chain against a frozen head anchor. Because the anchor was frozen before this session, a claim you challenged here is expected to report a head-mismatch.
Nothing yet. Press a button on any claim card below — start with "Why this grade?" on Hint · hint-000, or follow the three-press tour above.
Survived 3 declared check-families; 0 refutations; 3 checks on record.
Payload
{"claim":"hint-000","statement":"A build hint that survived the F0, F1, and F2 declared check-families."}The grade, step by step
γ(v) = dead if any admitted refuted append else min(K, D(chain), min γ(cites))
Read it as: γ is 3 at most; a cited claim can drag it lower; one refutation makes it dead for good.
K = 3 (WARRANT_MAX_GRADE); D = 3 declared dependency classes; current γ = 3; own part of the fold before cites = 3.
Published advert: 3. It is an advert only and never an input to the recomputation.
Saturation: D ≥ K, so the cap binds and further declared dependency classes cannot raise γ above K.
Declared dependence relation: same family OR declared coverage overlap ≥ 1/2. This relation is syntactic; two checks that share a method or a blind spot can still join one declared dependency class, so the class count is not evidence that their failure modes are distinct (Knight–Leveson).
Ledger
Last challenge: logical index 3. Only admitted appends appear; rejected attempts never entered the store.
No admitted refutations.
None were recorded and admitted, not none exist.
- Index 0survivedseed 0
- Family
- 144dce0e688bdd9b
- Refuter
- 7b1fd941347a864e
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 8f9d → ed53
- Index 1survivedseed 1
- Family
- 9467684e9d8d20fb
- Refuter
- 3df9a5b63faca259
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- ed53 → 7afc
- Index 2survivedseed 2
- Family
- 22929bc6d9c70021
- Refuter
- a69ba33fe2dc05b4
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 7afc → 9c5c
Cites
No cites were declared for this value.
Try it
These four buttons change this browser tab only; nothing is stored or sent. A refutation is recorded against the claim, never the person.
Survived 3 declared check-families; 0 refutations; 3 checks on record.
Payload
{"claim":"explanation-001","statement":"A worked explanation that survived F0, F1, and F2; the frozen anchor points here."}The grade, step by step
γ(v) = dead if any admitted refuted append else min(K, D(chain), min γ(cites))
Read it as: γ is 3 at most; a cited claim can drag it lower; one refutation makes it dead for good.
K = 3 (WARRANT_MAX_GRADE); D = 3 declared dependency classes; current γ = 3; own part of the fold before cites = 3.
Published advert: 3. It is an advert only and never an input to the recomputation.
Saturation: D ≥ K, so the cap binds and further declared dependency classes cannot raise γ above K.
Declared dependence relation: same family OR declared coverage overlap ≥ 1/2. This relation is syntactic; two checks that share a method or a blind spot can still join one declared dependency class, so the class count is not evidence that their failure modes are distinct (Knight–Leveson).
Ledger
Last challenge: logical index 3. Only admitted appends appear; rejected attempts never entered the store.
No admitted refutations.
None were recorded and admitted, not none exist.
- Index 0survivedseed 0
- Family
- 144dce0e688bdd9b
- Refuter
- 7b1fd941347a864e
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 8f9f → 673e
- Index 1survivedseed 1
- Family
- 9467684e9d8d20fb
- Refuter
- 3df9a5b63faca259
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 673e → 082a
- Index 2survivedseed 2
- Family
- 22929bc6d9c70021
- Refuter
- a69ba33fe2dc05b4
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 082a → e645
Cites
No cites were declared for this value.
Try it
These four buttons change this browser tab only; nothing is stored or sent. A refutation is recorded against the claim, never the person.
Survived 0 declared check-families; 0 refutations; 0 checks on record.
Payload
{"claim":"difficulty-002","statement":"A difficulty estimate with no admitted attempts yet."}The grade, step by step
γ(v) = dead if any admitted refuted append else min(K, D(chain), min γ(cites))
Read it as: γ is 3 at most; a cited claim can drag it lower; one refutation makes it dead for good.
K = 3 (WARRANT_MAX_GRADE); D = 0 declared dependency classes; current γ = 0; own part of the fold before cites = 0.
Published advert: 0. It is an advert only and never an input to the recomputation.
Declared dependence relation: same family OR declared coverage overlap ≥ 1/2. This relation is syntactic; two checks that share a method or a blind spot can still join one declared dependency class, so the class count is not evidence that their failure modes are distinct (Knight–Leveson).
Ledger
Last challenge: No challenge recorded. Only admitted appends appear; rejected attempts never entered the store.
No challenge recorded.
Absence of attempts is not survival.
Cites
No cites were declared for this value.
Try it
These four buttons change this browser tab only; nothing is stored or sent. A refutation is recorded against the claim, never the person.
Refuted: grade dead (terminal); 1 refutation on record.
Payload
{"claim":"prerequisite-003","statement":"A prerequisite link whose single F2 attempt was refuted."}The grade, step by step
γ(v) = dead if any admitted refuted append else min(K, D(chain), min γ(cites))
Read it as: γ is 3 at most; a cited claim can drag it lower; one refutation makes it dead for good.
K = 3 (WARRANT_MAX_GRADE); D = 0 declared dependency classes; current γ = dead; own part of the fold before cites = dead.
Published advert: dead. It is an advert only and never an input to the recomputation.
Declared dependence relation: same family OR declared coverage overlap ≥ 1/2. This relation is syntactic; two checks that share a method or a blind spot can still join one declared dependency class, so the class count is not evidence that their failure modes are distinct (Knight–Leveson).
Ledger
Last challenge: logical index 1. Only admitted appends appear; rejected attempts never entered the store.
- Index 0refutedseed 0
- Family
- 22929bc6d9c70021
- Refuter
- a69ba33fe2dc05b4
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 6eab → c7fc
Cites
No cites were declared for this value.
Try it
These four buttons change this browser tab only; nothing is stored or sent. A refutation is recorded against the claim, never the person.
Survived 2 declared check-families; 0 refutations; 2 checks on record.
Payload
"60f54839a81042ee"
The grade, step by step
γ(v) = dead if any admitted refuted append else min(K, D(chain), min γ(cites))
Read it as: γ is 3 at most; a cited claim can drag it lower; one refutation makes it dead for good.
K = 3 (WARRANT_MAX_GRADE); D = 2 declared dependency classes; current γ = 2; own part of the fold before cites = 2.
Published advert: 2. It is an advert only and never an input to the recomputation.
Declared dependence relation: same family OR declared coverage overlap ≥ 1/2. This relation is syntactic; two checks that share a method or a blind spot can still join one declared dependency class, so the class count is not evidence that their failure modes are distinct (Knight–Leveson).
Ledger
Last challenge: logical index 2. Only admitted appends appear; rejected attempts never entered the store.
No admitted refutations.
None were recorded and admitted, not none exist.
- Index 0survivedseed 0
- Family
- 144dce0e688bdd9b
- Refuter
- 7b1fd941347a864e
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 924f → 378c
- Index 1survivedseed 1
- Family
- 9467684e9d8d20fb
- Refuter
- 3df9a5b63faca259
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 378c → cc36
Cites
- a7882978f32dd6d1λ = 3 · does not pin the grade here
Try it
These four buttons change this browser tab only; nothing is stored or sent. A refutation is recorded against the claim, never the person.
Survived 1 declared check-family; 0 refutations; 2 checks on record.
Payload
{"claim":"hint-005","statement":"A hint whose F2 and F3 declarations overlap, so one class covers both."}The grade, step by step
γ(v) = dead if any admitted refuted append else min(K, D(chain), min γ(cites))
Read it as: γ is 3 at most; a cited claim can drag it lower; one refutation makes it dead for good.
K = 3 (WARRANT_MAX_GRADE); D = 1 declared dependency classes; current γ = 1; own part of the fold before cites = 1.
Published advert: 1. It is an advert only and never an input to the recomputation.
Declared dependence relation: same family OR declared coverage overlap ≥ 1/2. This relation is syntactic; two checks that share a method or a blind spot can still join one declared dependency class, so the class count is not evidence that their failure modes are distinct (Knight–Leveson).
Ledger
Last challenge: logical index 2. Only admitted appends appear; rejected attempts never entered the store.
No admitted refutations.
None were recorded and admitted, not none exist.
- Index 0survivedseed 0
- Family
- 22929bc6d9c70021
- Refuter
- a69ba33fe2dc05b4
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- fc40 → 8ab9
- Index 1survivedseed 1
- Family
- e28f3251dc2a924a
- Refuter
- e1c348bcad2804f7
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 8ab9 → 3fdb
Cites
No cites were declared for this value.
Try it
These four buttons change this browser tab only; nothing is stored or sent. A refutation is recorded against the claim, never the person.
Survived 2 declared check-families; 0 refutations; 2 checks on record.
Payload
{"claim":"explanation-006","statement":"A second explanation that survived F0 and F1."}The grade, step by step
γ(v) = dead if any admitted refuted append else min(K, D(chain), min γ(cites))
Read it as: γ is 3 at most; a cited claim can drag it lower; one refutation makes it dead for good.
K = 3 (WARRANT_MAX_GRADE); D = 2 declared dependency classes; current γ = 2; own part of the fold before cites = 2.
Published advert: 2. It is an advert only and never an input to the recomputation.
Declared dependence relation: same family OR declared coverage overlap ≥ 1/2. This relation is syntactic; two checks that share a method or a blind spot can still join one declared dependency class, so the class count is not evidence that their failure modes are distinct (Knight–Leveson).
Ledger
Last challenge: logical index 2. Only admitted appends appear; rejected attempts never entered the store.
No admitted refutations.
None were recorded and admitted, not none exist.
- Index 0survivedseed 0
- Family
- 144dce0e688bdd9b
- Refuter
- 7b1fd941347a864e
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- 0e37 → c6b0
- Index 1survivedseed 1
- Family
- 9467684e9d8d20fb
- Refuter
- 3df9a5b63faca259
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- c6b0 → 5755
Cites
No cites were declared for this value.
Try it
These four buttons change this browser tab only; nothing is stored or sent. A refutation is recorded against the claim, never the person.
Survived 0 declared check-families; 0 refutations; 1 check on record.
Payload
{"claim":"difficulty-007","statement":"A difficulty estimate with one inconclusive F1 attempt."}The grade, step by step
γ(v) = dead if any admitted refuted append else min(K, D(chain), min γ(cites))
Read it as: γ is 3 at most; a cited claim can drag it lower; one refutation makes it dead for good.
K = 3 (WARRANT_MAX_GRADE); D = 0 declared dependency classes; current γ = 0; own part of the fold before cites = 0.
Published advert: 0. It is an advert only and never an input to the recomputation.
Declared dependence relation: same family OR declared coverage overlap ≥ 1/2. This relation is syntactic; two checks that share a method or a blind spot can still join one declared dependency class, so the class count is not evidence that their failure modes are distinct (Knight–Leveson).
Ledger
Last challenge: logical index 1. Only admitted appends appear; rejected attempts never entered the store.
No admitted refutations.
None were recorded and admitted, not none exist.
- Index 0inconclusiveseed 0
- Family
- 9467684e9d8d20fb
- Refuter
- 3df9a5b63faca259
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- d476 → be75
Cites
No cites were declared for this value.
Try it
These four buttons change this browser tab only; nothing is stored or sent. A refutation is recorded against the claim, never the person.
Survived 1 declared check-family; 0 refutations; 2 checks on record.
Payload
"cddb7673c0484944"
The grade, step by step
γ(v) = dead if any admitted refuted append else min(K, D(chain), min γ(cites))
Read it as: γ is 3 at most; a cited claim can drag it lower; one refutation makes it dead for good.
K = 3 (WARRANT_MAX_GRADE); D = 1 declared dependency classes; current γ = 1; own part of the fold before cites = 1.
Published advert: 1. It is an advert only and never an input to the recomputation.
Declared dependence relation: same family OR declared coverage overlap ≥ 1/2. This relation is syntactic; two checks that share a method or a blind spot can still join one declared dependency class, so the class count is not evidence that their failure modes are distinct (Knight–Leveson).
Ledger
Last challenge: logical index 2. Only admitted appends appear; rejected attempts never entered the store.
No admitted refutations.
None were recorded and admitted, not none exist.
- Index 0survivedseed 0
- Family
- 22929bc6d9c70021
- Refuter
- a69ba33fe2dc05b4
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- cc20 → ab9a
- Index 1survivedseed 1
- Family
- e28f3251dc2a924a
- Refuter
- e1c348bcad2804f7
- Admitted by
- demo-verifier
- Prev → head (4-char prefixes)
- ab9a → 9379
Cites
- 8cb0e077f866426aλ = 2 · does not pin the grade here
Try it
These four buttons change this browser tab only; nothing is stored or sent. A refutation is recorded against the claim, never the person.
What this is not
- A grade is contestability accounting for one claim, never a badge that the claim is true, confirmed, or beyond doubt.
- The lab never grades people: no learner account, result, assessment, or progress is read, written, or reported.
- The counts are declared dependency classes (declared check-families), never evidence that the failure modes behind them differ. A shared method or a shared blind spot can still join one class (Knight–Leveson).
- The audit re-checks arithmetic against the ledger and the frozen head anchor; hash chains are tamper evidence, not authenticity.
- "No challenge recorded" is an empty ledger, not a positive warrant: absence of attempts is not survival.
- A refutation is recorded against the claim, never the person; nothing here changes a learner's record.
- This page makes no learning-outcome claim; the real-problem evidence belongs to the problem, not to this lab.
What the words mean
- Claim
- One piece of content someone else derived for you: a hint, an explanation, a difficulty label, or a prerequisite link. Each card below is one claim.
- Ledger
- The append-only list of checks run against that claim. Checks are never deleted or edited, only added; a locally added check lives in this browser tab only.
- Check-family
- A kind of check. Two checks count as one family when they share a declared family, or when their declared coverage overlaps by at least half. Families are declared, not proven, so two checks that share a blind spot can still count as two.
- Grade γ
- The capped count of surviving check-families (3 at most), dragged down to the lowest grade of anything the claim cites. If a check refutes the claim, the grade becomes "dead", permanently.
- Exact demotion
- Refute a claim and exactly the claims that cite it — directly or through a chain — die with it; independent claims keep their grades.
- Audit
- Redoes the grade arithmetic from the ledger and checks the stored link chain against a frozen head anchor. It proves the bookkeeping is consistent, not that the content is right.
Two honest disclaimers: an empty ledger means nobody has tried a check yet, not that the claim passed, and the audit checks the bookkeeping only — never whether a claim is true. This lab belongs to the publications index, where the Refutation-Ledger Values paper and the other labs are listed with their status.