Show HN: ProofForge, AI agents whose proofs have to compile in Lean
ProofForge An AI-agent pipeline that produces machine-verified Lean 4 / Mathlib proofs. Agents decompose a problem, prove the pieces, and formalize them in Lean. The Lean kernel rechecks every step: #print axioms shows only the standard axioms, and native_decide is never used.
- ▪ProofForge An AI-agent pipeline that produces machine-verified Lean 4 / Mathlib proofs.
- ▪Agents decompose a problem, prove the pieces, and formalize them in Lean.
- ▪The Lean kernel rechecks every step: #print axioms shows only the standard axioms, and native_decide is never used.
Hacker News (AI / LLM) files mainly under ai. We currently carry 6,555 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | GitHub |
| Canonical URL | https://github.com/Sanexxxx777/ProofForge |
| Publication time | Sat, 26 Sep 2026 20:44:01 +0000 |
| Retrieval time | 2026-09-26T20:55:40.253Z |
| Last seen | 2026-09-26T20:55:40.253Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | 6E_p4cjMh5Ce · 1 stories |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
ProofForge An AI-agent pipeline that produces machine-verified Lean 4 / Mathlib proofs. Agents decompose a problem, prove the pieces, and formalize them in Lean. The Lean kernel rechecks every step: #print axioms shows only the standard axioms, and native_decide is never used. A wrong proof does not compile — so "the AI proved it" is not something you take on trust; the checker either accepts it or it doesn't. Contributions to Google DeepMind's formal-conjectures Six pull requests merged into google-deepmind/formal-conjectures: PR Problem What it contributes #4245 Erdős #1084 f₁(n) = n − 1 for unit-distance configurations on a line — the upper bound proved.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at GitHub.