LDP: An Identity-Aware Protocol for Multi-Agent LLM Systems
Organizations: Indian School of Business, Hyderabad, India
Abstract
As multi-agent AI systems grow in complexity, the protocols connecting them constrain their capabilities. Current protocols such as A2A and MCP do not expose model-level properties as first-class primitives, ignoring properties fundamental to effective delegation: model identity, reasoning profile, quality calibration, and cost characteristics. We present the LLM Delegate Protocol (LDP), an AI-native communication protocol introducing five mechanisms: (1) rich delegate identity cards with quality hints and reasoning profiles; (2) progressive payload modes with negotiation and fallback; (3) governed sessions with persistent context; (4) structured provenance tracking confidence and verification status; (5) trust domains enforcing security boundaries at the protocol level. We implement LDP as a plugin for the JamJet agent runtime and evaluate against A2A and random baselines using local Ollama models and LLM-as-judge evaluation. Identity-aware routing achieves ~12x lower latency on easy tasks through delegate specialization, though it does not improve aggregate quality in our small delegate pool; semantic frame payloads reduce token count by 37% (p=0.031) with no observed quality loss; governed sessions eliminate 39% token overhead at 10 rounds; and noisy provenance degrades synthesis quality below the no-provenance baseline, arguing that confidence metadata is harmful without verification. Simulated analyses show architectural advantages in attack detection (96% vs. 6%) and failure recovery (100% vs. 35% completion). This paper contributes a protocol design, reference implementation, and initial evidence that AI-native protocol primitives enable more efficient and governable delegation.
Figures & tables
| Condition | Quality | Latency (s) | Tokens | |
|---|---|---|---|---|
| LDP | 85.6 | 1379 | 30 | |
| A2A | 67.4 | 1227 | 30 | |
| RANDOM | 42.2 | 826 | 30 |
| Mode | Tokens | Latency (s) | Quality | Info Preserved |
|---|---|---|---|---|
| Text (Mode 0) | 24.1 | |||
| Semantic Frame (Mode 1) | 14.0 | |||
| A2A JSON | 23.4 |
| Condition | Decision Quality | Calibration | Synth. Tokens |
|---|---|---|---|
| With Provenance | 970 | ||
| Without Provenance | 802 | ||
| Noisy Provenance | 1018 |
| Condition | Tokens | Overhead | OH% | Messages |
|---|---|---|---|---|
| LDP 3 rounds | 3,860 | 60 | 2% | 4.2 |
| A2A 3 rounds | 3,847 | 399 | 10% | 6.0 |
| LDP 5 rounds | 6,379 | 0 | 0% | 5.0 |
| A2A 5 rounds | 6,798 | 1,374 | 20% | 10.0 |
| LDP 10 rounds | 12,990 | 0 | 0% | 10.0 |
| A2A 10 rounds | 16,010 | 6,275 | 39% | 20.0 |
| Condition | Detection Rate | False Positive Rate |
|---|---|---|
| LDP Trust Domains | 96.0% | 0.0% |
| A2A Bearer Token | 6.0% | 0.0% |
| Condition | Completion Rate | Quality Degradation | Recovery (ms) |
|---|---|---|---|
| LDP (with fallback) | 100% | 112 | |
| A2A (no fallback) | 35% | 0 |
| A2A Routing | LDP Routing | |
|---|---|---|
| Generic Prompt | ||
| Identity Prompt |
| RQ | Metric | LDP | A2A | Evidence | |
|---|---|---|---|---|---|
| RQ1 | Overall quality ‡ | 6.80 | 7.43 | Empirical | |
| Easy task latency | 2.9s | 34.8s | Empirical | ||
| Hard task quality ‡ | 3.3 | 4.1 | Empirical | ||
| RQ2 | Token count ∗ | 765 | 1128 | Empirical | |
| Latency | 14.0s | 23.4s | Empirical | ||
| Quality ‡ | 5.70 | 5.47 | +0.23 | Empirical |
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
| Attack Type | Description | Detection Mechanism |
|---|---|---|
| Untrusted domain join | Agent from outside the trust domain attempts to register as a delegate | Trust domain membership check |
| Capability escalation | Agent claims capabilities beyond its registered manifest | Capability manifest validation |
| Replay attack | Previously captured task/result messages are re-submitted | Session nonce and timestamp verification |
| Cross-domain access | Agent in domain A attempts to invoke a delegate restricted to domain B | Cross-domain policy enforcement |
| Difficulty | Domain | Prompt (abbreviated) |
|---|---|---|
| Easy | Classify | Classify the sentiment of this product review as positive, negative, or neutral. |
| Easy | Extract | Extract all dates and monetary amounts from this contract paragraph. |
| Medium | Code | Write a Python function that implements binary search on a sorted list with duplicate handling. |
| Medium | Analysis | Compare the tradeoffs between microservices and monolithic architectures for a 5-person team. |
| Hard | Reasoning | Given the following set of constraints, determine whether a valid schedule exists and prove or disprove its feasibility. |
| Hard | Math | Prove that the sum of the first odd numbers equals using mathematical induction. |