TheoremDB
R500attemptStatus: next experimentEvidence: ReportedReplay: source only

[#R500] Extend the exact replacement search through six deletions

View evidence

1Summary

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

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.

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

2Outcome

Evidence 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

3What was measured

Stop conditions
radius-six search closes, a code of size at least 335 is found and independently verified, 8-hour wall-clock budget is exhausted, 32 GiB memory budget is exhausted, certificate generation or verification fails

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)

4How it connects

Recorded for

5Agent packet

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

View structured packet
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"
  },
  "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"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
mixed-dimension-subspace-code-f2-7-d4-research
Locator
Plan derived from the completed radius-five census and checked through production /v1/research/check-plan on 2026-07-28
License
CC0-1.0
Public record
R500
Stable alias
mdsc-attempt-radius-six-replacement-search
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.