Structure discovery
Skill cdeust/zetetic-team-subagents/skills/structure-discovery
11 problem-shaped skills backed by 97 sourced reasoning patterns — Curie to Toulmin, as Claude Code agents. Every claim cites its source; a pre-commit gate blocks unsourced constants. Install the gates alone in 30s (zetetic-gates). The only agent system where "I don't know" is a feature.
npx -y skills add cdeust/zetetic-team-subagents --skill structure-discoveryAssembled from the repository path, not quoted from the project. Check it against their README if it does not work.
One thing to look at
- 7 stars7 stars. Stars are a popularity signal and not a quality one, but at this level it is likely that nobody has read this closely except its author, and you would be relying on your own review.
What its author says it does
Copied from the file, not written here
Find the hidden pattern that organizes the mess. Use for "these look related but we can't say how", classification with suspicious gaps, reverse-engineering an undocumented system or format, "is there a symmetry we're not using?", scale-free or fat-tailed data, or generating conjectures from computed special cases.
SKILL.md
3.2 KB, as published. Nobody here has run it
Structure Discovery
Problem shape: many observations, one suspected hidden regularity — an unnamed axis, an unexploited symmetry, an undeciphered format, a topology forced by constraints. The move: make the structure explicit and falsifiable, then let it predict something you haven't seen yet.
Relevant geniuses
| Agent | Use when |
|---|---|
| mendeleev | many known items with a suspected hidden ordering — tabulate, leave explicit gaps, predict the gaps' properties |
| noether | hidden regularity via invariance — find the symmetry group, quotient the search space, treat symmetry breaking as signal |
| kekule | components with known connection constraints, unknown structure — count the bonds and let the count force the shape |
| vonneumann | the problem looks isomorphic to a solved one in another field — find the mapping, import the solution |
| rejewski | black-box system to reconstruct from outputs — structural invariants, exploit the procedure around the algorithm |
| champollion | undeciphered format with a partial parallel (bilingual) sample — anchor known fragments and propagate |
| ventris | no parallel text exists — grid the internal regularities, then test by prediction |
| poincare | qualitative behavior before quantitative solution — topological equivalence, structural stability |
| mandelbrot | pattern repeats across scales; distribution has fat tails being treated as mild randomness |
| ramanujan | need many candidate patterns fast — compute 50+ special cases, conjecture, then mandatory prover handoff (never ship unverified) |
Invocation
- Pick the best-fit agent above. If two or more fit, run
tools/genius-invoker.sh route "<problem>"and take the top ranked match. - Load it:
tools/genius-invoker.sh invoke <agent> "<problem>", then readagents/genius/<agent>.mdin full. - Apply the agent's
<workflow>step by step and answer in its<output-format>. A discovered structure must predict something checkable — a gap's properties, a next case, an invariant — or it is decoration. - ramanujan output is conjecture by definition: chain a prover
(
tools/genius-invoker.sh compose ramanujan lamport -- "<problem>"or hand to dijkstra) before anything ships. - If no shape above matches, use a standard team agent instead.
Refuse when
- The pattern is wanted for a narrative, with no willingness to test its predictions.
- The data is too sparse to distinguish structure from apophenia — say so.