A proof of the Reinhardt conjecture

The smoothed octagon is the worst packing centrally symmetric convex disc: among all centrally symmetric convex discs in the plane it has the smallest maximal packing density, δ_oct = (8 − 4√2 − ln 2)/(2√2 − 1) ≈ 0.902414, and up to affine maps it is the only disc with this density. This was conjectured by Reinhardt in 1934. We give a computer-assisted proof. This record contains the paper and the complete certificate of the computer-assisted part. Files:- Schmutz_A_proof_of_the_Reinhardt_conjecture.pdf — the paper.- certificates_final_run_a66fe26f.tar.gz — the final verdict s_urteil.json (SHA-256 a66fe26fa63542d3a183b71bec8a66d203b91066de861686a048ecd8fa7ee3e1), all 6 243 files it binds by hash, the registers at the time of the final run, and the hash lists.- certificates_chart_N_A3.tar.gz — the certificates of the 42 root cells of chart N and the outputs of their checker.- supplementary_runs.tar.gz — further runs and certificate data used by the proof texts.- project_records.tar.gz — approval register, freeze log, checker register and internal reviews.- SHA256SUMS.txt — SHA-256 of all files of this record. Source, proof texts, checkers and the quick check: https://github.com/lucasterix/reinhardt-conjecture

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24268921
Primary Topic
Optimization and Packing Problems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A proof of the Reinhardt conjecture

Schmutz Lucas
Zenodo (CERN European Organization for Nuclear Research)
Optimization and Packing Problems
preprint

A proof of the Reinhardt conjecture

Schmutz Lucas
preprint en

Abstract

The smoothed octagon is the worst packing centrally symmetric convex disc: among all centrally symmetric convex discs in the plane it has the smallest maximal packing density, δ_oct = (8 − 4√2 − ln 2)/(2√2 − 1) ≈ 0.902414, and up to affine maps it is the only disc with this density. This was conjectured by Reinhardt in 1934. We give a computer-assisted proof. This record contains the paper and the complete certificate of the computer-assisted part. Files:- Schmutz_A_proof_of_the_Reinhardt_conjecture.pdf — the paper.- certificates_final_run_a66fe26f.tar.gz — the final verdict s_urteil.json (SHA-256 a66fe26fa63542d3a183b71bec8a66d203b91066de861686a048ecd8fa7ee3e1), all 6 243 files it binds by hash, the registers at the time of the final run, and the hash lists.- certificates_chart_N_A3.tar.gz — the certificates of the 42 root cells of chart N and the outputs of their checker.- supplementary_runs.tar.gz — further runs and certificate data used by the proof texts.- project_records.tar.gz — approval register, freeze log, checker register and internal reviews.- SHA256SUMS.txt — SHA-256 of all files of this record. Source, proof texts, checkers and the quick check: https://github.com/lucasterix/reinhardt-conjecture

Zenodo (CERN European Organization for Nuclear Research)
Optimization and Packing Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon