mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-07-31 03:05:21 +00:00
40d8ed3d54
1. Singer Sidon Sets in Lean 4 (2605.03274) — 7541 lines, zero sorry 2. AutoformBot: 45K Lean declarations from 26 textbooks (2605.29955) 3. Rust-to-Lean verification pipeline (2605.30106) 4. Hexagonal lattice + RG + fractal dimension (2605.09974) 5. Burgers + Hopf-Cole unified transform (2605.11788) 6. Self-orthogonal Reed-Solomon → quantum ECC (2605.23460) 7. Hash-based GPU 3D reconstruction (2511.21459) 8. Conjugacy classes of positive 3-braids (2604.16876) 9. Navier-Stokes non-uniqueness (2605.29934) 10. Continuum limit of causal fermion systems (2605.30199) Most relevant to Research Stack: - #1: Direct Sidon set infrastructure for Lean - #4: RG + fractal dimension exact results - #5: Hopf-Cole Burgers (confirms our approach) - #6: RS codes → quantum ECC (VCN pipeline connection)
13 lines
1.5 KiB
JSON
13 lines
1.5 KiB
JSON
{
|
|
"arxiv_id": "2605.30106",
|
|
"title": "A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report",
|
|
"authors": ["Klaus, Natalia", "Tolmach, Palina", "Conejero, Juan"],
|
|
"abstract": "We describe a verification pipeline that takes production Rust cryptographic code and produces machine-checked correctness proofs in Lean 4. The pipeline combines three components: symbolic extraction tools (Charon and Aeneas, or Hax) that lift Rust into Lean 4; formal cryptographic specification libraries (ArkLib and CompPoly, from the Verified zkEVM project) that provide the mathematical targets; and AI provers (Aristotle from Harmonic AI and Aleph from Logical Intelligence) that close the resulting proof obligations. Every proof is checked by the Lean kernel, so AI output cannot compromise soundness. Within the scope of the Ethereum Foundation's zkEVM Verification Project, we applied the pipeline to cryptographic primitives in Plonky3 (FRI folding, Mersenne31 and KoalaBear field arithmetic, Horner polynomial evaluation) and RISC Zero (Merkle inclusion verification). In addition, Aleph authored proofs of two bounds-style theorems in Plonky3's compute_log_arity_for_round that previously stood as sorry.",
|
|
"url": "https://arxiv.org/abs/2605.30106",
|
|
"pdf_url": "https://arxiv.org/pdf/2605.30106",
|
|
"pdf_file": "2605.30106.pdf",
|
|
"pdf_size": "661K",
|
|
"date": "2026-05-30",
|
|
"topics": ["Rust", "Lean 4", "formal verification", "AI provers", "zkEVM", "cryptographic verification"],
|
|
"fetched_at": "2026-05-30"
|
|
}
|