order-and-lattice-thinking

Diagnosing broken CRDT convergence requires verifying that your domain forms a poset with valid algebraic merge properties. The skill checks reflexivity, antisymmetry, and transitivity, identifies incomparable elements, and defines valid joins to ensure monotone operations and correct concurrent state merges.

A partially ordered domain contains elements that may be incomparable rather than strictly greater or smaller. You need poset verification for type systems when modeling subtype lattices or permission hierarchies, ensuring that reflexivity, antisymmetry, and transitivity hold before defining joins and meets.

Checking monotonicity and lattice termination for dataflow analysis involves evaluating whether operations preserve order and verifying chain conditions. The skill analyzes your lattice structure to determine if algorithms will terminate naturally or require widening techniques for abstract interpretation workflows.

You can model version compatibility using lattice structures by defining bottom and top elements to represent boundaries. The skill helps map protocol compatibility across partially ordered versions, identifying incomparable releases and defining joins for safe schema merges and backward compatibility checks.

Handling incomparable elements in vector clocks requires explicit partial order analysis rather than simple equality checks. The skill identifies incomparable concurrent states, verifies poset laws, and defines algebraic merge properties to structure dataflow and synchronization workflows correctly.

Permission hierarchy merges fail when the underlying order is modeled too crudely without valid joins. The skill analyzes your partially ordered permission domain, verifies antisymmetry and transitivity, and defines precise bottom and top elements to fix broken hierarchy convergence.