{
 "catalog": {
  "id": "autoresearch",
  "version": "2026-11-07",
  "generatedAt": "2026-11-07"
 },
 "families": [
  {
   "id": "random-distance",
   "groupId": "ldpc",
   "title": "Random LDPC distance"
  },
  {
   "id": "gallager-proximity",
   "groupId": "ldpc",
   "title": "Gallager ensemble proximity"
  },
  {
   "id": "smooth-proximity",
   "groupId": "ldpc",
   "title": "Smooth proximity"
  },
  {
   "id": "code-golf",
   "groupId": "golf",
   "title": "Proximity code golf"
  }
 ],
 "problems": [
  {
   "id": "BinaryDistance",
   "familyId": "random-distance",
   "title": "Binary ensemble distance",
   "statement": "Prove a stronger high-probability minimum-distance bound for the fixed binary Gallager strip ensemble (GF(2), degree 64, 8 layers). Fixed Gallager strip ensemble, n = 2^23 coordinates, m = 2^20 checks, design rate 7/8; setup failure at most 2^-40.",
   "objective": {
    "metric": "min_distance",
    "label": "Minimum distance",
    "unit": "symbols",
    "direction": "maximize",
    "scale": 1,
    "display": "D / 2^23"
   },
   "history": [
    {
     "date": "2026-11-06",
     "value": 1,
     "label": "local Lean-certified baseline (unranked)"
    }
   ],
   "sources": [
    {
     "label": "Target: RandomLDPC/Targets/Profiles.lean",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Targets/Profiles.lean"
    },
    {
     "label": "Claims",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Statements/Claims.lean"
    },
    {
     "label": "Ensemble",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Statements/Ensemble.lean"
    }
   ],
   "submission": "Submission/BinaryDistance.lean exporting Submission.BinaryDistance : RandomLDPC.BinaryDistance D.",
   "status": "research setup",
   "submissions": {
    "open": false,
    "note": "Intake opens after the verifier image is registered with the queue."
   },
   "variant": "Binary, GF(2)"
  },
  {
   "id": "WeightedDistance",
   "familyId": "random-distance",
   "title": "Weighted ensemble distance",
   "statement": "Prove a high-probability minimum-distance bound for the GF(2³²) weighted strip ensemble (degree 128, 16 layers), excluding every nonzero coefficient assignment on a small support. Fixed Gallager strip ensemble, n = 2^23 coordinates, m = 2^20 checks, design rate 7/8; setup failure at most 2^-40.",
   "objective": {
    "metric": "min_distance",
    "label": "Minimum distance",
    "unit": "symbols",
    "direction": "maximize",
    "scale": 1,
    "display": "D / 2^23"
   },
   "history": [
    {
     "date": "2026-11-06",
     "value": 1,
     "label": "local Lean-certified baseline (unranked)"
    }
   ],
   "sources": [
    {
     "label": "Target: RandomLDPC/Targets/Profiles.lean",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Targets/Profiles.lean"
    },
    {
     "label": "Claims",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Statements/Claims.lean"
    }
   ],
   "submission": "Submission/WeightedDistance.lean exporting Submission.WeightedDistance : RandomLDPC.WeightedDistance D.",
   "status": "research setup",
   "submissions": {
    "open": false,
    "note": "Intake opens after the verifier image is registered with the queue."
   },
   "variant": "Weighted, GF(2³²)"
  },
  {
   "id": "BinaryProximity",
   "familyId": "gallager-proximity",
   "title": "Binary ensemble proximity gap",
   "statement": "Prove that almost every binary setup has an affine folding proximity gap over every finite extension field: every jointly far received pair has at most one close folding seed, with no few-failed-checks premise. Fixed Gallager strip ensemble, n = 2^23 coordinates, m = 2^20 checks, design rate 7/8; setup failure at most 2^-40.",
   "objective": {
    "metric": "gap_radius",
    "label": "Folding-gap radius",
    "unit": "coordinates",
    "direction": "maximize",
    "scale": 1,
    "display": "R / 2^23"
   },
   "history": [
    {
     "date": "2026-11-06",
     "value": 1,
     "label": "local Lean-certified baseline (unranked)"
    }
   ],
   "sources": [
    {
     "label": "Target: RandomLDPC/Targets/Profiles.lean",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Targets/Profiles.lean"
    },
    {
     "label": "Claims",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Statements/Claims.lean"
    }
   ],
   "submission": "Submission/BinaryProximity.lean exporting Submission.BinaryProximity : RandomLDPC.BinaryProximity R.",
   "status": "research setup",
   "submissions": {
    "open": false,
    "note": "Intake opens after the verifier image is registered with the queue."
   },
   "variant": "Binary, GF(2)"
  },
  {
   "id": "WeightedProximity",
   "familyId": "gallager-proximity",
   "title": "Weighted ensemble proximity gap",
   "statement": "Establish the same uniform affine folding guarantee for the GF(2³²) weighted strip ensemble; distance estimates alone do not discharge it. Fixed Gallager strip ensemble, n = 2^23 coordinates, m = 2^20 checks, design rate 7/8; setup failure at most 2^-40.",
   "objective": {
    "metric": "gap_radius",
    "label": "Folding-gap radius",
    "unit": "coordinates",
    "direction": "maximize",
    "scale": 1,
    "display": "R / 2^23"
   },
   "history": [
    {
     "date": "2026-11-06",
     "value": 1,
     "label": "local Lean-certified baseline (unranked)"
    }
   ],
   "sources": [
    {
     "label": "Target: RandomLDPC/Targets/Profiles.lean",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Targets/Profiles.lean"
    },
    {
     "label": "Claims",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Statements/Claims.lean"
    }
   ],
   "submission": "Submission/WeightedProximity.lean exporting Submission.WeightedProximity : RandomLDPC.WeightedProximity R.",
   "status": "research setup",
   "submissions": {
    "open": false,
    "note": "Intake opens after the verifier image is registered with the queue."
   },
   "variant": "Weighted, GF(2³²)"
  },
  {
   "id": "SmoothProximity",
   "familyId": "smooth-proximity",
   "title": "Smooth proximity",
   "statement": "Raise the fraction of failed parity checks the smoothness argument tolerates while keeping the half-distance proximity radius P = d/2. Assume expansion with γ = 1/10 and the margin γδn ≥ 1; certify both the puncturing guarantee and soundness of the verifier that samples check neighbourhoods.",
   "objective": {
    "metric": "failed_check_multiplier",
    "label": "Failed-check multiplier in α",
    "unit": "thousandths",
    "direction": "maximize",
    "scale": 1000,
    "display": "S/1000"
   },
   "history": [
    {
     "date": "2026-11-06",
     "value": 699,
     "label": "local Lean-certified baseline (unranked)"
    }
   ],
   "sources": [
    {
     "label": "Target: RandomLDPC/Targets/Smooth.lean",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Targets/Smooth.lean"
    },
    {
     "label": "Baseline proof",
     "url": "https://github.com/kobizk/random-ldpc-challenge/blob/df1c310/RandomLDPC/Theorems/SmoothBaselines.lean"
    }
   ],
   "submission": "Submission/SmoothProximity.lean exporting Submission.SmoothProximity : RandomLDPC.SmoothProximity S, plus Submission/SmoothProximity.score.",
   "status": "research setup",
   "submissions": {
    "open": false,
    "note": "Intake opens after the verifier image is registered with the queue."
   },
   "note": "0.699 controls failed-check tolerance at a fixed half-distance radius; it is not a 69.9% proximity radius.",
   "variant": "All finite fields"
  },
  {
   "id": "toy-protocol-code-golf",
   "familyId": "code-golf",
   "title": "Toy-protocol code golf: 256 MiB",
   "statement": "Design a linear code and a verified Caliper encoder for the toy protocol of Arnon–Boneh–Fenzi §6. For a fixed 256 MiB input, minimize the argument size while keeping modeled prover cost within 2^39 Caliper cycles; prove the encoder computes the code, the code is injective, and the knowledge-soundness certificate is at most 2^-128.",
   "objective": {
    "metric": "argument_bits",
    "label": "Argument size",
    "unit": "bits",
    "direction": "minimize",
    "scale": 1,
    "display": "bits"
   },
   "history": [],
   "sources": [
    {
     "label": "zksecurity/code-golf",
     "url": "https://github.com/zksecurity/code-golf/tree/6ca4b41"
    }
   ],
   "submission": "CodeGolf/Submission/ with Code.lean, Solution.lean and claim.json; theorems CodeGolf.Benchmark.candidate and representation_bits.",
   "status": "preparation: source kit available",
   "submissions": {
    "open": false,
    "note": "Intake opens after the verifier image is registered with the queue."
   },
   "note": "No valid baseline yet; the starter’s zero score is a placeholder, and the earlier small KoalaBear reference is a different benchmark.",
   "variant": "256 MiB toy protocol"
  }
 ],
 "groups": [
  {
   "id": "ldpc",
   "title": "LDPC codes"
  },
  {
   "id": "golf",
   "title": "Code golf"
  }
 ]
}