Related papers: Constitutional Consensus

Related papers

Ada-TokenCom: Rate-Adaptive Token Communications via Large-Model-Driven Token Compression and Generation [52.99258064220833]
Ada-TokenCom is a rate-adaptive TokenCom framework based on large autoregressive models.<n>We propose a mixed reconstruction/generation scheme, where the transmitter encodes and transmits the highly informative tokens.<n>We show that our proposed Ada-TokenCom framework outperforms both digital and deep joint source-channel coding-based semantic communication baselines.
arXiv Detail & Related papers (2026-08-28T08:54:28Z)
A Technical Taxonomy of LLM Agent Communication Protocols [60.76747983053368]
This study develops a technical taxonomy to classify and analyze large language models (LLMs) agent communication protocols.<n>The framework guides protocol selection and highlights open research gaps such as privacy and policy enforcement.
arXiv Detail & Related papers (2026-06-17T14:45:20Z)
Foundation Protocol: A Coordination Layer for Agentic Society [78.01727114524464]
Foundation Protocol (FP) is a graph-first coordination layer for an emerging human-AI society.<n>FP unifies heterogeneous entities, including agents, tools, resources, humans, institutions, and organizations.<n>The aim is to keep autonomous agency composable while keeping accountability non-negotiable.
arXiv Detail & Related papers (2026-05-22T04:20:35Z)
Constitutional Governance in Metric Spaces [8.575010739465993]
Computational social choice and decision theory offer rich aggregation theory but no comprehensive process for egalitarian self-governance.<n>Here, we propose constitutional governance in metric spaces, integrating deliberation, amendment, and consensus.<n>We focus on the utility of the generalised median, prove that at majority threshold no misreport and study the compromise gap between best peak and unconstrained optimum.
arXiv Detail & Related papers (2026-05-13T11:23:34Z)
Self-Evolving Coordination Protocol in Multi-Agent AI Systems: An Exploratory Systems Feasibility Study [0.0]
Self-Evolving Coordination Protocols (SECP)<n>SECP: coordination protocols that permit limited, externally validated self-modification.<n>This paper presents an exploratory systems feasibility study of Self-Evolving Coordination Protocols.
arXiv Detail & Related papers (2026-02-02T14:45:04Z)
Hierarchical Adaptive Consensus Network: A Dynamic Framework for Scalable Consensus in Collaborative Multi-Agent AI Systems [0.5505634045241287]
This article introduces a three-tier architecture for consensus strategies in multi-agent systems.<n>The first layer collects the confidence-based voting outcomes of several local agent clusters.<n>The second level facilitates inter-cluster communication through cross-clustered partial knowledge sharing and dynamic timeouts.<n>The third layer provides system-wide coordination and final arbitration by employing a global orchestration framework.
arXiv Detail & Related papers (2025-11-16T15:09:15Z)
On the Limits of Consensus under Dynamic Availability and Reconfiguration [18.465539741088197]
We provide a bootstrapping gadget that is particularly simple and efficient in the common optimistic case of few reconfigurations and no double-spending attempts.<n>We then introduce a new and realistic additional assumption: honest nodes dispose of their cryptographic keys the moment they express intent to exit from the set of operating nodes.
arXiv Detail & Related papers (2025-10-04T02:19:25Z)
SmartphoneDemocracy: Privacy-Preserving E-Voting on Decentralized Infrastructure using Novel European Identity [0.0]
SmartphoneDemocracy is a novel e-voting protocol that combines three key technologies.<n>Our protocol enables voters to register and cast ballots anonymously and verifiably directly from their smartphones.
arXiv Detail & Related papers (2025-07-13T02:39:10Z)
Willchain: Decentralized, Privacy-Preserving, Self-Executing, Digital Wills [0.0]
This work presents a novel decentralized protocol for digital estate planning that integrates advances distributed computing, and cryptography.<n>A key contribution of this research is the implementation of several modern cryptographic primitives to support various forms of claims for information validation.<n>This ensures a fair and secure distribution of digital assets in accordance with the wishes of the decedent without the requirement of moving their funds.
arXiv Detail & Related papers (2025-07-04T16:23:32Z)
IDCloak: A Practical Secure Multi-party Dataset Join Framework for Vertical Privacy-preserving Machine Learning [7.765213701941396]
This paper proposes IDCloak, the first practical secure multi-party dataset join framework for vPPML.<n>We show that IDCloak demonstrates higher efficiency in the two-party setting and comparable performance when the party number increases.<n>Our proposed cmPSI protocol provides a stronger security guarantee (dishonest majority) while improving efficiency by up to $7.78times$ in time and $8.73times$ in communication sizes.
arXiv Detail & Related papers (2025-06-01T16:20:39Z)
Seeing the Politics of Decentralized Social Media Protocols [15.148383833030714]
Decentralized social media have been driven by concerns about the concentrated power of centralized platforms and their societal impact.<n>We analyze four such protocols -- ActivityPub, AT Protocol, Nostr, and Farcaster -- to develop a novel conceptual framework for understanding how protocols operationalize decentralization.
arXiv Detail & Related papers (2025-05-29T01:04:45Z)
Secure Stateful Aggregation: A Practical Protocol with Applications in Differentially-Private Federated Learning [36.42916779389165]
DP-FTRL based approaches have already seen widespread deployment in industry. We introduce secure stateful aggregation: a simple append-only data structure that allows for the private storage of aggregate values. We observe that secure stateful aggregation suffices for realizing DP-FTRL-based private federated learning.
arXiv Detail & Related papers (2024-10-15T07:45:18Z)
Validated Strong Consensus Protocol for Asynchronous Vote-based Blockchains [4.79997217554732]
Vote-based blockchains use Byzantine Fault Tolerance consensus protocols to transition from one state to another.<n>This paper proposes a emphvalidated strong BFT consensus model that allows leader-based coordination in asynchronous settings.<n>Our protocol greatly reduces message complexity and is the first one to achieve linear view changes without relying on threshold signatures.
arXiv Detail & Related papers (2024-09-12T15:54:40Z)
A Multiparty Quantum Private Equality Comparison scheme relying on $\ket{ GHZ_{ 3 } }$ states [0.0]
This paper introduces an innovative entanglement-based protocol that accomplishes multiparty quantum private comparison. It is made possible because the protocol uses only GHZ3 triplets, irrespective of the number of millionaires. The protocol is information-theoretically secure, preventing outside parties from learning about fortunes or inside players from knowing each other's secret numbers.
arXiv Detail & Related papers (2024-07-07T14:21:22Z)
Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
arXiv Detail & Related papers (2024-03-28T07:08:26Z)
ParCo: Part-Coordinating Text-to-Motion Synthesis [48.67225204910634]
We propose Part-Coordinating Text-to-Motion Synthesis (ParCo) ParCo is endowed with enhanced capabilities for understanding part motions and communication among different part motion generators. Our approach demonstrates superior performance on common benchmarks with economic computations.
arXiv Detail & Related papers (2024-03-27T12:41:30Z)
Grassroots Social Networking: Where People have Agency over their Personal Information and Social Graph [2.06682776181122]
We present a grassroots architecture for serverless, permissionless, peer-to-peer social networks termed Grassroots Social Networking. The architecture incorporates (i) a decentralized social graph, where each person controls, maintains and stores only their local neighborhood in the graph. We provide two example Grassroots Social Networking protocols -- Twitter-like and WhatsApp-like -- and address their security (safety, liveness and privacy), spam/bot/deep-fake resistance, and implementation.
arXiv Detail & Related papers (2023-06-24T11:43:17Z)
An Efficient and Multi-private Key Secure Aggregation for Federated Learning [41.29971745967693]
We propose an efficient and multi-private key secure aggregation scheme for federated learning. Specifically, we skillfully modify the variant ElGamal encryption technique to achieve homomorphic addition operation. For the high dimensional deep model parameter, we introduce a super-increasing sequence to compress multi-dimensional data into 1-D.
arXiv Detail & Related papers (2023-06-15T09:05:36Z)
Multipartite entanglement theory with entanglement-nonincreasing operations [55.2480439325792]
We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication.<n>We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
arXiv Detail & Related papers (2023-05-30T12:53:56Z)
Understanding Blockchain Governance: Analyzing Decentralized Voting to Amend DeFi Smart Contracts [17.620751747376726]
We review and characterize decentralized governance in practice, using Compound and Uniswap. We reveal a high concentration of voting power in both Compound and Uniswap. We show that voting on Compound proposals can be unfairly expensive for small token holders.
arXiv Detail & Related papers (2023-05-28T07:45:33Z)
Resilient Consensus Sustained Collaboratively [6.090550359575682]
We present the design of our Power-of-Collaboration protocol, which guards existing PoS/BFT blockchains against long-range attacks. PoC guarantees fairness and accountability and only marginally degrades the throughput of the underlying system.
arXiv Detail & Related papers (2023-02-05T07:33:57Z)
Deploying Convolutional Networks on Untrusted Platforms Using 2D Holographic Reduced Representations [33.26156710843837]
We create a neural network with a pseudo-encryption style defense that empirically shows robustness to attack. By leveraging Holographic Symbolic Reduced Representations (HRR), we create a neural network with a pseudo-encryption style defense that empirically shows robustness to attack.
arXiv Detail & Related papers (2022-06-13T03:31:39Z)
Squeezeformer: An Efficient Transformer for Automatic Speech Recognition [99.349598600887]
Conformer is the de facto backbone model for various downstream speech tasks based on its hybrid attention-convolution architecture. We propose the Squeezeformer model, which consistently outperforms the state-of-the-art ASR models under the same training schemes.
arXiv Detail & Related papers (2022-06-02T06:06:29Z)
Disentangling Decentralized Finance (DeFi) Compositions [1.7205106391379026]
Decentralized Finance protocols aim to disrupt traditional finance and offer services on top of distributed ledgers. We study the interactions of protocols and associated smart contracts. We propose an algorithm to decompose a protocol call into a nested set of building blocks that may be part of other DeFi protocols.
arXiv Detail & Related papers (2021-11-05T14:02:18Z)
Structured Diversification Emergence via Reinforced Organization Control and Hierarchical Consensus Learning [48.525944995851965]
We propose a structured diversification emergence MARL framework named scRochico based on reinforced organization control and hierarchical consensus learning. scRochico is significantly better than the current SOTA algorithms in terms of exploration efficiency and cooperation strength.
arXiv Detail & Related papers (2021-02-09T11:46:12Z)
DyCo3D: Robust Instance Segmentation of 3D Point Clouds through Dynamic Convolution [136.7261709896713]
We propose a data-driven approach that generates the appropriate convolution kernels to apply in response to the nature of the instances. The proposed method achieves promising results on both ScanetNetV2 and S3DIS. It also improves inference speed by more than 25% over the current state-of-the-art.
arXiv Detail & Related papers (2020-11-26T14:56:57Z)
Holdout SGD: Byzantine Tolerant Federated Learning [43.446891082719944]
This work presents a new distributed Byzantine tolerant federated learning algorithm, HoldOut SGD, for Gradient Descent (SGD) optimization. HoldOut SGD uses the well known machine learning technique of holdout estimation, in a distributed fashion, in order to select parameter updates that are likely to lead to models with low loss values. We provide formal guarantees for the HoldOut SGD process in terms of its convergence to the optimal model, and its level of resilience to the fraction of Byzantine workers.
arXiv Detail & Related papers (2020-08-11T10:16:37Z)
Regulation conform DLT-operable payment adapter based on trustless - justified trust combined generalized state channels [77.34726150561087]
Economy of Things (EoT) will be based on software agents running on peer-to-peer trustless networks. We give an overview of current solutions that differ in their fundamental values and technological possibilities. We propose to combine the strengths of the crypto based, decentralized trustless elements with established and well regulated means of payment.
arXiv Detail & Related papers (2020-07-03T10:45:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.