Programs and Lean formalization for "An upper bound for the connective constant of the square lattice"
Authors/Creators
Description
Programs and the Lean formalization for the paper An upper bound for the connective constant of the square lattice (doi:10.5281/zenodo.23715896). The paper proves that the connective constant μ of self-avoiding walks on the square lattice satisfies μ ≤ 105432502045487/39656386815908 = 2.658651241600… < 2.6586513. The proof is computer-assisted: a finite automaton that counts bridges and a vector of integer weights form a certificate, and μ is at most the largest ratio of the total weight of the children of a state to the weight of the state. The certificate has order 30 and 24,887,440,008 states. Its three files were compressed with xz: the file of keys as a whole, the file of entries in four pieces and the file of weights in five. The ten compressed files, which take 210.4 GB, are archived in five records: doi:10.5281/zenodo.23574056, doi:10.5281/zenodo.23574058, doi:10.5281/zenodo.23574060, doi:10.5281/zenodo.23574062 and doi:10.5281/zenodo.23574064. The bound is also proved twice in Lean 4, without hypotheses. In the first Lean proof, the certificate is checked by a program written in Lean and run as compiled code; the second relies on Lean’s kernel instead of code generated by Lean’s compiler. Three other certificates, with larger ratios, are archived in earlier records: one of order 28 in doi:10.5281/zenodo.23551536 and doi:10.5281/zenodo.23551538, and one each of orders 28 and 26 in doi:10.5281/zenodo.23548806.
Files.
connective-constant-bound-9a451bfefdf4.zip: the checker; a second, independently written checker, with a Python version for small certificates; the generators of the negative controls (certificates that the checkers must reject); two versions of the construction program, the one that built the certificate of order 30 and the earlier one that built the other certificates; in the directorylean/, the Lean proof with the programs that generate its data files from the certificate; in the directorylean_k30e/, the second Lean proof with the programs that generate its data, hints and modules; and, in the directorypaper/, the LaTeX source of the paper. The zip contains the files of the GitHub repository github.com/tejasvi/connective-constant-bound/tree/v8 (commit9a451bfefdf405ff3dcaefdfbd98262ce3ae540e).SHARDS_B25000.tsv: the list of the units of the second Lean proof, with the first state, the number of states and the data modules of each.K30E_UNIT_OLEAN_SHA256SUMS.txt.xz: the SHA-256 checksums of the three compiled files of every unit.K30E_PARTS_ROOT.tarandK30E_DATA_PUBLICS.tar: the compiled public files of the part modules, the root and the data modules; with them and the sources, the root can be loaded and its statement and axioms checked without rebuilding the data modules or the units.SHA256SUMS: the SHA-256 checksums of the zip and of these four files.
Checking. Download the pieces from the five records, join and decompress them as the README describes (995.5 GB in all), and check the SHA-256 checksums of the three files. The checker needs a C++ compiler with OpenMP and 128-bit integers: compile it with g++ -O2 -march=native -fopenmp -o check_saw checker/check_saw.cpp and run ./check_saw 30 k30e 128; it prints the counts of the checked entries and the exact ratio (5455 seconds on 128 threads, about 1.3 TB of memory). The second checker is built in the same way from independent/check38a.cpp and run as ./check38a k30e 30 128 105432502045487/39656386815908; it also compares the computed ratio with the fraction given on the command line (16,480 seconds on 128 threads). The READMEs describe the certificate format, the expected output of both checkers for the four certificates, the negative controls and how the certificates were built. The Lean proof (Lean v4.35.0-rc3, Mathlib commit c55e6e786f49) is built as described in lean/README.md. The build reads the decompressed files of the certificate and needs about 5.6 TB of further disk space; the Lean checks were run on a machine with 128 threads and about 2 TB of memory. The second Lean proof is built from the same decompressed files as described in lean_k30e/README.md; building and checking its units took about 213,000 hours of single-threaded processes.
Files
connective-constant-bound-9a451bfefdf4.zip
Files
(459.9 MB)
| Name | Size | |
|---|---|---|
|
md5:6495b30e9f72ec02326ad9994fedce01
|
7.2 MB | Preview Download |
|
md5:4a987503dfcf483ffbe021cb7d665bba
|
90.6 MB | Download |
|
md5:24e986fb36fed6d67a8072e9a28ec475
|
129.0 MB | Download |
|
md5:2e09f8ecc73bcbd4b0cc537e2fc3b802
|
103.7 MB | Download |
|
md5:a1ff9de8afc4141bfe21c13a43b51a24
|
467 Bytes | Download |
|
md5:1fa94527fae8b9a3153dc22a04c2609f
|
129.4 MB | Download |