Problem packetResearch packetR1146
Current status and unresolved remainder
Link to a section
The record cites sources for its explanation.
Recorded status: reported
Recorded scope: No scope is recorded.
Originating problem: Positive cycle entropy for finite cyclic Rule 30
Authored record and scope
- Authored title
- Current status and unresolved remainder
- Record type
- claim
- Stored status
- reported
- Evidence grade
- sourced
2Authored explanation
UNKNOWN as of 2026-07-31. Exact maximum-period tables exist for small widths, and the checked structural results for Rule 30 do not prove an exponential subsequence of finite-ring periods.
A complete resolution must satisfy this condition: Prove that \(M_n\ge2^{cn}\) for some explicit \(c>0\) and infinitely many \(n\), or prove \(\log M_n=o(n)\).
Continue this work
Replay material: source only
3Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, See dataset.references[0] for the exact external source and locator.
4How it connects
Addressed by
- attempt
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": "R1146",
"content_hash": null,
"slug": "rule-30-positive-cycle-entropy-claim-status-20260731",
"type": "claim",
"title": "Current status and unresolved remainder",
"summary": "UNKNOWN as of 2026-07-31. Exact maximum-period tables exist for small widths, and the checked structural results for Rule 30 do not prove an exponential subsequence of finite-ring periods. Prove that \\(M_n\\ge2^{cn}\\) for some explicit \\(c>0\\) and infinitely many \\(n\\), or prove \\(\\log M_n=o(n)\\).",
"relevance": "For rule 30 positive cycle entropy, pins the dated research frontier: UNKNOWN as of 2026-07-31. Exact maximum-period tables exist for small widths, and the checked structural results for Rule 30 do not prove an exponential subsequence of finite-ring periods. Prove that \\(M_n\\ge2^{cn}\\) for some explicit \\(c>0\\) and infinitely many \\(n\\), or prove \\(\\log M_n=o(n)\\).",
"relevance_source": "recorded",
"body": "UNKNOWN as of 2026-07-31. Exact maximum-period tables exist for small widths, and the checked structural results for Rule 30 do not prove an exponential subsequence of finite-ring periods.\n\nA complete resolution must satisfy this condition: Prove that \\(M_n\\ge2^{cn}\\) for some explicit \\(c>0\\) and infinitely many \\(n\\), or prove \\(\\log M_n=o(n)\\).",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://doi.org/10.1016/j.tcs.2022.12.018",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1016/j.tcs.2022.12.018",
"locator": "See dataset.references[0] for the exact external source and locator."
},
"models": [],
"continuation": null,
"relations": [
{
"slug": "R1145",
"title": "Resolve the stated acceptance condition",
"object_type": "attempt",
"relation": "addresses",
"direction": "incoming"
},
{
"slug": "rule-30-positive-cycle-entropy",
"title": "rule 30 positive cycle entropy",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.