There is a newer version of the record available.

Published October 21, 2026 | Version 2

Certificates, programs and Lean formalization for "An upper bound for the connective constant of the square lattice"

Authors/Creators

Description

Certificates, programs and the Lean formalization for the paper An upper bound for the connective constant of the square lattice (doi:10.5281/zenodo.23548805). The paper proves that the connective constant μ of self-avoiding walks on the square lattice satisfies μ ≤ 7653257817410405/2877082878637577 = 2.660075548826… < 2.6600756. 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 record also contains an earlier certificate of order 26, which gives μ ≤ 21295442098601775/8001377286078544 = 2.661472061272…. 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. The six certificate archives are the same files as in the first version of this record, with the same SHA-256 checksums.

Files.

  • k28e.keys.xz, k28e.chosen.xz, k28e.v.xz: the certificate of order 28 (4,124,965,633 states as sorted 64-bit keys; the child of each state for each of the steps +x, +y and −y, as 32-bit indices; the weights, as doubles).
  • k26f.keys.xz, k26f.chosen.xz, k26f.v.xz: the certificate of order 26 (960,470,402 states), in the same format.
  • SHA256SUMS: SHA-256 checksums of the compressed files and of the zip.
  • connective-constant-bound-v2-d06745bf370e.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 directory lean/, the Lean proof with the programs that generate its data files from the certificate. The zip is identical to the GitHub repository github.com/tejasvi/connective-constant-bound-v2 at commit d06745bf370ea0d0f6e55eccddb9cfc4cc127b5b.

Sizes and checksums.

  • k28e.keys.xz: 2,924,191,244 bytes, SHA-256 547319fe2014b6b16a3610dbca7bf090cebd77ad36f5844b4ecfb050679eab54; after decompression 32,999,725,064 bytes, SHA-256 ae2fc2a3ed12239868fb9f711ae16e7a5554792b6ed49e068b86abf461a87753
  • k28e.chosen.xz: 12,765,591,564 bytes, SHA-256 becb0bdfc86a498ef2638a5d608accb0a0a79ccea895afc9cf2d119ebdbb268f; after decompression 49,499,587,596 bytes, SHA-256 71e3e45b9f5e08dedcbfc78316eb7fbef97357c3df699aa0e4213c5603e5602d
  • k28e.v.xz: 18,694,447,344 bytes, SHA-256 644bbf779a6b65777e8665aa34196ef9cc0aa53ac9af15020d38bcfb75048a0c; after decompression 32,999,725,064 bytes, SHA-256 8062f90eb09348c27a7e11deabecd7cb4f4f8565bc743db78be8dd3063ca0069
  • k26f.keys.xz: 608,516,272 bytes, SHA-256 c0b1250c1c781734bc124dd66e6f8d70968d958678fbb6c03a42b7d1afbbcc18; after decompression 7,683,763,216 bytes, SHA-256 1fcb4b076db689a9d9a044cc0e2a920c0eb5296c68b44bd4b5a5b083984291e0
  • k26f.chosen.xz: 2,982,188,008 bytes, SHA-256 2ffac2e6e1d3cebbc693255a3b5263fd254238ecbdbb2d5395ccc8da9c36d15c; after decompression 11,525,644,824 bytes, SHA-256 3a3bbe57756025029032e012953809526e4d072398a023a38831a3d0298822e9
  • k26f.v.xz: 4,519,899,776 bytes, SHA-256 8399d8b7ec5b6621a0dc7e2be5fee5d03cea15ec5e979b5607406409d90a0be9; after decompression 7,683,763,216 bytes, SHA-256 8e89d9f25cb73384bb2c1bf41be46e93e86e4eb5578e6065f74f7233d40818ca

Checking. Decompress the files with xz -dk (115.5 GB for the certificate of order 28, 26.9 GB for the one of order 26). 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 k28e 176; it prints the counts of the checked entries and the exact ratio (846 seconds on 176 threads, about 215 GB of memory). The second checker, built in the same way from independent/check38a.cpp and run as ./check38a k28e 28 48 7653257817410405/2877082878637577, also compares the computed ratio with the fraction given on the command line (6657 seconds on 48 threads). The README describes the certificate format, the expected output of both checkers for both 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 of order 28 and needs about 1 TB of disk space and about 250 GB of memory.

Files

connective-constant-bound-v2-d06745bf370e.zip

Files (42.5 GB)

Name Size
md5:c49abe3c7fd73030787d49c56fdb5b03
223.2 kB Preview Download
md5:f7172a1ef87614f9f8a0feac1ef7e2d8
3.0 GB Download
md5:3eb900ae8b446faa708dcfdd5abb5a09
608.5 MB Download
md5:9d91f51063db133dcc9d71c44c051b41
4.5 GB Download
md5:3f4fb53f4156ae361458e35d1b0343d7
12.8 GB Download
md5:eac863bba11d5734197e6707334e7d38
2.9 GB Download
md5:7dbe8bb0bf4e1c8b509902015a71ad27
18.7 GB Download
md5:257d11abebfa4d0b3179c9adbd5d9c80
584 Bytes Download

Additional details

Related works

Is supplement to
Preprint: 10.5281/zenodo.23548805 (DOI)