cargo
Rust package manager (36 subcommands).
cognitive-sufficiency-superposition
name: cognitive-sufficiency-superposition
Full skill instructions
Cognitive Sufficiency Superposition applies the four-pillar ASI framework to the ε-machine sufficiency gate:
|ψ_sufficiency⟩ = α|Riehl⟩ + β|Sutskever⟩ + γ|Schmidhuber⟩ + δ|Bengio⟩
The gate holds ALL perspectives until measurement collapses it.
#lang rzk-1
-- ε-machine as Segal type
#define EpsilonMachine : U := Segal-type
-- Causal states as objects
#define CausalState : EpsilonMachine → U := object
-- Skill requirements as morphisms
#define SkillReq (S : EpsilonMachine) (s1 s2 : CausalState S) : U
:= hom S s1 s2
-- Sufficiency = composite exists
#define sufficient (S : EpsilonMachine)
(current required : CausalState S) : U
:= Σ (path : hom S current required), is-contr path
Key insight: Test sufficiency at identity (directed Yoneda).
class SutskeverSufficiency:
"""ε-machine = minimal sufficient statistic."""
def compression_sufficient(self, loaded: Set[Skill], required: Set[Skill]) -> bool:
"""
Sufficient if loaded skills can be compressed to program
that generates required skills.
K(required | loaded) < K(required) → sufficient
"""
program = self.compress(loaded)
generated = self.decompress(program)
return required <= generated
def gating_intelligence(self) -> float:
"""Compression ratio = intelligence of gate."""
return self.bits_saved / self.total_bits
Key insight: Compression ratio measures gating intelligence.
class SchmidhuberSufficiency:
"""Insufficient coverage = exploration opportunity."""
def curiosity_reward(self, action: Action, coverage: float) -> float:
"""
Low coverage → high curiosity → learning opportunity.
Reward = compression progress on ε-machine after seeing failure.
"""
if coverage >= 0.95:
return 0 # Already sufficient, no learning
# Expected learnability from this failure
return self.expected_compression_progress(action)
def explore_skills(self, missing: List[Skill]) -> Skill:
"""Load skill that maximizes expected learnability."""
return max(missing, key=self.expected_learnability)
Key insight: Failures are learning opportunities for ε-machine.
class BengioSufficiency:
"""Sample sufficient skill sets proportional to success."""
def sample_sufficient_skills(self, action: Action) -> Set[Skill]:
"""
GFlowNet: P(skills | action) ∝ P(success | skills, action)
Don't just maximize - sample DIVERSE sufficient sets.
"""
# Trajectory balance for skill loading
trajectory = []
state = self.initial_skills()
while not self.is_sufficient(state, action):
skill = self.P_F.sample(state, action)
state = state | {skill}
trajectory.append(skill)
return state
def diversity_bonus(self, skill_set: Set[Skill]) -> float:
"""Reward novel skill combinations."""
return self.novelty(skill_set) * self.success_prob(skill_set)
Key insight: Multiple sufficient sets exist - sample their diversity.
| Measurement | Collapses To | ε-Machine Operation |
|---|---|---|
verify | Riehl | Check hom-space non-empty |
compress | Sutskever | Minimize description length |
explore | Schmidhuber | Seek compressible failures |
sample | Bengio | GFlowNet sample sufficient sets |
integrate | ALL FOUR | Weighted superposition |
class CognitiveSufficiencyGate:
"""Superposition of four gating strategies."""
def __init__(self):
self.riehl = RiehlSufficiency() # Segal type check
self.sutskever = SutskeverSufficiency() # Compression
self.schmidhuber = SchmidhuberSufficiency() # Curiosity
self.bengio = BengioSufficiency() # GFlowNet
# Amplitude weights (learned or fixed)
self.amplitudes = {
'riehl': 0.25,
'sutskever': 0.25,
'schmidhuber': 0.25,
'bengio': 0.25
}
def gate(self, action: Action, loaded: Set[Skill],
measurement: str = 'integrate') -> Verdict:
"""
Apply superposition gate with measurement collapse.
"""
if measurement == 'verify':
return self.riehl.gate(action, loaded)
elif measurement == 'compress':
return self.sutskever.gate(action, loaded)
elif measurement == 'explore':
return self.schmidhuber.gate(action, loaded)
elif measurement == 'sample':
return self.bengio.gate(action, loaded)
else:
# Integrate: weighted vote
verdicts = {
'riehl': self.riehl.gate(action, loaded),
'sutskever': self.sutskever.gate(action, loaded),
'schmidhuber': self.schmidhuber.gate(action, loaded),
'bengio': self.bengio.gate(action, loaded),
}
return self.weighted_vote(verdicts)
def weighted_vote(self, verdicts: Dict[str, Verdict]) -> Verdict:
"""Amplitude-weighted voting."""
scores = {'PROCEED': 0, 'LOAD_MORE': 0, 'ABORT': 0}
for perspective, verdict in verdicts.items():
weight = self.amplitudes[perspective] ** 2 # Born rule
scores[verdict.name] += weight
return Verdict[max(scores, key=scores.get)]
-- Superposition as sigma type over perspectives
def SufficiencySuperposition : Type := sig (
riehl_amplitude : ℝ,
sutskever_amplitude : ℝ,
schmidhuber_amplitude : ℝ,
bengio_amplitude : ℝ,
normalized : riehl² + sutskever² + schmidhuber² + bengio² ≡ 1
)
-- Collapse as projection
def collapse (measurement : Measurement) (ψ : SufficiencySuperposition)
: Perspective :=
match measurement with
| verify → Riehl
| compress → Sutskever
| explore → Schmidhuber
| sample → Bengio
| integrate → Integrated ψ
-- ε-machine as Segal type
def EpsilonMachineSegal (S : Category) : Type := sig (
causal_states : Obj S,
skill_morphisms : (s1 s2 : causal_states) → Hom S s1 s2,
segal_composite : (s1 s2 s3 : causal_states) →
Hom S s1 s2 → Hom S s2 s3 → Hom S s1 s3,
segal_unique : IsContr (segal_composite ...)
)
dynamic-sufficiency (-1) ⊗ cognitive-superposition (0) ⊗ gay-mcp (+1) = 0 ✓
The gate (MINUS) observes
The superposition (ERGODIC) coordinates
The color generator (PLUS) produces witnesses
| Perspective | Trit | Role in Gate |
|---|---|---|
| Riehl | -1 | Validate (hom-space check) |
| Sutskever | +1 | Generate (compressed program) |
| Schmidhuber | +1 | Explore (curiosity-driven) |
| Bengio | 0 | Coordinate (GFlowNet sampling) |
Sum: -1 + 1 + 1 + 0 = +1 → Needs MINUS to balance → dynamic-sufficiency (-1)
Free Energy = Prediction Error + Complexity
= 1.237 (measured between sufficiency and superposition)
High free energy → rich synthesis opportunity
Minimize by: updating beliefs (perceptual inference)
OR acting to change world (active inference)
# Apply superposition gate
just cognitive-sufficiency action="code:julia:acset"
# Collapse to specific perspective
just cognitive-sufficiency --collapse=verify
just cognitive-sufficiency --collapse=compress
just cognitive-sufficiency --collapse=explore
just cognitive-sufficiency --collapse=sample
# Full integration (maintain superposition)
just cognitive-sufficiency --collapse=integrate
# Show perspective weights
just cognitive-sufficiency --amplitudes
| Skill | Trit | Connection |
|---|---|---|
cognitive-superposition | 0 | Parent: four-pillar framework |
dynamic-sufficiency | -1 | Parent: ε-machine gating |
curiosity-driven | +1 | Schmidhuber perspective |
gflownet | 0 | Bengio perspective |
segal-types | -1 | Riehl perspective |
kolmogorov-compression | +1 | Sutskever perspective |
Skill Name: cognitive-sufficiency-superposition Type: Meta-Skill / Gating / Superposition Trit: 0 (ERGODIC - coordinates perspectives) Free Energy: 1.237 (high tension → rich synthesis) Collapse: Measurement-dependent GF(3): Conserved with dynamic-sufficiency + gay-mcp
The interaction IS the skill improving itself.
Every use of this skill is an opportunity for worlding:
Add Interaction Exemplars here as the skill is used.
Rust package manager (36 subcommands).
Translate Figma nodes into production-ready code with 1:1 visual fidelity using the Figma MCP workflow (design context, screenshots, assets, and project-convention translation). Trigger when the user provides Figma URLs or node IDs, or asks to implement designs or components that must match Figma...
**Status**: 🌳 Production Ready (upstream in StringZilla v3+) **Type**: High-Performance String Operations / SIMD-Accelerated Text Processing **Principle**: Zero-copy views, SIMD/SWAR acceleration, deterministic hashing **Frame**: Cross-language interoperability (C, C++, Python, Rust, Go, Swift, ...
Conformal Geometric Algebra (CGA) for circles, spheres, and Möbius transformations
Verifies code implements exactly what documentation specifies for blockchain audits. Use when comparing code against whitepapers, finding gaps between specs and implementation, or performing compliance checks for protocol implementations.
Systems programming and performance optimization using Zig. Provides low-level abstractions, memory-safe compiled code, and performance benchmarking. Use for system-level operations, optimization, and interoperability with C/POSIX APIs.
PayPal MCP server integration for invoices, payments, subscriptions, disputes, and transaction reporting via @paypal/mcp.
Unison language - content-addressed functional programming with abilities for effects, distributed computing, and structural types. Use for pure functional code, effect management, distributed systems, and refactoring-safe codebases.
Google Tasks management via TasksACSet. Transforms task operations into GF(3)-typed Interactions, routes to triadic queues, detects saturation for task-zero-as-condensed-state.
World C Skill
Syrup binary serialization for OCapN/CapTP wire format. Canonical encoding for capability messages.
Install Codex skills into $CODEX_HOME/skills from a curated list or a GitHub repo path. Use when a user asks to list installable skills, install a curated skill, or install a skill from another repo (including private repos).
Generate, edit, and beat-sync AI video with leading models in one workspace.
The world's fastest calendar for remote work
Transform Your Design with AI Designer by ImgCreator.ai
Revolutionizing Video Production with AI-Powered Creativity
Extend an image past the frame and let AI fill the new aspect ratio.
Discover your celebrity doppelgänger with StarByFace!
ChainClarity explains 700+ crypto whitepapers in plain English, with layered summaries, comparisons, research tools, alerts, and a $4.99 Pro plan.
Opus.ai: Revolutionize Your Web Experience