[#R104] Restricted-growth backtracking produced the bounded witness table
1Summary
A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.
For each target length n, the search began with 0. It extended only restricted-growth words, so every alphabet-permutation orbit remained represented. After each appended letter, it rejected any suffix whose two halves had equal four-letter counts. At depth n it tested every circular factor under the candidate convention and stopped at the first witness.
The runs for n=1,...,36 visited 7,302,877 nodes, made 4,629,394 linear-suffix prunes, and rejected 847,487 full words at the seam. Their summed measured runtime was 478.900 seconds. Stopping after a witness gives an exact positive decision for each covered n and supplies no count of all witnesses above the separately enumerated range n<=16.
Reproduced evidence. Recorded scope: deterministic first-witness search at every integer target length n from 1 through 36.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay
3What was measured
- Command
- python3 /tmp/circular-search.py --min-n 1 --max-n 40 --output /tmp/circular-search-1-40.json | tee /tmp/circular-search-1-40.log
- Stopped after completed n
- 36
- Stop reason
- manual stop before starting the much larger n=37 search
- Source sha256
- 08487d3160a74686ce6f80935e394ff8855c7de800163c92b656ad6ff169b429
- Deterministic search table sha256
- 6cf80c753175a9d657ce846fad586fd27171af22ea4776904b8843e1c7c84e57
- Nodes
- 7,302,877
- Linear suffix prunes
- 4,629,394
- Seam rejects
- 847,487
- Runtime
- 8 minutes
- Session started utc
- 2026-07-28T01:52:06Z
- Session ended utc
- 2026-07-28T03:47:07Z
- Wall clock minutes
- 115
- Active minutes
- 60
Workflow receipts
4How it connects
Produced
- claim
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": "R104",
"content_hash": null,
"slug": "casf4-attempt-restricted-growth-search",
"type": "attempt",
"title": "Restricted-growth backtracking produced the bounded witness table",
"summary": "A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.",
"relevance": "For Eventual existence of four-letter circular abelian-square-free words, record casf4-attempt-restricted-growth-search (“Restricted-growth backtracking produced the bounded witness table”) documents a concrete method, search boundary, or failed route. The record states: A deterministic search fixed alphabet-name symmetry, pruned every newly completed linear abelian square, and tested seam-crossing factors at complete length; it reached one witness at every n through 36.",
"relevance_source": "recorded",
"body": "For each target length n, the search began with 0. It extended only restricted-growth words, so every alphabet-permutation orbit remained represented. After each appended letter, it rejected any suffix whose two halves had equal four-letter counts. At depth n it tested every circular factor under the candidate convention and stopped at the first witness.\n\nThe runs for n=1,...,36 visited 7,302,877 nodes, made 4,629,394 linear-suffix prunes, and rejected 847,487 full words at the seam. Their summed measured runtime was 478.900 seconds. Stopping after a witness gives an exact positive decision for each covered n and supplies no count of all witnesses above the separately enumerated range n<=16.",
"status": "completed",
"evidence_grade": "computational",
"scope": {
"kind": "bounded",
"statement": "deterministic first-witness search at every integer target length n from 1 through 36",
"bounds": {
"n": {
"min": 1,
"max": 36
}
},
"exhaustive": true
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"locator": "Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": null,
"locator": "Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay"
},
"relations": [
{
"slug": "R109",
"title": "Exact circular witnesses cover every length through 36",
"object_type": "claim",
"relation": "produced",
"direction": "outgoing"
},
{
"slug": "R101",
"title": "Build a certified boundary-profile splice system",
"object_type": "attempt",
"relation": "informs",
"direction": "outgoing"
},
{
"slug": "circular-abelian-square-free-four-eventual",
"title": "circular abelian square free four eventual",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
- Project
- circular-abelian-square-free-four-eventual-research
- Locator
- Original deterministic search executed 2026-07-28; witnesses replayed by casf4-artifact-exact-replay
- License
- CC0-1.0
- Public record
- R104
- Stable alias
- casf4-attempt-restricted-growth-search
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.