{"schema":"VERIFIED_THEOREMS_ECR_FIELD_v1.2","sources":[{"id":"selfproofs-draft","filename":"SelfProofs.lean","size_bytes":6495,"lines_of_lean":115,"download_url":"/static/evidence/sources/SelfProofs.lean","canonical":false,"theorems_proved":["corpus_monotone","corpus_nondecreasing","extension_invariant","no_replacement_law","sorry_frontier_finite","sorry_elimination_condition"],"honest_classification":"FORMAL_MODEL_COMPONENT","honest_note":"Earliest iteration. Contains one proof whose author-comment acknowledges the obligation is not fully discharged ('In a full formalization, this would be enforced by a dependent type'). Preserved as revision history. Superseded by SelfProofs_S231_a20e8cfe.lean.","disposition":"source-attested","what_this_proves":"Structural invariants over record types for the author's corpus-tracking and landing-tracking records.","what_this_does_not_prove":"That any real-world event has these properties. The theorems are about the records themselves, not about external systems."},{"id":"selfproofs-s231-3c","filename":"SelfProofs_S231_3c9494e8.lean","size_bytes":5991,"lines_of_lean":105,"download_url":"/static/evidence/sources/SelfProofs_S231_3c9494e8.lean","canonical":false,"supersedes":"selfproofs-draft","theorems_proved":["corpus_monotone","corpus_nondecreasing","extension_invariant","no_replacement_law","sorry_frontier_finite","sorry_frontier_named"],"honest_classification":"FORMAL_MODEL_COMPONENT","honest_note":"Cleaner iteration. The extension_invariant signature is strengthened to require both the kind hypothesis AND the replacement hypothesis — making the proof structurally honest at the cost of becoming conjunctive. Superseded by SelfProofs_S231_a20e8cfe.lean.","disposition":"source-attested","what_this_proves":"Same scope as draft, with cleaner tactics and honest theorem signatures.","what_this_does_not_prove":"Same limits as draft."},{"id":"selfproofs-s231-a2","filename":"SelfProofs_S231_a20e8cfe.lean","size_bytes":8422,"lines_of_lean":155,"download_url":"/static/evidence/sources/SelfProofs_S231_a20e8cfe.lean","canonical":true,"supersedes":"selfproofs-s231-3c","theorems_proved":["corpus_monotone","corpus_nondecreasing","extension_invariant","no_replacement_law","sorry_frontier_finite","sorry_frontier_named","delta_guard_safety","delta_guard_strict","deposit_faithfulness","deposit_faithfulness_eq"],"honest_classification":"FORMAL_MODEL_COMPONENT","honest_note":"Canonical version. Adds the Behavioral namespace with delta_guard and deposit_faithfulness theorems. The sorry_frontier_S231 list enumerates named gaps (including P≠NP, Hodge, Navier-Stokes, Riemann, BSD) as unsolved problems with stated elimination conditions. Appearance on that list is NOT a claim of solution — it is a claim of named gap. No Clay or Millennium Problem is asserted proven on this surface or elsewhere by NODE-23.","disposition":"source-attested","what_this_proves":"Structural invariants + behavioral invariants (delta-guard, deposit faithfulness) for the author's corpus and edit records.","what_this_does_not_prove":"That any Clay/Millennium problem is solved. That any live system satisfies these properties on real inputs. That the enumerated gap set is complete beyond the 5 explicit entries + the author's declaration of 283 further gaps in a referenced registry (not published here)."},{"id":"chaos-compounding","filename":"ChaosCompounding__VERIFIED.lean","size_bytes":2661,"lines_of_lean":60,"download_url":"/static/evidence/sources/ChaosCompounding__VERIFIED.lean","canonical":true,"theorems_proved":["chaos_compounding"],"honest_classification":"DEFINITIONAL_WITNESS","honest_note":"The theorem is a definitional witness: compounding_loop_witnessed is defined as causal_predecessor, so the theorem states 'A implies A' under renaming. The source file itself opens with 'NOT from the Riemann Hypothesis. NOT from Clay problems.' Published here as a demonstration of the receipt pipeline on an unambiguous case — not as a substantive claim about chaos, compounding or causality.","disposition":"sandbox-reproduced","receipt_id":"PHI13_8d36a77eb708d9a255c8a4b3","what_this_proves":"That the author's receipt pipeline produces a well-formed kernel-verified attestation for a transparent tautology. NODE-23 sandbox independently reproduced the compilation: 0.507s, rc=0, no axioms used (direct #print axioms check).","what_this_does_not_prove":"Any substantive claim about chaos, compounding, causality or civilisations. The theorem is definitionally tautological. The receipt pipeline is what is being demonstrated, not an external result."}],"receipts":[{"theorem_id":"PHI13_8d36a77eb708d9a255c8a4b3","phihash":"PHI13_df069f19b5e80d0246b9a641","class":"CHAOS-COMPOUNDING","file":"ChaosCompounding__VERIFIED.lean","problem_identity":"CHAOS_COMPOUNDING","theorem_name":"ChaosCompounding__VERIFIED","statement":"chaos_compounding : ∀ (d1 d2 : Direction), causal_predecessor d1 d2 → compounding_loop_witnessed d1 d2 — note: compounding_loop_witnessed is definitionally equal to causal_predecessor; the theorem is a definitional witness","environment":{"lean_version":"Lean 4.30.0-rc2","mathlib_commit":"5450b53e5ddc75d46418fabb605edbf36bd0beb6","lake_project":"D:/KQAS_NATIVE/chaos_proofs"},"kernel_verdict":"ELABORATED_CLOSED","kernel_elapsed_s":0.69,"axiom_dependencies":"propext, Classical.choice, Quot.sound (standard-three only)","ecr_gate":{"ECR-1":"PASS","ECR-2":"PASS","ECR-3":"PASS","ECR-4":"PASS"},"honest_classification":"FORMAL_MODEL_COMPONENT","honest_note":"Definitional witness: compounding_loop_witnessed is defined as causal_predecessor; the theorem states the hypothesis implies the conclusion by definitional unfolding. Demonstrates the receipt pipeline on an unambiguous case; does not substantively assert properties of chaos, compounding, causality or any civilisation.","compounding":{"C1_kg_registration":"PENDING","C2_problem_attachment":"PENDING","C3_cross_domain_reuse":"PENDING","C4_frontier_boundary":"PENDING","C5_capability_backing":"PENDING"},"verified_utc":"2026-09-14T05:17:51Z","schema":"VERIFIED_THEOREMS_ECR_FIELD_v1.2","authority":"chaos-prime-v18.45.0","env":"ENV_CANONICAL_USED | pin=PHI13_62a066f692c33c0637ef2824","lean_version":"leanprover/lean4:v4.30.0-rc2","mathlib_rev":"5450b53e5ddc75d46418fabb605edbf36bd0beb6","node23_disposition":"sandbox-reproduced","node23_sandbox_axiom_profile":"'chaos_compounding' does not depend on any axioms (direct check via #print axioms; stronger than the receipt's conservative upper bound)","node23_sandbox_elapsed_s":0.507}],"attribution":"These theorems are the kernel-verified formal substrate underlying the Geometry Intelligence Foundational Series. Each is checked by Lean 4 against mathlib using only the three standard axioms (propext, Classical.choice, Quot.sound). Verification uses the same toolchain used globally for formal mathematics and physics. Sources, pinned environment and receipts are published for independent reproduction. Author: Tim Jacobs (ORCID 0009-0002-8896-4849). Published across: NODE-18 (geometricintelligence.ai), NODE-19 (geometry-of-intelligence.com), NODE-21 (geometry-intelligence.com), NODE-10 (tim-jacobs.net), NODE-20 (evidence-economy.com), NODE-23 (morphogenic.systems). Archived at NODE-6 (kts-global-evidence-locker)."}