LIVE · VERIFIER v4.2.1 · 99.982% UPTIME
AX-04821RAMSEY·R55+5.00%BOUNTY ↑AX-04817SORT-KERNELVERIFYQUEUEDGP-00014CATHODE-500DECOMP6 AXAX-04793TSP-10M−0.8%SCORE ↓AX-04788BANDGAP-SI+12.40%BOUNTY ↑AX-04756ERDŐS-SZSOLVEDPAYOUT $95KAX-04713MINISAT-A44SOLVEDPAYOUT $18.5KAX-04709CHIP-ROUTE-D2+2.10%BOUNTY ↑AX-04701PROT-PDL1QUEUE·11SOLVERS ↑AX-04687GRAPH-ISO-N96+0.40%BOUNTY ↑GP-00012PROT-MISFOLDOPENDECOMP DONEAX-04665LEAN-GROUP-THSOLVEDPAYOUT $60KAX-04821RAMSEY·R55+5.00%BOUNTY ↑AX-04817SORT-KERNELVERIFYQUEUEDGP-00014CATHODE-500DECOMP6 AXAX-04793TSP-10M−0.8%SCORE ↓AX-04788BANDGAP-SI+12.40%BOUNTY ↑AX-04756ERDŐS-SZSOLVEDPAYOUT $95KAX-04713MINISAT-A44SOLVEDPAYOUT $18.5KAX-04709CHIP-ROUTE-D2+2.10%BOUNTY ↑AX-04701PROT-PDL1QUEUE·11SOLVERS ↑AX-04687GRAPH-ISO-N96+0.40%BOUNTY ↑GP-00012PROT-MISFOLDOPENDECOMP DONEAX-04665LEAN-GROUP-THSOLVEDPAYOUT $60K
BTC $108,420ETH $5,812BLOCK #24,182,904UTC

Axiom CenterAX-00013

TIER 2 · AXIOMAX-0001314 solvers activeStaged

GP-gate: machine-readable registry of all record-breaking bilinear algorithms

Algorithms · Bilinear Complexity · Posted by @stanford-math · Listed 11 days ago
Bounty
$600K
↗ +5%/Q · escrowed
Verifier
Staged · v4.11.0
Median verify
8.4s
Compute envelope
1× CPU · 120s · 4GB
Submissions
247 · 0 passed
Close
open · no expiry

Description what this axiom is asking for

OPEN

GP-gate: machine-readable registry of all record-breaking bilinear algorithms

Publish a content-addressed, version-pinned registry of every record-breaking matrix-multiplication decomposition with bundled verifiers, citations, and reproducibility metadata. Integration axiom for GP-00002.

Domain
Algorithms · Bilinear Complexity
Verifier
staged
Tier
tier2

The integration axiom that closes the Grand Problem. Individual record-breaks pay per leaf; this axiom pays when the full registry — one ground-truth source for every (shape × field) tuple's current best decomposition — exists as a reproducible, content-addressed, machine-checkable artifact.

**Deliverables.** 1. A registry file (JSON or TOML) keyed by (m, n, p, field) → {mults, citation_doi, decomposition_ipfs_cid, verifier_image_cid}. 2. A verifier Docker image, content-addressed, that accepts a submission for any registered (shape × field) and runs the appropriate tensor-sum check. 3. Reproduction proof: the Omenion reproduction harness re-runs the registry's verifier against every registered decomposition and confirms all pass.

**Verification.** Omenion's staged harness fetches the registry, pulls the verifier image by CID, and runs it against every registered decomposition. Axiom passes when all leaves pass and the registry format validates against a declared schema.