
Creating algorithmic art using p5.js with seeded randomness and interactive parameter exploration. Use when users request creating art using code, generative art, algorithmic art, flow fields, or particle systems.
Connect and stream from OpenBCI Cyton/Daisy via USB dongle, including first-time radio channel pairing
# SKILL: ACSets Relational Thinking **Version**: 2.0.0 **Trit**: 0 (ERGODIC) **Domain**: database, category-theory, rewriting **Source**: Topos Institute RelationalThinking Course + AlgebraicJulia --- ## Overview ACSets (Attributed C-Sets) are **functors X: C → Set** where C is a small category (schema). This skill integrates: 1. **RelationalThinking Course** - Topos Institute's pedagogical approach 2. **DPO Rewriting** - Double Pushout graph transformation 3. **Self-Play Loop** - Query → E
Scholze-Clausen condensed mathematics bridge to sheaf neural networks via 6-functor formalism
Red Planet Labs Rama with Gay.jl deterministic coloring for 100x backend development with gay-colored parentheses as expressive as tensor shapes.
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).
Verify Strong Parallelism Invariance (SPI) and GF(3) conservation for 3-way color streams with arbitrary precision.
Bengio's causal inference for AI: Interventional reasoning, counterfactuals, and System 2 deep learning. World models with causal structure.
# Chemical Organization Theory **Category:** Phase 3 Core - Autopoietic Systems **Status:** Skeleton Implementation **Dependencies:** `categorical-composition` (reaction networks as categories) ## Overview Implements Chemical Organization Theory (COT) for modeling self-maintaining autopoietic systems through reaction-diffusion dynamics, organizational closure detection, and self-maintenance verification. ## Capabilities - **Reaction Networks**: Define chemical reaction systems - **Organizat
Schmidhuber's curiosity-driven learning: Intrinsic motivation via compression progress. Seek states that improve world model.
DeepWiki MCP server for AI-powered GitHub repository documentation and Q&A
# Exponential Topology Communication **Category:** Phase 3 Core - Scalable Communication **Status:** Skeleton Implementation **Dependencies:** `oriented-simplicial-networks` (for topological structure) ## Overview Implements ExpoComm framework for exponentially efficient communication in large-scale systems using hyperbolic embeddings, O(log N) routing, and spectral gap optimization for rapid information dissemination. ## Capabilities - **Hyperbolic Embeddings**: Embed agents in hyperbolic
# Feedforward Learning Local **Category:** Phase 3 Core - Alternative Learning Paradigms **Status:** Skeleton Implementation **Dependencies:** None (standalone learning framework) ## Overview Implements forward-forward (FF) learning algorithm and variants that eliminate backpropagation through local, layer-wise contrastive objectives. Each layer learns to distinguish positive from negative data independently. ## Capabilities - **Forward-Forward Algorithm**: Hinton's layer-local learning - *
Schmidhuber's Gödel Machine: Self-improving systems that prove their own improvements. Darwin Gödel Machine (DGM) combines evolution with formal verification.
Kan Extensions Skill (ERGODIC 0)
LocalSend-based P2P transfer with MCP server design for NATS/Tailscale discovery and throughput tuning.
Topos Generation Skill (PLUS +1)
BDD-Driven Mathematical Content Verification Skill Combines Behavior-Driven Development with mathematical formula extraction, verification, and transformation using: - Cucumber/Gherkin for specification - RSpec for implementation verification - mathpix-gem for LaTeX/mathematical content extraction - Pattern matching on syntax trees for formula validation Enables iterative discovery and verification of mathematical properties through executable specifications.
Layer 6 Barton Cognitive Surrogate - build, train, validate psychological models with >90% fidelity
Chicken Scheme Hatchery eggs and academic papers for color logic, 2TDX, colored operads, and higher observational type theory.
Guide for creating high-quality MCP (Model Context Protocol) servers that enable LLMs to interact with external services through well-designed tools. Use when building MCP servers to integrate external APIs or services, whether in Python (FastMCP) or Node/TypeScript (MCP SDK).
# Topological Superintelligence (TSI) Compositional AI framework using GF(3) triadic balance and category-theoretic foundations. ## Core Principle Every operation balances trits {-1, 0, +1}: ``` inject(+1) + bridge(0) + emit(-1) ≡ 0 (mod 3) ``` ## Tripartite Agent Architecture | Agent | Trit | Role | Color | |-------|------|------|-------| | PLUS | +1 | Generation, creation, synthesis | #FF6B6B | | ERGODIC | 0 | Coordination, balance, infrastructure | #4ECDC4 | | MINUS | -1 | Verification,
# IES Triadic Skill > *Three maximally polarizing yet topos-compatible directions of the ies collective mind* **Trit Assignment**: This skill spans all three polarities as a meta-skill. | Sub-Skill | Trit | Polarity | Subagent | |-----------|------|----------|----------| | ies-form | -1 | MINUS | Validator | | ies-game | 0 | ERGODIC | Coordinator | | ies-witness | +1 | PLUS | Generator | **Canonical Triad**: `ies-form (-1) ⊗ ies-game (0) ⊗ ies-witness (+1) = 0 ✓` ## GF(3) Decomposition The
# Map Projection Skill Category theory of map projections: functors between manifolds with distortion analysis. ## Trigger - Map projection selection and analysis - Distortion metrics (Tissot's indicatrix) - Coordinate system transformations - Cartographic design decisions ## GF(3) Trit: +1 (Generator) Generates projections from sphere to plane, creating new coordinate representations. ## Category Theory of Projections A map projection is a functor: ``` P: Sphere → Plane S² → ℝ² ``` Dif
Cross-Language Strong Parallelism Invariance Verification for 15+ languages
Guide for creating effective skills. Use when users want to create a new skill (or update an existing skill) that extends Claude's capabilities with specialized knowledge, workflows, or tool integrations.
Static type inference and validation for navigation paths
bmorphism's GitHub stars (2155 repos) and created repos - a curated index of applied category theory, MCP servers, and xenomodern tooling.
Deterministic color generation with SplitMix64, GF(3) trits, and MCP tools for palettes and threads.
Hypothesis-Test Loops via REPL for Exploratory Abductive Inference with Gay.jl colors
UV/UVX/Ruff toolchain for DiscoHy Thread Operad with Python packaging and linting
ASI skill integrating polynomial functors, free monad/cofree comonad module action, operadic decomposition, and open games for compositional intelligence.
# Deterministic Color Generation via Metadata Hashing **Status**: ✅ Production Ready **Type**: Color Space / Metadata Visualization **Principle**: Colors are NOT learned—they're deterministically computed from skill metadata **Frame**: Involution-invariant (ι∘ι = id) **GF(3)**: Conservation verified across 4-level hierarchy --- ## Core Discovery **Colors in IsUMAP visualization are NOT generated by any machine learning model.** Instead, they are **deterministically computed from cryptograph
Jepsen-style correctness testing for distributed systems under faults (partitions, crashes, clock skew) using concurrent operation histories and formal checkers (linearizability/serializability and Elle-style anomalies). Use when designing, implementing, or running Jepsen tests, or interpreting histories/violations.
Layer 4 Learning and Pattern Extraction for Cognitive Surrogate Systems
GF(3) color envelope preservation across navigator compositions
Generalization and composition of constraints across navigators
# DuckDB Spatial Skill H3 hexagonal indexing, PostGIS-compatible spatial queries, and geographic analysis with GF(3) coloring. ## Trigger - Spatial SQL queries, geographic data analysis - H3 hexagonal grid operations - Point-in-polygon, distance queries - Geospatial joins, spatial indexing ## GF(3) Trit: 0 (Ergodic/Coordinator) Coordinates spatial data flow and transforms between coordinate systems. ## Installation ```sql INSTALL spatial; LOAD spatial; -- Also useful INSTALL h3 FROM commun
Koopman operator theory for infinite-dimensional linear lifting of nonlinear dynamics. Generates dynamics from observables.
# SKILL: MCP Tripartite Integration **Version**: 1.0.0 **Trit**: 0 (ERGODIC) **Domain**: mcp, integration, orchestration --- ## Overview Each MCP server is integrated with a **3-partite structure** that ensures GF(3) conservation: ``` MCP_server ⊗ Skill_MINUS ⊗ Skill_PLUS = 0 (mod 3) ``` This creates balanced triads where each MCP has a validator (-1) and generator (+1) complement. --- ## MCP Tripartite Assignments ### 1. GAY.jl MCP (Trit: 0) ``` three-match (-1) ⊗ gay (0) ⊗ cider-cloju
oapply: Operad algebra evaluation via colimits. Composes machines/resource sharers.
ACSets (Attributed C-Sets): Algebraic databases as in-memory data structures. Category-theoretic formalism for relational databases generalizing graphs and data frames.
Hesse-inspired interdisciplinary synthesis game with Badiou triangle inequality for possible world hopping across mathematical, musical, and philosophical domains.
Squint ClojureScript runtime for minimal JS output compilation
Interleave three deterministic color streams into balanced schedules for parallel execution and evaluation.
Replace temporal succession with derivational chains using deterministic seeds and GF(3) invariants.
Self-inverse derivation patterns where ι∘ι = id for frame-invariant self
Badiou-inspired possible world navigation using triangle inequality constraints, event ontology, and truth procedures for traversing mathematical possibility space.
Compare data structures (DuckDB, LanceDB) via ACSets with persistent homology coverage analysis and geometric morphism translation.
DisCoPy categorical color streams via Hy with 3 parallel TAP streams
# Categorical Composition **Category:** Phase 3 Core - Compositional Architecture **Status:** Skeleton Implementation **Dependencies:** None (foundational) ## Overview Implements categorical abstractions for compositional learning: Kan extensions for adapting between learning problems, higher adjunctions for bidirectional transformations, and functorial parameter transfer for compositional generalization. ## Capabilities - **Kan Extensions**: Left/right Kan extensions for problem adaptation
# Continuous Inverter **Category**: Real-Time Monitoring + CI/CD **Type**: Automated Measurement + Remediation **Language**: Julia **Status**: Production Ready **Version**: 1.0.0 **Date**: December 22, 2025 ## Overview Real-time monitoring and automated remediation for proof system health. Runs on every commit to measure spectral gap across all 6 theorem provers in parallel, generates GitHub Actions CI/CD workflows, and provides automated suggestions when system health degrades. ## Key Data
Dialectica Skill (ERGODIC 0)
Directed interval type 2 axiomatizing (0 → 1). Time-directed homotopy for reactions.
# Formal Verification AI **Category:** Phase 3 Core - Correctness Guarantees **Status:** Skeleton Implementation **Dependencies:** `categorical-composition` (correctness as functoriality) ## Overview Integrates formal verification methods with AI systems: theorem proving for correctness guarantees, interval arithmetic for certified bounds, and categorical proofs for compositional correctness. ## Capabilities - **Theorem Proving**: Automated verification of AI properties - **Interval Arithme
Ihara zeta function for graphs: non-backtracking walks, prime cycles, and spectral analysis via det(I - uB).
# Möbius Path Filter **Category**: Theorem Dependency Analysis **Type**: Graph Path Classification **Language**: Julia **Status**: Production Ready **Version**: 1.0.0 **Date**: December 22, 2025 ## Overview Identifies tangled geodesics in proof dependency graphs via Möbius inversion. Classifies paths by prime factorization to determine which dependencies are problematic (create cycles) vs. optimal (linear chains). ## Key Functions - **`enumerate_paths(adjacency)`**: Discovers all paths in g
Möbius inversion on posets and lattices: alternating sums, chromatic polynomials, incidence algebras, and centrality predicates.
Open Games Skill (ERGODIC 0)
Operad Composition Skill (PLUS +1)
Metaskill that fans out on every interaction, using interaction entropy as SplitMixTernary seed for maximum synergistic parallelism
Ramanujan graphs and Alon-Boppana spectral optimality for edge growth rules. Optimal expanders with λ₂ ≤ 2√(d-1) bound.
Segal types for synthetic ∞-categories. Binary composites exist uniquely up to homotopy. Foundation for topological chemputer.
Čech cohomology for local-to-global consistency verification in code structure and data schemas.
# Sheaf-Theoretic Coordination **Category:** Phase 3 Core - Distributed Reasoning **Status:** Skeleton Implementation **Dependencies:** `oriented-simplicial-networks`, `categorical-composition` ## Overview Implements sheaf-theoretic coordination mechanisms for multi-agent systems, using sheaf Laplacians for consensus, harmonic extension for inference, and cohomology for detecting global obstructions. ## Capabilities - **Sheaf Laplacian**: Consensus dynamics on cellular sheaves - **Harmonic
# Spectral Gap Analyzer **Category**: Theorem Prover Health Monitoring **Type**: Graph Analysis + Linear Algebra **Language**: Julia **Status**: Production Ready **Version**: 1.0.0 **Date**: December 22, 2025 ## Overview Measures proof system health via Laplacian eigenvalue gap analysis. Computes the spectral gap λ₁ - λ₂ of proof dependency graphs to identify optimal connectivity (Ramanujan property) vs. tangled dependencies. ## Key Functions - **`compute_laplacian(adjacency)`**: Constructs
# Spectral Random Walker **Category**: Theorem Discovery + Comprehension **Type**: Random Walk Analysis **Language**: Julia **Status**: Production Ready **Version**: 1.0.0 **Date**: December 22, 2025 ## Overview Integrates spectral gaps with random walk theory using the Benjamin Merlin Bumpus comprehension model. Samples proof space via random walks to discover related theorems through co-visitation patterns, enabling "comprehension neighborhoods" - clusters of theorems that are naturally exp
Coalgebraic observation of derivation streams with final coalgebra bisimulation for infinite trace verification.
# Tree-Sitter Analyzer Skill **Version**: 1.0.0 **Status**: Production Ready **Date**: December 22, 2025 **Phase**: 2 Stage 3 Foundation --- ## Overview Automated code structure analysis for module verification and cross-prover theorem mapping using tree-sitter incremental parsing. Enables 100x+ speedup on integration verification tasks compared to manual analysis. **Quick Stats**: - 550+ lines of code (2 modules) - 350+ lines of tests (10 test cases, 10/10 PASS) - <1ms per operation (well
Code Query with AI-enhanced deterministic analysis via SplitMix ternary classification
Meta-skill that generates domain-specific AI skills from tool documentation
Org-agenda-like transient views for ASI skill orchestration via nbb/squint + Emacs hydra
Bisimulation game for resilient skill dispersal across AI agents with GF(3) conservation and observational bridge types.
Guidance for selecting the right ClojureScript runtime across scripting, browser, Node, and embedded use.
CIDER integration for Clojure development with nREPL
Semantic embeddings for Clojure code navigation via CIDER
# Bidirectional Navigator **Category**: Proof Navigation + Caching **Type**: Graph Index Structure **Language**: Julia **Status**: Production Ready **Version**: 1.0.0 **Date**: December 22, 2025 ## Overview Safe proof ↔ theorem navigation with non-backtracking constraint. Implements Friedman's B operator to enable linear homotopy type theory (LHoTT) resource-aware evaluation where proofs are consumed exactly once. ## Key Data Structures ```julia struct Theorem id::Int name::String e
# CapTP: Capability Transfer Protocol **Trit**: 0 (ERGODIC - transports capabilities without amplification) **Color**: #46F27F (Coordinator stream) **Source**: Spritely Goblins (codeberg.org/spritely/goblins) --- ## Overview CapTP (Capability Transfer Protocol) enables distributed object programming with capability security. Objects can live anywhere on the network; CapTP abstracts location so programmers focus on object interaction, not protocol architecture. **Core principle**: Capabiliti
clj-kondo linter with Gay.jl 3-color integration for GF(3) conservation in Clojure code analysis.
Automated code review for pull requests using specialized review patterns. Analyzes code for quality, security, performance, and best practices. Use when reviewing code changes, PRs, or doing code audits.
Lisp machine self-modification patterns via MCP Tasks and Narya bridge types
# Geodesic Manifold Skill Spherical geometry, great circles, and Riemannian manifolds with Gay.jl coloring. ## Trigger - Geodesic calculations, great circle routes - Spherical trigonometry, haversine distance - Riemannian geometry on Earth's surface - Flight paths, navigation, ship routing ## GF(3) Trit Assignment - **+1 (Generator)**: Creates geodesic paths, generates waypoints - **0 (Ergodic)**: Distance calculations, coordinate transforms - **-1 (Validator)**: Verifies shortest path optima
Cognitive superposition synthesizing Riehl (∞-categories), Sutskever (compression), Schmidhuber (curiosity-driven), and Bengio (GFlowNets) into unified ASI framework with quantum-inspired measurement collapse.
--- name: duck-time-travel description: SKILL: Duck Time Travel source: local license: UNLICENSED --- # SKILL: Duck Time Travel **Version**: 1.0.0 **Created**: 2025-12-21 **Trit**: 0 (ERGODIC - Coordinator) **Color**: `#26D826` (Green) **Lineage**: Traced from 745+ threads across November-December 2025 ## Canonical Triads ``` clj-kondo-3color (-1) ⊗ duck-time-travel (0) ⊗ rama-gay-clojure (+1) = 0 ✓ acsets (-1) ⊗ duck-time-travel (0) ⊗ gay-mcp (+1) = 0 ✓ ``` ## Purpose DuckDB/DuckLake time
# Emergent Role Assignment **Category:** Phase 3 Core - Self-Organization **Status:** Skeleton Implementation **Dependencies:** `sheaf-theoretic-coordination`, `chemical-organization-theory` ## Overview Implements spontaneous role assignment in multi-agent systems through self-organization, dynamic hierarchy adaptation, and reward-based emergence without central coordination. ## Capabilities - **Spontaneous Hierarchy**: Agents self-organize into hierarchical structures - **Dynamic Role Adap
Layer 5 Interaction Interleaving for Maximum Information Gain with DuckDB
Propagator-based parallel structure for exploiting knowledge differentials across domains using local scoped propagators and SplitMixTernary RNG.
External skill interface for integration with external systems
Hinton's Forward-Forward algorithm for local learning without backpropagation. Use for biologically plausible learning, on-chip training, memory-efficient networks, or parallel layer-wise training.
Free Monad Generation Skill (PLUS +1)
AI-guided UI/UX design patterns with Gay.jl deterministic colors
# Geohash Coloring Skill GF(3) colored geohashes for hierarchical spatial indexing with deterministic color derivation. ## Trigger - Geohash encoding/decoding - Hierarchical spatial clustering - Location-based coloring schemes - Privacy-preserving location representation ## GF(3) Trit: +1 (Generator) Generates colored spatial identifiers from coordinates. ## Geohash Basics Geohash encodes lat/lon into a string where: - Longer = more precise - Prefix = parent cell - Adjacent cells share pref
Bengio's GFlowNets: Generative Flow Networks that sample proportionally to reward. Diversity over maximization for causal discovery and molecule design.
Geiser REPL integration for Chicken Scheme with SplitMixTernary 3-coloring and crdt.el sexp patterns.
# Safe Rewriting Advisor **Category**: Graph Optimization + Remediation **Type**: Strategic Edge Removal Analysis **Language**: Julia **Status**: Production Ready **Version**: 1.0.0 **Date**: December 22, 2025 ## Overview Strategic selective edge removal maintaining spectral gap ≥ 0.25. Analyzes edge criticality via betweenness centrality to identify which proof dependencies can be safely removed without breaking system connectivity (Ramanujan property). ## Key Data Structures ```julia stru
# ies > FloxHub `bmorphism/ies` - Clojure/Julia/Python/multimedia environment with Gay.jl coloring, Flox composition, and DuckDB social analysis. **Trit Assignment**: 0 (ERGODIC) - Coordinator role for environment orchestration. **Canonical Triads**: ``` polyglot-spi (-1) ⊗ ies (0) ⊗ gay-mcp (+1) = 0 ✓ [Environment] three-match (-1) ⊗ ies (0) ⊗ pulse-mcp-stream (+1) = 0 ✓ [Social Analysis] influence-propagation (-1) ⊗ ies (0) ⊗ agent-o-rama (+1) = 0 ✓ [Cognitive Surrogate] ``` --- ## Qui
Kolmogorov complexity as the ultimate intelligence measure. Shortest program that outputs data.
Layer 7 Interperspectival Network Analysis and Influence Flow
JaxLife open-ended agentic simulator for emergent behavior, tool use, and cultural accumulation. Use for artificial life simulations, emergent agent behavior, and open-ended evolution research.
Cohesive Linear HoTT patterns for interaction entropy with diagram generation. Implements Schreiber's cohesive modalities (♯,♭,ʃ) and Riley's linear modality (♮) for quantum-classical bridging.
LispSyntax.jl ↔ ACSets.jl bidirectional bridge with OCaml ppx_sexp_conv-style deriving
Building applications with Large Language Models - prompt engineering, RAG patterns, and LLM integration. Use for AI-powered features, chatbots, or LLM-based automation.
Mathpix OCR for LaTeX extraction with balanced ternary checkpoints
Non-orientable topological filtering that eliminates self-revisiting paths
# Oriented Simplicial Networks **Category:** Phase 3 Core - Geometric Deep Learning **Status:** Skeleton Implementation **Dependencies:** `categorical-composition`, `persistent-homology` ## Overview Implements directional simplicial neural networks (Dir-SNNs) with asymmetric message passing operators, E(n)-equivariance constraints, and persistent homology tracking for topological feature learning. ## Capabilities - **Directional Message Passing**: Asymmetric operators respecting simplex ori
# OSM Topology Skill OpenStreetMap graph analysis: road networks, routing, and topological structure with GF(3) coloring. ## Trigger - OpenStreetMap data processing - Road network analysis, routing - Graph-based geographic queries - Street network topology ## GF(3) Trit: -1 (Validator) Validates topological consistency of geographic networks. ## OSM Data Model OSM uses three primitives: - **Nodes**: Points with lat/lon - **Ways**: Ordered lists of nodes (roads, boundaries) - **Relations**:
Topological data analysis for stable feature verification across filtrations of code complexity.
Darwin Gödel Machine patterns for self-improving AI agents with open-ended code evolution. Use for building agents that autonomously improve their own capabilities, modify their codebases, and evolve through interaction.
Proof General + Narya: Higher-dimensional type theory proof assistant with observational bridge types for version control.
Layer 1 Real-Time Social Stream Monitoring via MCP with DuckDB persistence
Rezk types (complete Segal spaces). Local univalence: categorical isomorphisms ≃ type-theoretic identities.
Rubato Composer integration for Mazzola's mathematical music theory
Run self-validation loops for triadic color systems using prediction vs observation and error minimization.
Sheaf neural network coordination via graph Laplacians for distributed consensus and harmonic inference. Use when coordinating multi-agent systems, building sheaf-aware GNNs, or implementing distributed consensus protocols.
SLIME integration for Common Lisp development
Unified Specter/Navigator/3-MATCH architecture with bidirectional path compilation
StructuredDecompositions.jl: Sheaves on tree decompositions for FPT algorithms
3-MATCH gadgets and non-backtracking geodesics for 3-SAT via colored subgraph isomorphism.
# Topos Unified Skill **Trit**: +1 (PLUS/Generator) | **Color**: #D82626 | **Subagent**: Generator Unified access to all topos-theoretic resources across the filesystem - mathematical music theory, categorical databases, infinity topoi, pretopos trees, and gayzip manifests. ## GF(3) Triads ``` topos-unified (+1) ⊗ world-hopping (0) ⊗ sheaf-cohomology (-1) = 0 ✓ [Navigation] topos-unified (+1) ⊗ acsets (0) ⊗ persistent-homology (-1) = 0 ✓ [Database] topos-unified (+1) ⊗ unworld (0) ⊗ thr
Tuple and product structure navigation with composition
Xenodium's Emacs packages: chatgpt-shell, agent-shell, dwim-shell-command, and ACP integration for modern Emacs development.
Directed Yoneda lemma as directed path induction. Riehl-Shulman's key insight for synthetic ∞-categories.