diff --git a/.github/workflows/agda-proof-policy.yml b/.github/workflows/agda-proof-policy.yml index e2f9fd6..eb81f75 100644 --- a/.github/workflows/agda-proof-policy.yml +++ b/.github/workflows/agda-proof-policy.yml @@ -126,7 +126,7 @@ jobs: git -C "$r" remote add origin https://github.com/metadatastician/standards.git git -C "$r" config core.sparseCheckout true printf '1-formats/deed/tools/\nscripts/check-proof-receipt.sh\nscripts/proof-inputs-sha256.sh\n' > "$r/.git/info/sparse-checkout" - git -C "$r" fetch -q --depth 1 origin e5a39d7e5c66f9d24d7e0ffa3f8dbd01f2d42d9d + git -C "$r" fetch -q --depth 1 origin 940a27af1e25a73a2d55daa78d0763e6749fd935 git -C "$r" checkout -q FETCH_HEAD - name: Golden path (just check), then its controls diff --git a/.github/workflows/proven-tests.yml b/.github/workflows/proven-tests.yml index 08031c5..62fe4f9 100644 --- a/.github/workflows/proven-tests.yml +++ b/.github/workflows/proven-tests.yml @@ -57,7 +57,7 @@ jobs: git -C "$r" remote add origin https://github.com/metadatastician/standards.git git -C "$r" config core.sparseCheckout true printf '1-formats/deed/tools/\nscripts/check-proof-receipt.sh\nscripts/proof-inputs-sha256.sh\n' > "$r/.git/info/sparse-checkout" - git -C "$r" fetch -q --depth 1 origin e5a39d7e5c66f9d24d7e0ffa3f8dbd01f2d42d9d + git -C "$r" fetch -q --depth 1 origin 940a27af1e25a73a2d55daa78d0763e6749fd935 git -C "$r" checkout -q FETCH_HEAD for f in verification/receipts/*_praxis.deed; do bun "$r/1-formats/deed/tools/deed_lint.js" --proof-receipt-json "$f" diff --git a/docs/atlas/generated/registry.adoc b/docs/atlas/generated/registry.adoc index e486105..89dfd2e 100644 --- a/docs/atlas/generated/registry.adoc +++ b/docs/atlas/generated/registry.adoc @@ -5,86 +5,86 @@ Each row is a claim in its home repository at a pinned commit. The grade is *derived* here from that repository's receipt by the canon reader of -PROOF-POLICY §8.5.1 (`metadatastician/standards` at `e5a39d7e5c66`), never +PROOF-POLICY §8.5.1 (`metadatastician/standards` at `940a27af1e25`), never assigned (§8.5). A grade is not a discharge (§8.4): `PWG-3` theorems still owe their Rocq and Lean legs. Status of this slice: accepted in link:../../decisions/0004-claims-registry.adoc[ADR 0004], ratified by the owner. -Census: 38 at `PWG-1`, 0 at `PWG-2ii`, 0 at `PWG-2i`, 0 at `PWG-3`, 6 `ungraded`, of 44 theorems. 5 demonstrations and assumptions are listed and not graded. +Census: 0 at `PWG-1`, 0 at `PWG-2ii`, 0 at `PWG-2i`, 0 at `PWG-3`, 44 `ungraded`, of 44 theorems. 5 demonstrations and assumptions are listed and not graded. [cols="2,1,1,4,3",options="header"] |=== |Claim |Kind |PWG |Statement (home repository's wording) |Why not higher -|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/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-1] at `58ebefbd9318` |theorem |`ungraded` |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`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) -|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/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-2] at `58ebefbd9318` |theorem |`ungraded` |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`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) -|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/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-3] at `58ebefbd9318` |theorem |`ungraded` |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`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) -|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/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#APP-4] at `58ebefbd9318` |theorem |`ungraded` |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`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) -|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/mathesis/blob/58ebefbd9318e9df6716b836d4c5ffea82498e10/docs/status/PROOF-STATUS.adoc[hyperpolymath/mathesis#THY-1] at `58ebefbd9318` |theorem |`ungraded` |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`) |the canon reader refuses the receipt: line 28: identity field :beholding-chora carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) -|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ʳ`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-1] at `a17ffb6cc653` |theorem |`ungraded` |`ResourceAlgebra`: alternatives form an idempotent commutative monoid and sequencing a monoid. (`ResourceAlgebra.Core`: `ResourceAlgebra`, `IsAltMonoid.unitʳ`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-2] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |The relation `≼` induced by ⊕ is a partial order. `𝟘` is least and `⊕` is its join. (`ResourceAlgebra.Core`: `≼-refl`, `≼-trans`, `≼-antisym`, `𝟘-least`, `⊕-upperˡ`, `⊕-upperʳ`, `⊕-least`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-2] at `a17ffb6cc653` |theorem |`ungraded` |The relation `≼` induced by ⊕ is a partial order. `𝟘` is least and `⊕` is its join. (`ResourceAlgebra.Core`: `≼-refl`, `≼-trans`, `≼-antisym`, `𝟘-least`, `⊕-upperˡ`, `⊕-upperʳ`, `⊕-least`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-3] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |Every dioid is ordered: distributivity makes `⊗` monotone on both sides. (`ResourceAlgebra.Core`: `IsDioid.ordered`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-3] at `a17ffb6cc653` |theorem |`ungraded` |Every dioid is ordered: distributivity makes `⊗` monotone on both sides. (`ResourceAlgebra.Core`: `IsDioid.ordered`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-4a] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |A dioid need not be annihilating. HWM is a dioid and is not annihilating. (`ResourceAlgebra.Instances.HWM`: `HWM-dioid`, `HWM-not-annihilating`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#C-4a] at `a17ffb6cc653` |theorem |`ungraded` |A dioid need not be annihilating. HWM is a dioid and is not annihilating. (`ResourceAlgebra.Instances.HWM`: `HWM-dioid`, `HWM-not-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-1] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |Both notions have identities and compose, and every strict morphism is lax. (`ResourceAlgebra.Morphism`: `id-hom`, `_∘h_`, `id-lax`, `_∘l_`, `lax`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-1] at `a17ffb6cc653` |theorem |`ungraded` |Both notions have identities and compose, and every strict morphism is lax. (`ResourceAlgebra.Morphism`: `id-hom`, `_∘h_`, `id-lax`, `_∘l_`, `lax`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-2] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`peak : HWM → MaxPlus` is lax: the peak of a sequence never exceeds the sum of the peaks. (`ResourceAlgebra.Morphism`: `peak-lax`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-2] at `a17ffb6cc653` |theorem |`ungraded` |`peak : HWM → MaxPlus` is lax: the peak of a sequence never exceeds the sum of the peaks. (`ResourceAlgebra.Morphism`: `peak-lax`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-3] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`peak` is not strict: it does not preserve ⊗, whatever it does to the units. (`ResourceAlgebra.Morphism`: `peak-not-strict`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-3] at `a17ffb6cc653` |theorem |`ungraded` |`peak` is not strict: it does not preserve ⊗, whatever it does to the units. (`ResourceAlgebra.Morphism`: `peak-not-strict`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-4] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |No strict morphism leaves HWM for an algebra with 𝟘 ≢ 𝟙. In particular, none goes to MaxPlus or to Loss. (`ResourceAlgebra.Morphism`: `no-strict-from-HWM`, `no-strict-HWM→MaxPlus`, `no-strict-HWM→Loss`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-4] at `a17ffb6cc653` |theorem |`ungraded` |No strict morphism leaves HWM for an algebra with 𝟘 ≢ 𝟙. In particular, none goes to MaxPlus or to Loss. (`ResourceAlgebra.Morphism`: `no-strict-from-HWM`, `no-strict-HWM→MaxPlus`, `no-strict-HWM→Loss`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-5] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |Exactly two strict morphisms Loss → MaxPlus exist, `zero-test` and `support`. Neither distinguishes `fin 1` from `fin 2`. (`ResourceAlgebra.Morphism`: `zero-test-hom`, `support-hom`, `Loss→MaxPlus`, `maps-disagree-at-positive`, `Loss→MaxPlus-collapses`, `no-injective-Loss→MaxPlus`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-5] at `a17ffb6cc653` |theorem |`ungraded` |Exactly two strict morphisms Loss → MaxPlus exist, `zero-test` and `support`. Neither distinguishes `fin 1` from `fin 2`. (`ResourceAlgebra.Morphism`: `zero-test-hom`, `support-hom`, `Loss→MaxPlus`, `maps-disagree-at-positive`, `Loss→MaxPlus-collapses`, `no-injective-Loss→MaxPlus`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-6] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |Exactly one strict morphism MaxPlus → Loss exists, `support′`. resource-algebra#3 sketched this direction as "symmetric" to Loss → MaxPlus, but it is not: there is one map, not two. The issue's other claim, that every positive grade goes to a single point, holds. (`ResourceAlgebra.Morphism`: `support′-hom`, `MaxPlus→Loss`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-6] at `a17ffb6cc653` |theorem |`ungraded` |Exactly one strict morphism MaxPlus → Loss exists, `support′`. resource-algebra#3 sketched this direction as "symmetric" to Loss → MaxPlus, but it is not: there is one map, not two. The issue's other claim, that every positive grade goes to a single point, holds. (`ResourceAlgebra.Morphism`: `support′-hom`, `MaxPlus→Loss`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-7] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |The identity on the carrier is a lax morphism Loss → MinMax: a bottleneck never exceeds the sum. (`ResourceAlgebra.Morphism`: `loss-bottleneck`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-7] at `a17ffb6cc653` |theorem |`ungraded` |The identity on the carrier is a lax morphism Loss → MinMax: a bottleneck never exceeds the sum. (`ResourceAlgebra.Morphism`: `loss-bottleneck`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-8] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |Out of one question there is exactly one strict morphism into an algebra `B`: lost goes to 𝟘 and kept goes to 𝟙. It exists exactly when `B` has 𝟘 ⊗ 𝟘 ≡ 𝟘, which every annihilating algebra has, and HWM too. (`ResourceAlgebra.Morphism`: `one-question-hom`, `one-question-needs`, `one-question-unique`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-8] at `a17ffb6cc653` |theorem |`ungraded` |Out of one question there is exactly one strict morphism into an algebra `B`: lost goes to 𝟘 and kept goes to 𝟙. It exists exactly when `B` has 𝟘 ⊗ 𝟘 ≡ 𝟘, which every annihilating algebra has, and HWM too. (`ResourceAlgebra.Morphism`: `one-question-hom`, `one-question-needs`, `one-question-unique`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-9] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |Taking the first question of `Questions (suc n)`, and dropping it, are strict morphisms. Composed, they read any single question alone. (`ResourceAlgebra.Morphism`: `first-question`, `later-questions`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-9] at `a17ffb6cc653` |theorem |`ungraded` |Taking the first question of `Questions (suc n)`, and dropping it, are strict morphisms. Composed, they read any single question alone. (`ResourceAlgebra.Morphism`: `first-question`, `later-questions`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-10] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |The number of lost questions does not preserve ⊕: `collapse` and `shuffle` each count 1 and their ⊕ counts 0. So no map into Loss or MinMax that factors through the count is strict or lax. (`ResourceAlgebra.Morphism`: `count-not-⊕`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#F-10] at `a17ffb6cc653` |theorem |`ungraded` |The number of lost questions does not preserve ⊕: `collapse` and `shuffle` each count 1 and their ⊕ counts 0. So no map into Loss or MinMax that factors through the count is strict or lax. (`ResourceAlgebra.Morphism`: `count-not-⊕`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#H-1] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`HWM` (peak, drift, with drift ≤ peak) is a `ResourceAlgebra`, `IsDioid` and `IsOrdered`, and 𝟘 ≡ 𝟙. (`ResourceAlgebra.Instances.HWM`: `HWM`, `HWM-dioid`, `HWM-ordered`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#H-1] at `a17ffb6cc653` |theorem |`ungraded` |`HWM` (peak, drift, with drift ≤ peak) is a `ResourceAlgebra`, `IsDioid` and `IsOrdered`, and 𝟘 ≡ 𝟙. (`ResourceAlgebra.Instances.HWM`: `HWM`, `HWM-dioid`, `HWM-ordered`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#H-3] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`HWM` has no annihilating zero. (`ResourceAlgebra.Instances.HWM`: `HWM-not-annihilating`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#H-3] at `a17ffb6cc653` |theorem |`ungraded` |`HWM` has no annihilating zero. (`ResourceAlgebra.Instances.HWM`: `HWM-not-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#L-1] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`Loss` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = min, ⊗ = +, 𝟘 = inf and 𝟙 = fin 0. (`ResourceAlgebra.Instances.Loss`: `Loss`, `Loss-dioid`, `Loss-ordered`, `Loss-annihilating`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#L-1] at `a17ffb6cc653` |theorem |`ungraded` |`Loss` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = min, ⊗ = +, 𝟘 = inf and 𝟙 = fin 0. (`ResourceAlgebra.Instances.Loss`: `Loss`, `Loss-dioid`, `Loss-ordered`, `Loss-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#M-1] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`MaxPlus` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = max, ⊗ = +, 𝟘 = bot and 𝟙 = val 0. (`ResourceAlgebra.Instances.MaxPlus`: `MaxPlus`, `MaxPlus-dioid`, `MaxPlus-ordered`, `MaxPlus-annihilating`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#M-1] at `a17ffb6cc653` |theorem |`ungraded` |`MaxPlus` is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`, with ⊕ = max, ⊗ = +, 𝟘 = bot and 𝟙 = val 0. (`ResourceAlgebra.Instances.MaxPlus`: `MaxPlus`, `MaxPlus-dioid`, `MaxPlus-ordered`, `MaxPlus-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#N-1] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`MinMax` (the bottleneck algebra) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating` on the Loss carrier. Its operations are ⊕ = min and ⊗ = max (`_⊔g_`, with `inf` absorbing), with 𝟘 = inf and 𝟙 = fin 0. (`ResourceAlgebra.Instances.MinMax`: `MinMax`, `MinMax-dioid`, `MinMax-ordered`, `MinMax-annihilating`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#N-1] at `a17ffb6cc653` |theorem |`ungraded` |`MinMax` (the bottleneck algebra) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating` on the Loss carrier. Its operations are ⊕ = min and ⊗ = max (`_⊔g_`, with `inf` absorbing), with 𝟘 = inf and 𝟙 = fin 0. (`ResourceAlgebra.Instances.MinMax`: `MinMax`, `MinMax-dioid`, `MinMax-ordered`, `MinMax-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-1] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`Questions n` (a "which" grade over `n` downstream questions) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`. A grade is `n` booleans, `true` where a step loses that question. Its operations are ⊕ = intersection and ⊗ = union, bit by bit, with 𝟘 = every question lost and 𝟙 = none lost. (`ResourceAlgebra.Instances.Questions`: `Questions`, `Questions-dioid`, `Questions-ordered`, `Questions-annihilating`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-1] at `a17ffb6cc653` |theorem |`ungraded` |`Questions n` (a "which" grade over `n` downstream questions) is a `ResourceAlgebra`, `IsDioid`, `IsOrdered` and `IsAnnihilating`. A grade is `n` booleans, `true` where a step loses that question. Its operations are ⊕ = intersection and ⊗ = union, bit by bit, with 𝟘 = every question lost and 𝟙 = none lost. (`ResourceAlgebra.Instances.Questions`: `Questions`, `Questions-dioid`, `Questions-ordered`, `Questions-annihilating`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-2] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |With two questions, `collapse` (loses question 1) and `shuffle` (loses question 0) each lose one question and are different grades: a count of lost questions cannot tell them apart. (`ResourceAlgebra.Instances.Questions`: `same-amount-different-loss`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-2] at `a17ffb6cc653` |theorem |`ungraded` |With two questions, `collapse` (loses question 1) and `shuffle` (loses question 0) each lose one question and are different grades: a count of lost questions cannot tell them apart. (`ResourceAlgebra.Instances.Questions`: `same-amount-different-loss`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-3] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |In sequence, `collapse` then `shuffle` loses both questions. (`ResourceAlgebra.Instances.Questions`: `both-lost`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-3] at `a17ffb6cc653` |theorem |`ungraded` |In sequence, `collapse` then `shuffle` loses both questions. (`ResourceAlgebra.Instances.Questions`: `both-lost`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-4] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |As alternatives, `collapse ⊕ shuffle` is 𝟙 (no question lost), while neither branch is 𝟙. So ⊕ answers "is question i kept on some branch?" and not "does one branch keep every question?". (`ResourceAlgebra.Instances.Questions`: `no-branch-achieves-meet`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#Q-4] at `a17ffb6cc653` |theorem |`ungraded` |As alternatives, `collapse ⊕ shuffle` is 𝟙 (no question lost), while neither branch is 𝟙. So ⊕ answers "is question i kept on some branch?" and not "does one branch keep every question?". (`ResourceAlgebra.Instances.Questions`: `no-branch-achieves-meet`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-1] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |Sequencing peaks 2 and 3 gives 3 under HWM and 5 under MaxPlus: an occupancy bound is not a cost bound. (`ResourceAlgebra.Separation`: `occupancy-is-not-cost`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-1] at `a17ffb6cc653` |theorem |`ungraded` |Sequencing peaks 2 and 3 gives 3 under HWM and 5 under MaxPlus: an occupancy bound is not a cost bound. (`ResourceAlgebra.Separation`: `occupancy-is-not-cost`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-2] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |On the same numbers, alternatives give `fin 2` under Loss and `val 3` under MaxPlus: echo's join is min, while tropical's is max. (`ResourceAlgebra.Separation`: `alternatives-differ`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-2] at `a17ffb6cc653` |theorem |`ungraded` |On the same numbers, alternatives give `fin 2` under Loss and `val 3` under MaxPlus: echo's join is min, while tropical's is max. (`ResourceAlgebra.Separation`: `alternatives-differ`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-3] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |`val 1 ≼ val 2` in MaxPlus but `fin 2 ≼ fin 1` in Loss: the induced orders run in opposite directions. (`ResourceAlgebra.Separation`: `maxplus-order`, `loss-order-reversed`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-3] at `a17ffb6cc653` |theorem |`ungraded` |`val 1 ≼ val 2` in MaxPlus but `fin 2 ≼ fin 1` in Loss: the induced orders run in opposite directions. (`ResourceAlgebra.Separation`: `maxplus-order`, `loss-order-reversed`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-4] at `a17ffb6cc653`; the receipt describes `47de4a8ee49d` |theorem |`PWG-1` |Sequencing 2 then 3 gives `fin 5` under Loss but `fin 3` under MinMax: a bottleneck bound is not a loss bound. (`ResourceAlgebra.Separation`: `bottleneck-is-not-sum`) |— +|https://github.com/hyperpolymath/resource-algebra/blob/a17ffb6cc653f850107df7b3b56051c2beaba5de/docs/status/PROOF-STATUS.adoc[hyperpolymath/resource-algebra#S-4] at `a17ffb6cc653` |theorem |`ungraded` |Sequencing 2 then 3 gives `fin 5` under Loss but `fin 3` under MinMax: a bottleneck bound is not a loss bound. (`ResourceAlgebra.Separation`: `bottleneck-is-not-sum`) |the canon reader refuses the receipt: claim "C-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-1] at `4ed067220f13`; the receipt describes `292d566a81a9` |theorem |`PWG-1` |TINI at the two-point lattice: two finishing runs of a well-typed command from low-equivalent stores end low-equivalent, fuels independent (`SecretTypes.Noninterference`: `tini`) |— +|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-1] at `4ed067220f13` |theorem |`ungraded` |TINI at the two-point lattice: two finishing runs of a well-typed command from low-equivalent stores end low-equivalent, fuels independent (`SecretTypes.Noninterference`: `tini`) |the canon reader refuses the receipt: claim "N-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-2] at `4ed067220f13`; the receipt describes `292d566a81a9` |theorem |`PWG-1` |Public expressions read the same in low-equivalent stores (`SecretTypes.Noninterference`: `eval-low`) |— +|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-2] at `4ed067220f13` |theorem |`ungraded` |Public expressions read the same in low-equivalent stores (`SecretTypes.Noninterference`: `eval-low`) |the canon reader refuses the receipt: claim "N-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-3] at `4ed067220f13`; the receipt describes `292d566a81a9` |theorem |`PWG-1` |Confinement: under a secret program counter the public variable is unchanged, loops included (`SecretTypes.Noninterference`: `confine`) |— +|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-3] at `4ed067220f13` |theorem |`ungraded` |Confinement: under a secret program counter the public variable is unchanged, loops included (`SecretTypes.Noninterference`: `confine`) |the canon reader refuses the receipt: claim "N-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) |https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-4] at `4ed067220f13` |demonstration |`ungraded` |The typing side-condition is load-bearing: an explicit and an implicit flow are each refused and each actually leaks |demonstration, not a theorem (§8.1) @@ -92,26 +92,26 @@ Census: 38 at `PWG-1`, 0 at `PWG-2ii`, 0 at `PWG-2i`, 0 at `PWG-3`, 6 `ungraded` |https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-6] at `4ed067220f13` |demonstration |`ungraded` |Laws census: generic TINI uses exactly the two upper-bound laws and the observer's down-closure (law-ablation certificate) |demonstration, not a theorem (§8.1) -|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-7] at `4ed067220f13`; the receipt describes `292d566a81a9` |theorem |`PWG-1` |TINI over the Lattice record: for every variable set with decidable equality, lattice, labelling and down-closed observer, two finishing runs of a well-typed command from stores agreeing on what the observer sees end agreeing on it (`SecretTypes.Noninterference.Generic`: `tini`) |— +|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-7] at `4ed067220f13` |theorem |`ungraded` |TINI over the Lattice record: for every variable set with decidable equality, lattice, labelling and down-closed observer, two finishing runs of a well-typed command from stores agreeing on what the observer sees end agreeing on it (`SecretTypes.Noninterference.Generic`: `tini`) |the canon reader refuses the receipt: claim "N-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-8] at `4ed067220f13`; the receipt describes `292d566a81a9` |theorem |`PWG-1` |Each census law is necessary: dropping an upper-bound law or observer down-closure admits a well-typed leaking program; transitivity is necessary for principal observers (`SecretTypes.Countermodels`: `NoUpper₁.refutes`, `NoUpper₂.refutes`, `NoDownClosure.refutes`, `NoTrans.refutes`) |— +|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-8] at `4ed067220f13` |theorem |`ungraded` |Each census law is necessary: dropping an upper-bound law or observer down-closure admits a well-typed leaking program; transitivity is necessary for principal observers (`SecretTypes.Countermodels`: `NoUpper₁.refutes`, `NoUpper₂.refutes`, `NoDownClosure.refutes`, `NoTrans.refutes`) |the canon reader refuses the receipt: claim "N-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) -|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-9] at `4ed067220f13`; the receipt describes `292d566a81a9` |theorem |`PWG-1` |If an observer sees finishing versus not finishing, termination-sensitive noninterference is false for the current typing rules (`SecretTypes.Noninterference.OutcomeVisibility`: `termination-sensitive-fails`) |— +|https://github.com/hyperpolymath/secret-types/blob/4ed067220f1357b37f7d54c5ae0690ff35b292bd/PROOF-STATUS.adoc[hyperpolymath/secret-types#N-9] at `4ed067220f13` |theorem |`ungraded` |If an observer sees finishing versus not finishing, termination-sensitive noninterference is false for the current typing rules (`SecretTypes.Noninterference.OutcomeVisibility`: `termination-sensitive-fails`) |the canon reader refuses the receipt: claim "N-1" records :pwg PWG-1, but its legs and receipts support PWG-2ii (PROOF-POLICY §8.2, §8.4) |https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#A-1] at `d7bdc21a1264` |assumption |`ungraded` |Non-collusion: no party holds both the proxy and the target role (the gap is proved: collusion-gap) |assumption, not a theorem (§8.1) -|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-1] at `d7bdc21a1264` |theorem |`ungraded` |A lattice, not just a poset: ⊑ is a decidable partial order, ⊔ and ⊓ are least upper and greatest lower bounds, anyone is least and no-one greatest (`Lintel.Lattice`: `⊑-refl`, `⊑-trans`, `⊑-antisym`, `⊔-upper₁`, `⊔-upper₂`, `⊔-least`, `⊓-lower₁`, `⊓-lower₂`, `⊓-greatest`, `anyone-least`, `no-one-greatest`, `no-one-⋢-anyone`, `_⊑?_`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-1] at `d7bdc21a1264` |theorem |`ungraded` |A lattice, not just a poset: ⊑ is a decidable partial order, ⊔ and ⊓ are least upper and greatest lower bounds, anyone is least and no-one greatest (`Lintel.Lattice`: `⊑-refl`, `⊑-trans`, `⊑-antisym`, `⊔-upper₁`, `⊔-upper₂`, `⊔-least`, `⊓-lower₁`, `⊓-lower₂`, `⊓-greatest`, `anyone-least`, `no-one-greatest`, `no-one-⋢-anyone`, `_⊑?_`) |the canon reader refuses the receipt: line 12: identity field :repo-uuid carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) -|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-2] at `d7bdc21a1264` |theorem |`ungraded` |⊑ is reverse inclusion of reader sets; a role sees a label exactly when the label may flow to that role's observer level (`Lintel.Lattice`: `⊑-readers`, `readers-⊑`, `observes-flow`, `flow-observes`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-2] at `d7bdc21a1264` |theorem |`ungraded` |⊑ is reverse inclusion of reader sets; a role sees a label exactly when the label may flow to that role's observer level (`Lintel.Lattice`: `⊑-readers`, `readers-⊑`, `observes-flow`, `flow-observes`) |the canon reader refuses the receipt: line 12: identity field :repo-uuid carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) -|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-3] at `d7bdc21a1264` |theorem |`ungraded` |The laws secret-types' generic TINI needs hold here, packed as an instance of its Lattice record (`Lintel.Instance`: `reader-sets`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-3] at `d7bdc21a1264` |theorem |`ungraded` |The laws secret-types' generic TINI needs hold here, packed as an instance of its Lattice record (`Lintel.Instance`: `reader-sets`) |the canon reader refuses the receipt: line 12: identity field :repo-uuid carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) -|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-4] at `d7bdc21a1264` |theorem |`ungraded` |Address and query name each reach their own role; composed, only the client may observe them (`Lintel.Lattice`: `address-to-proxy`, `qname-to-target`, `link`, `link-confined`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-4] at `d7bdc21a1264` |theorem |`ungraded` |Address and query name each reach their own role; composed, only the client may observe them (`Lintel.Lattice`: `address-to-proxy`, `qname-to-target`, `link`, `link-confined`) |the canon reader refuses the receipt: line 12: identity field :repo-uuid carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) |https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-5] at `d7bdc21a1264` |demonstration |`ungraded` |The typechecker refuses the self-defeating compositions and accepts the client's |demonstration, not a theorem (§8.1) -|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-6] at `d7bdc21a1264` |theorem |`ungraded` |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 (`Lintel.Instance`: `tini-per-role`, `tini-coalition`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-6] at `d7bdc21a1264` |theorem |`ungraded` |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 (`Lintel.Instance`: `tini-per-role`, `tini-coalition`) |the canon reader refuses the receipt: line 12: identity field :repo-uuid carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) -|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-7] at `d7bdc21a1264` |theorem |`ungraded` |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 (`Lintel.Composition`: `writes-flow`, `link-written-to-client`, `link-written-to-local`, `link-writable`) |the canon reader refuses the receipt: unexpected clause (identity) in the receipt +|https://github.com/metadatastician/lintel/blob/d7bdc21a1264f08d7b4368f5d5dadc163630a1bc/docs/status/PROOF-STATUS.adoc[metadatastician/lintel#L-7] at `d7bdc21a1264` |theorem |`ungraded` |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 (`Lintel.Composition`: `writes-flow`, `link-written-to-client`, `link-written-to-local`, `link-writable`) |the canon reader refuses the receipt: line 12: identity field :repo-uuid carries a #u5 literal; write #uuid"" or #u8"domain:name" (owner ruling Q2, CHORA-SPEC 7.1) |=== diff --git a/docs/status/PROOF-STATUS.adoc b/docs/status/PROOF-STATUS.adoc index 2095b7c..587ccc2 100644 --- a/docs/status/PROOF-STATUS.adoc +++ b/docs/status/PROOF-STATUS.adoc @@ -15,7 +15,7 @@ reader of PROOF-POLICY §8.5.1. |THY-1 |Discharged -|`PWG-1` +|`PWG-2ii` |The receipt `verification/receipts/theory_praxis.deed`; the record below |The token-lattice theorems (next on the theory shelf) @@ -25,13 +25,16 @@ reader of PROOF-POLICY §8.5.1. |APP-1 to APP-4, the cohort model of the applied shelf (WO 4.2) |Proved in Agda, Rocq and Lean -|`PWG-1` +|`PWG-2ii` |The receipt `verification/receipts/theory_praxis.deed`; the record below. Claim pins at main `58ebefb` (2026-11-17) |=== *Overall*: 5 of 6 obligations are proved in all three provers, and each of the -5 has a receipt and a derived grade, `PWG-1`. The token-lattice theorems +5 has a receipt and a derived grade, `PWG-2ii`. None is `PWG-1`: since +standards#1625 (2026-11-17), `PWG-1` needs every counted checker to have run +in a container image pinned by digest, and the proof lanes run in the pinned +Guix shell, which the receipt cannot name as such an image. The token-lattice theorems (counted as one) are open. These are counts, not a percentage: PROOF-POLICY §8 grades are derived from receipts and are never flattened. The template example proofs were removed in WO 4.1. @@ -236,16 +239,19 @@ Residual assumptions: none in any leg. |Machine receipt (§8.5.1) |`verification/receipts/theory_praxis.deed`. The canon reader -(`deed_lint.js --proof-receipt-json`) derives `PWG-1` from it, the grade -below, and CI runs that reader on each change. The claims registry lists +(`deed_lint.js --proof-receipt-json`, standards `940a27af`) derives +`PWG-2ii` from it, the grade below, and CI runs that reader on each change. The claims registry lists the claim as `hyperpolymath/mathesis#THY-1` and shows the grade that the same reader derives (link:../atlas/generated/registry.adoc[`docs/atlas/generated/registry.adoc`]). |`pwg` -|`1` (since 2026-11-10): `PWG-2ii`, and every counted witness has a current -receipt from one headless, isolated, pinned CI run on the exact source commit -(PROOF-POLICY §8.2): `336768958d01` until 2026-11-13, `034f215` until 2026-11-17, `8c55804` since. The grade holds while those receipts stay +|`2ii` (since 2026-11-18). From 2026-11-10 to 2026-11-17 it was `1`: +`PWG-2ii`, and every counted witness had a current receipt from one headless, +pinned CI run on the exact source commit (PROOF-POLICY §8.2). Standards#1625 +then required the checker's image, pinned by digest, on each receipt; the +pinned Guix shell is not such an image, so the reader derives `PWG-2ii`. +The receipts are unchanged. The commits: `336768958d01` until 2026-11-13, `034f215` until 2026-11-17, `8c55804` since. The grade holds while those receipts stay current: a later commit that breaks a leg, or a run that cannot be repeated, drops it (§8.4). Before 2026-11-10 it was `2ii`, because each receipt came from a local run. @@ -331,8 +337,8 @@ Residual assumptions: none in any leg. come from CI run 44190913019 on main `8c55804` (Agda 2.7.0.1, Rocq 8.18.0, Lean 4.29.0, pinned Guix `8edb9da`), the first under the gate of #107; the receipts of run 43498592499 on main `034f215` are superseded. Each records the inputs manifest of its -prover and no axiom. The canon reader at standards `e5a39d7` derives `PWG-1` -for each of APP-1 to APP-4, and the shared git checker (`just receipt-check`) +prover and no axiom. The canon reader at standards `940a27af` derives `PWG-2ii` +for each of APP-1 to APP-4 (no digest-pinned checker image, standards#1625), and the shared git checker (`just receipt-check`) passes. The Rocq and Lean legs are `RECONCILED` by the comparison above, done by reading. The trusted base gains `Char` and `String`, the postulates that `Applied/IntLaws` reaches through `Agda.Builtin.Int`. @@ -356,6 +362,18 @@ bash tests/proofs/gate_controls_test.sh agda |=== |Date |Change +|2026-11-18 +|The claims registry pins the canon reader at standards `940a27af` +(it was `e5a39d7`). That reader reads `(import …)` clauses and applies +standards#1625: `PWG-1` needs every counted checker to have run in a +container image pinned by digest. The receipt is recorded again without a +new run. Its `:beholding-chora` used a `#u5` literal, which that reader +refuses (owner ruling Q2), and now uses the canon form +`#u8"chora:estate/github.com/hyperpolymath"`. The reader derives +`PWG-2ii` for all five. The claim pins still name the receipt at +`58ebefb`, which the reader refuses, so the registry shows the five as +`ungraded` until the pins move to this receipt (the next 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 diff --git a/docs/theory/generated/index.adoc b/docs/theory/generated/index.adoc index 0ff0fd5..98017dd 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 `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. +|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. |`ungraded` |`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 da46f40..b13dcae 100644 --- a/docs/theory/ledger.jsonl +++ b/docs/theory/ledger.jsonl @@ -2,3 +2,4 @@ {"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} +{"admission_sha256":"91977ed786bb4a63913234167876096bf6e93491e828dcc3e1e7538862349fc5","changes":["pwg"],"date":"2026-11-18","event":"changed","id":"hyperpolymath/mathesis#THY-1","note":"The reader pin moved to standards 940a27af, which refuses a #u5 identity literal (owner ruling Q2) and requires a digest-pinned checker image for PWG-1 (standards#1625). The receipt that THY-1's claim pin names (58ebefb) has a #u5 :beholding-chora, so the reader refuses it. The Mathesis receipt is recorded again in the same change, where the reader derives PWG-2ii, and the next change moves THY-1's pin to it.","pwg":"ungraded","receipt":{"commit":"58ebefbd9318e9df6716b836d4c5ffea82498e10","path":"verification/receipts/theory_praxis.deed","sha256":"793d2664bc34e55956171c65569dc7c59d662bdb05b25c33f4ab540176af34bc"},"seq":5} diff --git a/scripts/registry/claims-registry.mjs b/scripts/registry/claims-registry.mjs index ebfce27..be5351e 100644 --- a/scripts/registry/claims-registry.mjs +++ b/scripts/registry/claims-registry.mjs @@ -64,9 +64,9 @@ const SHELVES = new Set(['theory', 'applied']); // that is not this file is refused, so a grade never comes from an unpinned rule. export const READER = { repository: 'metadatastician/standards', - commit: 'e5a39d7e5c66f9d24d7e0ffa3f8dbd01f2d42d9d', + commit: '940a27af1e25a73a2d55daa78d0763e6749fd935', path: '1-formats/deed/tools/deed_lint.js', - sha256: '37ff85be499b35dd9d74399e05d9ae1e57ccf095362c355f93e04b3bbf4c9491', + sha256: '29278b46654bdee70e8e1ff4a7ff8cb810e04b618c9ca1520a6979d6c4c91f18', }; // The git checks of PROOF-POLICY §8.5.3, from the same standards commit as the @@ -74,7 +74,7 @@ export const READER = { // the home repository; the checker calls the digest script, so both are pinned. export const CHECKER = { path: 'scripts/check-proof-receipt.sh', - sha256: '831f5a43c906c3edc8cfa68ab5fe13c37e7a41b35e40068481d988d887f4bd3f', + sha256: 'f2375747238464535d1b4a61f658f07cb2f8504c69bfb1812311c79429a4e23e', digest: 'scripts/proof-inputs-sha256.sh', digestSha256: 'dfc6dde01a3a79df638eebe4cad0eae584d8f17280077e149174c0667e9508f4', }; diff --git a/tests/registry/claims-registry.test.mjs b/tests/registry/claims-registry.test.mjs index 050fddd..fded230 100644 --- a/tests/registry/claims-registry.test.mjs +++ b/tests/registry/claims-registry.test.mjs @@ -27,13 +27,15 @@ beforeAll(async () => { readProofReceipt = await loadReader(); }); // `rocq` and `lean` are leg states, or null for no leg; `*At` is the commit of // that leg's current receipt. const fixture = ({repo = 'o/r', pwg = 'PWG-3', invocation = 'agda --safe --without-K --cubical-compatible M.agda', - rocq = null, lean = null, rocqAt = commit, leanAt = commit} = {}) => { + rocq = null, lean = null, rocqAt = commit, leanAt = commit, image = false} = {}) => { // Each current receipt lists its inputs (standards e5a39d7): one manifest line, - // the digest of that manifest, and an empty axioms clause. + // the digest of that manifest, and an empty axioms clause. With `image`, each + // receipt also names a digest-pinned image, which PWG-1 needs (§8.2, standards#1625). const run = (prover, at, inv) => { const line = `${'c'.repeat(64)} ${prover}/M\n`; const digest = createHash('sha256').update(line).digest('hex'); - return ` (receipt :run "ci" :commit "${at}" :checker "${prover}" :invocation "${inv}"\n` + + const img = image ? ` :image "example/${prover}@sha256:${'d'.repeat(64)}"` : ''; + return ` (receipt :run "ci" :commit "${at}" :checker "${prover}"${img} :invocation "${inv}"\n` + ` :inputs-sha256 "${digest}" :state current (axioms)\n` + ` (inputs-manifest (file :path "${prover}/M" :sha256 "${'c'.repeat(64)}"))))\n`; }; @@ -89,8 +91,13 @@ test('the grade is the one the reader derives (§8.2)', () => { const two = derive(theorem, read(fixture({pwg: 'PWG-2ii', rocq: 'RECONCILED', lean: 'RECONCILED', leanAt: 'b'.repeat(40)}))); expect(two.pwg).toBe('PWG-2ii'); expect(two.reasons.join()).toContain('the reader derives PWG-2ii'); - const one = derive(theorem, read(fixture({pwg: 'PWG-1', rocq: 'RECONCILED', lean: 'RECONCILED'}))); + const one = derive(theorem, read(fixture({pwg: 'PWG-1', rocq: 'RECONCILED', lean: 'RECONCILED', image: true}))); expect(one).toEqual({pwg: 'PWG-1', reasons: [], evidence: commit}); + // The same witnesses with no checker image give PWG-2ii, so a recorded PWG-1 is refused. + expect(derive(theorem, read(fixture({pwg: 'PWG-2ii', rocq: 'RECONCILED', lean: 'RECONCILED'}))).pwg).toBe('PWG-2ii'); + const noImage = derive(theorem, read(fixture({pwg: 'PWG-1', rocq: 'RECONCILED', lean: 'RECONCILED'}))); + expect(noImage.pwg).toBe('ungraded'); + expect(noImage.reasons.join()).toMatch(/records :pwg PWG-1, but its legs and receipts support PWG-2ii/); }); test('a receipt the reader refuses is ungraded, with the reader\'s reason', () => { @@ -145,7 +152,7 @@ test('a row names the commit that its receipt describes when it differs from the }); test('a PWG-1 is catalogued only when the git checks of §8.5.3 hold', async () => { - const one = derive(theorem, read(fixture({pwg: 'PWG-1', rocq: 'RECONCILED', lean: 'RECONCILED'}))); + const one = derive(theorem, read(fixture({pwg: 'PWG-1', rocq: 'RECONCILED', lean: 'RECONCILED', image: true}))); expect(withGitCheck(one, {ok: true})).toEqual(one); const capped = withGitCheck(one, {ok: false, reason: 'the source commit is not on origin/main'}); expect(capped.pwg).toBe('PWG-2ii'); @@ -154,7 +161,7 @@ test('a PWG-1 is catalogued only when the git checks of §8.5.3 hold', async () expect(withGitCheck(three, {ok: false, reason: 'x'})).toEqual(three); // deriveAll runs the check once per receipt, and with no check it catalogues no PWG-1. const dir = mkdtempSync(path.join(tmpdir(), 'registry-')); - const text = fixture({pwg: 'PWG-1', rocq: 'RECONCILED', lean: 'RECONCILED'}); + const text = fixture({pwg: 'PWG-1', rocq: 'RECONCILED', lean: 'RECONCILED', image: true}); mkdirSync(path.join(dir, `o__r@${commit}`), {recursive: true}); writeFileSync(path.join(dir, `o__r@${commit}`, 'r_praxis.deed'), text); const row = {...theorem, receipt: {path: 'r_praxis.deed', sha256: createHash('sha256').update(text).digest('hex')}}; diff --git a/verification/receipts/theory_praxis.deed b/verification/receipts/theory_praxis.deed index 5e509fc..665853a 100644 --- a/verification/receipts/theory_praxis.deed +++ b/verification/receipts/theory_praxis.deed @@ -1,6 +1,6 @@ ;; SPDX-License-Identifier: CC-BY-SA-4.0 ;; SPDX-FileCopyrightText: 2026 Jonathan D.A. Jewell (hyperpolymath) -;; The proof receipt of Mathesis (PROOF-POLICY §8.5.1, standards e5a39d7), +;; The proof receipt of Mathesis (PROOF-POLICY §8.5.1, standards 940a27af), ;; written from the records of THY-1 and APP-1 to APP-4 in ;; docs/status/PROOF-STATUS.adoc. The current receipts come from one CI run of ;; the proof lanes in the pinned Guix (Guix 8edb9da) on main 8c55804: run @@ -14,6 +14,8 @@ ;; standards scripts/proof-inputs-sha256.sh --manifest 8c55804 PATH... ;; One manifest per prover, because §8.5.1 allows one digest for one commit and ;; one prover. Earlier receipts stay as superseded receipts, each with a reason. +;; No row is PWG-1: the lanes run in the pinned Guix shell, not a container +;; image pinned by digest (§8.2, standards#1625), so the reader derives PWG-2ii. ;; The reader derives the grade, and the shared git checker does the §8.5.3 ;; checks (just receipt-check): ;; bun deed_lint.js --proof-receipt-json verification/receipts/theory_praxis.deed @@ -25,7 +27,7 @@ (praxis-deed :schema-version "1.0.0" :canonical-name "mathesis-theory-receipt" - :beholding-chora #u5"estate/chora" + :beholding-chora #u8"chora:estate/github.com/hyperpolymath" :profile proof-receipt :repository "hyperpolymath/mathesis" :source-commit "8c55804163fd15deb1e89f0630a72d4ba8588001" @@ -36,7 +38,7 @@ (primitive :prover agda :module "Agda.Primitive" :name "_⊔_" :binding "BUILTIN LEVELMAX") (primitive :prover agda :module "Agda.Builtin.Char" :name "Char" :binding "BUILTIN CHAR") (primitive :prover agda :module "Agda.Builtin.String" :name "String" :binding "BUILTIN STRING")) - (claim :id "THY-1" :pwg PWG-1 :foundation-diverse #f + (claim :id "THY-1" :pwg PWG-2ii :foundation-diverse #f (leg :prover agda :route source :token proven :state AGDA-VERIFIED (receipt :run "https://github.com/hyperpolymath/mathesis/actions/runs/44190913019/job/134419742986" :commit "8c55804163fd15deb1e89f0630a72d4ba8588001" @@ -151,7 +153,7 @@ :invocation "lean FeatureReachability.lean" :state superseded :reason "replaced by the CI receipt in the pinned Guix, Lean 4.29.0"))) - (claim :id "APP-1" :pwg PWG-1 :foundation-diverse #f + (claim :id "APP-1" :pwg PWG-2ii :foundation-diverse #f (leg :prover agda :route source :token proven :state AGDA-VERIFIED (receipt :run "https://github.com/hyperpolymath/mathesis/actions/runs/44190913019/job/134419742986" :commit "8c55804163fd15deb1e89f0630a72d4ba8588001" @@ -230,7 +232,7 @@ (file :path "verification/proofs/lean4/Cohort.lean" :sha256 "b91e2aa7b1322284d67710ea918858497bc1245a6b941448df2deba4b521ce10") (file :path "verification/proofs/lean4/FeatureReachability.lean" :sha256 "4158e54f85c8e83e49789869a4e9b12fe4b8d7460981f5c8442479268f17d55a") (file :path "verification/proofs/lean4/lean-toolchain" :sha256 "651c8accb402b0c071cd336e9d3dc0a55516b1bfb434ddc4801f14936785b1d2"))))) - (claim :id "APP-2" :pwg PWG-1 :foundation-diverse #f + (claim :id "APP-2" :pwg PWG-2ii :foundation-diverse #f (leg :prover agda :route source :token proven :state AGDA-VERIFIED (receipt :run "https://github.com/hyperpolymath/mathesis/actions/runs/44190913019/job/134419742986" :commit "8c55804163fd15deb1e89f0630a72d4ba8588001" @@ -309,7 +311,7 @@ (file :path "verification/proofs/lean4/Cohort.lean" :sha256 "b91e2aa7b1322284d67710ea918858497bc1245a6b941448df2deba4b521ce10") (file :path "verification/proofs/lean4/FeatureReachability.lean" :sha256 "4158e54f85c8e83e49789869a4e9b12fe4b8d7460981f5c8442479268f17d55a") (file :path "verification/proofs/lean4/lean-toolchain" :sha256 "651c8accb402b0c071cd336e9d3dc0a55516b1bfb434ddc4801f14936785b1d2"))))) - (claim :id "APP-3" :pwg PWG-1 :foundation-diverse #f + (claim :id "APP-3" :pwg PWG-2ii :foundation-diverse #f (leg :prover agda :route source :token proven :state AGDA-VERIFIED (receipt :run "https://github.com/hyperpolymath/mathesis/actions/runs/44190913019/job/134419742986" :commit "8c55804163fd15deb1e89f0630a72d4ba8588001" @@ -388,7 +390,7 @@ (file :path "verification/proofs/lean4/Cohort.lean" :sha256 "b91e2aa7b1322284d67710ea918858497bc1245a6b941448df2deba4b521ce10") (file :path "verification/proofs/lean4/FeatureReachability.lean" :sha256 "4158e54f85c8e83e49789869a4e9b12fe4b8d7460981f5c8442479268f17d55a") (file :path "verification/proofs/lean4/lean-toolchain" :sha256 "651c8accb402b0c071cd336e9d3dc0a55516b1bfb434ddc4801f14936785b1d2"))))) - (claim :id "APP-4" :pwg PWG-1 :foundation-diverse #f + (claim :id "APP-4" :pwg PWG-2ii :foundation-diverse #f (leg :prover agda :route source :token proven :state AGDA-VERIFIED (receipt :run "https://github.com/hyperpolymath/mathesis/actions/runs/44190913019/job/134419742986" :commit "8c55804163fd15deb1e89f0630a72d4ba8588001"