What is a derangement in the context of this CRDT?

A derangement is a permutation where no element maps to itself. In this skill, it ensures that every state update results in a move, preventing 'fixed points' where data remains stagnant during a transformation.

When should I use Derangement-CRDT over a standard CRDT?

Use this skill when your distributed system requires strict invariants regarding state movement, such as in cryptographic protocols, complex terminal synchronizations, or topological simulations where static states are invalid.

Does this skill support multi-replica conflict resolution?

Yes, it uses a Join-Semilattice approach with Lamport timestamps to resolve conflicts during merges while re-verifying the derangement and coloring properties.

How does GF(3) coloring ensure state conservation?

Cycles within the derangement are assigned 'trits' based on their length modulo 3. The skill enforces a conservation law where the sum of these trits must equal zero (mod 3), ensuring mathematical balance across distributed replicas.

Derangement CRDT & Topological State

Name: Derangement CRDT & Topological State
Author: plurigrid

byplurigrid

•

Gestión de Bases de Datos

Enforces no-fixed-point permutations and GF(3) color conservation within distributed CRDT state transitions.

Acerca de

The Derangement-CRDT skill provides a specialized mathematical framework for managing distributed state transformations where identity mappings are strictly forbidden. By combining the properties of derangements (permutations with no fixed points) with Conflict-free Replicated Data Types (CRDTs), it ensures that every state update represents a genuine transformation. Utilizing a join-semilattice structure and GF(3) triadic coloring, the skill maintains a strict conservation law across cycle-decomposed states, making it an essential tool for high-entropy distributed systems, secure state lattices, and topological modeling in Claude Code.

Características Principales

Subfactorial mathematical validation of state space density
Join-semilattice merge operations ensuring eventual consistency
GF(3) triadic coloring (Ergodic, Plus, Minus) for state balance
2 GitHub stars
Automatic enforcement of the derangement property (no fixed points)
Cross-language implementation patterns for Babashka, Ruby, and Julia

Casos de Uso

Managing distributed state transitions where identity mappings represent security risks
Synchronizing terminal session buffers using cycle-based transformations
Topological simulations requiring balanced cycle decompositions and conservation laws

Acerca de

Características Principales

Subfactorial mathematical validation of state space density
Join-semilattice merge operations ensuring eventual consistency
GF(3) triadic coloring (Ergodic, Plus, Minus) for state balance
2 GitHub stars
Automatic enforcement of the derangement property (no fixed points)
Cross-language implementation patterns for Babashka, Ruby, and Julia

Casos de Uso

Managing distributed state transitions where identity mappings represent security risks
Synchronizing terminal session buffers using cycle-based transformations
Topological simulations requiring balanced cycle decompositions and conservation laws