winter-super-cli 2026.5.15

package/resources/local/claude/plugins/marketplaces/claude-plugins-official/plugins/math-olympiad/skills/math-olympiad/references/solver_heuristics.md

@@ -0,0 +1,135 @@
+# Solver Heuristics (Pólya + Olympiad Practice)
+
+For solver subagents. These are the moves to try when the direct approach
+stalls.
+
+## Pólya's core moves (from "How to Solve It")
+
+**Have you seen a related problem?** Not the same problem — one with the same
+UNKNOWN, or the same STRUCTURE. A problem about covering points with lines has
+the same shape as one about covering lattice points with arithmetic
+progressions.
+
+**Specialize.** If you can't solve the given problem, solve n=3, n=4, n=5 by
+hand. The pattern is often the proof. (But: test past the first nontrivial case
+— n≤3 may be degenerate.)
+
+**Generalize (inventor's paradox).** The more ambitious problem sometimes has
+MORE structure and is easier. "Prove for all primes" might be harder than "prove
+for all integers" if the integer case has a clean induction.
+
+**Drop a condition.** What happens if you relax one hypothesis? Does the result
+become trivially false? Where? That WHERE is often the key step — the point
+where the condition is load-bearing.
+
+**Work backwards.** Start from what you want to prove. What would imply it? What
+would imply THAT? If this chain meets something you can prove directly, you have
+the proof (reversed).
+
+**Auxiliary element.** Introduce something not in the problem — a new variable,
+a reflection, a well-chosen function. Olympiad geometry lives on this (auxiliary
+points, circles).
+
+## Olympiad-specific moves
+
+**Find the invariant.** If there's a process (game, transformation, iteration),
+what quantity is preserved? Parity, sum, product modulo something.
+
+**Find the extremal.** Take the LARGEST, or SMALLEST, or LEFTMOST object.
+Extremal choices often have extra properties that generic choices don't.
+
+**Double count.** Count the same thing two ways. Incidences, edges, sums over
+pairs.
+
+**Coloring / parity.** Can you 2-color the objects so the claim becomes a parity
+statement?
+
+**Smoothing / adjusting.** For inequalities: if you perturb two variables closer
+together (or further apart), does the expression increase or decrease?
+Extremize.
+
+**Symmetry → WLOG.** If the problem is symmetric in x,y,z, you can assume x≤y≤z.
+But only if the conclusion is ALSO symmetric.
+
+## Geometry-specific moves
+
+Standard angles (induction, invariants, extremal) are often wrong-shaped for
+olympiad geometry. Use these instead:
+
+**Coordinate bash.** Place the configuration in coordinates. Choose them to kill
+degrees of freedom (origin at a center, axis along a line). Grind out the
+algebra. Ugly but reliable.
+
+**Auxiliary point.** Introduce a point not in the problem — a reflection, a
+second intersection, the point where two lines "should" meet. Often the key
+construction is finding the right extra point.
+
+**Power of a point.** For any point P and circle ω, PA·PB is the same for every
+line through P meeting ω at A, B. Use it to turn ratios into equalities.
+
+**Spiral similarity / rotation.** Two directly similar triangles are related by
+a spiral similarity (rotation + scaling about a fixed point). Find that point —
+it often lies on a circle you already have.
+
+**Inversion.** When there are many circles or tangencies, invert about a
+well-chosen center. Circles through the center become lines; tangencies become
+simpler tangencies.
+
+**Angle chase.** Cyclic quadrilaterals give equal angles. Tangent-chord gives an
+angle equal to the inscribed angle. Chase around the figure.
+
+## Geometry-specific moves (these are DIFFERENT)
+
+The standard angles (invariant, extremal, induction) don't fit
+circles/circumcenters/orthocenters. Geometry needs:
+
+**Coordinate bash.** Place one point at origin, another on the x-axis. Compute
+everything explicitly. The algebra is heavy but mechanical. For two circles with
+centers M, N and radii r, R: set M=(0,0), N=(d,0), then the intersection points
+have x-coordinate (r²+d²−R²)/2d and everything follows.
+
+**Auxiliary point.** Introduce a point not in the problem — the reflection, the
+foot of a perpendicular, the second intersection. Olympiad geometry lives on
+finding the right extra point.
+
+**Power of a point.** For point P and circle Γ: PA·PB is constant for any line
+through P meeting Γ at A,B. This converts circles to products.
+
+**Inversion.** Circles through the center become lines. Sometimes the inverted
+problem is trivial.
+
+**Angle chasing / cyclic quads.** Four points are concyclic iff opposite angles
+sum to π. Chase angles until enough equalities force concyclicity.
+
+## Recurrence-specific trap
+
+For recurrences like b\_{n+1} = P(b_n) where P is polynomial degree ≥ 2: **b_n
+grows doubly-exponentially**. You cannot compute b_30 exactly — it has trillions
+of digits. Work in ℤ/2^m (or ℤ/p^m) from the start. Prove b_n ≡ r_n (mod 2^m) by
+induction on n, NOT by computing b_n.
+
+## When the answer involves √n or log n
+
+These answers often come from a structure that is NOT the obvious/symmetric one.
+The diagonal, the identity, the "natural" choice frequently gives the WORST
+case, not the best — it clusters the constraint in a way that prevents large
+substructures.
+
+**For pure-reasoning solvers**: Before claiming the symmetric choice is optimal,
+ask "what if I deliberately break the symmetry?" For grid/covering problems:
+what if the gaps are SPREAD OUT instead of clustered? For sequences: what if the
+extremal sequence is NOT constant or linear?
+
+**For deep-mode agents**: Brute-force n=3..8 before theorizing. If the formula
+that fits is n+c√n instead of cn, the structure has √n-sized blocks.
+
+## The Look Back phase (after you have a proof)
+
+- **Can you check it?** Plug in small cases. Does n=3 give what your formula
+  says?
+- **Can you prove it differently?** A second proof is a verification. And often
+  shorter.
+- **Is your bound tight?** If you proved ≤ N and the answer is exactly N, find
+  the extremal case. If you can't, your bound might be loose.
+- **What did you actually use?** Sometimes you used less than all the hypotheses
+  — the real theorem is stronger.

package/resources/local/claude/plugins/marketplaces/claude-plugins-official/plugins/math-olympiad/skills/math-olympiad/references/verifier_patterns.md

@@ -0,0 +1,206 @@
+# Verifier Patterns — Olympiad Subset
+
+For a verifier with **no tools, only reasoning**. Each pattern is a mental check
+you can run on a candidate proof. These are the specific ways proofs go wrong
+that self-verification misses. (Source: 59 patterns from real research sessions;
+these 13 need no grep/fetch/compute.)
+
+Run #18 and #19 after any positive finding. Run #40 on any proof that feels too
+short.
+
+---
+
+### Pattern 4: Would it prove a famous open problem?
+
+**The check**: Specialize the claimed theorem to the most famous object in its
+class (ζ(s), the Ramsey number, the Collatz map). Does the specialization settle
+a known open problem?
+
+**What it catches**: A bound "for all Dirichlet series with property P" that,
+applied to ζ, would prove Lindelöf — the proof treated arithmetic input as
+generic.
+
+**How to run it**: Find the step where the argument uses a generic property.
+Ask: does ζ (or the canonical hard instance) actually have this property? The
+gap is always where it doesn't.
+
+---
+
+### Pattern 5: Outside the hypothesis class
+
+**The check**: For each example claimed to satisfy a theorem, re-derive the
+hypotheses from the definition — don't trust the label.
+
+**What it catches**: "f is entire of order ≤1, so by Thm 3.1…" — but Thm 3.1
+needs f analytic in a _full disk_ around 0; a natural boundary on the imaginary
+axis blocks it.
+
+**How to run it**: Write out the theorem's hypothesis verbatim. For each claimed
+instance, check inclusion from scratch. Watch for near-synonyms ("bounded" vs
+"bounded on the line"; "entire" vs "analytic on a domain").
+
+---
+
+### Pattern 6: Divergent sum behind analytic continuation
+
+**The check**: When a divergent-looking sum is "bounded by ζ(s)" or similar,
+evaluate the bounding function at the boundary of the claimed range.
+
+**What it catches**: "Σ 1/n ≤ ζ(1)" — but ζ(1) is a pole. The analytic
+continuation of a sum is not the sum.
+
+**How to run it**: Mentally substitute the boundary value of the parameter into
+the bounding expression. A pole or ∞ there means the original sum diverges,
+regardless of what the continued function says elsewhere.
+
+---
+
+### Pattern 10: Same keywords, different theorem
+
+**The check**: When a cited theorem has the right _words_ but the fit feels off
+— check pointwise vs averaged, uniform vs a.e., finite vs asymptotic.
+
+**What it catches**: Invoking "Fourier decay ⇒ bound" for a pointwise estimate,
+when the cited decay theorem needs curvature and you only have it on average.
+
+**How to run it**: State precisely what the proof _needs_ (pointwise? for all x?
+with what uniformity?). State what the cited theorem _gives_. Sometimes the
+weaker version is enough and this _closes_ a gap; sometimes the gap is real.
+
+---
+
+### Pattern 17: Test past the first nontrivial block
+
+**The check**: Before accepting a pattern from small cases, identify where the
+structure first becomes nontrivial. Confirm the pattern holds _past_ that
+threshold.
+
+**What it catches**: "Checked m = 1, 2, 3: all blocks have rank 1." But m ≤ 3
+gives only 1×2 blocks — rank 1 is forced. First 2×2 appears at m = 4, and there
+the claim fails.
+
+**How to run it**: Ask "what makes the small cases easy?" Find the parameter
+value where that degeneracy disappears. The claim must survive at least one case
+beyond it.
+
+---
+
+### Pattern 18: Tautological reduction
+
+**The check**: When a reduction chain ends at "estimate X would finish it,"
+substitute the chain's own already-proven identities into X.
+
+**What it catches**: "Suffices to show ∫|P|² ≤ C·H." But the chain itself proved
+∫|P|² = H + 2Re(OD') _exactly_. So X is just the original conjecture plus a
+cosmetic shift — not a reduction.
+
+**How to run it**: Take each identity the chain proved along the way and plug it
+into the "final gap." If you recover the starting conjecture (or something at
+least as strong), the chain went in a circle.
+
+---
+
+### Pattern 19: Derived obstruction vs base obstruction
+
+**The check**: When the same obstruction kills 3+ independent approaches,
+compute the disputed property on the _original_ object — before any reduction.
+
+**What it catches**: "det(Hessian) = 0, ruled surface, decoupling fails" — for
+the phase log(2πm−θ). But the _base_ phase is nθ − t·log(n), and _its_ Hessian
+has det = −1. The obstruction lived in the proxy.
+
+**How to run it**: Name the object the obstruction is _about_. Is it the thing
+you started with, or something a reduction produced? Go back to the start and
+check directly.
+
+---
+
+### Pattern 22: Absolute-sum gives O(K); compute the mean first
+
+**The check**: Before accepting that Σₖ Xₖ = O(1) is "too hard because |Xₖ|
+summed gives O(K)," compute the mean of Xₖ over the varying parameter.
+
+**What it catches**: Weyl equidistribution gives mean(Xₖ) = 0 _exactly_. So Σ Xₖ
+is a fluctuation sum — the target is Var = O(1), and half the conjecture falls
+in one line.
+
+**How to run it**: Separate Xₖ into mean + fluctuation. If
+orthogonality/equidistribution forces the mean to zero, you were never fighting
+K terms of size 1 — you were fighting √K terms (or better). Rewrite the target.
+
+---
+
+### Pattern 23: Formula's scope never stated
+
+**The check**: For any identity used in the proof, ask: was this proved for the
+general case, or for a special case that the author silently generalized?
+
+**What it catches**: "κ₄ = 3d − 1" was derived for 2-piece Cantor sets. The
+proof applies it to an m-piece set, where the real formula involves additive
+energy and can differ by a constant factor.
+
+**How to run it**: Trace the identity to where it was first introduced. What
+were the standing assumptions _there_? Check that those assumptions still hold
+at the point of use.
+
+---
+
+### Pattern 35: Count quantifiers before diagonalizing
+
+**The check**: Before "diagonalize against class C using property P," ask
+whether _certifying_ P is an ∃-statement or a ∀-statement.
+
+**What it catches**: "Find an x not computed by any small circuit" — but
+verifying "no small circuit computes x" is a ∀ over circuits. Your diagonalizer
+is in Σ₂, not NP. (This is _why_ Kannan gives Σ₂ᴾ ⊄ SIZE, not NP ⊄ SIZE.)
+
+**How to run it**: Write the diagonalization as a formula. Count alternations.
+If you need ∀∃ to describe the witness, you've jumped a level in the hierarchy.
+
+---
+
+### Pattern 40: One-line-proof-too-clean
+
+**The check**: Extract the proof's key step as a lemma in _full generality_ —
+not specialized to the objects at hand. Try a 2×2 counterexample to the general
+lemma.
+
+**What it catches**: "rank depends only on monomial support" — but [[1,1],[1,1]]
+has rank 1 and [[1,1],[1,−1]] has rank 2 with the same support. The general
+lemma is false; the specific case holds because sgn(π) = f(S)·g(T) factors.
+_That's_ the real proof.
+
+**How to run it**: If the general lemma dies but the specific conclusion
+survives numerically, there's hidden structure. Find it. The real proof goes
+through _that_, not the false lemma.
+
+---
+
+### Pattern 58: Quantifier direction on domain size
+
+**The check**: Before claiming one statement is "strictly stronger" than another
+because its domain is smaller — check whether the quantifier is ∀ or ∃.
+
+**What it catches**: "∀ S ∈ D, φ(S)" over a _smaller_ D is _weaker_ (fewer
+obligations). "∃ S ∈ D, φ(S)" over smaller D is _stronger_ (fewer candidates).
+Backwards strength claims swap these.
+
+**How to run it**: Say the statement out loud with the quantifier explicit.
+Shrinking the domain under ∀ drops requirements. Shrinking under ∃ drops
+witnesses. Only one direction is "harder."
+
+---
+
+### Pattern 60: Easiest-interpretation trap
+
+**The check**: Before solving, write down 2–3 readings of the problem statement.
+Flag whichever one makes the problem trivial.
+
+**What it catches**: 63 "technically correct" solutions; only 13 "meaningfully
+correct." The gap: solving the easiest grammatically-valid reading instead of
+the intended one. Olympiad problems often _plant_ an easy misreading.
+
+**How to run it**: Ask "under which reading is this a real problem?" If your
+interpretation makes it a one-liner and the problem is worth 7 points, you've
+probably chosen wrong. Solve the hard reading; note the easy one only as a
+remark.

package/resources/local/claude/plugins/marketplaces/claude-plugins-official/plugins/math-olympiad/skills/math-olympiad/scripts/check_latex.sh

@@ -0,0 +1,4 @@
+#!/bin/bash
+# Exit 0 if a LaTeX compiler is available, 1 otherwise.
+# Used by SKILL.md to decide whether to offer PDF compilation.
+command -v pdflatex >/dev/null 2>&1 || command -v xelatex >/dev/null 2>&1

package/resources/local/claude/plugins/marketplaces/claude-plugins-official/plugins/math-olympiad/skills/math-olympiad/scripts/compile_pdf.sh

@@ -0,0 +1,54 @@
+#!/bin/bash
+# Compile a LaTeX proof body into a standalone PDF.
+# Usage: compile_pdf.sh <body.tex> <output_dir>
+# The body.tex should contain just the \begin{document}...\end{document} contents
+# (theorem, proof, lemmas). This script wraps it in a minimal preamble.
+
+set -euo pipefail
+
+BODY="$1"
+OUTDIR="${2:-.}"
+BASENAME=$(basename "$BODY" .tex)
+FULL="$OUTDIR/${BASENAME}_full.tex"
+
+cat > "$FULL" <<'PREAMBLE'
+\documentclass[11pt]{article}
+\usepackage[margin=1.25in]{geometry}
+\usepackage{amsmath, amssymb, amsthm, mathtools}
+\usepackage[shortlabels]{enumitem}
+\usepackage{enumitem}
+\usepackage[colorlinks=true, linkcolor=blue, citecolor=blue]{hyperref}
+
+\theoremstyle{plain}
+\newtheorem{theorem}{Theorem}
+\newtheorem{lemma}[theorem]{Lemma}
+\newtheorem{claim}[theorem]{Claim}
+\newtheorem{proposition}[theorem]{Proposition}
+\newtheorem{corollary}[theorem]{Corollary}
+
+\theoremstyle{definition}
+\newtheorem{definition}[theorem]{Definition}
+\newtheorem{remark}[theorem]{Remark}
+
+\begin{document}
+PREAMBLE
+
+cat "$BODY" >> "$FULL"
+
+cat >> "$FULL" <<'CLOSE'
+\end{document}
+CLOSE
+
+if command -v pdflatex >/dev/null 2>&1; then
+    COMPILER=pdflatex
+elif command -v xelatex >/dev/null 2>&1; then
+    COMPILER=xelatex
+else
+    echo "No LaTeX compiler found" >&2
+    exit 1
+fi
+
+cd "$OUTDIR"
+$COMPILER -interaction=nonstopmode -halt-on-error "${BASENAME}_full.tex" >/dev/null
+$COMPILER -interaction=nonstopmode -halt-on-error "${BASENAME}_full.tex" >/dev/null
+echo "$OUTDIR/${BASENAME}_full.pdf"

package/resources/local/claude/plugins/marketplaces/claude-plugins-official/plugins/mcp-server-dev/.claude-plugin/plugin.json

@@ -0,0 +1,8 @@
+{
+  "name": "mcp-server-dev",
+  "description": "Skills for designing and building MCP servers that work seamlessly with Claude — guides you through deployment models (remote HTTP, MCPB, local), tool design patterns, auth, and interactive MCP apps.",
+  "author": {
+    "name": "Anthropic",
+    "email": "support@anthropic.com"
+  }
+}

package/resources/local/claude/plugins/marketplaces/claude-plugins-official/plugins/mcp-server-dev/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/resources/local/claude/plugins/marketplaces/claude-plugins-official/plugins/mcp-server-dev/README.md

@@ -0,0 +1,32 @@
+# mcp-server-dev
+
+Skills for designing and building MCP servers that work seamlessly with Claude.
+
+## What's inside
+
+Three skills that compose into a full build path:
+
+| Skill | Purpose |
+|---|---|
+| **`build-mcp-server`** | Entry point. Interrogates the use case, picks deployment model (remote HTTP / MCPB / local stdio), picks tool-design pattern, routes to a specialized skill. |
+| **`build-mcp-app`** | Adds interactive UI widgets (forms, pickers, confirm dialogs) rendered inline in chat. Works on remote servers and MCPB bundles. |
+| **`build-mcpb`** | Packages a local stdio server with its runtime so users can install it without Node/Python. For servers that must touch the local machine. |
+
+## How it works
+
+`build-mcp-server` is the front door. It asks what you're connecting to, who'll use it, how big the action surface is, and whether you need in-chat UI. From those answers it recommends one of four paths:
+
+- **Remote streamable-HTTP** (the default recommendation for anything wrapping a cloud API) — scaffolded inline
+- **MCP app** — hands off to `build-mcp-app`
+- **MCPB** — hands off to `build-mcpb`
+- **Local stdio prototype** — scaffolded inline with an MCPB upgrade note
+
+Each skill ships reference files for the parts that don't fit in the main instructions: auth flows (DCR/CIMD), tool-description writing, widget templates, manifest schemas, security hardening.
+
+## Usage
+
+Ask Claude to "help me build an MCP server" and the entry skill will trigger. Or invoke directly:
+
+```
+/mcp-server-dev:build-mcp-server
+```