Certificate of order 30, part 2 of 5, for "An upper bound for the connective constant of the square lattice"
Authors/Creators
Description
Part 2 of 5 of the certificate of order 30 for the paper An upper bound for the connective constant of the square lattice (doi:10.5281/zenodo.23574053). The paper proves that the connective constant μ of self-avoiding walks on the square lattice satisfies μ ≤ 105432502045487/39656386815908 = 2.658651241600… < 2.6586513. The certificate consists of three files, 995.5 GB in all: the keys of its 24,887,440,008 states, the entries (the table of children) and the weights. They 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 spread over 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 programs, the README and the Lean formalization are in the record doi:10.5281/zenodo.23574054; the README in its zip file describes the format of the files, how to join the pieces and how to check the certificate.
Files.
k30e.chosen.part2.xz: piece 2 of 4 of the file of entriesk30e.chosen, compressed (bytes 149,324,660,736 to 298,649,321,471 of the uncompressed file); 22,599,715,512 bytes, SHA-2566c2614f44979dcd94a8ce67549ceb36d87fdfab7f6b38f68f5d2d54665c7de3e.k30e.chosen.part3.xz: piece 3 of 4 of the file of entriesk30e.chosen, compressed (bytes 298,649,321,472 to 447,973,982,207 of the uncompressed file); 21,064,849,444 bytes, SHA-2560f4c722498bd8bd3eb27775aaa7edfcb78a200cf1b4d8c5b178f03f2b0ea7015.SHA256SUMS: the SHA-256 checksums of the files of this record.
Files
Additional details
Related works
- Is required by
- Dataset: 10.5281/zenodo.23574054 (DOI)
- Is supplement to
- Preprint: 10.5281/zenodo.23574053 (DOI)