Cited by 20Blockchain Technology Applications and SecurityAdversarial Robustness in Machine LearningMulti-Agent Systems and Negotiation

Blockagents: Towards byzantine-robust llm-based multi-agent coordination via blockchain

Open access
Chen, Bei, Li, Gaolei, Lin, Xi, Wang, Zheng, Li, Jianhua·2024·ACM Turing Award Celebration Conference 2024

Abstract

Recent advancements in multi-agent systems based on large language models (LLM) have shown potential for problem-solving and planning tasks. However, most existing LLM-based multi-agent approaches show vulnerability against byzantine attacks. First, agents instantiated on diverse LLMs may inherit biases present in the LLMs and thus exhibit deception behavior. Second, as the number of agents grows, collusive behavior among multiple malicious agents poses a potential threat. In this paper, we propose BlockAgents, an innovative framework that integrates blockchain into LLM-based cooperative multi-agent systems to mitigate byzantine behaviors. BlockAgents completes multi-agent collaboration through a unified workflow including role assignment, proposal statement, evaluation, and decision-making. To help the agent who contributes the most to the group thinking process acquire accounting rights, we propose a proof-of-thought (PoT) consensus mechanism combined with stake-based miner designation and multi-round debate-style voting. To effectively distinguish valid and abnormal answers, we design a multi-metric prompt-based evaluation method for each evaluator to score each proposal by carefully and comprehensively considering multiple dimensions. Experiments on three datasets show that BlockAgents reduces the interference of poisoning attacks on accuracy to less than 3% and reduces the success rate of backdoor attacks to less than 5%, demonstrating the resistance ability against Byza…

Integrity signals

Registry

Crossref · 10.1145/3674399.3674445

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Most existing multi-agent systems lack robustness.

    “Most existing multi-agent systems lack robustness (Chen et al., 2024a;Zhang et al., 2024;He et al., 2025).”

    From Free-MAD: Consensus-Free Multi-Agent Debate (2026) · cites this paper as Chen et al., 2024a

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Chen, B., Li, G., Lin, X., Wang, Z., & Li, J.
Affiliations
Shanghai Jiao Tong University (CN)
Venue
ACM Turing Award Celebration Conference 2024
Publisher
ACM
Published
2024-07-05
Pages
187-192
OpenAlex
W4401105851
Cited by
15
References
11
Citations by year
2026: 7 · 2025: 8
FWCI
5.71
Type
conference paper
Language
en
Open access
Locations
ACM Turing Celebration Conference - China (ACM TURC) (publishedVersion, cc-by)
Funders
  • National Nature Science Foundation of China (U21B2019, U20B2048, 62202303)
  • curity CommunicNational Key Laboratory of Seation Foundation (6142103042310)
Topics
  • Physical Sciences › Computer Science › Information Systems › Blockchain Technology Applications and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › Multi-Agent Systems and Negotiation
Keywords
multi-agent LLM systems, blockchain, Byzantine attacks, prompt-based evaluation, poisoning attacks, backdoor attacks, collusive behavior, deception, role assignment, decision-making

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review