From 584d2cb846bda1c1ffd191d4e765683f2a946f3f Mon Sep 17 00:00:00 2001 From: Claude Date: Tue, 17 Nov 2026 23:51:00 +0000 Subject: [PATCH] registry: move the pins of THY-1 and APP-1 to APP-4 to main 58ebefb The receipt of THY-1 and APP-1 to APP-4 was earned again in PR 113, from CI run 44190913019 on main 8c55804, the first under the gate of PR 107. The five claim pins now name that receipt at main 58ebefb (its SHA-256 there is 793d2664...), and APP-1's pin also names verdict-missing and verdict-not-yes, the theorems of its middle and last clauses (PR 107). The views are regenerated by `claims-registry.mjs build`: the reader at standards e5a39d7 derives PWG-1 for all five, and the 8.5.3 git checks hold. The theory ledger's writer appended THY-1's receipt change (entry 4); the grade it records is the derived one. `just registry-check` passes, and both JSON Lines files stay in JCS form. Co-Authored-By: Claude Opus 5.5 Claude-Session: https://claude.ai/code/session_01J4QvDf73vaDJwGZ3qMSeH3 --- docs/atlas/claims/claims.jsonl | 10 +++++----- docs/atlas/generated/registry.adoc | 10 +++++----- docs/status/PROOF-STATUS.adoc | 9 ++++++++- docs/status/ROADMAP.adoc | 9 ++++++--- docs/theory/generated/index.adoc | 2 +- docs/theory/ledger.jsonl | 1 + 6 files changed, 26 insertions(+), 15 deletions(-) diff --git a/docs/atlas/claims/claims.jsonl b/docs/atlas/claims/claims.jsonl index d99a044..c2330d3 100644 --- a/docs/atlas/claims/claims.jsonl +++ b/docs/atlas/claims/claims.jsonl @@ -15,11 +15,11 @@ {"agda":{"module":"Lintel.Instance","names":["tini-per-role","tini-coalition"]},"claim":"L-6","id":"metadatastician/lintel#L-6","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"tini holds at this lattice over the address, the query name and the client's local state, for each role's observer and for any two roles observing together","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":{"module":"Lintel.Composition","names":["writes-flow","link-written-to-client","link-written-to-local","link-writable"]},"claim":"L-7","id":"metadatastician/lintel#L-7","kind":"theorem","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"Self-defeating privacy compositions cannot be built as programs: a typed command writes a value depending on both fields only into a variable the client alone may read","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":null,"claim":"A-1","id":"metadatastician/lintel#A-1","kind":"assumption","receipt":{"path":"verification/receipts/agda-pwg_praxis.deed","sha256":"d755487b8c64129a9220ebc9d9d883f0abd9f25452e18476159499362337e317"},"repo":"metadatastician/lintel","source_commit":"d7bdc21a1264f08d7b4368f5d5dadc163630a1bc","statement":"Non-collusion: no party holds both the proxy and the target role (the gap is proved: collusion-gap)","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"FeatureReachability","names":["Cargo.absent-under-all-features","Monotone.reach-mono"]},"claim":"THY-1","id":"hyperpolymath/mathesis#THY-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"repo":"hyperpolymath/mathesis","shelf":"theory","source_commit":"a1388fcc922ea6d6930fdae78f569139493be975","statement":"In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"Applied.Missing","names":["Proofs.closing-needs","Proofs.missing-persists","Proofs.closings-missing","Proofs.verdict-yes","Proofs.breach-decides"]},"claim":"APP-1","id":"hyperpolymath/mathesis#APP-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"a1388fcc922ea6d6930fdae78f569139493be975","statement":"Missing propagates: in the cohort model, an output that depends on a missing input is missing, in every period after it too, and never zero. A verdict is \"no\" on a known breach and otherwise missing when any value it depends on is missing; it is never \"yes\" then.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"Applied.Cash","names":["Proofs.cash-identity"]},"claim":"APP-2","id":"hyperpolymath/mathesis#APP-2","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"a1388fcc922ea6d6930fdae78f569139493be975","statement":"Cash identity: the closing cash of the last period equals the opening cash plus, summed over the periods, receipts minus payments; when a value is missing, both sides are missing. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"Applied.Cash","names":["Proofs.gap-sound","Proofs.gap-least"]},"claim":"APP-3","id":"hyperpolymath/mathesis#APP-3","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"a1388fcc922ea6d6930fdae78f569139493be975","statement":"The funding gap is sound and least: adding the gap to the opening cash keeps every closing balance at or above its floor, and no smaller non-negative amount does. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one.","status_doc":"docs/status/PROOF-STATUS.adoc"} -{"agda":{"module":"Applied.Missing","names":["Proofs.members-needs","Proofs.receipts-needs","Proofs.payments-needs","Proofs.closing-needs","Proofs.shortfall-needs","Proofs.cashOk-needs","Proofs.hours-needs","Proofs.capacityOk-needs","Proofs.gap-needs"]},"claim":"APP-4","id":"hyperpolymath/mathesis#APP-4","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"a1388fcc922ea6d6930fdae78f569139493be975","statement":"Status never upgrades: the evidence status of an output is never stronger than the weakest status of the inputs that it depends on.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"FeatureReachability","names":["Cargo.absent-under-all-features","Monotone.reach-mono"]},"claim":"THY-1","id":"hyperpolymath/mathesis#THY-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"theory","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Applied.Missing","names":["Proofs.closing-needs","Proofs.missing-persists","Proofs.closings-missing","Proofs.verdict-yes","Proofs.breach-decides","Proofs.verdict-missing","Proofs.verdict-not-yes"]},"claim":"APP-1","id":"hyperpolymath/mathesis#APP-1","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"Missing propagates: in the cohort model, an output that depends on a missing input is missing, in every period after it too, and never zero. A verdict is \"no\" on a known breach and otherwise missing when any value it depends on is missing; it is never \"yes\" then.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Applied.Cash","names":["Proofs.cash-identity"]},"claim":"APP-2","id":"hyperpolymath/mathesis#APP-2","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"Cash identity: the closing cash of the last period equals the opening cash plus, summed over the periods, receipts minus payments; when a value is missing, both sides are missing. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Applied.Cash","names":["Proofs.gap-sound","Proofs.gap-least"]},"claim":"APP-3","id":"hyperpolymath/mathesis#APP-3","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"The funding gap is sound and least: adding the gap to the opening cash keeps every closing balance at or above its floor, and no smaller non-negative amount does. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one.","status_doc":"docs/status/PROOF-STATUS.adoc"} +{"agda":{"module":"Applied.Missing","names":["Proofs.members-needs","Proofs.receipts-needs","Proofs.payments-needs","Proofs.closing-needs","Proofs.shortfall-needs","Proofs.cashOk-needs","Proofs.hours-needs","Proofs.capacityOk-needs","Proofs.gap-needs"]},"claim":"APP-4","id":"hyperpolymath/mathesis#APP-4","kind":"theorem","receipt":{"path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"repo":"hyperpolymath/mathesis","shelf":"applied","source_commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","statement":"Status never upgrades: the evidence status of an output is never stronger than the weakest status of the inputs that it depends on.","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":{"module":"ResourceAlgebra.Core","names":["ResourceAlgebra","IsAltMonoid.unitʳ"]},"claim":"C-1","id":"hyperpolymath/resource-algebra#C-1","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"`ResourceAlgebra`: alternatives form an idempotent commutative monoid and sequencing a monoid.","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":{"module":"ResourceAlgebra.Core","names":["≼-refl","≼-trans","≼-antisym","𝟘-least","⊕-upperˡ","⊕-upperʳ","⊕-least"]},"claim":"C-2","id":"hyperpolymath/resource-algebra#C-2","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"The relation `≼` induced by ⊕ is a partial order. `𝟘` is least and `⊕` is its join.","status_doc":"docs/status/PROOF-STATUS.adoc"} {"agda":{"module":"ResourceAlgebra.Core","names":["IsDioid.ordered"]},"claim":"C-3","id":"hyperpolymath/resource-algebra#C-3","kind":"theorem","receipt":{"path":"verification/receipts/resource-algebra-proofs_praxis.deed","sha256":"f6a56a8dc73a43ea6ce5f7700ed66d489fa03ba300a725af81dc8c8d6f4f11b9"},"repo":"hyperpolymath/resource-algebra","source_commit":"a17ffb6cc653f850107df7b3b56051c2beaba5de","statement":"Every dioid is ordered: distributivity makes `⊗` monotone on both sides.","status_doc":"docs/status/PROOF-STATUS.adoc"} diff --git a/docs/atlas/generated/registry.adoc b/docs/atlas/generated/registry.adoc index 03e8b0c..e486105 100644 --- a/docs/atlas/generated/registry.adoc +++ b/docs/atlas/generated/registry.adoc @@ -16,15 +16,15 @@ Census: 38 at `PWG-1`, 0 at `PWG-2ii`, 0 at `PWG-2i`, 0 at `PWG-3`, 6 `ungraded` |=== |Claim |Kind |PWG |Statement (home repository's wording) |Why not higher -|https://github.com/hyperpolymath/mathesis/blob/a1388fcc922ea6d6930fdae78f569139493be975/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-1] at `a1388fcc922e`; the receipt describes `034f215b3b60` |theorem |`PWG-1` |Missing propagates: in the cohort model, an output that depends on a missing input is missing, in every period after it too, and never zero. A verdict is "no" on a known breach and otherwise missing when any value it depends on is missing; it is never "yes" then. (`Applied.Missing`: `Proofs.closing-needs`, `Proofs.missing-persists`, `Proofs.closings-missing`, `Proofs.verdict-yes`, `Proofs.breach-decides`) |— +|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-1] at `58ebefbd9318`; the receipt describes `8c55804163fd` |theorem |`PWG-1` |Missing propagates: in the cohort model, an output that depends on a missing input is missing, in every period after it too, and never zero. A verdict is "no" on a known breach and otherwise missing when any value it depends on is missing; it is never "yes" then. (`Applied.Missing`: `Proofs.closing-needs`, `Proofs.missing-persists`, `Proofs.closings-missing`, `Proofs.verdict-yes`, `Proofs.breach-decides`, `Proofs.verdict-missing`, `Proofs.verdict-not-yes`) |— -|https://github.com/hyperpolymath/mathesis/blob/a1388fcc922ea6d6930fdae78f569139493be975/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-2] at `a1388fcc922e`; the receipt describes `034f215b3b60` |theorem |`PWG-1` |Cash identity: the closing cash of the last period equals the opening cash plus, summed over the periods, receipts minus payments; when a value is missing, both sides are missing. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one. (`Applied.Cash`: `Proofs.cash-identity`) |— +|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-2] at `58ebefbd9318`; the receipt describes `8c55804163fd` |theorem |`PWG-1` |Cash identity: the closing cash of the last period equals the opening cash plus, summed over the periods, receipts minus payments; when a value is missing, both sides are missing. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one. (`Applied.Cash`: `Proofs.cash-identity`) |— -|https://github.com/hyperpolymath/mathesis/blob/a1388fcc922ea6d6930fdae78f569139493be975/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-3] at `a1388fcc922e`; the receipt describes `034f215b3b60` |theorem |`PWG-1` |The funding gap is sound and least: adding the gap to the opening cash keeps every closing balance at or above its floor, and no smaller non-negative amount does. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one. (`Applied.Cash`: `Proofs.gap-sound`, `Proofs.gap-least`) |— +|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-3] at `58ebefbd9318`; the receipt describes `8c55804163fd` |theorem |`PWG-1` |The funding gap is sound and least: adding the gap to the opening cash keeps every closing balance at or above its floor, and no smaller non-negative amount does. Proved for any ordered abelian group; `Applied.IntLaws` proves the integers are one. (`Applied.Cash`: `Proofs.gap-sound`, `Proofs.gap-least`) |— -|https://github.com/hyperpolymath/mathesis/blob/a1388fcc922ea6d6930fdae78f569139493be975/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-4] at `a1388fcc922e`; the receipt describes `034f215b3b60` |theorem |`PWG-1` |Status never upgrades: the evidence status of an output is never stronger than the weakest status of the inputs that it depends on. (`Applied.Missing`: `Proofs.members-needs`, `Proofs.receipts-needs`, `Proofs.payments-needs`, `Proofs.closing-needs`, `Proofs.shortfall-needs`, `Proofs.cashOk-needs`, `Proofs.hours-needs`, `Proofs.capacityOk-needs`, `Proofs.gap-needs`) |— +|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-4] at `58ebefbd9318`; the receipt describes `8c55804163fd` |theorem |`PWG-1` |Status never upgrades: the evidence status of an output is never stronger than the weakest status of the inputs that it depends on. (`Applied.Missing`: `Proofs.members-needs`, `Proofs.receipts-needs`, `Proofs.payments-needs`, `Proofs.closing-needs`, `Proofs.shortfall-needs`, `Proofs.cashOk-needs`, `Proofs.hours-needs`, `Proofs.capacityOk-needs`, `Proofs.gap-needs`) |— -|https://github.com/hyperpolymath/mathesis/blob/a1388fcc922ea6d6930fdae78f569139493be975/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#THY-1] at `a1388fcc922e`; the receipt describes `034f215b3b60` |theorem |`PWG-1` |In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone. (`FeatureReachability`: `Cargo.absent-under-all-features`, `Monotone.reach-mono`) |— +|https://github.com/hyperpolymath/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#THY-1] at `58ebefbd9318`; the receipt describes `8c55804163fd` |theorem |`PWG-1` |In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone. (`FeatureReachability`: `Cargo.absent-under-all-features`, `Monotone.reach-mono`) |— |https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-1] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`ResourceAlgebra`: alternatives form an idempotent commutative monoid and sequencing a monoid. (`ResourceAlgebra.Core`: `ResourceAlgebra`, `IsAltMonoid.unitʳ`) |— diff --git a/docs/status/PROOF-STATUS.adoc b/docs/status/PROOF-STATUS.adoc index 92b058d..2095b7c 100644 --- a/docs/status/PROOF-STATUS.adoc +++ b/docs/status/PROOF-STATUS.adoc @@ -27,7 +27,7 @@ reader of PROOF-POLICY §8.5.1. |Proved in Agda, Rocq and Lean |`PWG-1` |The receipt `verification/receipts/theory_praxis.deed`; the record below. -Claim pins at main `a1388fc` (2026-11-14) +Claim pins at main `58ebefb` (2026-11-17) |=== *Overall*: 5 of 6 obligations are proved in all three provers, and each of the @@ -356,6 +356,13 @@ bash tests/proofs/gate_controls_test.sh agda |=== |Date |Change +|2026-11-17 +|The claim pins of THY-1 and APP-1 to APP-4 name the receipt at main +`58ebefb` (PR 113), and APP-1's pin also names `verdict-missing` and +`verdict-not-yes`. The claims registry catalogues `PWG-1` for all five: +the reader derives it from the receipt of run 44190913019, and the §8.5.3 +git checks hold. The theory ledger records THY-1's receipt change (entry 4). + |2026-11-17 |The receipt is earned again from CI run 44190913019 on main `8c55804`, the first under the gate of #107: for THY-1 and APP-1 to APP-4, in Agda, Rocq diff --git a/docs/status/ROADMAP.adoc b/docs/status/ROADMAP.adoc index 341dfe2..9c9a3ef 100644 --- a/docs/status/ROADMAP.adoc +++ b/docs/status/ROADMAP.adoc @@ -312,9 +312,12 @@ One pull request that changes census rows is open at a time (atlas README, each Rocq library and its import cone with the kernel checker `coqchk -o`. The receipt is written again from CI run 44190913019 on main `8c55804`, the first under that gate; THY-1's Lean leg gains axiom - evidence that inspected its results. Next: the claim pins of THY-1 and - APP-1 to APP-4 move to this receipt, and APP-1's pin names - `verdict-missing` and `verdict-not-yes`. + evidence that inspected its results. +** Fourth change (2026-11-17), after PR 113: the claim pins of THY-1 and + APP-1 to APP-4 name the receipt at main `58ebefb`, and APP-1's pin also + names `verdict-missing` and `verdict-not-yes`. The registry catalogues + `PWG-1` for all five, and the theory ledger records THY-1's receipt + change (entry 4). [[stages]] == Stages diff --git a/docs/theory/generated/index.adoc b/docs/theory/generated/index.adoc index b96653d..0ff0fd5 100644 --- a/docs/theory/generated/index.adoc +++ b/docs/theory/generated/index.adoc @@ -13,6 +13,6 @@ Theorems: 1. |=== |Theorem |Statement |PWG |Source and receipt |Dependant -|THY-1 |In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone. |`PWG-1` |`FeatureReachability`: `Cargo.absent-under-all-features`, `Monotone.reach-mono`; `verification/receipts/theory_praxis.deed` at `a1388fcc922e` |https://github.com/metadatastician/standards/blob/main/docs/UPSTREAM-DEPENDENCY-WATCH.adoc[metadatastician/standards]: Run cargo tree --target all --workspace --all-features, and read a crate missing there as missing from every build. +|THY-1 |In a dependency graph whose edges are guarded by features closed under Horn rules, and by an arbitrary per-target condition, a node unreachable with every feature requested is unreachable under any request, on each target (`Cargo.absent-under-all-features`). The general form is `Monotone.reach-mono`: reachability over a monotone family of edge sets is monotone. |`PWG-1` |`FeatureReachability`: `Cargo.absent-under-all-features`, `Monotone.reach-mono`; `verification/receipts/theory_praxis.deed` at `58ebefbd9318` |https://github.com/metadatastician/standards/blob/main/docs/UPSTREAM-DEPENDENCY-WATCH.adoc[metadatastician/standards]: Run cargo tree --target all --workspace --all-features, and read a crate missing there as missing from every build. |=== diff --git a/docs/theory/ledger.jsonl b/docs/theory/ledger.jsonl index f946835..da46f40 100644 --- a/docs/theory/ledger.jsonl +++ b/docs/theory/ledger.jsonl @@ -1,3 +1,4 @@ {"admission_sha256":"91977ed786bb4a63913234167876096bf6e93491e828dcc3e1e7538862349fc5","date":"2026-11-11","event":"admitted","id":"hyperpolymath/mathesis#THY-1","note":"The ledger starts here, on 2026-11-11. THY-1 was proved in Agda on 2026-11-09 and re-proved in Rocq and Lean; it derived PWG-2ii until the CI receipts of run 42896264290 gave PWG-1 on 2026-11-10. Transport from Agda was blocked, because the Lambdapi exports to Rocq and Lean drop rewrite rules. Earlier history is in git and docs/status/PROOF-STATUS.adoc.","pwg":"PWG-1","receipt":{"commit":"9aa1662da5b2ac4a0e37b9f75a151bb312a8cbea","path":"verification/receipts/theory_praxis.deed","sha256":"001903cb2cf4822aa3a8b4d7ff9bbc8cec99a72d73135df71795529272f95101"},"seq":1} {"admission_sha256":"91977ed786bb4a63913234167876096bf6e93491e828dcc3e1e7538862349fc5","changes":["pwg"],"date":"2026-11-13","event":"changed","id":"hyperpolymath/mathesis#THY-1","note":"The reader pin moved to standards e5a39d7, which requires an inputs manifest, the axioms and the inputs digest on every current receipt. The receipt that THY-1's claim pin names predates them, so the reader refuses it. The Mathesis receipt is regenerated in the same change, and the next change moves THY-1's pin to it.","pwg":"ungraded","receipt":{"commit":"9aa1662da5b2ac4a0e37b9f75a151bb312a8cbea","path":"verification/receipts/theory_praxis.deed","sha256":"001903cb2cf4822aa3a8b4d7ff9bbc8cec99a72d73135df71795529272f95101"},"seq":2} {"admission_sha256":"91977ed786bb4a63913234167876096bf6e93491e828dcc3e1e7538862349fc5","changes":["pwg","receipt"],"date":"2026-11-14","event":"changed","id":"hyperpolymath/mathesis#THY-1","note":"THY-1's claim pin moved to main a1388fc, where the receipt written under PROOF-POLICY 8.5.1 (PR 90) is on main. The canon reader at standards e5a39d7 derives PWG-1 from it, and the 8.5.3 git checks hold, so the registry catalogues PWG-1 again.","pwg":"PWG-1","receipt":{"commit":"a1388fcc922ea6d6930fdae78f569139493be975","path":"verification/receipts/theory_praxis.deed","sha256":"7e175ec06b47177983d5cd9360043358268fb53ea5a69cd75dde58d196cf1c2c"},"seq":3} +{"admission_sha256":"91977ed786bb4a63913234167876096bf6e93491e828dcc3e1e7538862349fc5","changes":["receipt"],"date":"2026-11-17","event":"changed","id":"hyperpolymath/mathesis#THY-1","note":"THY-1's claim pin moved to main 58ebefb (PR 113), where the receipt is earned again from CI run 44190913019 on main 8c55804: the first run under the gate of PR 107, which audits definitions as well as theorems, refuses an empty audit and a declared Lean axiom, and checks each Rocq library and its import cone with the kernel checker coqchk -o. THY-1's Lean leg now has axiom evidence from an audit that inspected its results; the receipt it replaces had an empty axiom list from an audit that inspected none of them. The canon reader at standards e5a39d7 derives PWG-1, and the 8.5.3 git checks hold.","pwg":"PWG-1","receipt":{"commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"seq":4}