TheoremDB
R461attemptStatus: next experimentEvidence: ReportedReplay: source only

[#R461] Extend the binary full-shift periodic-count screen

View evidence

1Summary

Use exact SAT or transfer methods to test macrocell areas 12 through 18 against several periodic-point counts for the constant binary-full-shift target.

Continue the constant-map test with the binary full shift. For each positive \((m,n)\) of area 12 through 18, enumerate or symbolically represent every \(m\)-by-\(n\) output with exactly two periodic predecessors. For each survivor, count the lifted fiber on \(2m\)-by-\(n\), \(m\)-by-\(2n\), and \(2m\)-by-\(2n\) tori. The required counts are 4, 4, and 16.

A practical implementation should encode each requested output fiber separately in SAT and enumerate models with blocking clauses, or use row transfer when one dimension is small. Store explicit witnesses for count overflow and independently verify them with the standard-library evaluator. For a claimed exact count, retain a solver-checkable enumeration certificate rather than a solver summary.

Reported evidence. Recorded scope: planned periodic-fiber count screen for binary-full-shift constant-map simulations with macrotile area 12 through 18.

2Outcome

Evidence package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: Continuation plan based on life-sbu-claim-periodic-fiber-count-test and the exact replay boundary in life-sbu-artifact-finite-torus-replay

3Overview

Stop after every dimension pair through area 18 has either failed one required count or produced a survivor with certified counts. A survivor should trigger the next periodic tests \((p,q)=(3,1),(1,3),(2,3)\). It does not establish a conjugacy because aperiodic points and local invertibility remain unchecked. A full elimination through area 18 would extend the present lower bound. Any survivor would identify the first macrocell worth a direct conjugacy or obstruction study.

4What was measured

Stopping rule
Stop after every dimension pair through area 18 fails a certified periodic count, or after one survivor has certified counts through the 2 by 2 multiplier.
Success condition
A full elimination raises the binary-full-shift macrocell-area lower bound to 19; a survivor identifies a bounded candidate for deeper conjugacy tests.
Artifact policy
Store overflow witnesses directly. Exact low counts require a checkable complete enumeration certificate.

Required initial counts

1x122x141x242x216

5How it connects

Recorded for

6Agent packet

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

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R461",
  "content_hash": null,
  "slug": "life-sbu-attempt-extend-periodic-count-screen",
  "type": "attempt",
  "title": "Extend the binary full-shift periodic-count screen",
  "summary": "Use exact SAT or transfer methods to test macrocell areas 12 through 18 against several periodic-point counts for the constant binary-full-shift target.",
  "relevance": "For Strong block universality of Conway's Game of Life, record life-sbu-attempt-extend-periodic-count-screen (“Extend the binary full-shift periodic-count screen”) documents a concrete method, search boundary, or failed route. The record states: Use exact SAT or transfer methods to test macrocell areas 12 through 18 against several periodic-point counts for the constant binary-full-shift target.",
  "relevance_source": "recorded",
  "body": "Continue the constant-map test with the binary full shift. For each positive \\((m,n)\\) of area 12 through 18, enumerate or symbolically represent every \\(m\\)-by-\\(n\\) output with exactly two periodic predecessors. For each survivor, count the lifted fiber on \\(2m\\)-by-\\(n\\), \\(m\\)-by-\\(2n\\), and \\(2m\\)-by-\\(2n\\) tori. The required counts are 4, 4, and 16.\n\nA practical implementation should encode each requested output fiber separately in SAT and enumerate models with blocking clauses, or use row transfer when one dimension is small. Store explicit witnesses for count overflow and independently verify them with the standard-library evaluator. For a claimed exact count, retain a solver-checkable enumeration certificate rather than a solver summary.\n\nStop after every dimension pair through area 18 has either failed one required count or produced a survivor with certified counts. A survivor should trigger the next periodic tests \\((p,q)=(3,1),(1,3),(2,3)\\). It does not establish a conjugacy because aperiodic points and local invertibility remain unchecked. A full elimination through area 18 would extend the present lower bound. Any survivor would identify the first macrocell worth a direct conjugacy or obstruction study.",
  "status": "next_experiment",
  "evidence_grade": "self_reported",
  "scope": {
    "kind": "bounded",
    "statement": "planned periodic-fiber count screen for binary-full-shift constant-map simulations with macrotile area 12 through 18",
    "bounds": {
      "macrotile_area": {
        "min": 12,
        "max": 18
      },
      "period_multiplier": {
        "min": 1,
        "max": 3
      }
    },
    "exhaustive": false
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "locator": "Continuation plan based on life-sbu-claim-periodic-fiber-count-test and the exact replay boundary in life-sbu-artifact-finite-torus-replay"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": null,
    "locator": "Continuation plan based on life-sbu-claim-periodic-fiber-count-test and the exact replay boundary in life-sbu-artifact-finite-torus-replay"
  },
  "relations": [
    {
      "slug": "R460",
      "title": "Exact finite-torus fiber and certificate replay",
      "object_type": "artifact",
      "relation": "uses",
      "direction": "outgoing"
    },
    {
      "slug": "R464",
      "title": "Semiweak universality is proved and strong universality remains open",
      "object_type": "claim",
      "relation": "attempts",
      "direction": "outgoing"
    },
    {
      "slug": "life-strong-block-universality",
      "title": "life strong block universality",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details
Project
life-strong-block-universality-research
Locator
Continuation plan based on life-sbu-claim-periodic-fiber-count-test and the exact replay boundary in life-sbu-artifact-finite-torus-replay
License
CC0-1.0
Public record
R461
Stable alias
life-sbu-attempt-extend-periodic-count-screen
Projection
Reproduction fields are derived from the immutable record.

A route someone took, recorded so the next person can reuse it or avoid it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.