ⰕⰘⰅ ⰋⰐⰋⰕⰋⰀⰎ ⰘⰀⰔⰘ ⰋⰔ ⰕⰘⰅ ⰔⰍⰖⰀⰓⰅ ⰓⰑⰑⰕ ⰗⰓⰀⰜⰕⰋⰑⰐⰔ
NOT A NOVELTY CLAIM. This is a machine-checked formalisation, checked by the Lean 4 kernel and depending on no axiom. It is dated and citable. Prior art, where it exists, is cited below. No discovery is claimed.
Ⱈ(0) ⰋⰔ ⰕⰘⰅ ⰔⰍⰖⰀⰓⰅ-ⰓⰑⰑⰕ ⰗⰓⰀⰜⰕⰋⰑⰐⰔ ⰑⰗ ⰕⰘⰅ ⰗⰋⰓⰔⰕ ⰅⰋⰃⰘⰕ ⰒⰓⰋⰏⰅⰔ — ⰀⰎⰎ ⰅⰋⰃⰘⰕ ⰂⰑⰓⰄⰔ, ⰄⰅⰓⰋⰂⰅⰄ, ⰅⰍⰖⰀⰎ ⰕⰑ ⰕⰘⰅ ⰒⰖⰁⰎⰋⰔⰘⰅⰄ ⰕⰀⰁⰎⰅ.
Proposition
(firstPrimes 320 8).map (frac32 2) = published_HProof
By decide in roots.lean. Checked by the Lean kernel.
- Debit
the_initial_hash_is_the_square_root_fractions— this theorem- Credit
of_decide_eq_true:∀ {p : Prop} [inst : Decidable p], decide p = true → p— the kernel itself: the statement reduces to true by computation, and the rule that turns that reduction into a proof rests on no axiom
Sources and identifiers
- Lean source · src/pair/lean/proofs/roots.lean
- Typeset paper · src/research/lean-theorems.tex
- Repository deposit · doi:10.5281/zenodo.21787144
- Author · ORCID 0009-0000-7312-9778