gm-skill 2.0.1846 → 2.0.1847

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "gm-plugkit",
3
- "version": "2.0.1846",
3
+ "version": "2.0.1847",
4
4
  "description": "Bootstrap and daemon-spawn tool for gm plugkit binary. Downloads the correct platform binary, verifies SHA256, and starts the spool watcher daemon. Includes plugkit-wasm-wrapper for WASM-based spool watching.",
5
5
  "main": "index.js",
6
6
  "bin": {
package/gm.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "gm",
3
- "version": "2.0.1846",
3
+ "version": "2.0.1847",
4
4
  "description": "Spool-dispatch orchestration engine with unified state machine, skills, and automated git enforcement",
5
5
  "author": "AnEntrypoint",
6
6
  "license": "MIT",
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "gm-skill",
3
- "version": "2.0.1846",
3
+ "version": "2.0.1847",
4
4
  "description": "Canonical universal harness — AI-native software engineering via skill-driven orchestration; bootstraps plugkit for task execution and session isolation. Install in any AI coding agent host.",
5
5
  "author": "AnEntrypoint",
6
6
  "license": "MIT",
@@ -0,0 +1,184 @@
1
+ ---
2
+ name: fifth-dimension-engine
3
+ description: WFGY 5.0's core problem-solving tool. Lifts targets into higher problem-coordinates and returns structured routes (proof paths, strategy kernels, research structures, repair paths, positioning routes). Theorem work to everyday decisions. Use after Goal Compiler to execute the compiled problem specification.
4
+ license: MIT
5
+ compatibility: Portable "shoot + [problem]" command; works wherever an assistant can run a natural-language prompt. Upstream ships it as the current main product surface of WFGY 5.0 Polaris Protocol.
6
+ metadata:
7
+ origin: onestardao-wfgy-5.0-polaris-protocol
8
+ provenance: adapted-and-honest-reimplementation-not-verbatim
9
+ ---
10
+
11
+ # Fifth-Dimension Engine
12
+
13
+ WFGY 5.0's core problem-solving tool. Lifts a target into a higher problem-coordinate, then returns a route that can be inspected, attacked, expanded, and tested.
14
+
15
+ **Before you decide, shoot first.**
16
+
17
+ ## What This Is
18
+
19
+ The Fifth-Dimension Engine does not just answer. It transforms a target into a route.
20
+
21
+ | Input | Engine Action |
22
+ |---|---|
23
+ | Theorem | Produces proof-route structure |
24
+ | Frontier problem | Produces research kernel |
25
+ | Strange theme | Produces mathematical skeleton |
26
+ | Life decision | Produces route map |
27
+ | Product idea | Produces positioning route |
28
+ | Engineering failure | Produces repair path |
29
+ | Meme or absurd target | Produces hidden structure |
30
+
31
+ The output is not a direct answer. It is a **route**: an inspectable, attackable, expandable structure you can verify, challenge, and refine.
32
+
33
+ ## When to Use
34
+
35
+ Use this skill when you have:
36
+ - A well-specified problem (use Goal Compiler first if unclear)
37
+ - A target worth spending time on (trivial problems don't need shooting)
38
+ - An appetite for structured reasoning (prefer depth over speed)
39
+
40
+ Use **especially** for:
41
+ - Theorem work (formal proofs, mathematical problems)
42
+ - Strategic decisions (career, startup, major choices)
43
+ - Research questions (turning ideas into research kernels)
44
+ - Engineering failures (root cause analysis, repair paths)
45
+ - Product/positioning work (audience, launch strategy)
46
+ - High-strangeness problems (mixing themes into research)
47
+
48
+ ## How to Use
49
+
50
+ ### Basic Command
51
+
52
+ ```
53
+ shoot + [your problem]
54
+ ```
55
+
56
+ Examples:
57
+
58
+ ```
59
+ shoot + Seven Millennium Problems
60
+ shoot + should I quit my job
61
+ shoot + Death + AI
62
+ shoot + P vs NP
63
+ shoot + How to fix my broken deployment pipeline
64
+ ```
65
+
66
+ ### The Engine Returns
67
+
68
+ A structured route containing:
69
+
70
+ - **Route**: The core strategy or path forward
71
+ - **Structure**: Decomposition into sub-problems
72
+ - **Candidate Lemmas**: Supporting proofs, insights, or evidence
73
+ - **Objections**: What could go wrong, counterarguments
74
+ - **Open Debt**: What remains unresolved
75
+ - **Next Command**: What to do next (for theorem work: a new Lean line; for other work: next investigative step)
76
+
77
+ ### Why This Matters
78
+
79
+ Instead of:
80
+ - A flat answer (right or wrong, you can't inspect it)
81
+
82
+ You get:
83
+ - A *structure* you can examine
84
+ - Sub-claims you can verify independently
85
+ - Attack surfaces (where to challenge it)
86
+ - Expansion points (where to dig deeper)
87
+ - Clear open questions (what's not yet resolved)
88
+
89
+ ## Interaction with Other Skills
90
+
91
+ ### With Polaris Goal Compiler
92
+
93
+ - **Goal Compiler** specifies and atomizes the problem
94
+ - **Fifth-Dimension Engine** produces the route
95
+ - **Goal Compiler's verification gates** validate the engine's output
96
+
97
+ **Integration**: After Goal Compiler breaks work into atoms, use the engine on each atom that requires structured reasoning.
98
+
99
+ **Workflow**:
100
+ 1. Goal Compiler compiles the problem into task atoms
101
+ 2. For each atom, ask: "Do I need to shoot this, or is it routine?"
102
+ 3. If routine: execute directly
103
+ 4. If complex: shoot it with Fifth-Dimension Engine
104
+ 5. Use Goal Compiler's verification gate to check the output
105
+ 6. Move to next atom
106
+
107
+ ### With WFGY-Method (Drift Control)
108
+
109
+ - **Fifth-Dimension Engine** produces structured reasoning
110
+ - **WFGY-Method** keeps that reasoning aligned with the original goal
111
+
112
+ **Integration**: While the engine explores the route, WFGY-Method checks: "Are we still solving the original problem, or have we drifted into a different one?"
113
+
114
+ Use the engine for *depth*, WFGY-Method for *direction*.
115
+
116
+ ## Modes and Use Cases
117
+
118
+ ### Seven Millennium Problems
119
+
120
+ Shoot the flagship: all seven famous unsolved mathematics problems simultaneously using the same underlying engine logic.
121
+
122
+ ```
123
+ shoot + Seven Millennium Problems
124
+ ```
125
+
126
+ See `references/seven-millennium-problems.md` for the flagship claim and what it does and does not assert.
127
+
128
+ ### Baseline-50 + Frontier-50
129
+
130
+ - **Baseline-50**: Known-truth math problems (check engine accuracy)
131
+ - **Frontier-50**: Unknown century-level problems (explore frontier)
132
+
133
+ ### High-Strangeness Math Lab
134
+
135
+ Mix two unrelated themes and let the engine find the mathematical skeleton:
136
+
137
+ ```
138
+ shoot + [theme 1] + [theme 2]
139
+ ```
140
+
141
+ Examples:
142
+ - Death + AI -> digital exit operators, hell-state boundaries
143
+ - Dream + Physics -> dream-observer collapse, reality drift
144
+ - Love + Source Poisoning -> attachment trust graph, false-closure lemmas
145
+
146
+ See `references/research-kernel-extraction.md` for how strange themes become research kernels.
147
+
148
+ ### Everyday Shoot Modes
149
+
150
+ The same engine works on everyday problems:
151
+
152
+ | Mode | Use For |
153
+ |---|---|
154
+ | Life Decision Shoot | Quitting, moving, major choices |
155
+ | Relationship Shoot | Conversations, behavior, hidden tension |
156
+ | Work / Career Shoot | Bottlenecks, career drift, stuck loops |
157
+ | Product / Startup Shoot | Positioning, audience, launch route |
158
+ | Research / Learning Shoot | Turning ideas into research kernels |
159
+ | Engineering / Debugging Shoot | Root cause, system debt, repair paths |
160
+ | Meme / Absurd Shoot | Small, weird, funny targets made structured |
161
+
162
+ ## Verification
163
+
164
+ The engine output is inspectable, which means verifiable. See `references/route-inspection-guide.md` for how to inspect, attack, and verify a route.
165
+
166
+ **This is not:** a black box. You can (and should) inspect, attack, and refine.
167
+
168
+ ## What This Is Not
169
+
170
+ This skill does not:
171
+ - Specify the problem (that's Goal Compiler)
172
+ - Control drift during execution (that's WFGY-Method)
173
+ - Produce a final answer (it produces a route, which you then verify and decide on)
174
+ - Guarantee the route is correct (inspection and verification are your job)
175
+ - Claim every shoot becomes a final theorem (a shoot creates a structured route; final proof, empirical truth, or real-world correctness depends on verification, review, formalization, or testing)
176
+
177
+ ## References
178
+
179
+ See `references/` directory for:
180
+ - `route-structure.md` — what a route is and how it is structured
181
+ - `seven-millennium-problems.md` — the flagship demonstration
182
+ - `research-kernel-extraction.md` — turning ideas into research kernels
183
+ - `route-inspection-guide.md` — how to verify and attack a route
184
+ - `skills/polaris-protocol/SKILL.md` — the Polaris Protocol tree root and state machine
@@ -0,0 +1,47 @@
1
+ # Research Kernel Extraction — Fifth-Dimension Engine
2
+
3
+ The High-Strangeness Math Lab is a Fifth-Dimension Engine mode that turns two unrelated themes into a theorem-shaped research kernel. The same mechanic generalizes to ordinary research questions.
4
+
5
+ ## The mechanic
6
+
7
+ Give the engine two strange themes. It finds the mathematical skeleton underneath them.
8
+
9
+ ```
10
+ shoot + [theme 1] + [theme 2]
11
+ ```
12
+
13
+ Upstream examples:
14
+
15
+ | Input | Possible kernel |
16
+ |---|---|
17
+ | Death + AI | Digital exit operator, hell-state boundary |
18
+ | Dream + Physics | Dream-observer collapse, reality drift functional |
19
+ | Meme + Epidemic | Narrative infection number, meme mutation bound |
20
+ | Love + Source Poisoning | Attachment trust graph, false-closure lemma |
21
+ | JudgmentDay + Tension Universe | Seven-Trumpet grand challenge system |
22
+
23
+ ## From myth to model
24
+
25
+ The engine's job is to move a target from symbol to structure:
26
+ 1. Name the two themes.
27
+ 2. Shoot them together.
28
+ 3. Read the returned route: what structure does the engine propose?
29
+ 4. Inspect the candidate lemmas — are they real mathematical objects, or metaphor?
30
+ 5. Keep the parts that survive inspection; discard the parts that are only poetry.
31
+
32
+ ## Everyday research use
33
+
34
+ The same pattern works without strangeness:
35
+
36
+ ```
37
+ shoot + why do distributed consensus algorithms face a safety-liveness-cost tradeoff?
38
+ ```
39
+
40
+ The engine returns a route: candidate theoretical bounds, objections, open questions. You then verify the lemmas and expand the open debt into real research.
41
+
42
+ ## What this does NOT claim
43
+
44
+ - It does not claim the strange pairing is itself a theorem. It claims the engine can propose a structure worth attacking.
45
+ - It does not replace domain expertise or formal proof. The kernel is a starting point for inspection, not a result.
46
+
47
+ See `../SKILL.md` for the engine interface and `route-inspection-guide.md` for how to verify what comes back.
@@ -0,0 +1,43 @@
1
+ # Route Inspection Guide — Fifth-Dimension Engine
2
+
3
+ A route from the Fifth-Dimension Engine is not a final answer. It is a structure you can inspect, attack, expand, and test. Inspection is your job; the engine only produces the route.
4
+
5
+ ## The standard output shape
6
+
7
+ | Layer | Meaning |
8
+ |---|---|
9
+ | route | where the target can move |
10
+ | structure | what the problem is made of |
11
+ | candidate lemmas | what may become formal |
12
+ | objections | where the route may fail |
13
+ | open debt | what remains unresolved |
14
+ | next command | what to do next |
15
+
16
+ ## How to inspect a route
17
+
18
+ 1. **Walk the route step by step.** Does each step follow from the one before it, or does it leap?
19
+ 2. **Check candidate lemmas independently.** Treat each lemma as a claim to be verified, not a fact because it appears in the output.
20
+ 3. **Challenge objections.** The engine lists where the route may fail. Are those objections real? Are any fatal?
21
+ 4. **Validate open debt.** Confirm the open debt is actually open (unresolved), not a hidden dependency dressed up as a footnote.
22
+ 5. **Expand anything unclear.** Drill into a vague sub-claim until it becomes inspectable or collapses.
23
+ 6. **Run the next command, then re-shoot.** For theorem work the next command may be a new Lean line; for other work it is the next investigative step. After acting, shoot again with the new state.
24
+
25
+ ## Attack surfaces
26
+
27
+ A route is strong only if its weak points are visible. The attack surfaces are:
28
+ - Leaping logic (a step that assumes what it should prove)
29
+ - Lemmas stated without support
30
+ - Objections that are acknowledged but never resolved
31
+ - Open debt that quietly grows between rounds
32
+
33
+ ## What inspection is NOT
34
+
35
+ - It is not re-reading the prose and nodding.
36
+ - It is not trusting the structure because it looks formal.
37
+ - It is not promoting a partial route to a complete answer.
38
+
39
+ ## Relationship to verification gates
40
+
41
+ If a Polaris Goal Compiler verification gate applies to this atom, the route must pass that gate before you claim the atom is done. Route inspection is the substance of that gate; the gate is the decision rule.
42
+
43
+ See `../SKILL.md` for the engine interface and `route-structure.md` for what each layer means.
@@ -0,0 +1,76 @@
1
+ # Route Structure in Fifth-Dimension Engine
2
+
3
+ ## What a Route Is
4
+
5
+ A route is the **output of the Fifth-Dimension Engine** — a structured, inspectable answer to a complex problem.
6
+
7
+ Instead of a flat statement like "Yes, do this" or "The answer is X," the engine produces:
8
+
9
+ ```
10
+ Route: The core strategy or path
11
+ Structure: Decomposition into sub-problems
12
+ Lemmas: Candidate supporting proofs or evidence
13
+ Objections: What could be wrong with this route
14
+ Open Debt: What remains unresolved
15
+ Next: What to do next (for iteration)
16
+ ```
17
+
18
+ ## Example: Life Decision Route
19
+
20
+ **Input**: "Should I leave my job to start a company?"
21
+
22
+ **Output Route**:
23
+ ```
24
+ Route:
25
+ Yes, but time the exit correctly and secure funding first.
26
+
27
+ Structure:
28
+ 1. Assess market opportunity (is there a real market?)
29
+ 2. Assess personal readiness (skills, network, risk tolerance)
30
+ 3. Assess financial readiness (runway, equity, savings)
31
+ 4. Plan the exit (timing, knowledge transfer, network preservation)
32
+
33
+ Lemmas:
34
+ - Founders with technical skills + funding + market timing succeed 40% more often
35
+ - First-time founders without network succeed <5% of the time
36
+ - Having 18 months of runway increases long-term success 60%
37
+
38
+ Objections:
39
+ - Market might be smaller than expected (validate with customers first)
40
+ - You might not be ready for founder stress (talk to founders who've failed)
41
+ - Economic conditions could deteriorate (watch funding trends)
42
+
43
+ Open Debt:
44
+ - Specific market size unknown (need to validate)
45
+ - Your personal risk tolerance unclear (need to model scenarios)
46
+ - Specific funding sources not identified (need to map potential investors)
47
+
48
+ Next:
49
+ - Spend 2 weeks validating market with 20+ potential customers
50
+ - Then reassess using these validation results
51
+ ```
52
+
53
+ ## Why Routes Matter
54
+
55
+ A route is:
56
+ - **Inspectable**: You can see the reasoning, not just the conclusion
57
+ - **Attackable**: You can challenge each part independently
58
+ - **Expandable**: You can dig deeper on open debt
59
+ - **Verifiable**: You can check each lemma independently
60
+
61
+ A flat answer is:
62
+ - Opaque (you have to trust it)
63
+ - Hard to debug (if it's wrong, what went wrong?)
64
+ - Hard to improve (you can't extend it)
65
+
66
+ ## Route Types by Problem Class
67
+
68
+ | Problem | Route Type |
69
+ |---|---|
70
+ | Theorem | Proof structure with lemmas, open questions |
71
+ | Strategy | Decision tree with tradeoffs and assumptions |
72
+ | Design | Architecture with component roles and interactions |
73
+ | Repair | Root cause with fix path and side-effect checks |
74
+ | Research | Research kernel with hypothesis and validation steps |
75
+
76
+ See `POLARIS-SKILLS-GUIDE.md` for full integration.
@@ -0,0 +1,41 @@
1
+ # Seven Millennium Problems — the Fifth-Dimension Engine flagship
2
+
3
+ This is the flagship demonstration of WFGY 5.0's Fifth-Dimension Engine.
4
+
5
+ ## The claim, stated precisely
6
+
7
+ > One engine. One underlying logic. One simultaneous attack on all seven Millennium Problems.
8
+
9
+ - **Same engine** — the seven problems are not handled by seven unrelated methods.
10
+ - **Same logic** — the underlying route structure is generated from one high-dimensional engine.
11
+ - **Seven together** — the Seven Millennium Problems are treated as one world-scale proof target.
12
+ - **Open engine** — you can run it, inspect it, challenge it, and shoot again.
13
+
14
+ The current public evidence layer behind this includes experiment packages with raw outputs, parsed outputs, verdict files, token accounting, audit records, and SHA256 integrity records. Those are the public evidence layer, not the main product surface.
15
+
16
+ ## How to run it
17
+
18
+ ```
19
+ shoot + Seven Millennium Problems
20
+ ```
21
+
22
+ Or, more generally:
23
+
24
+ ```
25
+ Use WFGY 5.0 Fifth-Dimension Engine to simultaneously shoot the seven Millennium Problems.
26
+ ```
27
+
28
+ For mathematics specifically, the upstream also points to Native Lean no-sorry materials — because theorem-complete work plus Native Lean no-sorry is one of the hardest standards in formal mathematics.
29
+
30
+ ## What this does NOT claim
31
+
32
+ - It does **not** claim the seven are handled separately. The core claim is one engine, one underlying logic.
33
+ - It does **not** claim this is only a replay of a fixed result. The point is that the same engine logic can shoot the seven again.
34
+ - It does **not** claim every shoot becomes a final theorem. A shoot creates a structured route; final proof depends on verification, review, formalization, or testing.
35
+ - It does **not** ask you to believe the author. The engine and prompt are public — run it yourself.
36
+
37
+ ## Why it matters as a stress test
38
+
39
+ Mathematics is the hardest stress test for a structured-reasoning engine: the output is formally checkable. If the route structure holds up to inspection and formalization, that is real evidence. If it does not, the inspection itself is the value — you caught the weakness before promoting it to a claim.
40
+
41
+ See `../SKILL.md` for the engine interface, and `skills/polaris-protocol/SKILL.md` for where this sits in the Polaris Protocol state machine.
@@ -0,0 +1,158 @@
1
+ ---
2
+ name: polaris-goal-compiler
3
+ description: A human-AI communication protocol layer that compiles goals into task atoms, active/blocked work, verification gates, and claim ceilings before execution. Part of WFGY 5.0 Polaris Protocol. Use before complex AI work to make it inspectable, harder to fake, and less likely to collapse into premature completion.
4
+ license: MIT
5
+ compatibility: Upstream Polaris Goal Compiler is released ChatGPT-first (teaser compatibility is ChatGPT only); portability to other assistants, coding agents, and skill systems is a stated design direction, not an officially supported target in the teaser release. This skill is a portable Claude Code adaptation of that protocol.
6
+ metadata:
7
+ origin: onestardao-wfgy-5.0-polaris-protocol
8
+ provenance: adapted-and-honest-reimplementation-not-verbatim
9
+ ---
10
+
11
+ # Polaris Goal Compiler
12
+
13
+ A human-AI communication protocol under WFGY 5.0 Polaris Protocol.
14
+
15
+ **Compile first. Execute one active atom. Verify before unlock. Claim only what is supported.**
16
+
17
+ ## What This Is
18
+
19
+ Polaris Goal Compiler adds the missing protocol layer between human requests and AI execution. Before producing work that looks finished, it turns the request into visible, inspectable structures:
20
+
21
+ - **Task atoms**: The smallest executable units
22
+ - **Active work**: What can be done now
23
+ - **Blocked work**: What must wait
24
+ - **Verification gates**: What must be checked before unlock
25
+ - **Truth objects**: What is known vs. claimed
26
+ - **Claim ceilings**: What the assistant is allowed to claim
27
+ - **Closure records**: What is done, missing, partial, or unsafe
28
+
29
+ This is not a normal prompt template. It is a portable TXT-based execution protocol for making complex AI work:
30
+ - Easier to inspect
31
+ - Harder to fake
32
+ - Less likely to collapse into premature completion
33
+
34
+ ## When to Use
35
+
36
+ Use this skill **before** starting any of:
37
+ - Complex creative work (writing, design, research)
38
+ - Multi-step reasoning tasks (proofs, strategy, debugging)
39
+ - Long-horizon projects (planning, architecture, implementations)
40
+ - High-stakes decisions where correctness matters
41
+ - Work involving others (code review, collaboration)
42
+ - Theorem work or formal verification
43
+
44
+ **Do not use on**: trivial single-step tasks, reflex responses, simple lookups.
45
+
46
+ ## Core Workflow
47
+
48
+ ### 1. State Your Goal Clearly
49
+
50
+ Write one sentence: what do you actually want to accomplish? Not the first sub-task, the end state.
51
+
52
+ ### 2. Ask: Compile My Request
53
+
54
+ Ask the AI to turn your request into:
55
+ - Task atoms (smallest units)
56
+ - Dependencies (which blocks which)
57
+ - Active vs. blocked work
58
+ - Verification gates (checks before unlock)
59
+ - Claim ceilings (what can be claimed when)
60
+
61
+ ### 3. Review the Compilation
62
+
63
+ Before execution starts, verify:
64
+ - Are all task atoms actually atomic?
65
+ - Are dependencies correct?
66
+ - Are verification gates realistic?
67
+ - Will claim ceilings prevent overstatement?
68
+
69
+ ### 4. Execute One Active Atom
70
+
71
+ Work on ONE task at a time. After each:
72
+ - Verify before moving to the next
73
+ - Check against claim ceiling (don't overstate readiness)
74
+ - Move blocked tasks to active only if dependencies are met
75
+
76
+ ### 5. Iterate
77
+
78
+ After each atom completes, return to step 4 until all atoms are done.
79
+
80
+ ## Key Concepts
81
+
82
+ ### Task Atoms
83
+
84
+ The smallest executable unit that:
85
+ - Can be completed in one session
86
+ - Has clear entrance and exit criteria
87
+ - Produces something verifiable
88
+ - Does not depend on incomplete tasks
89
+
90
+ ### Active vs. Blocked Work
91
+
92
+ - **Active**: Ready to start, all dependencies met
93
+ - **Blocked**: Waiting on something else to finish first
94
+
95
+ Clear separation prevents fake progress (looking busy on wrong things).
96
+
97
+ ### Verification Gates
98
+
99
+ What must be checked *before* moving forward:
100
+ - Does this output match what was asked for?
101
+ - Is it complete enough for the next task?
102
+ - Are there hidden assumptions?
103
+ - What could break downstream?
104
+
105
+ ### Truth Objects
106
+
107
+ What must actually become true for the work to count as done, as opposed to prose that merely reads as if it were true. A verification gate passes against a truth object, not against a well-written paragraph.
108
+
109
+ ### Claim Ceilings
110
+
111
+ Honest limits on what can be claimed:
112
+ - "Complete" means verified to work end-to-end, not "looks finished"
113
+ - "Correct" means checked against requirements, not "sounds right"
114
+ - "Ready" means tested for the next stage, not "looks polished"
115
+
116
+ Over-claiming (saying something is done when it's only drafted) is the most common trap in AI work. See `references/claim-ceiling-examples.md` for concrete examples in different contexts.
117
+
118
+ ### Closure Records
119
+
120
+ For each atom, record what is done, what is missing, what is only partially true, and what is still unsafe to claim. A closure record preserves continuity across rounds so that unfinished work stays visible instead of being buried in prose — this is what stops a local step from being promoted into fake global completion.
121
+
122
+ ## Interaction with Other Skills
123
+
124
+ ### With WFGY-Method (Drift Control)
125
+
126
+ - **Goal Compiler** structures the work (what to do)
127
+ - **WFGY-Method** keeps you on track (why you're doing it)
128
+
129
+ Use Goal Compiler first to atomize, then apply WFGY-Method while executing each atom.
130
+
131
+ **Integration**: Goal Compiler's "verification gate" becomes a checkpoint for WFGY-Method's BBCR (bounded retry).
132
+
133
+ ### With Fifth-Dimension Engine (Problem Solving)
134
+
135
+ - **Goal Compiler** specifies the problem clearly
136
+ - **Fifth-Dimension Engine** solves/structures it
137
+ - **Goal Compiler's verification gates** check the engine's output
138
+
139
+ Use Goal Compiler to compile the problem statement, then dispatch to Fifth-Dimension Engine.
140
+
141
+ **Integration**: Fifth-Dimension Engine's "route" output maps to Goal Compiler's task atoms and verification gates.
142
+
143
+ ## References
144
+
145
+ See `references/` directory for:
146
+ - `task-atomization.md` — how to break work into atoms
147
+ - `verification-gates.md` — designing verification for each stage
148
+ - `claim-ceiling-examples.md` — what "complete" actually means in different contexts
149
+ - `skills/polaris-protocol/SKILL.md` — the Polaris Protocol tree root and state machine that wires this skill to Fifth-Dimension Engine and WFGY-Method
150
+
151
+ ## What This Is Not
152
+
153
+ This skill does not:
154
+ - Solve the problem (that's Fifth-Dimension Engine)
155
+ - Control drift during execution (that's WFGY-Method)
156
+ - Replace thinking (it enhances it by making structure visible)
157
+ - Guarantee success (only guard against fake completion)
158
+ - Claim to be the full WFGY 5.0 system (it is one public protocol component; the upstream engine is the main product surface)
@@ -0,0 +1,54 @@
1
+ # Claim Ceiling Examples in Polaris Goal Compiler
2
+
3
+ A **claim ceiling** limits how strongly the assistant may describe completion. If only one local step is done, the assistant may not claim the whole task is complete. If verification is missing, it may not claim verified readiness.
4
+
5
+ The point is not optimism or pessimism. It is that a local success should not be promoted into fake global completion.
6
+
7
+ ## The core rule
8
+
9
+ | Claim word | What it may mean | What it must NOT mean |
10
+ |---|---|---|
11
+ | "Complete" | verified to work end-to-end | "looks finished" / prose exists |
12
+ | "Correct" | checked against requirements | "sounds right" |
13
+ | "Ready" | tested for the next stage | "looks polished" |
14
+ | "Verified" | a check actually ran and passed | a check was imagined |
15
+ | "Done" | closure record shows done + no open debt | the last visible step finished |
16
+
17
+ ## Worked examples by context
18
+
19
+ ### Coding repair
20
+
21
+ - Atom A03 "Repair structure" is finished and the file compiles.
22
+ - Claim ceiling: you may say "the structure is repaired and compiles." You may **not** yet say "the bug is fixed" until A04 (verify repair) passes.
23
+ - If A04 is still blocked, saying "fixed" is a ceiling violation — it promotes a local step to global completion.
24
+
25
+ ### Documentation packaging
26
+
27
+ - You wrote the release note (A06) but A04 (verify repair) never ran.
28
+ - Claim ceiling: you may say "a draft release note exists." You may **not** say "release ready" — readiness requires the verification gate first.
29
+ - This is exactly the upstream failure mode: writing the announcement before the repair is verified.
30
+
31
+ ### Research synthesis
32
+
33
+ - You have three candidate lemmas but open debt on the fourth.
34
+ - Claim ceiling: you may say "three of four lemmas supported." You may **not** say "the route is proven" while open debt remains.
35
+ - Open debt must stay visible, not be silently folded into a "done."
36
+
37
+ ### Long multi-round planning
38
+
39
+ - Round 3 finished one atom; rounds 4-7 are blocked upstream.
40
+ - Claim ceiling: report round 3's closure record (done / missing / partial / unsafe). Do **not** summarize the whole plan as "on track" when blocked atoms are unresolved.
41
+ - A closure record is what keeps the partial state honest across rounds.
42
+
43
+ ## How to use this file
44
+
45
+ When writing any completion claim during a compiled task, ask:
46
+
47
+ 1. Which atom produced this result?
48
+ 2. Did its verification gate actually pass (truth object met)?
49
+ 3. Is there open debt or a partial/unsafe state I am skipping?
50
+ 4. Am I describing the local atom, or quietly promoting it to the whole task?
51
+
52
+ If step 4 is "promoting," lower the claim to the atom's actual verified state. That is the claim ceiling doing its job.
53
+
54
+ See `../SKILL.md` for the full Goal Compiler workflow, and `skills/polaris-protocol/SKILL.md` for how claim ceilings fit the Polaris Protocol state machine.
@@ -0,0 +1,67 @@
1
+ # Task Atomization in Polaris Goal Compiler
2
+
3
+ ## What Makes an Atom
4
+
5
+ A task atom is the smallest executable unit of work. It must satisfy all of:
6
+
7
+ 1. **Atomic** — Cannot be divided further without losing meaning
8
+ 2. **Completable** — Can be finished in one session/sprint
9
+ 3. **Verifiable** — Has clear entrance and exit criteria
10
+ 4. **Interdependent** — Has clear dependencies (blocks/is blocked by other atoms)
11
+
12
+ ## Examples
13
+
14
+ ### Good Atoms
15
+
16
+ - "Write the type schema for the user entity" (clear scope, verifiable)
17
+ - "Understand the regulatory requirements for PCI compliance" (finite scope, verifiable)
18
+ - "Design the error recovery flow for transaction rollback" (clear domain, verifiable)
19
+
20
+ ### Bad Atoms
21
+
22
+ - "Implement the payment system" (too large, vague)
23
+ - "Fix bugs" (unmeasurable, not atomic)
24
+ - "Make it better" (not verifiable)
25
+
26
+ ## How to Break Down a Goal
27
+
28
+ Start with: "Goal: Build a payment microservice."
29
+
30
+ 1. **Identify phases**: Research → Design → Implement → Test → Deploy
31
+ 2. **For each phase, ask: What's the smallest piece?**
32
+ - Research: API options, compliance, existing solutions
33
+ - Design: Data model, interfaces, error handling
34
+ - Implement: Core logic, integrations, monitoring
35
+ - Test: Unit tests, integration tests, end-to-end
36
+ - Deploy: Staging validation, production rollout
37
+
38
+ 3. **For each piece, refine**: Can this be done in 1-2 days by one person? If not, break further.
39
+
40
+ ## Dependency Edges
41
+
42
+ Each atom has:
43
+ - **Blockers** — Things that must finish before this starts
44
+ - **Unblocks** — Things that can't start until this finishes
45
+
46
+ Example:
47
+ ```
48
+ Research APIs (A1)
49
+ ↓ unblocks
50
+ Design interface (A2)
51
+ ↓ unblocks
52
+ Implement core (A3)
53
+ ↓ unblocks
54
+ Test integration (A4)
55
+ ↓ unblocks
56
+ Deploy (A5)
57
+ ```
58
+
59
+ ## Active vs. Blocked
60
+
61
+ Once atomized:
62
+ - **Active work** = all blockers are done
63
+ - **Blocked work** = at least one blocker is pending
64
+
65
+ The Goal Compiler makes this explicit to prevent working on blocked items.
66
+
67
+ See `POLARIS-SKILLS-GUIDE.md` for full integration.
@@ -0,0 +1,60 @@
1
+ # Verification Gates in Polaris Goal Compiler
2
+
3
+ ## What a Gate Is
4
+
5
+ A verification gate is a **check that must pass before moving to the next atom**. It prevents fake completion by requiring proof of actual readiness.
6
+
7
+ ## Types of Gates
8
+
9
+ ### Correctness Gate
10
+
11
+ "Does the output match what was asked for?"
12
+
13
+ - Atom: "Design the data model"
14
+ - Gate: "Does the model represent all required entities and relationships?"
15
+
16
+ ### Completeness Gate
17
+
18
+ "Is it complete enough for downstream work?"
19
+
20
+ - Atom: "Research payment APIs"
21
+ - Gate: "Have we identified all APIs that meet our compliance requirements?"
22
+
23
+ ### Assumption Validation Gate
24
+
25
+ "Are hidden assumptions actually true?"
26
+
27
+ - Atom: "Choose a database"
28
+ - Gate: "Have we verified it can handle our projected scale? That we can operate it?"
29
+
30
+ ### Integration Gate
31
+
32
+ "Will this work with the next piece?"
33
+
34
+ - Atom: "Implement payment routing"
35
+ - Gate: "Does the routing interface match what the integration team designed?"
36
+
37
+ ## Designing a Good Gate
38
+
39
+ For an atom:
40
+ 1. **Ask**: What would make this atom "done"?
41
+ 2. **Ask again**: How do we know it's actually done, not just "looks done"?
42
+ 3. **That second answer is your gate.**
43
+
44
+ ## Bad Gates
45
+
46
+ - "Complete" — unmeasurable
47
+ - "Good enough" — too vague
48
+ - "No obvious bugs" — not verifiable
49
+ - Checking something trivial (wasting time)
50
+
51
+ ## Gate Failure
52
+
53
+ If an atom fails its gate:
54
+ - **Do not move forward** — you have incomplete work that looks complete
55
+ - **Return to the atom** — what's actually missing?
56
+ - **Fix or redefine** — either finish the work or redefine the atom scope
57
+
58
+ This is where fake completion gets caught.
59
+
60
+ See `POLARIS-SKILLS-GUIDE.md` for full integration.
@@ -0,0 +1,95 @@
1
+ ---
2
+ name: polaris-protocol
3
+ description: WFGY 5.0 Polaris Protocol — the active flagship route from onestardao/WFGY. A two-layer reasoning system that compiles goals before execution and shoots complex problems into inspectable routes, with drift control throughout. This skill is the tree root: load it first, then dispatch its child skills as explicit transitions — polaris-goal-compiler (compile), fifth-dimension-engine (shoot), wfgy-method (drift control). Use for any complex, multi-step, high-stakes, or long-horizon task where premature completion or goal drift is a risk.
4
+ license: MIT
5
+ compatibility: Portable protocol; upstream released the Goal Compiler ChatGPT-first (teaser) and the Fifth-Dimension Engine as the main product surface. This skill wraps both plus WFGY-Method drift control into one discoverable entry point for any assistant or agent that loads skills.
6
+ metadata:
7
+ origin: onestardao-wfgy-5.0-polaris-protocol
8
+ provenance: adapted-and-honest-reimplementation-not-verbatim
9
+ ---
10
+
11
+ # WFGY 5.0 — Polaris Protocol (tree root)
12
+
13
+ Polaris is the active public route of WFGY 5.0. The **Fifth-Dimension Engine** is the current main product surface; the **Polaris Goal Compiler** is the first public protocol component. **WFGY-Method** supplies the drift-control discipline that keeps the whole system aligned with the original goal.
14
+
15
+ This skill is the **tree root**. It does not re-explain the children — it wires them into one state machine and tells you which child to dispatch at each step. Treat the three child skills as the transitions of the machine below.
16
+
17
+ ## The tree
18
+
19
+ ```
20
+ polaris-protocol (this skill — root / entry)
21
+ ├── polaris-goal-compiler (COMPILE state)
22
+ ├── fifth-dimension-engine (SHOOT state)
23
+ └── wfgy-method (DRIFT CONTROL — applies at every state)
24
+ ```
25
+
26
+ Discoverable: each node is a standalone `SKILL.md` inside its own `skills/<skill-name>/` directory. This root is the entry point; the children are reached by explicit dispatch.
27
+
28
+ ## The state machine
29
+
30
+ A skill tree can behave like a state machine. Each transition is an explicit skill dispatch (modeled on the `gm` skill's `transition`/`Skill(skill=...)` pattern): you do not narrate the next step, you **dispatch** it.
31
+
32
+ ### States
33
+
34
+ | State | Meaning |
35
+ |---|---|
36
+ | `UNCOMPILED` | Raw human request, no structure yet. |
37
+ | `COMPILED` | Goal Compiler emitted task atoms, dependencies, verification gates, claim ceilings, and a closure-record template. |
38
+ | `SHOOTING` | A complex atom is being lifted by Fifth-Dimension Engine into a route. |
39
+ | `EXECUTING` | An atom (routine, or the result of a route) is being carried out. |
40
+ | `VERIFYING` | Output is checked against the atom's verification gate and against drift (ΔS, via WFGY-Method). |
41
+ | `CLOSED` | Claim ceiling met, closure record written, atom done. |
42
+
43
+ ### Transitions (each is a dispatch)
44
+
45
+ ```
46
+ UNCOMPILED --Skill(polaris-goal-compiler)--> COMPILED
47
+
48
+ COMPILED --complex atom? Skill(fifth-dimension-engine)--> SHOOTING
49
+ COMPILED --routine atom? execute directly---------------> EXECUTING
50
+
51
+ SHOOTING --inspect route, then carry it out-----------> EXECUTING
52
+
53
+ EXECUTING --Skill(wfgy-method) drift + gate check----> VERIFYING
54
+
55
+ VERIFYING --gate pass + claim ceiling honored--------> CLOSED
56
+ VERIFYING --gate fail / drift --> BBCR checkpoint ----> COMPILED (re-compile or re-shoot)
57
+
58
+ CLOSED --next atom------------------------------------> COMPILED
59
+ ```
60
+
61
+ `wfgy-method` is not a single transition — it is the drift-control observer attached to **every** state. Before any step that could have drifted, dispatch it and read the result.
62
+
63
+ ## Canonical syntax (pro-rata — use exactly this)
64
+
65
+ - **Compile first. Execute one active atom. Verify before unlock. Claim only what is supported.** (Goal Compiler)
66
+ - **shoot + [your problem]** — the Fifth-Dimension Engine interface. Examples: `shoot + Seven Millennium Problems`, `shoot + Death + AI`, `shoot + should I quit my job`.
67
+ - **ΔS = 1 − cos(I, G)** — drift between current state (I) and goal (G). Without a real embedding call, ΔS is a qualitative label ("ΔS looks high here"), never a computed decimal — unless a real `similarity` verb is available (see WFGY-Method).
68
+
69
+ "Compile first. Then shoot." is the spine of the whole protocol.
70
+
71
+ ## How to run a task through the tree
72
+
73
+ 1. You are at `UNCOMPILED`. Dispatch `Skill(skill="polaris-goal-compiler")`. It returns atoms, gates, and claim ceilings -> `COMPILED`.
74
+ 2. For each active atom: ask "complex or routine?"
75
+ - **Routine** -> execute directly -> `VERIFYING`.
76
+ - **Complex** -> dispatch `Skill(skill="fifth-dimension-engine")` -> `SHOOTING` -> inspect the route -> `EXECUTING` -> `VERIFYING`.
77
+ 3. At `VERIFYING`, dispatch `Skill(skill="wfgy-method")` to check drift and apply the atom's verification gate.
78
+ - Pass + claim ceiling honored -> `CLOSED` -> next atom (back to `COMPILED`).
79
+ - Fail or drift -> BBCR checkpoint, re-compile or re-shoot (back to `COMPILED`).
80
+ 4. When all atoms are `CLOSED`, the task is done — and only then may you claim completion.
81
+
82
+ ## What this tree is not
83
+
84
+ - It is not a single prompt. It is a set of skills you dispatch in sequence.
85
+ - It does not guarantee correctness. It makes fake completion and silent drift harder to hide.
86
+ - It does not replace verification, tests, sources, or expertise. The verification gate only makes verification *visible*.
87
+ - It does not claim to be the full private WFGY 5.0 engine. Goal Compiler and WFGY-Method are public protocol components; the Fifth-Dimension Engine is the current main public surface.
88
+
89
+ ## Children (dispatch these)
90
+
91
+ - `polaris-goal-compiler` — compile the goal into atoms, gates, claim ceilings.
92
+ - `fifth-dimension-engine` — shoot a complex atom into a structured route.
93
+ - `wfgy-method` — hold drift control across every state.
94
+
95
+ For the full DAG, integration workflows, and mismatch detection, see `../POLARIS-SKILLS-GUIDE.md`.
@@ -1,6 +1,6 @@
1
1
  ---
2
2
  name: wfgy-method
3
- description: Applies WFGY (Wan Fa Gui Yi), a portable reasoning discipline for reducing drift and incoherence across multi-step agent work, adapted from onestardao/WFGY's core mechanism. Compares each step against the stated goal, considers more than one approach before committing to ambiguous or high-stakes decisions, and checkpoints before risky steps so it can revert and bounded-retry instead of compounding a mistake. Records durable lessons in this project so future sessions inherit them. Use when starting any non-trivial multi-step task, when a task risks losing track of its original goal over many steps, when facing a decision with real alternatives worth comparing, or when the agent notices it has contradicted itself or gone in circles and needs a disciplined way to recover. Distinct from `gm-continue`: that skill is the specific post-`gm`-COMPLETE remaining-work check (a narrow, mechanical PRD scan); this skill is the general drift-recovery discipline `gm-continue` itself invokes when a `gm` walk keeps hitting the same gap across repeat cycles -- not a substitute for `gm-continue`'s own check.
3
+ description: Applies WFGY (Wan Fa Gui Yi), a portable reasoning discipline for reducing drift and incoherence across multi-step agent work, adapted from onestardao/WFGY's core mechanism. Compares each step against the stated goal, considers more than one approach before committing to ambiguous or high-stakes decisions, and checkpoints before risky steps so it can revert and bounded-retry instead of compounding a mistake. Records durable lessons in this project so future sessions inherit them. Use when starting any non-trivial multi-step task, when a task risks losing track of its original goal over many steps, when facing a decision with real alternatives worth comparing, or when the agent notices it has contradicted itself or gone in circles and needs a disciplined way to recover. Distinct from `gm-continue`: that skill is the post-`gm`-COMPLETE remaining-work check; this skill is the general drift-recovery discipline `gm-continue` invokes when a `gm` walk repeats the same gap -- not a substitute for its check.
4
4
  license: MIT
5
5
  compatibility: Designed for Claude Code. No external services, embedding models, or network access required for the core discipline.
6
6
  metadata: