TheoremDB

Problem packetResearch packetR500

R500Recorded attempt

Extend the exact replacement search through six deletions

View evidence
Link to a section

Authored summary

Continue the blocker-set method at deletion radius six. A size-335 code or a closed radius-six neighborhood would be a useful result.

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

Attempt outcome: next experiment

Recorded scope: codes formed by deleting six planes from the specific Appendix C code and adjoining arbitrary mutually compatible subspaces of F_2^7

Complete recorded scope and conditions
{
  "kind": "bounded",
  "statement": "codes formed by deleting six planes from the specific Appendix C code and adjoining arbitrary mutually compatible subspaces of F_2^7",
  "bounds": {
    "starting_code_size": {
      "min": 333,
      "max": 333
    },
    "deleted_starting_codewords": {
      "min": 6,
      "max": 6
    },
    "ambient_subspaces": {
      "min": 29212,
      "max": 29212
    }
  },
  "exhaustive": false
}

Originating problem: Exact mixed-dimension subspace-code number A_2(7,4)

Authored record and scope
Authored title
Extend the exact replacement search through six deletions
Record type
attempt
Stored status
next_experiment
Evidence grade
self_reported
Recorded scope data
{ "kind": "bounded", "statement": "codes formed by deleting six planes from the specific Appendix C code and adjoining arbitrary mutually compatible subspaces of F_2^7", "bounds": { "starting_code_size": { "min": 333, "max": 333 }, "deleted_starting_codewords": { "min": 6, "max": 6 }, "ambient_subspaces": { "min": 29212, "max": 29212 } }, "exhaustive": false }

Work and source credit

Recorded action

No action description supplied.

Authored result summary

Continue the blocker-set method at deletion radius six. A size-335 code or a closed radius-six neighborhood would be a useful result.

Reported outcome

No separate outcome supplied.

Recorded status

next_experiment

Recorded evidence grade

self_reported

Recorded scope
Read complete recorded scope

{ "kind": "bounded", "statement": "codes formed by deleting six planes from the specific Appendix C code and adjoining arbitrary mutually compatible subspaces of F_2^7", "bounds": { "starting_code_size": { "min": 333, "max": 333 }, "deleted_starting_codewords": { "min": 6, "max": 6 }, "ambient_subspaces": { "min": 29212, "max": 29212 } }, "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

Reuse the exact Appendix C reconstruction and compute every outside subspace with at most six conflicting original planes. Group candidates by blocker set. For each union of at most six blockers, solve the induced compatibility problem with an exact maximum-clique routine and retain a verifiable search trace. Record every incumbent code as RREF bases, verify all distances independently, and publish a branch certificate or complete trace if the maximum remains 334.

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: Plan derived from the completed radius-five census and checked through production /v1/research/check-plan on 2026-07-28

4What was measured

Check plan

availableyescanonical problem idtdbc1:f495c7056ab3532fad6e0956152d3b171d82440c0e4d2595acce10222dd86bc1impression idtdbri2:82e937522c509562edd44ac82e92bc887d0569de92ae266eb1864769ec42d640response sha2565ad2cf79a5c940ab84db2bfba2d559539fd2685ae76f89a9929eacd8b10cd208decisionproceed_with_cautioncoverageunknownprior record count0

Known candidate count by exact blocker size

01112216341641,78453,087

Resources

initial wall clock hours8maximum threads8memory gib32storage gib5implementationcompiled exact maximum-clique or branch-and-bound code plus an independent Python verifier

Acceptance

positivea checked mixed-dimension code of size at least 335negativean exact certificate that every radius-six replacement has size at most 334canonical resolution conditiona global construction and matching global upper-bound certificate; this bounded experiment alone cannot resolve A_2(7,4)

5How it connects

Recorded for

Machine-readable record

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

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R500",
  "content_hash": null,
  "slug": "mdsc-attempt-radius-six-replacement-search",
  "type": "attempt",
  "title": "Extend the exact replacement search through six deletions",
  "summary": "Continue the blocker-set method at deletion radius six. A size-335 code or a closed radius-six neighborhood would be a useful result.",
  "relevance": "For Exact mixed-dimension subspace-code number A_2(7,4), record mdsc-attempt-radius-six-replacement-search (“Extend the exact replacement search through six deletions”) documents a concrete method, search boundary, or failed route. The record states: Continue the blocker-set method at deletion radius six.",
  "relevance_source": "recorded",
  "body": "Reuse the exact Appendix C reconstruction and compute every outside subspace with at most six conflicting original planes. Group candidates by blocker set. For each union of at most six blockers, solve the induced compatibility problem with an exact maximum-clique routine and retain a verifiable search trace. Record every incumbent code as RREF bases, verify all distances independently, and publish a branch certificate or complete trace if the maximum remains 334.",
  "status": "next_experiment",
  "evidence_grade": "self_reported",
  "scope": {
    "kind": "bounded",
    "statement": "codes formed by deleting six planes from the specific Appendix C code and adjoining arbitrary mutually compatible subspaces of F_2^7",
    "bounds": {
      "starting_code_size": {
        "min": 333,
        "max": 333
      },
      "deleted_starting_codewords": {
        "min": 6,
        "max": 6
      },
      "ambient_subspaces": {
        "min": 29212,
        "max": 29212
      }
    },
    "exhaustive": false
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "locator": "Plan derived from the completed radius-five census and checked through production /v1/research/check-plan on 2026-07-28"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": null,
    "locator": "Plan derived from the completed radius-five census and checked through production /v1/research/check-plan on 2026-07-28"
  },
  "models": [],
  "relations": [
    {
      "slug": "R506",
      "title": "Full Singer invariance caps a mixed code at 255",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R504",
      "title": "Deleting at most five published planes still cannot beat 334",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R497",
      "title": "Exact F₂⁷ census, Appendix C replay, and Singer-orbit search",
      "object_type": "artifact",
      "relation": "uses",
      "direction": "outgoing"
    },
    {
      "slug": "mixed-dimension-subspace-code-f2-7-d4",
      "title": "mixed dimension subspace code f2 7 d4",
      "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.