Construct directed bridges and perform hops across ordered locales with GF(3) conservation.
npx skills add https://github.com/plurigrid/asi --skill glass-hopping
Please help me install this Agent Skill. Skill: glass-hopping Source: https://github.com/plurigrid/asi/tree/main/skills/glass-hopping Command: npx skills add https://github.com/plurigrid/asi --skill glass-hopping
Glass Hoping synthesizes concepts from Glass Bead Game, World Hopping, and Ordered Locale to navigate the space of possibilities with GF(3) conservation, providing a structured framework for traversing ideas across worlds.
just glass-hop
High-intent search queries and answers about installing and using this skill.
Glass-hopping navigates possibility space by composing glass-bead-game concepts with observational bridges and world-hopping within an ordered locale. The framework uses beads, bridges, and hops to traverse world-state space while maintaining GF(3) conservation across transitions, enabling structured exploration of theoretical models and reasoning tasks.
GF(3) conservation ensures triadic invariants are preserved across hops between worlds. This means every move between world-states maintains balance according to GF(3) rules, making transitions verifiable and consistent through a formal spec with seed-based determinism.
Combine observational beads, directional bridge types, and hops as a unified mechanism. Each bead marks a point in world-state space, bridges connect beads with directional types, and hops execute transitions. The Skill verifies composition and hop rules through its formal framework to ensure valid world navigation.
Yes. Glass-hopping applies to theoretical modeling, game-like exploration, and reasoning tasks requiring directed bridges, bead placement, and state traversal. It satisfies type-theoretic requirements with World, Bead, Bridge, and Hop constructs within a complete Heyting algebra of opens.
Moves are scored by GF(3) balance and bridge quality. The Skill provides scoring and demo capabilities to assess whether each hop maintains triadic invariants and whether bridges compose correctly according to the formal specification.
plurigridImplement ordered locales with frames and preorders in Julia/Catlab workflows.
bivexExtract player metrics, difficulty curves, and loot tables from narrative text.
plurigridCompute shortest valid hop paths between possible worlds under triangle inequality constraints.
Arcadi4Solve graph-search and representation problems for directed and undirected graphs.
