Sybil-Resistant Service Discovery for Agent Economies

• URL: http://arxiv.org/abs/2510.27554v1
• Date: Fri, 31 Oct 2025 15:29:31 GMT
• Title: Sybil-Resistant Service Discovery for Agent Economies
• Abstract summary: x402 enables Hypertext Transfer Protocol services like application programming interfaces (APIs), data feeds, and inference providers to accept cryptocurrency payments for access.<n>We introduce TraceRank, a reputation-weighted ranking algorithm where payment transactions serve as endorsements.<n>We argue that reputation propagation resists Sybil attacks by making spam services with many low-reputation payers rank below legitimate services with few high-reputation payers.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: x402 enables Hypertext Transfer Protocol (HTTP) services like application programming interfaces (APIs), data feeds, and inference providers to accept cryptocurrency payments for access. As agents increasingly consume these services, discovery becomes critical: which swap interface should an agent trust? Which data provider is the most reliable? We introduce TraceRank, a reputation-weighted ranking algorithm where payment transactions serve as endorsements. TraceRank seeds addresses with precomputed reputation metrics and propagates reputation through payment flows weighted by transaction value and temporal recency. Applied to x402's payment graph, this surfaces services preferred by high-reputation users rather than those with high transaction volume. Our system combines TraceRank with semantic search to respond to natural language queries with high quality results. We argue that reputation propagation resists Sybil attacks by making spam services with many low-reputation payers rank below legitimate services with few high-reputation payers. Ultimately, we aim to construct a search method for x402 enabled services that avoids infrastructure bias and has better performance than purely volume based or semantic methods.

Related papers

• Codebook Agent: Amortized Topology Design for LLM Multi-Agent Systems [67.04448659688579]
  We develop a query-independent 16-entry codebook that ranks the top decoded candidates in a single batched forward pass.<n>With no iterative search and no message passing at test time, Codebook Agent is the most accurate method on all six benchmarks.
  arXiv  Detail & Related papers  (2026-09-02T08:10:22Z)
• When HTTP 402 Meets the Blockchain: Risks on Emerging x402 Payments [53.795332613020946]
  x402 is an emerging payment protocol for Web APIs and autonomous AI agents.<n>We present the first systematic study of authorization correctness and execution safety in current facilitator-mediated x402 deployments in the wild.<n>We derive four new attack vectors, including Free Shopping, Asset Theft, Service Denial, and Gas Abuse.
  arXiv  Detail & Related papers  (2026-07-21T19:45:13Z)
• Fantastic Adaptive Taxonomies and How to Use Them [100.20614173157708]
  AdaMAST converts execution traces into a compact, evidence-grounded failure taxonomy.<n>No code is hand-authored, no trace human-annotated.<n>In agent-system search, taxonomy-coded diagnoses of failed candidates outperform free-form.
  arXiv  Detail & Related papers  (2026-07-17T17:41:16Z)
• AJ-Bench: Benchmarking Agent-as-a-Judge for Environment-Aware Evaluation [71.49152943451328]
  We introduce a benchmark AJ-Bench to evaluate Agent-as-a-Judge across three domains-search, data systems, and graphical user interfaces-comprising 155 tasks and 516 annotated trajectories.<n>Experiments demonstrate consistent performance gains over LLM-as-a-Judge baselines, while also revealing substantial open challenges in agent-based verification.
  arXiv  Detail & Related papers  (2026-04-20T13:23:38Z)
• Hardening x402: PII-Safe Agentic Payments via Pre-Execution Metadata Filtering [0.913755431537592]
  We present presidio-hardened-x402, the first open-source that intercepts x402 payment requests before transmission to detect and redact personally identifiable information (PII)<n>To evaluate the PII filter, we construct a labeled synthetic corpus of 2,000 x402 metadata tripleconfigurations spanning seven use-case categories, and run a 42-precision/recall sweep across two detection modes (regex, NLP) and five confidence thresholds.<n>The recommended configuration achieves micro-F1 = 0.894 with precision 0.972, at a p99 latency of 5.73ms - well within the 50ms overhead budget.
  arXiv  Detail & Related papers  (2026-04-13T13:17:12Z)
• APEX: Agent Payment Execution with Policy for Autonomous Agent API Access [0.0]
  APEX is a complete research system that adapts 402-style payment gating to UPI-like fiat.<n>It preserves policy-governed spend control, tokenized access verification, and replay resistance.<n>Results show that policy enforcement reduces total spending by 27.3% while maintaining 52.8% success rate for legitimate requests.
  arXiv  Detail & Related papers  (2026-04-02T13:32:01Z)
• $τ$-Knowledge: Evaluating Conversational Agents over Unstructured Knowledge [58.03692489021332]
  $$-Knowledge is an extension of $$-Bench for evaluating agents in environments where success depends on coordinating external, natural-language knowledge with tool outputs.<n>We show that $$-Knowledge provides a realistic testbed for developing agents that integrate unstructured knowledge in human-facing deployments.
  arXiv  Detail & Related papers  (2026-03-04T18:34:47Z)
• Fairness Dynamics in Digital Economy Platforms with Biased Ratings [50.29721091981893]
  We study how digital platforms can perpetuate or counteract rating-based discrimination.<n>Our results demonstrate a fundamental trade-off between user experience and fairness.<n>Our results also provide evidence that intervening by tuning the demographics of the search results is a highly effective way of reducing unfairness.
  arXiv  Detail & Related papers  (2026-02-18T18:41:16Z)
• Failure is Feedback: History-Aware Backtracking for Agentic Traversal in Multimodal Graphs [13.855117422052315]
  Open-domain multimodal document retrieval aims to retrieve specific components from large and interconnected document corpora.<n>Existing graph-based retrieval approaches rely on a uniform similarity metric that overlooks hop-specific semantics.<n>We propose Failure is Feedback (FiF), which casts subgraph retrieval as a sequential decision process.<n>FiF achieves state-of-the-art retrieval on the benchmarks of MultimodalQA, MMCoQA and WebQA.
  arXiv  Detail & Related papers  (2026-02-03T11:54:38Z)
• Game of Trust: How Trustworthy Does Your Blockchain Think You Are? [13.895485424939329]
  We investigate how a blockchain can distill the collective belief of its nodes regarding the trustworthiness of a (sub)set of nodes into a em reputation system that reflects the probability of correctly performing a task.<n>We propose a new class of games, called Trustworthy Reputation games (TRep games), which aim to extract the collective beliefs on trust from the actions of rational participants.
  arXiv  Detail & Related papers  (2025-05-20T16:06:25Z)
• Are You Getting What You Pay For? Auditing Model Substitution in LLM APIs [71.7892165868749]
  Commercial Large Language Model (LLM) APIs create a fundamental trust problem.<n>Users pay for specific models but have no guarantee that providers deliver them faithfully.<n>We formalize this model substitution problem and evaluate detection methods under realistic adversarial conditions.<n>We propose and evaluate the use of Trusted Execution Environments (TEEs) as one practical and robust solution.
  arXiv  Detail & Related papers  (2025-04-07T03:57:41Z)
• Pod: An Optimal-Latency, Censorship-Free, and Accountable Generalized Consensus Layer [1.9262692180149905]
  pod is a novel notion of consensus whose first priority is to achieve the physically-optimal latency of $2delta$.<n>Clients send transactions directly to all replicas, which independently process transactions and append them to local logs.<n>We show pod-core, a protocol that satisfies properties such as transaction confirmation within $2delta$, censorship resistance against Byzantine replicas, and accountability for safety violations.
  arXiv  Detail & Related papers  (2025-01-24T21:41:03Z)
• Beyond Browsing: API-Based Web Agents [58.39129004543844]
  API-Based Agents outperform web Browsing Agents in experiments on WebArena.<n>Hybrid Agents out-perform both others nearly uniformly across tasks.<n>Results strongly suggest that when APIs are available, they present an attractive alternative to relying on web browsing alone.
  arXiv  Detail & Related papers  (2024-10-21T19:46:06Z)
• Towards Trust and Reputation as a Service in a Blockchain-based Decentralized Marketplace [0.9217021281095907]
  We propose a novel trust and reputation service for a decentralized marketplace. Our service was inspired by Laplace Law of Succession, where trust in a seller is defined as the probability that she will fulfill her obligations. We show how to predict trust and reputation far in the future, based on incomplete information.
  arXiv  Detail & Related papers  (2024-03-02T04:44:56Z)
• Algorithmic Persuasion Through Simulation [51.23082754429737]
  We study a Bayesian persuasion game where a sender wants to persuade a receiver to take a binary action.<n>The sender is informed about the (real-valued) state of the world, such as the quality of the product, but only has limited information about the receiver's beliefs and utilities.<n>Motivated by customer surveys, user studies, and recent advances in AI, we allow the sender to learn more about the receiver.
  arXiv  Detail & Related papers  (2023-11-29T23:01:33Z)
• Evaluating Verifiability in Generative Search Engines [70.59477647085387]
  Generative search engines directly generate responses to user queries, along with in-line citations. We conduct human evaluation to audit four popular generative search engines. We find that responses from existing generative search engines are fluent and appear informative, but frequently contain unsupported statements and inaccurate citations.
  arXiv  Detail & Related papers  (2023-04-19T17:56:12Z)
• Byzantine-Robust Online and Offline Distributed Reinforcement Learning [60.970950468309056]
  We consider a distributed reinforcement learning setting where multiple agents explore the environment and communicate their experiences through a central server. $alpha$-fraction of agents are adversarial and can report arbitrary fake information. We seek to identify a near-optimal policy for the underlying Markov decision process in the presence of these adversarial agents.
  arXiv  Detail & Related papers  (2022-06-01T00:44:53Z)
• Fine-grained TLS Services Classification with Reject Option [0.0]
  This paper focuses on collecting a large up-to-date dataset with almost 200 fine-grained service labels and 140 million network flows extended with packet-level metadata. The number of flows is three orders of magnitude higher than in other existing public labeled datasets of encrypted traffic. The published dataset is intended as a benchmark for identifying services in encrypted traffic.
  arXiv  Detail & Related papers  (2022-02-24T09:44:12Z)
• A Semi-supervised Graph Attentive Network for Financial Fraud Detection [30.645390612737266]
  We propose a semi-supervised attentive graph neural network, namedSemiSemiGNN, to utilize the multi-view labeled and unlabeled data for fraud detection. By utilizing the social relations and the user attributes, our method can achieve a better accuracy compared with the state-of-the-art methods on two tasks.
  arXiv  Detail & Related papers  (2020-02-28T10:35:25Z)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.