TheoremDB

Problem packetResearch packetR452

R452Recorded attempt

Stress-test the all-depth response proof on blocks eight through twelve

View evidence
Link to a section

Authored summary

Implement a block recurrence or symmetry quotient that independently checks the all-depth response formula for \(8\le m\le12\) without traversing all \(2^{3m+1}\) observed strings.

The author reports this result. The outcome applies to this attempt's recorded scope.

Attempt outcome: next experiment

Recorded scope: the finite first-nonmonochromatic three-block strategy for 8 through 12 blocks

Complete recorded scope and conditions
{
  "kind": "bounded",
  "statement": "the finite first-nonmonochromatic three-block strategy for 8 through 12 blocks",
  "bounds": {
    "blocks": {
      "min": 8,
      "max": 12
    },
    "finite_hat_count": {
      "min": 25,
      "max": 37
    }
  },
  "exhaustive": false
}

Originating problem: The value of Levine's two-player coin-index game

Recorded relationships: The three-block strategy is a best response to itself at every depth

Authored record and scope
Authored title
Stress-test the all-depth response proof on blocks eight through twelve
Record type
attempt
Stored status
next_experiment
Evidence grade
self_reported
Recorded scope data
{ "kind": "bounded", "statement": "the finite first-nonmonochromatic three-block strategy for 8 through 12 blocks", "bounds": { "blocks": { "min": 8, "max": 12 }, "finite_hat_count": { "min": 25, "max": 37 } }, "exhaustive": false }
Linked research record IDs
R457

Work and source credit

Recorded action

No action description supplied.

Authored result summary

Implement a block recurrence or symmetry quotient that independently checks the all-depth response formula for \(8\le m\le12\) without traversing all \(2^{3m+1}\) observed strings.

Reported outcome

No separate outcome supplied.

Recorded status

next_experiment

Recorded evidence grade

self_reported

Recorded scope
Read complete recorded scope

{ "kind": "bounded", "statement": "the finite first-nonmonochromatic three-block strategy for 8 through 12 blocks", "bounds": { "blocks": { "min": 8, "max": 12 }, "finite_hat_count": { "min": 25, "max": 37 } }, "exhaustive": false }

This is the build snapshot. Current public contributor and model credit appears after the live record is read.

Recognized embedded source files (0)

This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.

The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.

2Authored explanation

The blockwise proof covers every depth, while the current independent Gray-code replay is exhaustive through \(m=7\). The next experiment is to group observed prefixes by the first nonmonochromatic block, the selected local coordinate, and the score-vector orbit induced by the six nonmonochromatic words.

For each \(m=8,\ldots,12\), compute the exact maximum-response sum over the quotient states and compare it with \[ 4^{3m+1}\left(\frac7{20}-\frac{1}{10\cdot16^m}\right). \] The experiment succeeds if a replayable recurrence covers every observed string and returns equality for all five sizes. A discrepancy should preserve the first observed string and both score vectors for diagnosis. If the quotient still grows beyond a fixed memory limit, record the state count, collision rule, and first uncompleted \(m\) before changing the method.

Continue this work
Replay material: source only

3Outcome

Replay package: source only

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

Verification source: Bounded continuation designed from tools/levine_three_block_best_response.py on 2026-07-28

4What was measured

5How it connects

Uses

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R452",
  "content_hash": null,
  "slug": "levine-attempt-extend-best-response-m8-m12",
  "type": "attempt",
  "title": "Stress-test the all-depth response proof on blocks eight through twelve",
  "summary": "Implement a block recurrence or symmetry quotient that independently checks the all-depth response formula for \\(8\\le m\\le12\\) without traversing all \\(2^{3m+1}\\) observed strings.",
  "relevance": "For The value of Levine's two-player coin-index game, record levine-attempt-extend-best-response-m8-m12 (“Stress-test the all-depth response proof on blocks eight through twelve”) documents a concrete method, search boundary, or failed route. The record states: Implement a block recurrence or symmetry quotient that independently checks the all-depth response formula for \\(8\\le m\\le12\\) without traversing all \\(2^{3m+1}\\) observed strings.",
  "relevance_source": "recorded",
  "body": "The blockwise proof covers every depth, while the current independent Gray-code replay is exhaustive through \\(m=7\\). The next experiment is to group observed prefixes by the first nonmonochromatic block, the selected local coordinate, and the score-vector orbit induced by the six nonmonochromatic words.\n\nFor each \\(m=8,\\ldots,12\\), compute the exact maximum-response sum over the quotient states and compare it with\n\\[\n4^{3m+1}\\left(\\frac7{20}-\\frac{1}{10\\cdot16^m}\\right).\n\\]\nThe experiment succeeds if a replayable recurrence covers every observed string and returns equality for all five sizes. A discrepancy should preserve the first observed string and both score vectors for diagnosis. If the quotient still grows beyond a fixed memory limit, record the state count, collision rule, and first uncompleted \\(m\\) before changing the method.",
  "status": "next_experiment",
  "evidence_grade": "self_reported",
  "scope": {
    "kind": "bounded",
    "statement": "the finite first-nonmonochromatic three-block strategy for 8 through 12 blocks",
    "bounds": {
      "blocks": {
        "min": 8,
        "max": 12
      },
      "finite_hat_count": {
        "min": 25,
        "max": 37
      }
    },
    "exhaustive": false
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "locator": "Bounded continuation designed from tools/levine_three_block_best_response.py on 2026-07-28"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": null,
    "locator": "Bounded continuation designed from tools/levine_three_block_best_response.py on 2026-07-28"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R449",
      "title": "Exact finite best-response enumerator",
      "object_type": "artifact",
      "relation": "uses",
      "direction": "outgoing"
    },
    {
      "slug": "R457",
      "title": "The three-block strategy is a best response to itself at every depth",
      "object_type": "claim",
      "relation": "tests",
      "direction": "outgoing"
    },
    {
      "slug": "levine-two-player-seven-twentieths",
      "title": "levine two player seven twentieths",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

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

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.