ORCHID introduces a novel, bio-inspired consensus protocol that uses quantum-noisy phase oscillators and a binding threshold derived from neuroscience to achieve scalable, high-fidelity consensus in d…

The paper proposes a Network Distributed Multi-Agent Reinforcement Learning (ND-MARL) framework that enables stable, scalable consensus control for large swarms of quadcopters using only local neighbo…

The paper proposes a scalable, distributed approach for constrained Multi-Agent Reinforcement Learning by using local consensus over dual variables to ensure global constraint satisfaction without cen…

The paper introduces Agora, a domain-aware multi-agent framework that successfully detects deep, previously unknown logic bugs in complex consensus protocols, outperforming existing LLM-based analysis…

TeeDAO introduces a novel three-layer framework that autonomously organizes and manages multiple heterogeneous Trusted Execution Environments (TEEs) to provide robust, distributed-trust systems with h…

The paper proposes DySCo, a dynamic trust-aware sparse consensus mechanism, to efficiently manage communication in multi-agent LLM systems by selectively connecting agents based on real-time value, th…

The paper proposes using an LLM aggregator that analyzes complete reasoning traces, demonstrating that trace-level synthesis is superior to traditional consensus methods like majority voting for solvi…

OrbitBFT introduces a novel two-stage hierarchical BFT consensus protocol that enables scalable and robust Byzantine Fault-Tolerant coordination for large-scale Low Earth Orbit satellite constellation…

The paper addresses secure distributed hypothesis testing, proving impossibility in the standard setting and achieving secure testing for simple and general classes by incorporating a shared secret ke…

The paper introduces Post-Deterministic Distributed Systems (PDDS) as a new model to coordinate autonomous infrastructure where participants, including stochastic agents, produce divergent reasoning p…

The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…

FedIDM introduces a novel federated learning framework that uses iterative distribution matching to achieve fast and stable convergence and maintain high model utility even when facing a large proport…

The paper evaluates dynamic coordination strategy selection for enterprise multi-agent systems, finding that a calibrated default routing approach is effective, even if a deterministic winner-selectio…

The paper introduces distance-preserving transaction digests, a new primitive that replaces standard collision-resistant hashes, enabling more efficient and robust Byzantine Fault Tolerance (BFT) cons…

The paper proposes a tree-based repository blockchain framework to manage hard forks in collaborative blockchain ecosystems, allowing a single process to access all system blocks without relying on In…

Intercloud proposes a decentralized economic network that achieves eventual consistency and security using a novel 'chilling-effect consensus' mechanism, eliminating the need for global coordination.

The paper proposes a bottom-up, system-oriented approach to formally verify authorization algorithms for large-scale, Byzantine fault-tolerant local-first systems, using Rust and the Verus framework.

Pepper is a novel, high-bandwidth anonymous broadcast protocol that achieves cryptographic sender anonymity and significantly improves messaging throughput compared to existing state-of-the-art system…

AetherWeave is a novel, stake-backed peer-discovery protocol that achieves Sybil resistance and privacy in P2P networks, ensuring robust connectivity even against powerful adversaries.

The paper proposes a novel decentralized framework that uses blockchain and Multi-task Peer Prediction to incentivize and manage the computationally intensive process of Federated Learning.