re0-import
Land handed-over material of any shape (a note, a link, a dump, a correction) in the document of an existing knowledge base that…
When every option on the table is a variation of one route or waits on the same sign-in, approval, person or dependency, list the options that frame already gives, then map working mechanisms from five or more distant domains onto the problem and report the ones the first list
Claude Code
$ npx -y skills add LilMGenius/paperthin --skill crossthink --agent claude-code
Codex
$ npx skills add LilMGenius/paperthin --skill crossthink -a codex -y
Cursor
$ npx skills add LilMGenius/paperthin --skill crossthink -a cursor -y
Gemini CLI
$ npx skills add LilMGenius/paperthin --skill crossthink -a gemini-cli -y
GitHub Copilot
$ npx skills add LilMGenius/paperthin --skill crossthink -a github-copilot -y
OpenCode
$ npx skills add LilMGenius/paperthin --skill crossthink -a opencode -y
Windsurf
$ npx skills add LilMGenius/paperthin --skill crossthink -a windsurf -y
name: crossthink description: "When every option on the table is a variation of one route or waits on the same sign-in, approval, person or dependency, list the options that frame already gives, then map working mechanisms from five or more distant domains onto the problem and report the ones the first list lacked, each with where it breaks. Use when work is stuck inside one frame, when the user asks how another field or industry would solve it, or asks for an analogy that actually transfers. Not for re-reading a decision at a larger scale (macrothink), listing options when no single frame is stuck, or checking claims (factchk)."
List what the problem's own frame already offers, then borrow working mechanisms from distant domains and keep only the ones that list lacked.
A problem stuck in one frame keeps producing variations of one route. A mechanism that already works in another domain can open a route the frame hides, but only when the transfer is operational: the source mechanism is real, the target mapping says who or what does which step here, and the breaks-where names the condition in this setting under which it fails. The run returns the new mechanisms with their breaks-where, or says honestly that the mapping found none.
The mapping does not replace direct generation. On the problems it was tried on, direct generation found more usable mechanisms, and the mapping still found ones direct generation missed, most of them about keeping the work safe while the blocker stands (reconciliation, staging against a stand-in, escalation, findings kept as text).
1. **State the problem and its frame.** Write the goal, the hard constraints, the stated unknowns and the frame that narrows the options now: the route every current option takes and the step it waits on, if any. Keep the problem's facts; drop the session's preferred answer. 2. **List the frame's own options first.** Write the distinct mechanisms the problem already yields directly, one line each: how it works here and what it needs. This list is the baseline the mapping is judged against, so write it before choosing any domain. 3. **Map distant domains until five rows are accepted.** Pick domains far from the problem's field (logistics, biology, law, finance, film, games, hardware, cognitive science, real estate, or others). For each, fill three cells:
4. **Reject what does not transfer.** A row with an empty cell, a mapping that only renames words with no operation behind it, and a source mechanism you cannot state as a working operation (reject it as unverified; this pass does not check sources) go to a rejected list with the reason. 5. **Fold and subtract.** Fold rows that share one working operation into one mechanism; a different domain, vendor, tool, parameter or wording does not make a new one. Move every mechanism already on the step 2 list to the rejected list with the reason `already direct: <its step 2 line>`. What remains is the result. 6. **Report.** Lead with the new mechanisms, each with its domain, target mapping and breaks-where: first those that remove the blocker, then those that limit its damage while it stands. Name the cheapest observation that would confirm or break the first one. Close with the rejected list. Zero new mechanisms is a valid result: say so and keep the step 2 list as the answer.
Before finishing, confirm:
1. The frame and the step 2 list were written before any domain was mapped. 2. At least five rows were accepted. Each has a source mechanism, a target mapping and a concrete breaks-where. 3. No reported mechanism is already on the step 2 list, and rows sharing one operation were folded. 4. Every rejected row, the already-direct ones included, is listed with its reason. 5. The report names one next observation, or states that the mapping added nothing.
The skillbook for recursive self-improvement (RSI).NVIDIA's latest proof, unpacked with timeless engineering.Distilled from the OpenAI harness engineering hackathon winner's zero-touch method.
Land handed-over material of any shape (a note, a link, a dump, a correction) in the document of an existing knowledge base that…
Keep a repository's README for the person deciding whether and how to use it, its AGENTS.md (or a CLAUDE.md read through it) for…
Keep one paperthin install current and loaded once: move an old skills.sh install onto the Claude Code or Codex plugin, clear the…
Consolidate duplicate files or directories into one canonical home after approval, held as an identity by this machine's…
Audit and consolidate a fact that's scattered across places into one canonical source, after approval, and replace the rest with…
Feed what a finished cycle taught back through the sources that produced it: measure the lesson, question the requirements it…
Behavioral guidelines to reduce common LLM coding mistakes. Use when writing, reviewing, or refactoring code to avoid…
Design and build AI agents for any domain. Use when users: (1) ask to "create an agent", "build an assistant", or "design an AI…