P42 Prizes · Register of recordsLocked · construction · maximize

Autoconvolution C2 Lower

verifier 0.1.0 · pending admissionimage digest pending admissionrepo problems/autoconvolution-c2-lower

A queued large-certificate board for exact L1/L2/Linf verification. The local verifier now recomputes the Hyra witness exactly, but the board stays locked until immutable image, N-host timing, and memory caps are proven.

§1Statement

C_2 \ge \tfrac{p}{q} \quad \text{certified by exact } \|w\|_1,\ \|w\|_2,\ \|w * w\|_\infty \ \text{of an integer witness vector } w

The functional defining C₂ is frozen in the problem spec packaged at admission; the verifier recomputes every norm in exact rational arithmetic from the raw witness.

§2Verification

The chain does not trust this page.

Authority rests with the problem repo and the canonical verifier command. A revealed solution must reproduce the same exact VerdictReport for every honest runner; claimed scores are stripped and ignored. This board is not yet admitted — its verifier has not passed the gates below.

Conditions precedent to admission

R1exact integer norms
H3all 1048575 coefficients checked
H5claimed-score trap
☐N-host timing gate required

§3Solution format

{
  "type": "object",
  "required": [
    "n",
    "values"
  ]
}

Plate 1. Canonical raw solution schema. Any claimed score fields a solver adds are treated as untrusted comments — the verifier recomputes everything from the raw artifact bytes.

{
  "n": 524288,
  "values": [
    "524288 nonnegative integers"
  ]
}

Plate 2. Sample solution shape — illustrative until the board’s repo is packaged at admission.

§4The record

no submissions

No award has yet been made. This board opens for submissions when its conditions precedent close.

ReproduceGET /prizes/api/leaderboard?problem_id=6