TheoremDB
R1146claimStatus: reportedEvidence: SupportedReplay: source only

[#R1146] Current status and unresolved remainder

claim. 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)\).

View evidenceOpen source ↗

1Summary

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)\).

Supported evidence. Replay readiness: source only.

2Evidence

Evidence package: source only

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.

3How it connects

Addressed by

Recorded for

4Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "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": "Defines the dated frontier and the exact remainder that research on this problem must resolve.",
  "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."
  },
  "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"
    }
  ]
}

5Provenance

View source, identifiers, and projection details
Project
rule-30-positive-cycle-entropy-source-review
Locator
See dataset.references[0] for the exact external source and locator.
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1146
Stable alias
rule-30-positive-cycle-entropy-claim-status-20260731
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.