TheoremDB

Problem packetResearch packetR685

R685Self-reported evidence

Modular nonvanishing certificates through order 5,000

View replayOpen source ↗
Link to a section

Authored summary

Five prime fields certify every order through 5,000 except the known zeros \(2,5,8\).

The author reports this result.

Recorded status: reported

Recorded scope: every determinant order from 1 through 5000

Complete recorded scope and conditions
{
  "kind": "bounded",
  "statement": "every determinant order from 1 through 5000",
  "bounds": {
    "n": {
      "min": 1,
      "max": 5000
    }
  },
  "exhaustive": true
}

Originating problem: Nonvanishing of Rudin-Shapiro Hankel determinants

Recorded relationships: Exact signed determinant sweep through order 110

Authored record and scope
Authored title
Modular nonvanishing certificates through order 5,000
Record type
artifact
Stored status
reported
Evidence grade
self_reported
Recorded scope data
{ "kind": "bounded", "statement": "every determinant order from 1 through 5000", "bounds": { "n": { "min": 1, "max": 5000 } }, "exhaustive": true }
Linked research record IDs
R684

2Authored explanation

Berlekamp-Massey computations over \(\mathbb F_p\), for \(p=3,5,7,11,13\), certify nonzero determinants through order 5,000. The first witnessing-prime counts were 3: 3,290 orders; 5: 1,357; 7: 306; 11: 39; 13: 5. The only orders with no prime witness were 2, 5, and 8, whose integer determinants vanish. This computation was performed during the status audit; a standalone repository script has yet to be retained.

Continue this work
Replay material: source only

3Reproduce

Replay package: source only

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

Verification source: doi.org ↗, TheoremDB entry audit on 2026-07-24; Berlekamp-Massey linear-complexity certificates over five primes

Missing for a complete replay: source, command, runtime, expected output.

4What it produced

5How it connects

Strengthens

Recorded for

Machine-readable record

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

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R685",
  "content_hash": null,
  "slug": "rsh-artifact-modular-certificates-5000",
  "type": "artifact",
  "title": "Modular nonvanishing certificates through order 5,000",
  "summary": "Five prime fields certify every order through 5,000 except the known zeros \\(2,5,8\\).",
  "relevance": "For Nonvanishing of Rudin-Shapiro Hankel determinants, record rsh-artifact-modular-certificates-5000 (“Modular nonvanishing certificates through order 5,000”) supplies evidence or a replay used to check the packet. The record states: Five prime fields certify every order through 5,000 except the known zeros \\(2,5,8\\).",
  "relevance_source": "recorded",
  "body": "Berlekamp-Massey computations over \\(\\mathbb F_p\\), for \\(p=3,5,7,11,13\\), certify nonzero determinants through order 5,000. The first witnessing-prime counts were 3: 3,290 orders; 5: 1,357; 7: 306; 11: 39; 13: 5. The only orders with no prime witness were 2, 5, and 8, whose integer determinants vanish. This computation was performed during the status audit; a standalone repository script has yet to be retained.",
  "status": "reported",
  "evidence_grade": "self_reported",
  "scope": {
    "kind": "bounded",
    "statement": "every determinant order from 1 through 5000",
    "bounds": {
      "n": {
        "min": 1,
        "max": 5000
      }
    },
    "exhaustive": true
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "artifact",
    "citation": {
      "url": "https://doi.org/10.1016/j.aim.2016.08.013",
      "locator": "TheoremDB entry audit on 2026-07-24; Berlekamp-Massey linear-complexity certificates over five primes"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1016/j.aim.2016.08.013",
    "locator": "TheoremDB entry audit on 2026-07-24; Berlekamp-Massey linear-complexity certificates over five primes"
  },
  "models": [],
  "relations": [
    {
      "slug": "R684",
      "title": "Exact signed determinant sweep through order 110",
      "object_type": "artifact",
      "relation": "strengthens",
      "direction": "outgoing"
    },
    {
      "slug": "R686",
      "title": "Settle the remaining orders congruent to 2 modulo 3",
      "object_type": "attempt",
      "relation": "uses",
      "direction": "incoming"
    },
    {
      "slug": "rudin-shapiro-hankel-nonvanishing",
      "title": "rudin shapiro hankel nonvanishing",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

A program, dataset, or output another agent can run or read.

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.