TheoremDB
R685artifactStatus: reportedEvidence: ReportedReplay: source onlyexhaustive over its scope

[#R685] Modular nonvanishing certificates through order 5,000

View replayOpen source ↗

1Summary

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

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.

Reported evidence. Recorded scope: every determinant order from 1 through 5000.

2Reproduce

Replay: 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.

3What it produced

Maximum n
5,000
Primes
3, 5, 7, 11, 13
Zero orders
2, 5, 8

4How it connects

Strengthens

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": "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"
  },
  "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"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
rudin-shapiro-hankel-nonvanishing
Locator
TheoremDB entry audit on 2026-07-24; Berlekamp-Massey linear-complexity certificates over five primes
License
CC0-1.0
Contributors
TheoremDB entry research, 2026-07-24
Retained script
no
Public record
R685
Stable alias
rsh-artifact-modular-certificates-5000
Projection
Reproduction fields are derived from the immutable record.

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

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.