Problem packetWorkR25
[#R25] The smallest height-361 projection survivor fails at 250952
1Summary
The projected h6 candidate with direction (361,288) survives 200,000 symbols and then has its first scalar additive square ending at position 250,952.
The direction maps the six h6 letters a,b,c,d,e,f to 0,649,1010,288,722,361, giving the sorted primitive integer alphabet {0,288,361,649,722,1010}. An exact end-major, half-length-minor scan found the first equal-sum adjacent blocks at zero-based interval [148708,250952). Each block has length 51,122 and sum 25,859,725. The full scanner tested 15,744,152,222 pairs through that witness. An independently written continuation scanner checked ends after 200,000 and matched the endpoint, start, half-length, and sum.
Ruled out evidence. Recorded scope: the projection (p,q)=(361,288) of h6^omega(a) through the first scalar additive square ending at 250952.
2Outcome
A verification source is cited. This record has no executable replay attached.
- Recorded runtime
- 13.32
Verification source: Exact C++20 scan of one projected Rao-Rosenfeld h6 fixed point, executed and independently replayed on 2026-07-28
3What was measured
- Sorted projected alphabet
- 0, 288, 361, 649, 722, 1,010
- Exact stdout sha256
- 0c62de4d0af910ef0a3e4c8b889a4080f80f1c916e36efb541a2b0e9eec93cde
- Independent continuation source sha256
- d3d083116c34c6578de3e79cc3ba89db6ece5c792835c5ce43349f75991ac7b5
- Independent continuation stdout sha256
- c10c1b188ec1a57ff025c14007454b98ddd10e3345ad896e5c311cea3b4661b8
- Independent continuation pairs tested
- 5,744,152,222
- Stopping rule
- stop at the first scalar additive square or after 1000000 symbols
- Restart criterion
- advance to the next deterministic surviving direction from the bounded projection screen
Execution
Letter order values
4How it connects
Uses
- artifact
Tests
- attempt
Informs
- attempt
Recorded for
- problem
5Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R25",
"content_hash": null,
"slug": "asq-attempt-projection-361-288",
"type": "attempt",
"title": "The smallest height-361 projection survivor fails at 250952",
"summary": "The projected h6 candidate with direction (361,288) survives 200,000 symbols and then has its first scalar additive square ending at position 250,952.",
"relevance": "For Infinite additive-square avoidance over a finite integer alphabet, record asq-attempt-projection-361-288 (“The smallest height-361 projection survivor fails at 250952”) documents a concrete method, search boundary, or failed route. The record states: The projected h6 candidate with direction (361,288) survives 200,000 symbols and then has its first scalar additive square ending at position 250,952.",
"relevance_source": "recorded",
"body": "The direction maps the six h6 letters a,b,c,d,e,f to 0,649,1010,288,722,361, giving the sorted primitive integer alphabet {0,288,361,649,722,1010}. An exact end-major, half-length-minor scan found the first equal-sum adjacent blocks at zero-based interval [148708,250952). Each block has length 51,122 and sum 25,859,725. The full scanner tested 15,744,152,222 pairs through that witness. An independently written continuation scanner checked ends after 200,000 and matched the endpoint, start, half-length, and sum.",
"status": "failed",
"evidence_grade": "computational",
"scope": {
"kind": "bounded",
"statement": "the projection (p,q)=(361,288) of h6^omega(a) through the first scalar additive square ending at 250952",
"bounds": {
"prefix_length": {
"min": 1,
"max": 250952
},
"p": {
"min": 361,
"max": 361
},
"q": {
"min": 288,
"max": 288
},
"half_length": {
"min": 51122,
"max": 51122
}
},
"exhaustive": true
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"locator": "Exact C++20 scan of one projected Rao-Rosenfeld h6 fixed point, executed and independently replayed on 2026-07-28"
},
"runtime_seconds": 13.32,
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": null,
"locator": "Exact C++20 scan of one projected Rao-Rosenfeld h6 fixed point, executed and independently replayed on 2026-07-28"
},
"models": [],
"relations": [
{
"slug": "R21",
"title": "First-square scanner for one h6 projection",
"object_type": "artifact",
"relation": "uses",
"direction": "outgoing"
},
{
"slug": "R26",
"title": "Screen rational projections of the Z^2 construction",
"object_type": "attempt",
"relation": "tests",
"direction": "outgoing"
},
{
"slug": "R24",
"title": "Search for a low-expansion morphism and certify it",
"object_type": "attempt",
"relation": "informs",
"direction": "outgoing"
},
{
"slug": "additive-square-finite-alphabet",
"title": "additive square finite alphabet",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
- Project
- additive-square-finite-alphabet-research
- Locator
- Exact C++20 scan of one projected Rao-Rosenfeld h6 fixed point, executed and independently replayed on 2026-07-28
- License
- CC0-1.0
- Public record
- R25
- Stable alias
- asq-attempt-projection-361-288
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.