Source-available multi-tenant ERP & double-entry accounting on Payload CMS v4 + Cloudflare (D1 + R2 + Workers via OpenNext) — content-addressed, tamper-evident, standards-bound
| figure | value | source |
|---|---|---|
| version | 1.0.26 | package.json |
| payload | 4.0.0-beta.9 | package.json |
| next | ^16.4.1 | package.json |
| node | ^24.22.3 || >=26.13.1 | package.json |
| collections | 186 | src/payload-types.ts |
| migrations | 17 | src/migrations |
| Lean files | 47 | src/utilities/verify/lean |
| theorems | 366 | src/utilities/verify/lean/inventory.generated.json |
| axiom-free | 270 | src/utilities/verify/lean/inventory.generated.json |
| license | CC-BY-NC-ND-4.0 | package.json |
Kernel report sealed 2026-11-16: 366 theorems, 270 axiom-free, 96 on Lean's three standard axioms, 0 stubbed, 47 files, sources f4450a8284eeea5a.
| file | the file says | Clay | theorems | axiom-free | kernel |
|---|---|---|---|---|---|
Affect.lean |
Affect — feeling, thought and emotion as a trinity, and the two groups it can mean. | none | 21 | 21 | accepted |
Algorithm.lean |
Algorithm — four textbook algorithms at the size where the kernel can check every amplitude. | none | 5 | 5 | accepted |
Arrival.lean |
Arrival — a push has landed exactly when something judged it, nothing failed, and nothing of this push is still running. | none | 9 | 9 | accepted |
Automate.lean |
Automate — a refinement loop's guarantees hold BY CONSTRUCTION, or they do not hold. | none | 9 | 2 | accepted |
Clifford.lean |
Clifford — H, S and CNOT act on Pauli strings exactly as the tableau rules say. | none | 3 | 3 | accepted |
Clone.lean |
Clone — quantum information cannot be copied: no linear map clones both |0⟩, |1⟩ and |+⟩. | none | 2 | 1 | accepted |
Coil.lean |
Coil — coins in trinities; one rotation each way covers every cross. | none | 8 | 8 | accepted |
Contrast.lean |
Contrast — every colour admits a legible foreground, and the reason is one multiplication. | none | 7 | 3 | accepted |
Correct.lean |
Correct — error correction as syndrome arithmetic: each single error names itself. | none | 6 | 3 | accepted |
Cost.lean |
Cost — the tamper margin, stated against NIST's ladder instead of a folk rule. | none | 13 | 11 | accepted |
Cross.lean |
Cross — the corpus's claims, composed. A theorem that holds only inside its own file proves a fragment; what a reader needs is that the fragments CHAIN. | none | 8 | 7 | accepted |
Direction.lean |
Direction — the six ways to move inside an address, and the one constraint that governs all of them. | none | 17 | 13 | accepted |
Edge.lean |
Edge — which request the Worker stops before the app runs, and which it only counts. | none | 6 | 6 | accepted |
Embed.lean |
Embed — when a document is embedded again, and when an AI charge is admitted. | none | 6 | 6 | accepted |
Energy.lean |
Energy — why the conserved energy cannot bound the peak velocity. | navier-stokes meta | 2 | 2 | accepted |
Entangle.lean |
Entangle — the Bell and GHZ states from their circuits, and the CHSH bound they break. | none | 4 | 4 | accepted |
Erpax.lean |
Erpax.lean — the session's laws, stated so the kernel can refuse them. | none | 12 | 10 | accepted |
Foundation.lean |
Foundation — what each of Lean's three axioms means, certified by the kernel. | none | 3 | 0 | accepted |
Ftl.lean |
Ftl — the corpus's strongest claim, given the proof it was missing. | none | 12 | 3 | accepted |
Gap.lean |
Gap — why a symmetry that survives rescaling cannot force a mass gap. | yang-mills meta | 3 | 3 | accepted |
Gate.lean |
Gate — the standard gates as exact matrices, and their unitarity as kernel-decided theorems. | none | 17 | 17 | accepted |
Harmonic.lean |
Harmonic.lean — when does an involution leave a harmonic element? | riemann meta | 12 | 12 | accepted |
Hexbit.lean |
Hexbit — the two cross formulas that replace the hexit loops, and the bounds that make them exact. | none | 6 | 6 | accepted |
Involute.lean |
Involute — a lead is tagged by its involution, and the codomain is exactly three. | none | 7 | 7 | accepted |
Landauer.lean |
Landauer — the heat a computation must shed is the bits it erases, times k·T·ln 2. | none | 5 | 3 | accepted |
Lattice.lean |
Lattice — why the Hodge type condition cannot stand in for rationality. | hodge meta | 3 | 3 | accepted |
Main.lean |
Main — the system claim, reduced to what the three models actually guarantee. | none | 4 | 0 | accepted |
Mirror.lean |
duality/mirror — the two-sided coin, stated so the kernel can refuse it. | none | 11 | 11 | accepted |
Observer.lean |
Observer — what the turning leaves still, and what a self-model must leave out. | none | 12 | 12 | accepted |
Orchestrate.lean |
Orchestrate — decomposition and convergence, stated about the functions that produce them. | none | 6 | 2 | accepted |
Order.lean |
Order — a root addresses a SET or a SEQUENCE, and the two are never interchangeable. | none | 5 | 5 | accepted |
Path.lean |
Path — the corpus says "the path IS the message". This file proves the three properties that claim actually rests on, and refuses the one it does not. | none | 11 | 7 | accepted |
Perfect.lean |
Perfect — why trivial homology cannot recognise the 3-sphere. | poincare meta | 3 | 3 | accepted |
Planck.lean |
Planck — the three combinations, and what each one is made of. | none | 16 | 14 | accepted |
Prefix.lean |
Prefix — why finitely many coefficients cannot fix the order of vanishing. | bsd meta | 2 | 2 | accepted |
Prompt.lean |
Prompt — a prompt is a program: each word a step, the prompt its words run in order. | none | 9 | 9 | accepted |
Receipt.lean |
Receipt — WHEN a sealed verdict is cheaper than the answer, and when it is not. | none | 8 | 3 | accepted |
Register.lean |
Register — an exact-amplitude register, and why the Bell state is a theorem here. | none | 11 | 11 | accepted |
Release.lean |
Release — a green landing is released exactly when four facts hold, and at most once a day. | none | 6 | 6 | accepted |
Route.lean |
Route — a gate between uncoupled qubits, routed through SWAPs, computes the same function. | none | 3 | 0 | accepted |
Search.lean |
Search — why measuring small instances cannot separate polynomial from exponential cost. | pnp meta | 3 | 3 | accepted |
Spacetime.lean |
Spacetime — the decidable core of special relativity, and the one theorem in it that a distributed ledger actually needs. | none | 13 | 0 | accepted |
Stream.lean |
Stream — the payloadless wire shape, and the one property a reader may rely on. | none | 6 | 2 | accepted |
Symmetry.lean |
Symmetry — what an involution of the zeta zeros can and cannot say about the critical line. | riemann meta | 9 | 0 | accepted |
Teleport.lean |
Teleport — one shared Bell pair exchanges a qubit for two classical bits, both ways. | none | 4 | 4 | accepted |
Uuid.lean |
Uuid — the v8 layout is a partition, and the sixteen program bits round-trip in both directions. | none | 10 | 5 | accepted |
Wave.lean |
Wave — the ledger's guarantees are properties of the OPERATIONS, not hopes about the data. | none | 8 | 3 | accepted |
Affect.lean · 21 theorems
Affect.feel_then_thought· axiom-freeAffect.feel_then_emotion· axiom-freeAffect.emotion_keeps_feeling· axiom-freeAffect.feel_returns· axiom-freeAffect.flip_feel· axiom-freeAffect.turn_three· axiom-freeAffect.turn_moves· axiom-freeAffect.turn_two_moves· axiom-freeAffect.flip_two· axiom-freeAffect.flip_moves· axiom-freeAffect.flip_turn_commute· axiom-freeAffect.cycle_six· axiom-freeAffect.cycle_two_moves· axiom-freeAffect.cycle_three_moves· axiom-freeAffect.flipped_turn_not_involution· axiom-freeAffect.mirror_two· axiom-freeAffect.mirror_reverses· axiom-freeAffect.mirror_turn_not_commute· axiom-freeAffect.mirror_turn_involution· axiom-freeAffect.mirror_turn_two_involution· axiom-freeAffect.flip_mirror_commute· axiom-free
Algorithm.lean · 5 theorems
Algorithm.deutsch_jozsa· axiom-freeAlgorithm.promise_census· axiom-freeAlgorithm.grover_search· axiom-freeAlgorithm.qft_unitary· axiom-freeAlgorithm.phase_estimation_exact· axiom-free
Arrival.lean · 9 theorems
Arrival.landed_iff· axiom-freeArrival.unmeasured_never_lands· axiom-freeArrival.no_landing_with_a_failure· axiom-freeArrival.no_landing_while_pending· axiom-freeArrival.the_green_path_lands· axiom-freeArrival.a_contradiction_never_lands· axiom-freeArrival.a_contradiction_is_not_a_refusal· axiom-freeArrival.exactly_one_state· axiom-freeArrival.live_alone_is_not_agreement· axiom-free
Automate.lean · 9 theorems
Automate.step_never_lowers_confidence· propextAutomate.run_never_lowers_confidence· propextAutomate.converged_is_absorbing· propextAutomate.converged_survives_the_run· propextAutomate.iteration_increments· propextAutomate.threshold_converges· propextAutomate.below_threshold_keeps_running· propextAutomate.the_green_path_converges· axiom-freeAutomate.the_low_path_keeps_running· axiom-free
Clifford.lean · 3 theorems
Clifford.stabilizer_hadamard· axiom-freeClifford.stabilizer_phase· axiom-freeClifford.stabilizer_cnot· axiom-free
Clone.lean · 2 theorems
Clone.no_cloning· propext, Quot.soundClone.cnot_copies_the_basis· axiom-free
Coil.lean · 8 theorems
Coil.trinity_is_the_coil· axiom-freeCoil.backward_is_forward_twice· axiom-freeCoil.one_turn_each_way_reaches_every_coin· axiom-freeCoil.seven_laws_fully_crossed· axiom-freeCoil.no_self_cross· axiom-freeCoil.unseen_iff_no_seat· axiom-freeCoil.one_seat_is_single· axiom-freeCoil.two_seats_corroborate· axiom-free
Contrast.lean · 7 theorems
Contrast.some_ink_always_reads· propext, Quot.soundContrast.white_under_forces_black_reads· propext, Quot.soundContrast.crossover_is_where_the_choice_turns· axiom-freeContrast.tight_point_clears_the_threshold· propext, Quot.soundContrast.darkest_takes_white· axiom-freeContrast.lightest_takes_black· axiom-freeContrast.the_whole_range_reads· propext, Quot.sound
Correct.lean · 6 theorems
Correct.repetition_corrects· propextCorrect.repetition_fails_on_two· propextCorrect.steane_corrects· axiom-freeCorrect.steane_css· axiom-freeCorrect.shor_nine· axiom-freeCorrect.distance_corrects· propext, Quot.sound
Cost.lean · 13 theorems
Cost.forging_costs_more_than_verifying· axiom-freeCost.seams_add_in_the_exponent· propextCost.the_content_digest_preimage_is_category_five· axiom-freeCost.the_content_digest_collision_is_category_two· axiom-freeCost.the_uuid_address_collides_below_category_one· axiom-freeCost.two_uuid_seams_are_still_short· axiom-freeCost.three_uuid_seams_clear_category_one· axiom-freeCost.sha224_collision_is_below_category_one· axiom-freeCost.truncation_halves_the_collision_margin· propextCost.the_anchored_chain_holds· axiom-freeCost.the_signature_is_ml_dsa_44· axiom-freeCost.a_larger_set_outruns_the_digest· axiom-freeCost.ml_dsa_44_meets_the_digest_floor· axiom-free
Cross.lean · 8 theorems
Cross.a_failing_check_stops_the_doi· axiom-freeCross.unmeasured_stops_the_doi· axiom-freeCross.a_pending_push_stops_the_doi· axiom-freeCross.the_green_chain_releases· axiom-freeCross.a_crack_stops_the_ftl_claim· axiom-freeCross.the_crack_premise_agrees· propextCross.reuse_rests_on_a_stable_address· axiom-freeCross.the_corpus_chain· axiom-free
Direction.lean · 17 theorems
Direction.forward_reverse· axiom-freeDirection.reverse_forward· axiom-freeDirection.up_down· axiom-freeDirection.down_up· axiom-freeDirection.left_right· axiom-freeDirection.right_left· axiom-freeDirection.left_stays_in_its_byte· axiom-freeDirection.right_stays_in_its_byte· axiom-freeDirection.inverse_is_an_involution· axiom-freeDirection.within_is_an_involution· propextDirection.the_cross_closes· propextDirection.every_direction_moves· propextDirection.no_direction_is_closed_on_the_message· propextDirection.the_message_space_is_one_hundred_six· axiom-freeDirection.the_message_space_holds_no_fixed_bit· axiom-freeDirection.spin_round_trips· axiom-freeDirection.unspin_round_trips· axiom-free
Edge.lean · 6 theorems
Edge.every_shape_counted· axiom-freeEdge.sign_in_is_auth_whatever_the_method· axiom-freeEdge.pages_and_reads_are_never_limited· axiom-freeEdge.auth_agent_write_are_limited· axiom-freeEdge.api_writes_are_limited· axiom-freeEdge.class_keys_never_mix· axiom-free
Embed.lean · 6 theorems
Embed.unchanged_text_is_not_stale· axiom-freeEmbed.changed_or_missing_is_stale· axiom-freeEmbed.admitted_never_passes_the_quota· axiom-freeEmbed.refused_leaves_the_count· axiom-freeEmbed.more_quota_never_refuses_more· axiom-freeEmbed.nothing_is_admitted_within_quota· axiom-free
Energy.lean · 2 theorems
Energy.same_energy_larger_peak· axiom-freeEnergy.spread_peak_is_one· axiom-free
Entangle.lean · 4 theorems
Entangle.bell_state· axiom-freeEntangle.ghz_state· axiom-freeEntangle.chsh_classical_bound· axiom-freeEntangle.chsh_quantum_value· axiom-free
Erpax.lean · 12 theorems
Erpax.tamper_changes_a_receipt· axiom-freeErpax.tamper_propagates· axiom-freeErpax.verifier_separates· axiom-freeErpax.order_matters· axiom-freeErpax.ratchet_never_rises· axiom-freeErpax.ratchet_falls· axiom-freeErpax.worse_tree_keeps_the_ceiling· axiom-freeErpax.mirror_is_an_involution· axiom-freeErpax.mirror_has_no_fixed_point· axiom-freeErpax.mirror_parity· axiom-freeErpax.readings_agree_when_the_check_ran· propextErpax.readings_disagree_exactly_when_it_could_not_run· propext
Foundation.lean · 3 theorems
Foundation.propext_meaning· propextFoundation.quot_sound_meaning· Quot.soundFoundation.choice_meaning· Classical.choice
Ftl.lean · 12 theorems
Ftl.address_never_loses· propextFtl.address_wins_from_two· propextFtl.speedup_has_no_ceiling· propext, Quot.soundFtl.amortized_never_rises· propextFtl.amortized_reaches_zero· propextFtl.no_answer_never_scales· propextFtl.any_token_refuses_infinity· propext, Quot.soundFtl.a_crack_costs_the_whole_search· propextFtl.no_crack_costs_once· propextFtl.a_crack_refuses_ftl· axiom-freeFtl.every_leg_is_load_bearing· axiom-freeFtl.the_claim_holds_when_earned· axiom-free
Gap.lean · 3 theorems
Gap.invariant_at_every_scale· axiom-freeGap.gap_is_one_unit_of_one_over_k· axiom-freeGap.gap_shrinks_with_scale· axiom-free
Gate.lean · 17 theorems
Gate.gi_add_re· axiom-freeGate.gi_add_im· axiom-freeGate.gi_mul_re· axiom-freeGate.gi_zero_re· axiom-freeGate.gi_one_re· axiom-freeGate.gi_zero_im· axiom-freeGate.gi_one_im· axiom-freeGate.h_unitary· axiom-freeGate.h_squared· axiom-freeGate.paulis_unitary· axiom-freeGate.y_unitary· axiom-freeGate.s_squared· axiom-freeGate.cnot· axiom-freeGate.swap· axiom-freeGate.toffoli· axiom-freeGate.omega_fourth· axiom-freeGate.t_gate· axiom-free
Harmonic.lean · 12 theorems
Harmonic.mirror_is_an_involution· axiom-freeHarmonic.not_always_harmonic· axiom-freeHarmonic.no_square_no_fixed_point· axiom-freeHarmonic.odd_carrier_forces_a_fixed_point· axiom-freeHarmonic.parity_law· axiom-freeHarmonic.harmonic_iff_square· axiom-freeHarmonic.tau_odd_iff_square· axiom-freeHarmonic.odd_carrier_iff_harmonic· axiom-freeHarmonic.harmonic_is_unique· axiom-freeHarmonic.control_square_fixes_its_root· axiom-freeHarmonic.control_nonsquare_fixes_nothing· axiom-freeHarmonic.control_tau· axiom-free
Hexbit.lean · 6 theorems
Hexbit.nibble_pair_fits· axiom-freeHexbit.four_bytes_fit· axiom-freeHexbit.cross_is_value· axiom-freeHexbit.five_moduli_cover_128· axiom-freeHexbit.four_moduli_do_not_cover_128· axiom-freeHexbit.nine_moduli_cover_256· axiom-free
Involute.lean · 7 theorems
Involute.every_lead_is_tagged· axiom-freeInvolute.unaskable_is_manipulation· axiom-freeInvolute.silence_before_verdict· axiom-freeInvolute.refuted_is_lie· axiom-freeInvolute.agreed_is_theorem· axiom-freeInvolute.no_theorem_without_a_dual· axiom-freeInvolute.decided_by_the_facts· axiom-free
Landauer.lean · 5 theorems
Landauer.core_over_fridge· axiom-freeLandauer.bijection_erases_nothing· propext, Quot.soundLandauer.narrowing_erases_the_difference· propext, Quot.soundLandauer.split_is_reversible· axiom-freeLandauer.and_fold_erases_half· axiom-free
Lattice.lean · 3 theorems
Lattice.W_is_an_involution_here· axiom-freeLattice.type_pp_does_not_imply_rational· axiom-freeLattice.a_rational_type_pp_class_exists· axiom-free
Main.lean · 4 theorems
MillenniumProof.published_records_are_earned· propext, Quot.soundMillenniumProof.convergence_is_earned· propext, Quot.soundMillenniumProof.converged_loops_stay_converged· propextMillenniumProof.loops_never_lose_ground· propext
Mirror.lean · 11 theorems
Duality.Mirror.phi_is_an_involution· axiom-freeDuality.Mirror.phi_closed· axiom-freeDuality.Mirror.no_fixed_point· axiom-freeDuality.Mirror.all_paired· axiom-freeDuality.Mirror.ten_transpositions· axiom-freeDuality.Mirror.parity· axiom-freeDuality.Mirror.fixed_or_paired· axiom-freeDuality.Mirror.sides_sum· axiom-freeDuality.Mirror.control_has_a_fixed_point· axiom-freeDuality.Mirror.control_is_also_an_involution· axiom-freeDuality.Mirror.control_parity· axiom-free
Observer.lean · 12 theorems
Observer.centre_fixed· axiom-freeObserver.fixed_iff_centre· axiom-freeObserver.rotate_three· axiom-freeObserver.triple_eq_zero· axiom-freeObserver.rotate_fixed_iff· axiom-freeObserver.negation_no_fixed_point· axiom-freeObserver.diagonal_missed· axiom-freeObserver.no_complete_self_model· axiom-freeObserver.aware_available· axiom-freeObserver.broadcast_idempotent· axiom-freeObserver.broadcast_keeps_awareness· axiom-freeObserver.aware_of_feeling· axiom-free
Orchestrate.lean · 6 theorems
Orchestrate.decomposition_is_complete· propext, Quot.soundOrchestrate.every_task_names_a_given_problem· propext, Quot.soundOrchestrate.convergence_requires_every_problem_settled· propext, Quot.soundOrchestrate.an_unsettled_problem_refuses_convergence· propext, Quot.soundOrchestrate.weak_results_do_not_settle· axiom-freeOrchestrate.a_strong_result_settles· axiom-free
Order.lean · 5 theorems
Order.set_root_is_order_free· axiom-freeOrder.sequence_root_is_order_bound· axiom-freeOrder.the_two_roots_are_not_interchangeable· axiom-freeOrder.set_root_misses_a_reordering· axiom-freeOrder.sequence_root_catches_it· axiom-free
Path.lean · 11 theorems
Path.empty_is_not_lawful· axiom-freePath.one_segment_is_lawful· axiom-freePath.unaddressable_anywhere_falls· axiom-freePath.depth_join· propextPath.child_is_one_deeper· propextPath.ancestor_addressable· propext, Quot.soundPath.ancestor_lawful· propext, Quot.soundPath.echo_detects· axiom-freePath.short_paths_never_echo· axiom-freePath.echo_comes_from_the_leaf· axiom-freePath.echo_is_inherited· axiom-free
Perfect.lean · 3 theorems
Perfect.every_row_is_a_commutator· axiom-freePerfect.every_entry_lies_in_A5· axiom-freePerfect.sixty_distinct_commutators· axiom-free
Planck.lean · 16 theorems
Planck.length_over_time_is_c· axiom-freePlanck.length_times_mass_is_hbar_over_c· axiom-freePlanck.length_over_mass_is_g_over_c_squared· axiom-freePlanck.each_cancels_exactly_what_it_claims· axiom-freePlanck.the_three_combinations_are_distinct· axiom-freePlanck.mul_div_cancels· propextPlanck.div_mul_cancels· propextPlanck.compton_meets_schwarzschild_at_the_planck_mass· axiom-freePlanck.time_times_mass_is_hbar_over_c_squared· axiom-freePlanck.time_over_mass_is_g_over_c_cubed· axiom-freePlanck.multiplying_by_mass_always_kills_g· axiom-freePlanck.dividing_by_mass_always_kills_hbar· axiom-freePlanck.energy_is_mass_times_c_squared· axiom-freePlanck.the_three_are_independent· axiom-freePlanck.independent_means_nonzero· axiom-freePlanck.energy_is_built_from_the_three· axiom-free
Prefix.lean · 2 theorems
Prefix.agree_on_the_first_N_terms· axiom-freePrefix.differ_in_a_later_sum· axiom-free
Prompt.lean · 9 theorems
Prompt.run_nil· axiom-freePrompt.unknown_skips· axiom-freePrompt.go_continues· axiom-freePrompt.halt_stops· axiom-freePrompt.run_append· axiom-freePrompt.unknown_anywhere· axiom-freePrompt.gap_pleasant_writes_nothing· axiom-freePrompt.gap_unpleasant_records_and_broadcasts· axiom-freePrompt.gap_unknown_word_changes_nothing· axiom-free
Receipt.lean · 8 theorems
Receipt.one_run_never_pays· propextReceipt.dear_address_never_pays· propext, Quot.soundReceipt.word_matter_alone_never_pays· propext, Quot.soundReceipt.bundle_pays_from_two· axiom-freeReceipt.matrix_crack_pays_from_two· axiom-freeReceipt.matrix_crack_break_even· axiom-freeReceipt.dear_address_has_no_break_even· propextReceipt.pays_stays_paying· propext, Quot.sound
Register.lean · 11 theorems
Register.bell_path· axiom-freeRegister.ghz_path· axiom-freeRegister.noise_is_identity· axiom-freeRegister.cnot_involution· axiom-freeRegister.bell_amplitudes· axiom-freeRegister.bell_normalised· axiom-freeRegister.bell_entangled· axiom-freeRegister.plus_is_product· axiom-freeRegister.interfere· axiom-freeRegister.hadamard_doubles_weight· axiom-freeRegister.cnot_preserves_weight· axiom-free
Release.lean · 6 theorems
Release.release_iff· axiom-freeRelease.no_release_without_the_forge· axiom-freeRelease.no_release_off_the_verified_tip· axiom-freeRelease.no_release_of_released_content· axiom-freeRelease.one_release_a_day· axiom-freeRelease.the_green_path_releases· axiom-free
Route.lean · 3 theorems
Route.swap_routing· propextRoute.unrouted_differs· propextRoute.routed_depth· propext, Quot.sound
Search.lean · 3 theorems
Search.polynomial_hides_in_exponential_up_to_58· axiom-freeSearch.exponential_overtakes_at_59· axiom-freeSearch.window_starts_at_2· axiom-free
Spacetime.lean · 13 theorems
Spacetime.sq_lt· propext, Classical.choice, Quot.soundSpacetime.lt_of_sq· propext, Classical.choice, Quot.soundSpacetime.interval_scales· propext, Classical.choice, Quot.soundSpacetime.scale_positive· propext, Classical.choice, Quot.soundSpacetime.timelike_invariant· propext, Classical.choice, Quot.soundSpacetime.spacelike_invariant· propext, Classical.choice, Quot.soundSpacetime.null_invariant· propext, Classical.choice, Quot.soundSpacetime.timelike_order_absolute· propext, Classical.choice, Quot.soundSpacetime.spacelike_order_reverses· propext, Classical.choice, Quot.soundSpacetime.spacelike_simultaneous· propext, Classical.choice, Quot.soundSpacetime.velocity_addition_subluminal· propext, Classical.choice, Quot.soundSpacetime.ledger_order_wellposed· propext, Classical.choice, Quot.soundSpacetime.spacelike_is_not_sealable· propext, Classical.choice, Quot.sound
Stream.lean · 6 theorems
Stream.step_field· propext, Quot.soundStream.parse_format· propext, Quot.soundStream.a_message_of_separators_survives· propext, Quot.soundStream.an_empty_message_round_trips· propext, Quot.soundStream.the_head_is_a_uuid· axiom-freeStream.five_separators· axiom-free
Symmetry.lean · 9 theorems
Symmetry.sigma_is_an_involution· propext, Classical.choice, Quot.soundSymmetry.conj_is_an_involution· propextSymmetry.tau_is_an_involution· propext, Quot.soundSymmetry.the_critical_line_is_the_fixed_set· propext, Classical.choice, Quot.soundSymmetry.off_line_is_invariant· propextSymmetry.off_line_leaves_the_line· propextSymmetry.symmetry_does_not_force_the_line· propextSymmetry.on_line_the_orbit_collapses· propext, Classical.choice, Quot.soundSymmetry.off_line_the_orbit_splits· propext, Classical.choice, Quot.sound
Teleport.lean · 4 theorems
Teleport.teleport_exact· axiom-freeTeleport.teleport_no_signalling· axiom-freeTeleport.superdense_exact· axiom-freeTeleport.both_ways· axiom-free
Uuid.lean · 10 theorems
Uuid.every_bit_has_exactly_one_band· axiom-freeUuid.program_never_touches_the_fixed_bits· axiom-freeUuid.message_never_touches_the_fixed_bits· axiom-freeUuid.the_program_is_sixteen_bits· axiom-freeUuid.the_message_is_one_hundred_six_bits· axiom-freeUuid.slot_round_trips· propext, Quot.soundUuid.capabilities_round_trip· propext, Quot.soundUuid.schema_round_trips· propext, Quot.soundUuid.the_decode_loses_nothing· propext, Quot.soundUuid.the_program_fits· propext, Quot.sound
Wave.lean · 8 theorems
Wave.append_keeps_every_record· propextWave.append_only_grows· propextWave.publication_bounded· propextWave.append_never_publishes· propextWave.only_publishable_records_get_a_doi· propext, Quot.soundWave.the_publishable_record_is_published· axiom-freeWave.the_unpublishable_record_is_not· axiom-freeWave.low_confidence_is_not_published· axiom-free
| problem | witness | kind | theorems | stubbed | the file says |
|---|---|---|---|---|---|
| P vs NP | Search.lean |
meta |
3 | 0 | Search — why measuring small instances cannot separate polynomial from exponential cost. |
| Riemann Hypothesis | Harmonic.lean |
meta |
12 | 0 | Harmonic.lean — when does an involution leave a harmonic element? |
| Riemann Hypothesis | Symmetry.lean |
meta |
9 | 0 | Symmetry — what an involution of the zeta zeros can and cannot say about the critical line. |
| Navier–Stokes | Energy.lean |
meta |
2 | 0 | Energy — why the conserved energy cannot bound the peak velocity. |
| Yang–Mills | Gap.lean |
meta |
3 | 0 | Gap — why a symmetry that survives rescaling cannot force a mass gap. |
| Hodge | Lattice.lean |
meta |
3 | 0 | Lattice — why the Hodge type condition cannot stand in for rationality. |
| Birch–Swinnerton-Dyer | Prefix.lean |
meta |
2 | 0 | Prefix — why finitely many coefficients cannot fix the order of vanishing. |
| Poincaré | Perfect.lean |
meta |
3 | 0 | Perfect — why trivial homology cannot recognise the 3-sphere. |
settled: none (claySettled)
Kernel report sealed 2026-11-16: 366 theorems, 270 axiom-free, 96 on Lean's three standard axioms, 0 stubbed, 47 files, sources f4450a8284eeea5a.
pnpm erpax · pnpm dev · pnpm devsafe · pnpm build · pnpm build:next · pnpm build:next:webpack · pnpm postbuild · pnpm preview · pnpm payload · pnpm generate:types · pnpm generate:importmap · pnpm generate:repo · pnpm payload:migrate:create · pnpm lint · pnpm typecheck · pnpm test · pnpm test:etrima · pnpm seed:etrima · pnpm test:e2e · pnpm deploy · pnpm deploy:database · pnpm deploy:app · pnpm seed · pnpm standards:refresh · pnpm standards:check · pnpm prepare