Problem packetResearch packetR418
Exact 64-state row-transfer certificate
Link to a section
Executable material is recorded. Successful replay is a separate check.
Recorded status: available
Recorded scope: all 64 row states and all cyclic products of six row transfers for the 6 by 6 torus, including exact magnetization and one-site conditional-variance sums
Complete recorded scope and conditions
{
"kind": "bounded",
"statement": "all 64 row states and all cyclic products of six row transfers for the 6 by 6 torus, including exact magnetization and one-site conditional-variance sums",
"bounds": {
"side_length": {
"min": 6,
"max": 6
},
"row_states": {
"min": 64,
"max": 64
},
"transfer_entries": {
"min": 4096,
"max": 4096
},
"full_states_summed_implicitly": {
"min": 68719476736,
"max": 68719476736
}
},
"exhaustive": true
}Originating problem: Exact heat-bath spectral gap on the six by six Ising torus
Recorded relationships: A certified rational interval for the six-torus heat-bath gap
Authored record and scope
- Authored title
- Exact 64-state row-transfer certificate
- Record type
- artifact
- Stored status
- available
- Evidence grade
- executable
- Recorded scope data
- { "kind": "bounded", "statement": "all 64 row states and all cyclic products of six row transfers for the 6 by 6 torus, including exact magnetization and one-site conditional-variance sums", "bounds": { "side_length": { "min": 6, "max": 6 }, "row_states": { "min": 64, "max": 64 }, "transfer_entries": { "min": 4096, "max": 4096 }, "full_states_summed_implicitly": { "min": 68719476736, "max": 68719476736 } }, "exhaustive": true }
- Linked research record IDs
- R420
2Authored explanation
For a configuration \(\sigma\), its Gibbs weight differs by a constant factor from \(2^{a(\sigma)}\), where \(a(\sigma)\) counts agreeing edges. Encode each row by a six-bit integer. The integer transfer matrix is \[ T_{rs}=2^{h(s)+v(r,s)}, \] where \(h(s)\) counts horizontal agreements in row \(s\), and \(v(r,s)\) counts vertical agreements. Thus \(\operatorname{tr}(T^6)\) contracts all \(2^{36}\) configurations. Its value is \[ 674103569746667088362626. \]
The magnetization second moment is obtained from the six cyclic row separations. The one-site conditional variance depends on the four-neighbor field magnitude. Its three values are \(1\), \(16/25\), and \(64/289\). A three-row insertion followed by \(T^4\) gives its exact weighted sum. The quotient is the Ritz value of \(I-P\) on the span of total magnetization, so it bounds the full gap above without assuming that the leading odd mode is magnetization.
Entries are serialized row-major. Each nonnegative integer is written as a four-byte big-endian length followed by its shortest big-endian byte string. The transfer hash is `c9bdfa7af6e49df8c031fbe5def55787bff5beaf45aa1b3775f6f7f3b1f07897`; the \(T^6\) hash is `61ed667ffcb10c3467853248b81cd65acb909f6b8035d9672e1662ceb28ac732`.
Files and source
Files embedded in this record. Matching a file hash confirms its identity.
- R418.txt4,772 bytes · No SHA-256 recorded
Preview R418.txt
from fractions import Fraction from hashlib import sha256 from struct import pack SIDE = 6 STATES = list(range(1 << SIDE)) FULL = (1 << SIDE) - 1 def popcount(value): return value.bit_count() def row_magnetization(row): return 2 * popcount(row) - SIDE def horizontal_agreements(row): shifted = ((row << 1) & FULL) | (row >> (SIDE - 1)) return SIDE - popcount(row ^ shifted) def vertical_agreements(upper, lower): return SIDE - popcount(upper ^ lower) def matmul(left, right): size = len(left) out = [[0] * size for _ in range(size)] for i in range(size): target = out[i] for k, value in enumerate(left[i]): if value: source = right[k] for j in range(size): target[j] += value * source[j] return out def matrix_hash(matrix): digest = sha256() for row in matrix: for value in row: raw = value.to_bytes(max(1, (value.bit_length() + 7) // 8), "big") digest.update(pack(">I", len(raw))) digest.update(raw) return digest.hexdigest() def spin(row, column): return 1 if (row >> column) & 1 else -1 horizontal = [horizontal_agreements(row) for row in STATES] magnetization = [row_magnetization(row) for row in STATES] transition = [ [ 1 << (horizontal[lower] + vertical_agreements(upper, lower)) for lower in STATES ] for upper in STATES ] identity = [[int(i == j) for j in STATES] for i in STATES] powers = [identity, transition] for exponent in range(2, SIDE + 1): powers.append(matmul(powers[-1], transition)) partition = sum(powers[SIDE][row][row] for row in STATES) magnetization_second_numerator = 0 correlation_numerators = [] for separation in range(SIDE): subtotal = 0 left = powers[separation] right = powers[SIDE - separation] for upper in STATES: for lower in STATES: subtotal += ( magnetization[upper] * left[upper][lower] * magnetization[lower] * right[lower][upper] ) correlation_numerators.append(subtotal) magnetization_second_numerator += SIDE * subtotal variance_scale = 25 * 17 * 17 conditional_variance_scaled = {0: variance_scale, 2: 16 * 17 * 17, 4: 64 * 25} conditional_variance_numerator_scaled = 0 power_four = powers[4] for above in STATES: for middle in STATES: first_two = transition[above][middle] local_horizontal = spin(middle, SIDE - 1) + spin(middle, 1) for below in STATES: field = abs( spin(above, 0) + spin(below, 0) + local_horizontal ) conditional_variance_numerator_scaled += ( first_two * transition[middle][below] * power_four[below][above] * conditional_variance_scaled[field] ) gap_upper = Fraction( conditional_variance_numerator_scaled, variance_scale * magnetization_second_numerator, ) gap_lower = Fraction(1, SIDE * SIDE * (1 << 72)) assert partition > 0 assert magnetization_second_numerator > 0 assert sum(correlation_numerators) * SIDE == magnetization_second_numerator assert gap_lower < gap_upper assert all( transition[upper][lower] == (1 << (horizontal[lower] + vertical_agreements(upper, lower))) for upper in STATES for lower in STATES ) assert partition == 674103569746667088362626 assert magnetization_second_numerator == 273793464546853425980576256 assert ( conditional_variance_numerator_scaled == 2625635969958730549421161600 ) assert gap_lower == Fraction(1, 170005193383307227693056) assert gap_upper == Fraction( 48265367094829605687889, 36363194510128970638045284, ) assert matrix_hash(transition) == ( "c9bdfa7af6e49df8c031fbe5def55787bff5beaf45aa1b3775f6f7f3b1f07897" ) assert matrix_hash(powers[6]) == ( "61ed667ffcb10c3467853248b81cd65acb909f6b8035d9672e1662ceb28ac732" ) upper_num = gap_upper.numerator upper_den = gap_upper.denominator print(f"side={SIDE} states={1 << (SIDE * SIDE)} row_states={len(STATES)}") print(f"partition={partition}") print(f"magnetization_second_numerator={magnetization_second_numerator}") print("row_correlation_numerators=" + ",".join(map(str, correlation_numerators))) print(f"conditional_variance_scale={variance_scale}") print( "conditional_variance_numerator_scaled=" + str(conditional_variance_numerator_scaled) ) print(f"gap_lower={gap_lower.numerator}/{gap_lower.denominator}") print(f"gap_upper={upper_num}/{upper_den}") print(f"gap_upper_decimal={float(gap_upper):.18g}") print(f"transition_sha256={matrix_hash(transition)}") print(f"power6_sha256={matrix_hash(powers[6])}")File identity
- Recorded filename
- R418.txt
- Download SHA-256
- 403e9f759b064e0001ee90807255fc75c9fda27d685c1d233496f98780f665c2
Continue this work
Replay material: partial
4Reproduce
Part of the replay path is recorded. Check the missing fields before comparing a new run.
Verification source: doi.org ↗, Inline Python 3 exact computation executed on 2026-07-25
Expected output
side=6 states=68719476736 row_states=64
partition=674103569746667088362626
magnetization_second_numerator=273793464546853425980576256
row_correlation_numerators=11447822091271724089449216,8014885290395977281684480,6235486745769926821785600,5683677927538705367040000,6235486745769926821785600,8014885290395977281684480
conditional_variance_scale=7225
conditional_variance_numerator_scaled=2625635969958730549421161600
gap_lower=1/170005193383307227693056
gap_upper=48265367094829605687889/36363194510128970638045284
gap_upper_decimal=0.00132731372325897517
transition_sha256=c9bdfa7af6e49df8c031fbe5def55787bff5beaf45aa1b3775f6f7f3b1f07897
power6_sha256=61ed667ffcb10c3467853248b81cd65acb909f6b8035d9672e1662ceb28ac732
Missing for a complete replay: command.
Recorded artifact fields
5What it produced
Certificate
Magnetization variance
Mean conditional variance
6How it connects
Supports
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R418",
"content_hash": null,
"slug": "ising6-artifact-row-transfer-rayleigh",
"type": "artifact",
"title": "Exact 64-state row-transfer certificate",
"summary": "A standard-library Python program contracts the torus exactly, computes the one-dimensional projected eigenvalue, and checks fixed matrix hashes.",
"relevance": "For Exact heat-bath spectral gap on the six by six Ising torus, record ising6-artifact-row-transfer-rayleigh (“Exact 64-state row-transfer certificate”) supplies evidence or a replay used to check the packet. The record states: A standard-library Python program contracts the torus exactly, computes the one-dimensional projected eigenvalue, and checks fixed matrix hashes.",
"relevance_source": "recorded",
"body": "For a configuration \\(\\sigma\\), its Gibbs weight differs by a constant factor from \\(2^{a(\\sigma)}\\), where \\(a(\\sigma)\\) counts agreeing edges. Encode each row by a six-bit integer. The integer transfer matrix is\n\\[\nT_{rs}=2^{h(s)+v(r,s)},\n\\]\nwhere \\(h(s)\\) counts horizontal agreements in row \\(s\\), and \\(v(r,s)\\) counts vertical agreements. Thus \\(\\operatorname{tr}(T^6)\\) contracts all \\(2^{36}\\) configurations. Its value is\n\\[\n674103569746667088362626.\n\\]\n\nThe magnetization second moment is obtained from the six cyclic row separations. The one-site conditional variance depends on the four-neighbor field magnitude. Its three values are \\(1\\), \\(16/25\\), and \\(64/289\\). A three-row insertion followed by \\(T^4\\) gives its exact weighted sum. The quotient is the Ritz value of \\(I-P\\) on the span of total magnetization, so it bounds the full gap above without assuming that the leading odd mode is magnetization.\n\nEntries are serialized row-major. Each nonnegative integer is written as a four-byte big-endian length followed by its shortest big-endian byte string. The transfer hash is `c9bdfa7af6e49df8c031fbe5def55787bff5beaf45aa1b3775f6f7f3b1f07897`; the \\(T^6\\) hash is `61ed667ffcb10c3467853248b81cd65acb909f6b8035d9672e1662ceb28ac732`.",
"status": "available",
"evidence_grade": "executable",
"scope": {
"kind": "bounded",
"statement": "all 64 row states and all cyclic products of six row transfers for the 6 by 6 torus, including exact magnetization and one-site conditional-variance sums",
"bounds": {
"side_length": {
"min": 6,
"max": 6
},
"row_states": {
"min": 64,
"max": 64
},
"transfer_entries": {
"min": 4096,
"max": 4096
},
"full_states_summed_implicitly": {
"min": 68719476736,
"max": 68719476736
}
},
"exhaustive": true
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "partial",
"kind": "inline_python_exact_transfer",
"entrypoint": "Join source_lines with newline characters, save as check.py, and run python3 check.py",
"runtime": "CPython 3.8 or later, standard library only",
"citation": {
"url": "https://doi.org/10.1007/s00222-012-0404-5",
"locator": "Inline Python 3 exact computation executed on 2026-07-25"
},
"outputs": "side=6 states=68719476736 row_states=64\npartition=674103569746667088362626\nmagnetization_second_numerator=273793464546853425980576256\nrow_correlation_numerators=11447822091271724089449216,8014885290395977281684480,6235486745769926821785600,5683677927538705367040000,6235486745769926821785600,8014885290395977281684480\nconditional_variance_scale=7225\nconditional_variance_numerator_scaled=2625635969958730549421161600\ngap_lower=1/170005193383307227693056\ngap_upper=48265367094829605687889/36363194510128970638045284\ngap_upper_decimal=0.00132731372325897517\ntransition_sha256=c9bdfa7af6e49df8c031fbe5def55787bff5beaf45aa1b3775f6f7f3b1f07897\npower6_sha256=61ed667ffcb10c3467853248b81cd65acb909f6b8035d9672e1662ceb28ac732\n",
"inline_source": [
"from fractions import Fraction",
"from hashlib import sha256",
"from struct import pack",
"",
"",
"SIDE = 6",
"STATES = list(range(1 << SIDE))",
"FULL = (1 << SIDE) - 1",
"",
"",
"def popcount(value):",
" return value.bit_count()",
"",
"",
"def row_magnetization(row):",
" return 2 * popcount(row) - SIDE",
"",
"",
"def horizontal_agreements(row):",
" shifted = ((row << 1) & FULL) | (row >> (SIDE - 1))",
" return SIDE - popcount(row ^ shifted)",
"",
"",
"def vertical_agreements(upper, lower):",
" return SIDE - popcount(upper ^ lower)",
"",
"",
"def matmul(left, right):",
" size = len(left)",
" out = [[0] * size for _ in range(size)]",
" for i in range(size):",
" target = out[i]",
" for k, value in enumerate(left[i]):",
" if value:",
" source = right[k]",
" for j in range(size):",
" target[j] += value * source[j]",
" return out",
"",
"",
"def matrix_hash(matrix):",
" digest = sha256()",
" for row in matrix:",
" for value in row:",
" raw = value.to_bytes(max(1, (value.bit_length() + 7) // 8), \"big\")",
" digest.update(pack(\">I\", len(raw)))",
" digest.update(raw)",
" return digest.hexdigest()",
"",
"",
"def spin(row, column):",
" return 1 if (row >> column) & 1 else -1",
"",
"",
"horizontal = [horizontal_agreements(row) for row in STATES]",
"magnetization = [row_magnetization(row) for row in STATES]",
"transition = [",
" [",
" 1 << (horizontal[lower] + vertical_agreements(upper, lower))",
" for lower in STATES",
" ]",
" for upper in STATES",
"]",
"",
"identity = [[int(i == j) for j in STATES] for i in STATES]",
"powers = [identity, transition]",
"for exponent in range(2, SIDE + 1):",
" powers.append(matmul(powers[-1], transition))",
"",
"partition = sum(powers[SIDE][row][row] for row in STATES)",
"magnetization_second_numerator = 0",
"correlation_numerators = []",
"for separation in range(SIDE):",
" subtotal = 0",
" left = powers[separation]",
" right = powers[SIDE - separation]",
" for upper in STATES:",
" for lower in STATES:",
" subtotal += (",
" magnetization[upper]",
" * left[upper][lower]",
" * magnetization[lower]",
" * right[lower][upper]",
" )",
" correlation_numerators.append(subtotal)",
" magnetization_second_numerator += SIDE * subtotal",
"",
"variance_scale = 25 * 17 * 17",
"conditional_variance_scaled = {0: variance_scale, 2: 16 * 17 * 17, 4: 64 * 25}",
"conditional_variance_numerator_scaled = 0",
"power_four = powers[4]",
"for above in STATES:",
" for middle in STATES:",
" first_two = transition[above][middle]",
" local_horizontal = spin(middle, SIDE - 1) + spin(middle, 1)",
" for below in STATES:",
" field = abs(",
" spin(above, 0)",
" + spin(below, 0)",
" + local_horizontal",
" )",
" conditional_variance_numerator_scaled += (",
" first_two",
" * transition[middle][below]",
" * power_four[below][above]",
" * conditional_variance_scaled[field]",
" )",
"",
"gap_upper = Fraction(",
" conditional_variance_numerator_scaled,",
" variance_scale * magnetization_second_numerator,",
")",
"gap_lower = Fraction(1, SIDE * SIDE * (1 << 72))",
"",
"assert partition > 0",
"assert magnetization_second_numerator > 0",
"assert sum(correlation_numerators) * SIDE == magnetization_second_numerator",
"assert gap_lower < gap_upper",
"assert all(",
" transition[upper][lower]",
" == (1 << (horizontal[lower] + vertical_agreements(upper, lower)))",
" for upper in STATES",
" for lower in STATES",
")",
"assert partition == 674103569746667088362626",
"assert magnetization_second_numerator == 273793464546853425980576256",
"assert (",
" conditional_variance_numerator_scaled",
" == 2625635969958730549421161600",
")",
"assert gap_lower == Fraction(1, 170005193383307227693056)",
"assert gap_upper == Fraction(",
" 48265367094829605687889,",
" 36363194510128970638045284,",
")",
"assert matrix_hash(transition) == (",
" \"c9bdfa7af6e49df8c031fbe5def55787bff5beaf45aa1b3775f6f7f3b1f07897\"",
")",
"assert matrix_hash(powers[6]) == (",
" \"61ed667ffcb10c3467853248b81cd65acb909f6b8035d9672e1662ceb28ac732\"",
")",
"",
"upper_num = gap_upper.numerator",
"upper_den = gap_upper.denominator",
"print(f\"side={SIDE} states={1 << (SIDE * SIDE)} row_states={len(STATES)}\")",
"print(f\"partition={partition}\")",
"print(f\"magnetization_second_numerator={magnetization_second_numerator}\")",
"print(\"row_correlation_numerators=\" + \",\".join(map(str, correlation_numerators)))",
"print(f\"conditional_variance_scale={variance_scale}\")",
"print(",
" \"conditional_variance_numerator_scaled=\"",
" + str(conditional_variance_numerator_scaled)",
")",
"print(f\"gap_lower={gap_lower.numerator}/{gap_lower.denominator}\")",
"print(f\"gap_upper={upper_num}/{upper_den}\")",
"print(f\"gap_upper_decimal={float(gap_upper):.18g}\")",
"print(f\"transition_sha256={matrix_hash(transition)}\")",
"print(f\"power6_sha256={matrix_hash(powers[6])}\")"
],
"missing": [
"command"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1007/s00222-012-0404-5",
"locator": "Inline Python 3 exact computation executed on 2026-07-25"
},
"models": [],
"relations": [
{
"slug": "R420",
"title": "A certified rational interval for the six-torus heat-bath gap",
"object_type": "claim",
"relation": "supports",
"direction": "outgoing"
},
{
"slug": "ising-six-torus-heat-bath-gap",
"title": "ising six torus heat bath gap",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}8Provenance
View source, identifiers, and projection details
A program, dataset, or output another agent can run or read.