Certificates, programs and Lean formalization for "An upper bound for the connective constant of the square lattice"
Authors/Creators
Description
Programs, the Lean formalization and two of the three files of the certificate for the paper An upper bound for the connective constant of the square lattice (doi:10.5281/zenodo.23551535). The paper proves that the connective constant μ of self-avoiding walks on the square lattice satisfies μ ≤ 5100683462145913/1917628724674902 = 2.659891039654… < 2.6598911. The proof is computer-assisted: a finite automaton that counts bridges and a vector of integer weights form a certificate, and the largest ratio of the total weight of the children of a state to the weight of the state bounds μ. The certificate has order 28 and 5,792,114,594 states. Its three compressed files take 49.7 GB, close to the size limit of a record, so this record holds the files of keys and weights, and the record doi:10.5281/zenodo.23551538 holds the file of entries (the table of children). The theorem is also proved in Lean 4, without hypotheses; there the certificate is checked by a checker written in Lean and run as compiled code. Two earlier certificates, of order 28 (μ ≤ 2.660075548826…) and of order 26 (μ ≤ 2.661472061272…), are in the previous version of this record, doi:10.5281/zenodo.23548806.
Files.
k28f.keys.xz: the 5,792,114,594 states of the certificate, as sorted 64-bit keys.k28f.v.xz: the weights, as doubles.SHA256SUMS: SHA-256 checksums of the compressed files and of the zip.connective-constant-bound-v3-c4ca99514afe.zip: the checker; a second checker, written independently, with a version of it in Python for small certificates; the generators of the negative controls (certificates that the checkers must reject); the construction program; and, in the directorylean/, the Lean proof with the programs that generate its data files from the certificate. The zip contains the files of the GitHub repository github.com/tejasvi/connective-constant-bound-v3 at commitc4ca99514afed0e4323b0b29fb10bbea752e1d4a.
Sizes and checksums.
k28f.keys.xz: 3,684,462,840 bytes, SHA-2560e320435432cb5909de4f4474ade0b68a385aa9078350f7123efc3c1431a6d7e; after decompression 46,336,916,752 bytes, SHA-256b73d1cccf9790daf2560025d804661976c27e81dea99b9444cf8fc362522309ck28f.v.xz: 27,412,437,612 bytes, SHA-256ffaf8ab83f22ae09c4dcc851127be78790fd4b802faff130b4dcbae39bbb7f35; after decompression 46,336,916,752 bytes, SHA-256e0142296de5bce853d3c4e80d1189e7647647b74462dcdd397fd2a305cdbfb94k28f.chosen.xz(in the record doi:10.5281/zenodo.23551538): 18,593,405,052 bytes, SHA-256634a82630e4bfc6d82778286411b31dcebdf1a8e7a4d3548cb772413ac646ce3; after decompression 139,010,750,256 bytes, SHA-25664c49e61c481539fd658b66b788052634863f3f2e15d6f5e56ee31934caeda3e
Checking. Decompress the three files with xz -dk (231.7 GB in all). 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 28 k28f 176; it prints the counts of the checked entries and the exact ratio (1178 seconds on 176 threads, about 301 GB of memory). The second checker, built in the same way from independent/check38a.cpp and run as ./check38a k28f 28 96 5100683462145913/1917628724674902, also compares the computed ratio with the fraction given on the command line (3680 seconds on 96 threads). The READMEs describe the certificate format, the expected output of both checkers for the three 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 certificate and needs about 1.2 TB of further disk space, and the checks were run on a machine with 128 threads and 512 GB of memory.
Files
connective-constant-bound-v3-c4ca99514afe.zip
Additional details
Related works
- Is supplement to
- Preprint: 10.5281/zenodo.23551535 (DOI)
- Requires
- Dataset: 10.5281/zenodo.23551538 (DOI)