1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
//! # Constraint-CRDT
//!
//! CRDT-backed constraint states for distributed fleet consensus.
//!
//! ## Core insight
//!
//! CRDTs satisfy three algebraic laws (commutative, associative, idempotent).
//! Constraint satisfaction requires closure under lattice operations.
//! These are THE SAME algebraic structure — a semilattice.
//!
//! ## Modules
//!
//! - `merge` — The semilattice join trait (C/A/I laws)
//! - `state` — Composite CRDT: all sub-CRDTs in one mergeable unit
//! - `counter` — G-Counter: distributed satisfaction counting
//! - `pncounter` — PN-Counter: positive/negative counting
//! - `orset` — OR-Set: add-wins constraint tracking
//! - `eisenstein` — Lattice positions as LWW registers (lower norm wins)
//! - `tile` — PLATO tiles as mergeable CRDTs
//! - `vclock` — Vector clocks for causal ordering
//! - `delta` — Delta-state CRDTs (send only changes)
//! - `merkle` — State hashes for efficient sync detection
//! - `gossip` — Anti-entropy gossip protocol
//! - `simulation` — Deterministic network simulation
//! - `plato` — HTTP client for PLATO server (feature-gated)
pub use Merge;
pub use ConstraintState;
pub use ConstraintGCounter;
pub use PNCounter;
pub use ConstraintORSet;
pub use EisensteinRegister;
pub use FleetTile;
pub use VectorClock;
pub use ;
pub use StateHash;
pub use ;
pub use Simulation;
pub use PlatoClient;