lattice-spatial-collective

Byzantine fault-tolerant shared memory uses cryptographic sharding and gossip propagation to preserve coherent context across distributed agents. This Skill enables K-of-N reconstruction with Ed25519-signed shards, tolerating up to f malicious nodes in a 2f+1 honest-node setup, maintaining integrity despite churn and adversarial behavior.

Context sharding distributes memory across agents using erasure coding and Merkle DAG integrity verification. Each shard is cryptographically signed and addressed via content identifiers, allowing fault-tolerant reconstruction and efficient gossip-based propagation without requiring all agents to store complete state.

Yes. Gossip-based propagation efficiently disseminates updates across dynamic networks with churn. Combined with Hybrid Logical Clocks for causal tracking and Bloom filters for bandwidth optimization, gossip ensures coherent memory without centralized coordination while maintaining Byzantine fault tolerance.

Implement cryptographic sharding using Ed25519 signatures, configure Merkle DAG structures for integrity verification, and establish CID-based addressing for shard lookup. Deploy a gossip propagation layer with Hybrid Logical Clock causal tracking to enable coherent updates across Byzantine-resistant networks.

Verify shard integrity through Merkle DAG proof-of-membership checks and Ed25519 signature validation on each shard. CID-based addressing enables content-addressable verification; reconstruction requires K-of-N shards to pass cryptographic validation before state coherence is achieved.

Erasure coding reduces storage overhead while maintaining K-of-N fault tolerance; it's optimal when bandwidth and storage are constrained but reconstruction latency is acceptable. Compared to full replication, erasure coding trades faster reads for more complex recovery and suitable for large-scale multi-agent systems with bounded churn.