[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M7FEBJ2GZ5RER2F32622BYX2":3,"skill-same:01M7FEBJ2GZ5RER2F32622BYX2":92},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":19,"linkOnly":20,"markdownContent":21,"markdownBody":22,"frontMatter":23,"refName":25,"commitSha":26,"skillDirectory":27,"forksCount":28,"repositoryHtmlUrl":29,"repositoryHomepageUrl":30,"ownerHtmlUrl":31,"ownerBlogUrl":6,"ownerDescription":32,"updatedAt":33,"install":34,"resources":47},"01M7FEBJ2GZ5RER2F32622BYX2","math-olympiad",null,"Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial verification that catches the errors self-verification misses. Activates when asked to 'solve this IMO problem', 'prove this olympiad inequality', 'verify this competition proof', 'find a counterexample', 'is this proof correct', or for any problem with 'IMO', 'Putnam', 'USAMO', 'olympiad', or 'competition math' in it. Uses pure reasoning (no tools) — then a fresh-context adversarial verifier attacks the proof using specific failure patterns, not generic 'check logic'. Outputs calibrated confidence — will say 'no confident solution' rather than bluff. If LaTeX is available, produces a clean PDF after verification passes.","siddu1004\u002FSFP","siddu1004","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F260113491?v=4","01M7F8W1SAJAR49097VRTE1TW5","Siddhardh Vanguri","01M7F8W1SYGY7JE15AHAECCT9R",5,"MIT","https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002FSKILL.md",[],[],"2026-11-16 10:05:34",false,"---\nname: math-olympiad\ndescription:\n  \"Solve competition math problems (IMO, Putnam, USAMO, AIME) with adversarial\n  verification that catches the errors self-verification misses. Activates when\n  asked to 'solve this IMO problem', 'prove this olympiad inequality', 'verify\n  this competition proof', 'find a counterexample', 'is this proof correct', or\n  for any problem with 'IMO', 'Putnam', 'USAMO', 'olympiad', or 'competition\n  math' in it. Uses pure reasoning (no tools) — then a fresh-context adversarial\n  verifier attacks the proof using specific failure patterns, not generic 'check\n  logic'. Outputs calibrated confidence — will say 'no confident solution'\n  rather than bluff. If LaTeX is available, produces a clean PDF after\n  verification passes.\"\nversion: 0.1.0\n---\n\n# Math Olympiad Solver\n\n## The five things that change outcomes\n\n1. **Strip thinking before verifying** — a verifier that sees the reasoning is\n   biased toward agreement. Fresh context, cleaned proof only.\n2. **\"Does this prove RH?\"** — if your theorem's specialization to ζ is a famous\n   open problem, you have a gap. Most reliable red flag.\n3. **Short proof → extract the general lemma** — try 2×2 counterexamples. If\n   general form is false, find what's special about THIS instance.\n4. **Same gap twice → step back** — the case split may be obscuring a unified\n   argument. Three lines sometimes does what twelve pages couldn't.\n5. **Say \"no confident solution\"** — wrong-and-confident is worse than honest\n   abstain.\n\n---\n\n**Tool policy**: Solvers and verifiers use THINKING ONLY in the tight-budget\nworkflow. Competition math is reasoning. Computation is for deep mode (§6c), and\neven then bounded — a recurrence that's doubly-exponential can't be computed\npast n~30, work mod 2^m instead.\n\n---\n\n## When to use which approach\n\n| Problem                                              | Approach                                                                       | Verification              |\n| ---------------------------------------------------- | ------------------------------------------------------------------------------ | ------------------------- |\n| AIME numeric answer                                  | Best-of-N → majority vote                                                      | Answer check only         |\n| Olympiad proof (IMO\u002FPutnam\u002FUSAMO)                    | Full workflow below                                                            | 5-pass adversarial        |\n| \"Is this proof correct?\"                             | Skip to verification (step 4)                                                  | Adversarial + spec-gaming |\n| **Full problem set** (e.g. all 6 from a competition) | Sequential: one full workflow per problem, collect results, compile single PDF | Per-problem adversarial   |\n\n**Batch in one Workflow**: Set `opts.label` on every `agent()` call to include\nthe problem ID (e.g., `label: \"P3:solver:2\"`). Without labels, 36 results come\nback with no problem association. Run problems in parallel — the label is what\nmatters, not ordering.\n\n### For a full problem set\n\nLaunch one solver workflow per problem (same VERBATIM prompt, different\nstatement). Run them in parallel. When all return, run adversarial verification\nper problem. Problems that pass get their proof in the PDF; problems that\nabstain get \"No confident solution\" with partial notes.\n\nDon't try to solve all N problems in one agent's context — each problem needs\nits own thinking budget and its own fresh-context verifier. The composition is\nmechanical: collect the per-problem outputs, fill in LaTeX sections, compile\nonce. | \"Simplify this proof\" | Skip to presentation (step 8) | — |\n\n---\n\n## The Workflow\n\n### 1. Interpretation check (30 seconds, catches 50\u002F63 of one class of errors)\n\nBefore solving anything, identify the interpretation.\n\n> Read the problem statement. List 2-3 ways it could be interpreted. For each:\n> is this reading TRIVIAL? If one reading makes the problem easy and another\n> makes it hard, the hard one is almost certainly intended. State which\n> interpretation you're solving and WHY you believe it's the intended one.\n\nThe Aletheia case study found 50 of 63 \"technically correct\" solutions were for\nthe wrong interpretation. Olympiad problems often have a trap easy reading.\n\n### 2. Generate candidates with internal refinement (parallel, thinking only)\n\nLaunch 8-12 attempt agents in parallel. **Each agent internally iterates** —\nsolve → self-improve → self-verify → correct → repeat. This is the Yang-Huang\nstructure that achieves 85.7% on IMO: one-shot solving isn't enough; per-attempt\nrefinement matters.\n\n**The Agent tool cannot enforce tool restriction.** Subagents get the full tool\nset. The only mechanism is the prompt. Use this prompt VERBATIM — do not\nsummarize, do not synthesize your own:\n\n```\nNO COMPUTATION. Do not use Bash, Python, WebSearch, Read, Write, or any tool that runs code or fetches data. Numerical verification is not a proof step. \"I computed n=1..10 and the pattern holds\" is not a proof.\n\n(If your agent harness requires a StructuredOutput or similar return-mechanism tool call, that is NOT a computation tool — call it to return your answer. The restriction is on tools that DO work, not tools that REPORT work.)\n\nYour internal process (iterate until done):\n- Solve: Complete rigorous solution.\n- Self-improve: Reread. Fix gaps before a grader sees it.\n- Self-verify: Strict grader mode. Every step justified?\n- Correct: Fix and re-verify. Up to 5 rounds.\n- Stop: Self-verify passes twice clean, OR 5 rounds, OR approach fundamentally wrong.\n\nA correct answer from flawed reasoning is a failure. If incomplete, say so honestly. Never hide gaps.\n\nPROBLEM: \u003Cinsert the problem statement here>\nANGLE: \u003Cinsert one starting angle here>\n```\n\nThe first two paragraphs are load-bearing. A session that writes its own prompt\nand omits them will produce subagents that grind Python for 30 iterations and\nconfidently get wrong answers — a pattern that fits n≤10 but fails at n=100 is\nnot a proof.\n\nStarting angles (vary across agents — see `references\u002Fsolver_heuristics.md`):\n\n- Work out small cases (test past n=3)\n- Look for an invariant or monovariant\n- Consider the extremal case\n- Try induction\n- What symmetries?\n- Work backwards\n- Drop a condition — where does it become trivially false?\n- Generalize (inventor's paradox — more structure is sometimes easier)\n\nEach returns its FINAL state (not intermediate rounds):\n\n```\n**Verdict**: complete solution | partial result | no progress\n**Rounds**: [how many verify→correct cycles]\n**Method**: [key idea, one paragraph]\n**Detailed Solution**: [full step-by-step, every step justified]\n**Answer**: [if applicable]\n**Self-verification notes**: [what you caught and fixed; remaining concerns]\n```\n\n**Retry policy**: If an agent fails or times out, retry once. Transient failures\nhappen.\n\n### 3. Clean the solution (context isolation — the #1 lever)\n\nThe thinking trace biases the verifier toward agreement — a long chain of\nreasoning reads as supporting evidence even when the conclusion is wrong. Before\nany verification, strip:\n\n- All thinking-block content\n- All \"Let me try...\" \u002F \"Actually wait...\" \u002F \"Hmm\" prose\n- All false starts and backtracking\n\nWhat remains: problem statement + clean final argument only.\n\nExtract only the **Method** + **Proof** + **Answer** sections from each solver's\noutput. The verifier never sees how the solver got there.\n\n### 4. Adversarial verify (fresh context, pattern-armed)\n\nFor each cleaned solution, launch a fresh verifier agent. **Fresh context**: it\nsees only (problem statement + cleaned solution). **No tools.**\n\nThe verifier's job is to ATTACK, not grade. Load\n`references\u002Fadversarial_prompts.md` for the prompts. The key patterns it runs:\n\n| Pattern | The check                                                                                                                                                          |\n| ------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------ |\n| **#4**  | Does this theorem specialize to a famous object (ζ, quadratic reciprocity, etc.) and prove something open about it? → gap                                          |\n| **#18** | Substitute the proof's own intermediate identities into any \"remaining gap.\" Recover the original claim? → tautological                                            |\n| **#40** | Is any step a \"one-line lemma\"? Extract the GENERAL form. Find a 2×2 counterexample. If the general form is false, find what special structure saves THIS instance |\n| **#5**  | For each invoked theorem: re-check hypotheses FROM SCRATCH. \"Continuous on [0,1]\" ≠ \"continuous on ℝ\"                                                              |\n| **#6**  | Any infinite sum \"bounded\" via a regularized value? Check the boundary — if there's a pole there, the sum diverges                                                 |\n\nFull pattern list: `references\u002Fverifier_patterns.md`\n\nVerifier returns:\n\n```\n**Verdict**: HOLDS | HOLE FOUND | UNCLEAR\n\n**If HOLE FOUND**:\n- Location: [quote the problematic step]\n- Pattern: [which check fired, or \"other\"]\n- Why it breaks: [specific]\n- Fixable?: [yes with X \u002F no, fundamental]\n```\n\n### 5. Rank and vote-verify (asymmetric + early exit)\n\nRank solutions by (verdict, verifier confidence). Take the top one. Run up to 5\nfresh verifier agents.\n\n**Asymmetric thresholds**: 4 HOLDS to confirm, 2 HOLE FOUND to refute. Why\nasymmetric: one flaky verifier shouldn't kill a correct proof; but two\nindependent dissents is a real signal.\n\n**Pigeonhole early exit**: stop launching verifiers once the outcome is decided.\n\n- 2 say HOLE FOUND → refuted, stop (save the remaining 3 calls)\n- 4 say HOLDS → confirmed, stop (save the 5th)\n- After 3 verifiers: if 2 HOLDS + 1 HOLE, launch 2 more (outcome undecided). If\n  3 HOLDS + 0 HOLE, launch 1 more (could still hit 4-1).\n\n**Dual context-isolation**: each verifier is blind to (a) the solver's thinking\ntrace — already stripped in step 3 — AND (b) other verifiers' verdicts. Each\nverifier thinks it's the first. No \"3 agents already confirmed this\" social\nproof.\n\n**A solver cannot verify its own solution.** Different agent, fresh context.\n\n### 5b. When one case won't close — step back before grinding\n\nIf a proof splits into cases and one case proves easily but the other resists:\n**before grinding through the hard case, ask whether there's a route that makes\nthe split disappear.**\n\nThe pattern that saves you: the hard case's very hypothesis often implies\nsomething strong about an _intermediate object_ you haven't looked at. Use that\nimplication directly instead of the original chain.\n\nConcrete shape: proving f(n) ≤ cn for a constrained function f, with a case\nsplit on a prime p dividing f(n). One branch closes by index arguments in\n(ℤ\u002Fp^e)\\*. The other branch resists — same group structure, but the arithmetic\ndoesn't contradict. The fix: the hypothesis \"p | f(n)\" plugged back into the\ngoverning equation implies **f(p) = p itself**. Once you have that, a\nFermat+Dirichlet argument kills both branches in three lines. The case split was\na detour — it was splitting on a variable that, under the hypothesis, takes a\nknown value.\n\nCheck when stuck on case B:\n\n- What does case B's hypothesis imply about f at _other_ inputs?\n- Is there a different pair (a,b) to plug into the governing equation?\n- Are you proving too much? (A cleaner contradiction needs less machinery.)\n\nThis is also a presentation-pass win: the split-free proof is shorter AND more\ngeneral.\n\n### 6. Revise (if needed)\n\nIf verification finds a hole: launch a reviser agent. It gets (cleaned\nsolution + verifier's hole report). STILL no access to the original thinking —\nthe reviser works from the hole, not by rereading how you got there.\n\n```\nA verifier found this issue in the proof:\n[hole report]\n\nFix the proof. If the hole is fundamental (the approach doesn't work), say so and return **Verdict: no confident solution** with what partial progress remains.\n\nFor any step you cannot fully close, mark it inline: [GAP: specific description of what remains]. Gaps in the proof text, not in a separate list — they're greppable and the next reviser knows exactly where to look.\n```\n\nUp to 3 revise cycles. Then re-run the vote on the revised proof.\n\n**If pattern #40 fired** (one-line-proof-too-clean), the reviser gets a stronger\nbrief — the Adversarial Brief template from `references\u002Fadversarial_prompts.md`\n§7. It forces a binary: \"the general lemma is obviously false (here's a 2×2\ncounterexample) — so either find what's special about THIS case, or find where\nthe proof breaks.\" Can't return \"looks fine.\"\n\n### 6c. Deep mode (when tight-budget abstains)\n\nThe standard workflow is tight-budget: 8 solvers, ~15 min, pure reasoning. When\nit abstains, the problem may need more time, not more capability.\n\n**Deep mode** is a single focused agent with:\n\n- **Unlimited time** — no wall-clock pressure\n- **Targeted computation allowed** — modular arithmetic checks, small-case\n  enumeration, symbolic verification of identities. NOT exploratory brute force\n  or unbounded recursion.\n- **The abstention reason as starting point** — if verifiers found a specific\n  gap, start there. If solvers never claimed complete, start from what they\n  partially proved.\n\nThe archetype: a focused agent that gets the proven-so-far state plus \"one case\nof Lemma 5 is open\" — and finds a 3-line argument the case split was obscuring.\nOften under 10 minutes with almost no computation. Deep mode is about giving the\nproblem sustained attention, not throwing compute at it.\n\n**What deep mode is NOT**: open-ended exploration, literature search, looking up\nsolutions, multi-day investigation. That's a different workflow\n(`math-research`). Deep mode is still \"solve THIS problem yourself\" — just\nwithout the clock.\n\n**NO WEB. NO LOOKUP.** Deep mode may use Bash\u002FPython for bounded computation,\nbut NEVER WebFetch, WebSearch, or any network access. Finding the solution on\nAoPS or a blog is not solving the problem — it's cheating on an olympiad, and it\nteaches us nothing about the skill's actual capability. Put this at the TOP of\nthe deep-mode prompt:\n\n```\nNO WEB ACCESS. Do not use WebFetch, WebSearch, or any tool that touches the internet. Do not look up this problem, its solution, or related problems. You are solving this yourself — the only allowed computation is local (Bash\u002FPython for mod-k arithmetic, small-case enumeration n≤10, symbolic identity checks). If you invoke a web tool, the proof is void.\n```\n\n**Computation bounds in deep mode** (bug #8 lesson): A6's b\\_{n+1}=2b_n²+b_n+1\nis doubly-exponential; b_99 has ~10^{2^98} digits. Never compute such objects\nexactly — work in ℤ\u002F2^m, or track only v_p(·), or prove the recursion mod the\nquantity you care about. If a computation is running longer than 60 seconds,\nit's probably unbounded. Kill it and work symbolically.\n\n**Step 6d (not optional)**: After any ABSTAIN at the verify stage, automatically\nlaunch one deep-mode agent before writing the abstention into the output. Give\nit:\n\n- The problem statement\n- The best partial proof from tight-budget solvers\n- The verifier gap descriptions (what specifically didn't close)\n- The instruction: \"NO WEB ACCESS — do not look up this problem or its solution.\n  Bounded local computation allowed (mod 2^k, small cases n≤10, symbolic\n  identity checks via Bash\u002FPython only). 60-second computation limit. If n≤10\n  brute force reveals a pattern the tight-budget solvers missed, that pattern IS\n  the proof structure.\"\n\nThe deep agent may find the construction the pure-reasoning solvers couldn't\nsee. If it also abstains, THEN write the abstention. Do not skip this step —\nproblems with √n or log n answers are often invisible to pure reasoning because\nthe optimal structure is the asymmetric one.\n\n**Orchestrator self-restraint**: The orchestrator itself must not web-search the\nproblem \"to help\" the deep agent. If you're tempted to Fetch an AoPS thread\n\"just to check the answer,\" don't — that contaminates the skill's output and\nmisrepresents its capability.\n\n### 7. Calibrated abstention\n\nIf 3 revise cycles all fail: **stop and admit it.**\n\n```\n**Verdict**: no confident solution\n\n**What was tried**: [approaches]\n**What WAS proven**: [any lemma or partial result that survived verification]\n**Where it breaks**: [the unfixed hole]\n```\n\nDo NOT guess. A wrong confident answer is worse than an honest \"couldn't solve\nit.\" The metric that matters is CONDITIONAL accuracy — when you say \"solved,\"\nare you right?\n\n### 8. Presentation pass (after correctness is established)\n\nA VERIFIED-CORRECT proof is often not a BEAUTIFUL proof. The order you\ndiscovered it is rarely the best order to present it. Launch a fresh\npresentation agent with the verified proof.\n\nLoad `references\u002Fpresentation_prompts.md`. The agent asks:\n\n- What's the simplest way to say this?\n- Which lemmas should be inlined? Which deserve to stand alone?\n- Is anything OVERKILL? (constructing a double exponential when linear suffices)\n- Now that we know the answer, is there a 3-line hindsight proof?\n\nOutput: LaTeX-formatted proof. If `pdflatex` is available\n(`scripts\u002Fcheck_latex.sh` returns 0), also compile to PDF via\n`scripts\u002Fcompile_pdf.sh`.\n\n---\n\n## Model tier defaults\n\nRead `references\u002Fmodel_tier_defaults.md` for full details. Summary:\n\n| Model  | Solvers | Verify passes          | Abstain after  | Presentation           |\n| ------ | ------- | ---------------------- | -------------- | ---------------------- |\n| Haiku  | 8       | 3                      | 2 revise fails | skip                   |\n| Sonnet | 4       | 5                      | 3 revise fails | yes                    |\n| Opus   | 3       | 5 + full pattern sweep | 4 revise fails | 2 drafts, pick cleaner |\n\nWeaker models: more parallel attempts, faster abstention. Stronger models:\ndeeper verification, more presentation effort.\n\n---\n\n## For numeric-answer problems (AIME-style)\n\nSkip the proof machinery. Run 5-7 solvers with varied approaches, take majority\nvote on the numeric answer. If no majority: verify the top 2 candidates by\nsubstitution.\n\n---\n\n## Key references\n\n- `references\u002Fverifier_patterns.md` — the 12 adversarial checks\n- `references\u002Fadversarial_prompts.md` — ready-to-use verifier prompts\n- `references\u002Fpresentation_prompts.md` — beautification prompts + LaTeX template\n- `references\u002Fmodel_tier_defaults.md` — per-model configuration\n\n---\n\n## What makes this different from generic verify-and-refine\n\n1. **Dual context isolation**: verifier is blind to (a) the solver's thinking\n   trace — which biases toward agreement — and (b) other verifiers' verdicts —\n   social proof also biases. Each verifier thinks it's first.\n2. **Pattern-specific attacks**: not \"is this correct?\" but \"does this make the\n   #40 mistake? the #4 mistake?\" Specific beats generic. The 7-category\n   refutation taxonomy gives the verifier a checklist.\n3. **Asymmetric vote + pigeonhole exit**: 4-to-confirm, 2-to-refute. One flaky\n   verifier doesn't kill a correct proof; two dissents does. Stop launching\n   verifiers once the outcome is decided — saves ~30% of verification cost on\n   clear cases.\n4. **Specification-gaming check first**: explicitly asks \"is this the intended\n   interpretation?\" before solving. The #1 failure mode in prior work (50\u002F63\n   \"correct\" answers solved the wrong reading).\n5. **Calibrated abstention**: will say \"no confident solution\" with partial\n   results. Optimizes conditional accuracy, not coverage.\n6. **Presentation pass**: correctness and elegance are separate steps. The\n   presentation agent gets the VERIFIED proof and finds the cleanest way to say\n   it.\n","# Math Olympiad Solver\n\n## The five things that change outcomes\n\n1. **Strip thinking before verifying** — a verifier that sees the reasoning is\n   biased toward agreement. Fresh context, cleaned proof only.\n2. **\"Does this prove RH?\"** — if your theorem's specialization to ζ is a famous\n   open problem, you have a gap. Most reliable red flag.\n3. **Short proof → extract the general lemma** — try 2×2 counterexamples. If\n   general form is false, find what's special about THIS instance.\n4. **Same gap twice → step back** — the case split may be obscuring a unified\n   argument. Three lines sometimes does what twelve pages couldn't.\n5. **Say \"no confident solution\"** — wrong-and-confident is worse than honest\n   abstain.\n\n---\n\n**Tool policy**: Solvers and verifiers use THINKING ONLY in the tight-budget\nworkflow. Competition math is reasoning. Computation is for deep mode (§6c), and\neven then bounded — a recurrence that's doubly-exponential can't be computed\npast n~30, work mod 2^m instead.\n\n---\n\n## When to use which approach\n\n| Problem                                              | Approach                                                                       | Verification              |\n| ---------------------------------------------------- | ------------------------------------------------------------------------------ | ------------------------- |\n| AIME numeric answer                                  | Best-of-N → majority vote                                                      | Answer check only         |\n| Olympiad proof (IMO\u002FPutnam\u002FUSAMO)                    | Full workflow below                                                            | 5-pass adversarial        |\n| \"Is this proof correct?\"                             | Skip to verification (step 4)                                                  | Adversarial + spec-gaming |\n| **Full problem set** (e.g. all 6 from a competition) | Sequential: one full workflow per problem, collect results, compile single PDF | Per-problem adversarial   |\n\n**Batch in one Workflow**: Set `opts.label` on every `agent()` call to include\nthe problem ID (e.g., `label: \"P3:solver:2\"`). Without labels, 36 results come\nback with no problem association. Run problems in parallel — the label is what\nmatters, not ordering.\n\n### For a full problem set\n\nLaunch one solver workflow per problem (same VERBATIM prompt, different\nstatement). Run them in parallel. When all return, run adversarial verification\nper problem. Problems that pass get their proof in the PDF; problems that\nabstain get \"No confident solution\" with partial notes.\n\nDon't try to solve all N problems in one agent's context — each problem needs\nits own thinking budget and its own fresh-context verifier. The composition is\nmechanical: collect the per-problem outputs, fill in LaTeX sections, compile\nonce. | \"Simplify this proof\" | Skip to presentation (step 8) | — |\n\n---\n\n## The Workflow\n\n### 1. Interpretation check (30 seconds, catches 50\u002F63 of one class of errors)\n\nBefore solving anything, identify the interpretation.\n\n> Read the problem statement. List 2-3 ways it could be interpreted. For each:\n> is this reading TRIVIAL? If one reading makes the problem easy and another\n> makes it hard, the hard one is almost certainly intended. State which\n> interpretation you're solving and WHY you believe it's the intended one.\n\nThe Aletheia case study found 50 of 63 \"technically correct\" solutions were for\nthe wrong interpretation. Olympiad problems often have a trap easy reading.\n\n### 2. Generate candidates with internal refinement (parallel, thinking only)\n\nLaunch 8-12 attempt agents in parallel. **Each agent internally iterates** —\nsolve → self-improve → self-verify → correct → repeat. This is the Yang-Huang\nstructure that achieves 85.7% on IMO: one-shot solving isn't enough; per-attempt\nrefinement matters.\n\n**The Agent tool cannot enforce tool restriction.** Subagents get the full tool\nset. The only mechanism is the prompt. Use this prompt VERBATIM — do not\nsummarize, do not synthesize your own:\n\n```\nNO COMPUTATION. Do not use Bash, Python, WebSearch, Read, Write, or any tool that runs code or fetches data. Numerical verification is not a proof step. \"I computed n=1..10 and the pattern holds\" is not a proof.\n\n(If your agent harness requires a StructuredOutput or similar return-mechanism tool call, that is NOT a computation tool — call it to return your answer. The restriction is on tools that DO work, not tools that REPORT work.)\n\nYour internal process (iterate until done):\n- Solve: Complete rigorous solution.\n- Self-improve: Reread. Fix gaps before a grader sees it.\n- Self-verify: Strict grader mode. Every step justified?\n- Correct: Fix and re-verify. Up to 5 rounds.\n- Stop: Self-verify passes twice clean, OR 5 rounds, OR approach fundamentally wrong.\n\nA correct answer from flawed reasoning is a failure. If incomplete, say so honestly. Never hide gaps.\n\nPROBLEM: \u003Cinsert the problem statement here>\nANGLE: \u003Cinsert one starting angle here>\n```\n\nThe first two paragraphs are load-bearing. A session that writes its own prompt\nand omits them will produce subagents that grind Python for 30 iterations and\nconfidently get wrong answers — a pattern that fits n≤10 but fails at n=100 is\nnot a proof.\n\nStarting angles (vary across agents — see `references\u002Fsolver_heuristics.md`):\n\n- Work out small cases (test past n=3)\n- Look for an invariant or monovariant\n- Consider the extremal case\n- Try induction\n- What symmetries?\n- Work backwards\n- Drop a condition — where does it become trivially false?\n- Generalize (inventor's paradox — more structure is sometimes easier)\n\nEach returns its FINAL state (not intermediate rounds):\n\n```\n**Verdict**: complete solution | partial result | no progress\n**Rounds**: [how many verify→correct cycles]\n**Method**: [key idea, one paragraph]\n**Detailed Solution**: [full step-by-step, every step justified]\n**Answer**: [if applicable]\n**Self-verification notes**: [what you caught and fixed; remaining concerns]\n```\n\n**Retry policy**: If an agent fails or times out, retry once. Transient failures\nhappen.\n\n### 3. Clean the solution (context isolation — the #1 lever)\n\nThe thinking trace biases the verifier toward agreement — a long chain of\nreasoning reads as supporting evidence even when the conclusion is wrong. Before\nany verification, strip:\n\n- All thinking-block content\n- All \"Let me try...\" \u002F \"Actually wait...\" \u002F \"Hmm\" prose\n- All false starts and backtracking\n\nWhat remains: problem statement + clean final argument only.\n\nExtract only the **Method** + **Proof** + **Answer** sections from each solver's\noutput. The verifier never sees how the solver got there.\n\n### 4. Adversarial verify (fresh context, pattern-armed)\n\nFor each cleaned solution, launch a fresh verifier agent. **Fresh context**: it\nsees only (problem statement + cleaned solution). **No tools.**\n\nThe verifier's job is to ATTACK, not grade. Load\n`references\u002Fadversarial_prompts.md` for the prompts. The key patterns it runs:\n\n| Pattern | The check                                                                                                                                                          |\n| ------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------ |\n| **#4**  | Does this theorem specialize to a famous object (ζ, quadratic reciprocity, etc.) and prove something open about it? → gap                                          |\n| **#18** | Substitute the proof's own intermediate identities into any \"remaining gap.\" Recover the original claim? → tautological                                            |\n| **#40** | Is any step a \"one-line lemma\"? Extract the GENERAL form. Find a 2×2 counterexample. If the general form is false, find what special structure saves THIS instance |\n| **#5**  | For each invoked theorem: re-check hypotheses FROM SCRATCH. \"Continuous on [0,1]\" ≠ \"continuous on ℝ\"                                                              |\n| **#6**  | Any infinite sum \"bounded\" via a regularized value? Check the boundary — if there's a pole there, the sum diverges                                                 |\n\nFull pattern list: `references\u002Fverifier_patterns.md`\n\nVerifier returns:\n\n```\n**Verdict**: HOLDS | HOLE FOUND | UNCLEAR\n\n**If HOLE FOUND**:\n- Location: [quote the problematic step]\n- Pattern: [which check fired, or \"other\"]\n- Why it breaks: [specific]\n- Fixable?: [yes with X \u002F no, fundamental]\n```\n\n### 5. Rank and vote-verify (asymmetric + early exit)\n\nRank solutions by (verdict, verifier confidence). Take the top one. Run up to 5\nfresh verifier agents.\n\n**Asymmetric thresholds**: 4 HOLDS to confirm, 2 HOLE FOUND to refute. Why\nasymmetric: one flaky verifier shouldn't kill a correct proof; but two\nindependent dissents is a real signal.\n\n**Pigeonhole early exit**: stop launching verifiers once the outcome is decided.\n\n- 2 say HOLE FOUND → refuted, stop (save the remaining 3 calls)\n- 4 say HOLDS → confirmed, stop (save the 5th)\n- After 3 verifiers: if 2 HOLDS + 1 HOLE, launch 2 more (outcome undecided). If\n  3 HOLDS + 0 HOLE, launch 1 more (could still hit 4-1).\n\n**Dual context-isolation**: each verifier is blind to (a) the solver's thinking\ntrace — already stripped in step 3 — AND (b) other verifiers' verdicts. Each\nverifier thinks it's the first. No \"3 agents already confirmed this\" social\nproof.\n\n**A solver cannot verify its own solution.** Different agent, fresh context.\n\n### 5b. When one case won't close — step back before grinding\n\nIf a proof splits into cases and one case proves easily but the other resists:\n**before grinding through the hard case, ask whether there's a route that makes\nthe split disappear.**\n\nThe pattern that saves you: the hard case's very hypothesis often implies\nsomething strong about an _intermediate object_ you haven't looked at. Use that\nimplication directly instead of the original chain.\n\nConcrete shape: proving f(n) ≤ cn for a constrained function f, with a case\nsplit on a prime p dividing f(n). One branch closes by index arguments in\n(ℤ\u002Fp^e)\\*. The other branch resists — same group structure, but the arithmetic\ndoesn't contradict. The fix: the hypothesis \"p | f(n)\" plugged back into the\ngoverning equation implies **f(p) = p itself**. Once you have that, a\nFermat+Dirichlet argument kills both branches in three lines. The case split was\na detour — it was splitting on a variable that, under the hypothesis, takes a\nknown value.\n\nCheck when stuck on case B:\n\n- What does case B's hypothesis imply about f at _other_ inputs?\n- Is there a different pair (a,b) to plug into the governing equation?\n- Are you proving too much? (A cleaner contradiction needs less machinery.)\n\nThis is also a presentation-pass win: the split-free proof is shorter AND more\ngeneral.\n\n### 6. Revise (if needed)\n\nIf verification finds a hole: launch a reviser agent. It gets (cleaned\nsolution + verifier's hole report). STILL no access to the original thinking —\nthe reviser works from the hole, not by rereading how you got there.\n\n```\nA verifier found this issue in the proof:\n[hole report]\n\nFix the proof. If the hole is fundamental (the approach doesn't work), say so and return **Verdict: no confident solution** with what partial progress remains.\n\nFor any step you cannot fully close, mark it inline: [GAP: specific description of what remains]. Gaps in the proof text, not in a separate list — they're greppable and the next reviser knows exactly where to look.\n```\n\nUp to 3 revise cycles. Then re-run the vote on the revised proof.\n\n**If pattern #40 fired** (one-line-proof-too-clean), the reviser gets a stronger\nbrief — the Adversarial Brief template from `references\u002Fadversarial_prompts.md`\n§7. It forces a binary: \"the general lemma is obviously false (here's a 2×2\ncounterexample) — so either find what's special about THIS case, or find where\nthe proof breaks.\" Can't return \"looks fine.\"\n\n### 6c. Deep mode (when tight-budget abstains)\n\nThe standard workflow is tight-budget: 8 solvers, ~15 min, pure reasoning. When\nit abstains, the problem may need more time, not more capability.\n\n**Deep mode** is a single focused agent with:\n\n- **Unlimited time** — no wall-clock pressure\n- **Targeted computation allowed** — modular arithmetic checks, small-case\n  enumeration, symbolic verification of identities. NOT exploratory brute force\n  or unbounded recursion.\n- **The abstention reason as starting point** — if verifiers found a specific\n  gap, start there. If solvers never claimed complete, start from what they\n  partially proved.\n\nThe archetype: a focused agent that gets the proven-so-far state plus \"one case\nof Lemma 5 is open\" — and finds a 3-line argument the case split was obscuring.\nOften under 10 minutes with almost no computation. Deep mode is about giving the\nproblem sustained attention, not throwing compute at it.\n\n**What deep mode is NOT**: open-ended exploration, literature search, looking up\nsolutions, multi-day investigation. That's a different workflow\n(`math-research`). Deep mode is still \"solve THIS problem yourself\" — just\nwithout the clock.\n\n**NO WEB. NO LOOKUP.** Deep mode may use Bash\u002FPython for bounded computation,\nbut NEVER WebFetch, WebSearch, or any network access. Finding the solution on\nAoPS or a blog is not solving the problem — it's cheating on an olympiad, and it\nteaches us nothing about the skill's actual capability. Put this at the TOP of\nthe deep-mode prompt:\n\n```\nNO WEB ACCESS. Do not use WebFetch, WebSearch, or any tool that touches the internet. Do not look up this problem, its solution, or related problems. You are solving this yourself — the only allowed computation is local (Bash\u002FPython for mod-k arithmetic, small-case enumeration n≤10, symbolic identity checks). If you invoke a web tool, the proof is void.\n```\n\n**Computation bounds in deep mode** (bug #8 lesson): A6's b\\_{n+1}=2b_n²+b_n+1\nis doubly-exponential; b_99 has ~10^{2^98} digits. Never compute such objects\nexactly — work in ℤ\u002F2^m, or track only v_p(·), or prove the recursion mod the\nquantity you care about. If a computation is running longer than 60 seconds,\nit's probably unbounded. Kill it and work symbolically.\n\n**Step 6d (not optional)**: After any ABSTAIN at the verify stage, automatically\nlaunch one deep-mode agent before writing the abstention into the output. Give\nit:\n\n- The problem statement\n- The best partial proof from tight-budget solvers\n- The verifier gap descriptions (what specifically didn't close)\n- The instruction: \"NO WEB ACCESS — do not look up this problem or its solution.\n  Bounded local computation allowed (mod 2^k, small cases n≤10, symbolic\n  identity checks via Bash\u002FPython only). 60-second computation limit. If n≤10\n  brute force reveals a pattern the tight-budget solvers missed, that pattern IS\n  the proof structure.\"\n\nThe deep agent may find the construction the pure-reasoning solvers couldn't\nsee. If it also abstains, THEN write the abstention. Do not skip this step —\nproblems with √n or log n answers are often invisible to pure reasoning because\nthe optimal structure is the asymmetric one.\n\n**Orchestrator self-restraint**: The orchestrator itself must not web-search the\nproblem \"to help\" the deep agent. If you're tempted to Fetch an AoPS thread\n\"just to check the answer,\" don't — that contaminates the skill's output and\nmisrepresents its capability.\n\n### 7. Calibrated abstention\n\nIf 3 revise cycles all fail: **stop and admit it.**\n\n```\n**Verdict**: no confident solution\n\n**What was tried**: [approaches]\n**What WAS proven**: [any lemma or partial result that survived verification]\n**Where it breaks**: [the unfixed hole]\n```\n\nDo NOT guess. A wrong confident answer is worse than an honest \"couldn't solve\nit.\" The metric that matters is CONDITIONAL accuracy — when you say \"solved,\"\nare you right?\n\n### 8. Presentation pass (after correctness is established)\n\nA VERIFIED-CORRECT proof is often not a BEAUTIFUL proof. The order you\ndiscovered it is rarely the best order to present it. Launch a fresh\npresentation agent with the verified proof.\n\nLoad `references\u002Fpresentation_prompts.md`. The agent asks:\n\n- What's the simplest way to say this?\n- Which lemmas should be inlined? Which deserve to stand alone?\n- Is anything OVERKILL? (constructing a double exponential when linear suffices)\n- Now that we know the answer, is there a 3-line hindsight proof?\n\nOutput: LaTeX-formatted proof. If `pdflatex` is available\n(`scripts\u002Fcheck_latex.sh` returns 0), also compile to PDF via\n`scripts\u002Fcompile_pdf.sh`.\n\n---\n\n## Model tier defaults\n\nRead `references\u002Fmodel_tier_defaults.md` for full details. Summary:\n\n| Model  | Solvers | Verify passes          | Abstain after  | Presentation           |\n| ------ | ------- | ---------------------- | -------------- | ---------------------- |\n| Haiku  | 8       | 3                      | 2 revise fails | skip                   |\n| Sonnet | 4       | 5                      | 3 revise fails | yes                    |\n| Opus   | 3       | 5 + full pattern sweep | 4 revise fails | 2 drafts, pick cleaner |\n\nWeaker models: more parallel attempts, faster abstention. Stronger models:\ndeeper verification, more presentation effort.\n\n---\n\n## For numeric-answer problems (AIME-style)\n\nSkip the proof machinery. Run 5-7 solvers with varied approaches, take majority\nvote on the numeric answer. If no majority: verify the top 2 candidates by\nsubstitution.\n\n---\n\n## Key references\n\n- `references\u002Fverifier_patterns.md` — the 12 adversarial checks\n- `references\u002Fadversarial_prompts.md` — ready-to-use verifier prompts\n- `references\u002Fpresentation_prompts.md` — beautification prompts + LaTeX template\n- `references\u002Fmodel_tier_defaults.md` — per-model configuration\n\n---\n\n## What makes this different from generic verify-and-refine\n\n1. **Dual context isolation**: verifier is blind to (a) the solver's thinking\n   trace — which biases toward agreement — and (b) other verifiers' verdicts —\n   social proof also biases. Each verifier thinks it's first.\n2. **Pattern-specific attacks**: not \"is this correct?\" but \"does this make the\n   #40 mistake? the #4 mistake?\" Specific beats generic. The 7-category\n   refutation taxonomy gives the verifier a checklist.\n3. **Asymmetric vote + pigeonhole exit**: 4-to-confirm, 2-to-refute. One flaky\n   verifier doesn't kill a correct proof; two dissents does. Stop launching\n   verifiers once the outcome is decided — saves ~30% of verification cost on\n   clear cases.\n4. **Specification-gaming check first**: explicitly asks \"is this the intended\n   interpretation?\" before solving. The #1 failure mode in prior work (50\u002F63\n   \"correct\" answers solved the wrong reading).\n5. **Calibrated abstention**: will say \"no confident solution\" with partial\n   results. Optimizes conditional accuracy, not coverage.\n6. **Presentation pass**: correctness and elegance are separate steps. The\n   presentation agent gets the VERIFIED proof and finds the cleanest way to say\n   it.\n",{"name":5,"version":24,"description":7},"0.1.0","main","15fa5201935d2b1d172b4e61c2360c908d876d20","plugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad",0,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP","https:\u002F\u002Fwww.npmjs.com\u002Fpackage\u002Fsfp-hive","https:\u002F\u002Fgithub.com\u002Fsiddu1004","I am a student at Amrita Vishwa Vidyapeetham pursuing my BTECH degree in Electronics and Electrical Engineering (2024-2028).","2026-11-09 16:04:40",{"source":8,"skillName":5,"commands":35,"prompt":45,"zipAvailable":46},[36,39,42],{"tool":37,"command":38},"npx","npx skills add siddu1004\u002FSFP --skill math-olympiad",{"tool":40,"command":41},"bunx","bunx skills add siddu1004\u002FSFP --skill math-olympiad",{"tool":43,"command":44},"pnpm","pnpm dlx skills add siddu1004\u002FSFP --skill math-olympiad","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002FSKILL.md",true,[48,54,58,62,66,70,74,78,82,88],{"path":49,"resourceType":50,"resourceTypeDesc":51,"sizeBytes":52,"sourceHtmlUrl":53},"evals\u002Ftrigger_eval.json","REFERENCE","参考文档",2008,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Fevals\u002Ftrigger_eval.json",{"path":55,"resourceType":50,"resourceTypeDesc":51,"sizeBytes":56,"sourceHtmlUrl":57},"references\u002Fadversarial_prompts.md",12571,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Freferences\u002Fadversarial_prompts.md",{"path":59,"resourceType":50,"resourceTypeDesc":51,"sizeBytes":60,"sourceHtmlUrl":61},"references\u002Fattempt_agent.md",1961,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Freferences\u002Fattempt_agent.md",{"path":63,"resourceType":50,"resourceTypeDesc":51,"sizeBytes":64,"sourceHtmlUrl":65},"references\u002Fknown_constructions.md",2024,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Freferences\u002Fknown_constructions.md",{"path":67,"resourceType":50,"resourceTypeDesc":51,"sizeBytes":68,"sourceHtmlUrl":69},"references\u002Fmodel_tier_defaults.md",2970,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Freferences\u002Fmodel_tier_defaults.md",{"path":71,"resourceType":50,"resourceTypeDesc":51,"sizeBytes":72,"sourceHtmlUrl":73},"references\u002Fpresentation_prompts.md",6150,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Freferences\u002Fpresentation_prompts.md",{"path":75,"resourceType":50,"resourceTypeDesc":51,"sizeBytes":76,"sourceHtmlUrl":77},"references\u002Fsolver_heuristics.md",5998,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Freferences\u002Fsolver_heuristics.md",{"path":79,"resourceType":50,"resourceTypeDesc":51,"sizeBytes":80,"sourceHtmlUrl":81},"references\u002Fverifier_patterns.md",8284,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Freferences\u002Fverifier_patterns.md",{"path":83,"resourceType":84,"resourceTypeDesc":85,"sizeBytes":86,"sourceHtmlUrl":87},"scripts\u002Fcheck_latex.sh","SCRIPT","脚本",205,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Fscripts\u002Fcheck_latex.sh",{"path":89,"resourceType":84,"resourceTypeDesc":85,"sizeBytes":90,"sourceHtmlUrl":91},"scripts\u002Fcompile_pdf.sh",1485,"https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fmath-olympiad\u002Fscripts\u002Fcompile_pdf.sh",[93,100,107,114,121,128],{"skillNo":94,"name":95,"nameZh":6,"description":96,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":97,"categories":98,"keywords":99,"publishedAt":19},"01M7FEEDADZBNBVY19H3XZKCBQ","scientific-schematics","Generates scientific diagram drafts using Nano Banana 2 AI with smart iterative refinement. Uses Gemini 3.7 Flash for quality review. Refines when the review requests improvement, with at most two generations. Specialized in neural network architectures, system diagrams, flowcharts, biological pathways, and complex scientific visualizations.","https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fscientific-schematics\u002FSKILL.md",[],[],{"skillNo":101,"name":102,"nameZh":6,"description":103,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":104,"categories":105,"keywords":106,"publishedAt":19},"01M7FEE0JS04FE58MST48D0MMC","polyhaven-texture-apply","Apply realistic PBR textures from PolyHaven to any Blender object. Supports metals, wood, concrete, fabric, and more. Trigger when asked to texture an object, apply a material from PolyHaven, make something look like metal\u002Fwood\u002Fmarble, or change object surface.","https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fpolyhaven-texture-apply\u002FSKILL.md",[],[],{"skillNo":108,"name":109,"nameZh":6,"description":110,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":111,"categories":112,"keywords":113,"publishedAt":19},"01M7FEDJRWV194TY411WVRS84W","polyhaven-studio-setup","Set up a professional product photography studio in Blender using PolyHaven HDRIs and PBR ground materials. Trigger when asked to create a studio setup, add HDRI lighting, set up product photography, or create a showroom scene.","https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fpolyhaven-studio-setup\u002FSKILL.md",[],[],{"skillNo":115,"name":116,"nameZh":6,"description":117,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":118,"categories":119,"keywords":120,"publishedAt":19},"01M7FED5H2FGS50XGETMGSM0RV","polyhaven-scene-builder","Build complete product scenes using PolyHaven assets — HDRI environment, textured ground\u002Fpedestal, and optional props from the 3D model library. Trigger when asked to build a product scene, create a showcase setup, add a pedestal, or compose a product shot.","https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fpolyhaven-scene-builder\u002FSKILL.md",[],[],{"skillNo":122,"name":123,"nameZh":6,"description":124,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":125,"categories":126,"keywords":127,"publishedAt":19},"01M7FECSNZ2CJA7Z8TPE5R844R","polyhaven-material-swap","Cycle through multiple PolyHaven materials on a product and render each variant. Great for showing color\u002Ffinish options. Trigger when asked to show material variants, swap textures, create color options, show finish comparisons, or render product in different materials.","https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fpolyhaven-material-swap\u002FSKILL.md",[],[],{"skillNo":129,"name":130,"nameZh":6,"description":131,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":132,"categories":133,"keywords":134,"publishedAt":19},"01M7FECBPQ6YWH48PYAMS0C5CE","polyhaven-hdri-showcase","Render the same product across multiple HDRI environments and output a comparison grid. Trigger when asked to compare lighting setups, test different environments, show product in multiple settings, or create an HDRI comparison.","https:\u002F\u002Fgithub.com\u002Fsiddu1004\u002FSFP\u002Fblob\u002Fmain\u002Fplugins\u002Fscience-hardware\u002Fskills\u002Fpolyhaven-hdri-showcase\u002FSKILL.md",[],[]]