What is the purpose of Narya verification in Worlding?

Narya provides a formal verification spec (HOTT) to prove that world builders are valid, ensuring deterministic fingerprinting, associative merging, and positive cardinality.

How does the skill handle duplicate state visits?

It uses an Interactome Bridge that employs fingerprint XORing to detect when a node or state has been 'opened twice,' allowing for efficient deduplication in dense interaction graphs.

What is the core difference between demo_ and world_ patterns?

The demo_ pattern is forbidden because it prints side effects and discards data. The world_ pattern is required because it returns composable, persistent structures that implement mandatory methods like length, merge, and fingerprint.

How does GF(3) conservation work within this skill?

GF(3) conservation ensures that state transitions maintain mathematical equilibrium, where triads of world states sum to zero (mod 3), facilitating deterministic state verification.

Persistent World State Builder

Name: Persistent World State Builder
Author: plurigrid

byplurigrid

•

Developer Tools

Enforces persistent, composable state patterns for topological systems by replacing ephemeral demonstrations with formal world builders.

About

The Worlding skill implements a rigorous architectural pattern for Claude Code within the Gay.jl ecosystem, transitioning from side-effect-heavy 'demo' functions to persistent 'world' structures. It ensures that every state builder adheres to mathematical constraints including GF(3) conservation, Möbius invertibility, and SPI-compliant hashing. This is particularly useful for developers working on complex topological systems, agentic state management, and interaction graphs where state persistence and formal verification via Narya are critical for system integrity.

Key Features

Implements Möbius invertibility and SPI-compliant fingerprinting for state tracking
Enforces the world_ prefix pattern for persistent and composable state builders
Provides GF(3) conservation and Narya formal verification for state integrity
Detects duplicate interaction graph visits via Interactome Bridge XOR hashing
Supports monoidal composition and merging of complex, multi-threaded world states
2 GitHub stars

Use Cases

Managing state in complex Julia-based topological systems and agentic workflows
Migrating ephemeral demo functions to persistent and verifiable world architectures
Deduplicating large-scale interaction graphs using entropy-based navigation

About

Key Features

Implements Möbius invertibility and SPI-compliant fingerprinting for state tracking
Enforces the world_ prefix pattern for persistent and composable state builders
Provides GF(3) conservation and Narya formal verification for state integrity
Detects duplicate interaction graph visits via Interactome Bridge XOR hashing
Supports monoidal composition and merging of complex, multi-threaded world states
2 GitHub stars

Use Cases

Managing state in complex Julia-based topological systems and agentic workflows
Migrating ephemeral demo functions to persistent and verifiable world architectures
Deduplicating large-scale interaction graphs using entropy-based navigation