Update to Cryptography Research Skills

{
  "description": "Audit or complete cryptographic proofs, reductions, simulators, and security theorems. Use for proof-validity questions; source edits follow the requested deliverable or existing authorization. Not for prose-only, code-conformance, or PDF reviews.",
  "included_files": [
    {
      "relative_path": "agents/openai.yaml",
      "size_in_bytes": 239
    },
    {
      "relative_path": "references/audit-method.md",
      "size_in_bytes": 9051
    },
    {
      "relative_path": "references/batching-and-release-order.md",
      "size_in_bytes": 4904
    },
    {
      "relative_path": "references/diagnostic-examples.md",
      "size_in_bytes": 5722
    },
    {
      "relative_path": "references/extraction-and-oracles.md",
      "size_in_bytes": 6445
    },
    {
      "relative_path": "references/interface-and-concrete-bound-diagnostics.md",
      "size_in_bytes": 8217
    },
    {
      "relative_path": "references/proof-mode-and-quantifier-traps.md",
      "size_in_bytes": 7166
    },
    {
      "relative_path": "references/reductions-hybrids-and-bounds.md",
      "size_in_bytes": 11588
    },
    {
      "relative_path": "references/repair-and-validation.md",
      "size_in_bytes": 3245
    },
    {
      "relative_path": "references/simulation-composition-and-resources.md",
      "size_in_bytes": 9824
    }
  ],
  "name": "crypto-proof-auditor",
  "skill_md_contents": "---\nname: crypto-proof-auditor\ndescription: Audit or complete cryptographic proofs, reductions, simulators, and security theorems. Use for proof-validity questions; source edits follow the requested deliverable or existing authorization. Not for prose-only, code-conformance, or PDF reviews.\n---\n\n# Crypto Proof Auditor\n\nDetermine whether the conclusion follows under the stated definition, model, and assumptions. Audits are read-only unless edits are also authorized. A completion request authorizes developing the missing argument; edit source files when the requested deliverable or existing session authorization calls for it. Never conceal a gap by silently adding an assumption, weakening the theorem, or changing the construction. Different proof organization or labels alone are not defects.\n\n## Audit workflow\n\n1. Resolve the active theorem, definitions, construction, proof, and source revision. Separate the intended target from the supplied statement and checked argument. Identify imported results you will check and those left unverified.\n2. Fix the theorem's objects, domains, parameter regime, quantifier order, and permitted dependencies. Record the adversary/corruption model, setup and oracle interfaces, compared joint outputs or success event, leakage, assumptions, bound, abort/delivery guarantee, and composition or reuse scope.\n3. Trace each part of the conclusion to the lemmas, calculations, simulators, extractors, or reductions supporting it. Check hypotheses, types, parameter substitutions, model compatibility, efficiency, and accumulated error. A dependency graph is useful for a large proof, not a required deliverable for a local question.\n4. For game or hybrid arguments, check complete experiments, endpoints, each adjacent justification, challenge embedding, the correctly correlated surrounding view, and the final advantage/runtime bound. For simulation, check that every action uses information available at that time. Inspect the actual experiment rather than importing a familiar template.\n5. Test disputed inferences with boundary parameters, adversarial choices, conditioning, schedules, reuse, or small counterexamples as relevant. A counterexample to a step need not refute the theorem; failure to find one is not a proof. Do not call a missing derivation routine until checked.\n6. Compare the established conclusion with the claimed scope. Mathematical proof support, implementation conformance, and empirical evidence are distinct conclusions; tests and builds do not establish a security theorem.\n\n## Read only the needed detail\n\n- [Audit method](references/audit-method.md): dependency tracing, probability, quantifiers, counterexamples, and optional diagnostic examples.\n- [Reductions and bounds](references/reductions-hybrids-and-bounds.md): game hops, hidden challenge keys, bounded rejection, concrete loss, and tightness.\n- [Batching and release order](references/batching-and-release-order.md): conditional field checks, powers of one challenge, ring counterexamples, and delayed verification.\n- [Simulation and composition](references/simulation-composition-and-resources.md): conditional share sampling, adaptive state opening, causality, abort, sessions, and ideal-resource replacement.\n- [Extraction and oracles](references/extraction-and-oracles.md): knowledge claims, commitments, proof systems, Fiat--Shamir, ROM, and QROM.\n- [Repair and validation](references/repair-and-validation.md): authorized completion or edits.\n\nA theory audit requires no implementation or experiments. These references are self-contained; optional writing or implementation skills are useful only when that additional work is requested.\n\n## Report findings\n\nLead with supported findings, ordered by consequence. For each, give the claim and source anchor, failed obligation, evidence, consequence, smallest defensible repair or missing lemma, and residual uncertainty. Scale the format to the question; a fixed worksheet is unnecessary. Identify valid challenged steps as well as invalid ones when adjudicating a disputed inference.\n\nDistinguish **confirmed error** (invalid inference or counterexample), **proof gap** (missing obligation), **unstated assumption**, **scope overclaim**, **ambiguity**, **unverified dependency**, and **presentation issue**. State impact and confidence; keep speculative concerns as questions.\n\nEnd with the strongest supported disposition: theorem refuted by a counterexample satisfying its hypotheses; supplied proof incomplete; only a stated narrower scope established; or no confirmed defect found in the audited surface. State coverage and unchecked dependencies. An outline can contain no identified defect while still failing to discharge the theorem. An informal audit does not certify correctness or constitute machine-checked verification.\n"
}