lattice-spatial-collective

Coordinate shared context across distributed AI agents with cryptographic sharding and gossip.

Updated Aug 27, 2026

Search Tags:#memory #cryptography #sharding #gossip #bft

Ready to run

npx skills add https://github.com/starwreckntx/IRP__METHODOLOGIES- --skill lattice-spatial-collective

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: lattice-spatial-collective
Source: https://github.com/starwreckntx/IRP__METHODOLOGIES-/tree/main/skills/lattice-spatial-collective
Command: npx skills add https://github.com/starwreckntx/IRP__METHODOLOGIES- --skill lattice-spatial-collective

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

This Skill describes a distributed memory protocol that preserves coherent shared context across many agents using cryptographic sharding and gossip.

Core Features & Use Cases

Context Sharding: Distribute memory across agents with fault tolerance.
Gossip Propagation: Efficiently disseminate updates in a decentralized manner.
Byzantine Fault Tolerance: Maintain integrity despite adversarial nodes.

Quick Start

Initiate a LATTICE session and propagate an update to verify shard reconstruction.

Frequently Asked Questions about lattice-spatial-collective

High-intent search queries and answers about installing and using this skill.

FAQPage Schema

How do I maintain shared memory across distributed agents with Byzantine fault tolerance?▼

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.

What is context sharding and how does it work in distributed systems?▼

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.

Can I use gossip protocols for decentralized memory propagation in multi-agent systems?▼

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.

What are the prerequisites for implementing a fault-tolerant distributed memory system?▼

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.

How do I verify shard integrity in a distributed memory system?▼

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.

When should I use erasure coding instead of simple replication for distributed memory?▼

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.