# Protocol (disambiguation)

A disambiguation topic for the term "protocol," including OOP interfaces and network or communication protocols.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Playing the SMR Game with Existential Honesty

DevFeed: [Playing the SMR Game with Existential Honesty](<https://devfeed.tech/articles/playing-the-smr-game-with-existential-honesty-143158.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.24586>)

Author: Zeta Avarikioti, Odysseas Sofikitis, Christos Stefo

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Finance](<https://devfeed.tech/topics/finance.md>)

Tags: [adversary](<https://devfeed.tech/tags/adversary.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [bribe](<https://devfeed.tech/tags/bribe.md>), [censorship](<https://devfeed.tech/tags/censorship.md>), [certificate](<https://devfeed.tech/tags/certificate.md>), [certificates](<https://devfeed.tech/tags/certificates.md>), [clients](<https://devfeed.tech/tags/clients.md>), [coin](<https://devfeed.tech/tags/coin.md>), [communication](<https://devfeed.tech/tags/communication.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [fees](<https://devfeed.tech/tags/fees.md>), [fetch](<https://devfeed.tech/tags/fetch.md>), [full](<https://devfeed.tech/tags/full.md>), [identity](<https://devfeed.tech/tags/identity.md>), [interactive](<https://devfeed.tech/tags/interactive.md>), [layer](<https://devfeed.tech/tags/layer.md>), [network](<https://devfeed.tech/tags/network.md>), [node](<https://devfeed.tech/tags/node.md>), [nodes](<https://devfeed.tech/tags/nodes.md>), [one](<https://devfeed.tech/tags/one.md>), [smr](<https://devfeed.tech/tags/smr.md>)

### AI overview

The paper proposes a finalization layer that remains safe even when every validator is rational or Byzantine, assuming one unidentified full node is honest and always online. In a synchronous network, clients relay received certificates to full nodes, wait before confirming, run an existing freezing gadget, and fetch past certificates from the honest node. This prevents honest clients from confirming conflicting ledgers under any validator strategy. Rewards encourage participation but can also fund bribery and censorship: using only its rewards, the adversary can censor less than a fraction of available fees equal to the fraction of the quorum it signs at each height; any additional censorship requires spending its own funds.

### Source excerpt

arXiv:2611.24586v1 Announce Type: new Abstract: State machine replication protocols are usually proven secure in the honest-Byzantine setting, which requires an honest supermajority of validators. Deployed systems offer no such guarantee: validators participate for profit and may deviate from the protocol whenever doing so increases their gains. In our work, every validator is rational or Byzantine, and none is honest. Rational validators may collude with each other and with the Byzantine ones, who may also bribe them to deviate. Known impossibility results show that, without honest validators, clients that decide whether to accept a transaction based on a non-interactive certificate and without further communication cannot be kept safe. To bypass these results, we let clients relay the certificates they receive to full nodes and wait before confirming transactions. We also assume that one full node, whose identity is unknown, is honest and always online. Under this assumption, we build a finalization layer over any certifiable quorum-based protocol in a synchronous network. Clients run an existing freezing gadget and fetch past certificates from the honest full node, which makes the protocol \emph{always-safe}: no two honest clients confirm conflicting ledgers, for any strategy of the validators. We incentivize participation through rewards, which the adversary may use to bribe rational validators into censoring transactions. In this setting, we formalize censorship and characterize it tightly: paying only with his rewards, the adversary censors less than a $\bw$ fraction of the available fees at each height, where $\bw$ is the fraction of the quorum he signs, and every coin of censorship beyond that comes from his own funds.

## Building the Agent Host Protocol for sessions that continue across devices

DevFeed: [Building the Agent Host Protocol for sessions that continue across devices](<https://devfeed.tech/articles/building-the-agent-host-protocol-for-sessions-that-continue-across-devices-139418.md>)

Original publisher: [Read original article](<https://github.blog/engineering/engineering-principles/building-the-agent-host-protocol-for-sessions-that-continue-across-devices/>)

Author: Rob Lourens

Published: 2026-11-17T18:20:40Z

Content type: article

Language: en

Sources: [GitHub Blog](<https://devfeed.tech/sources/github-engineering.md>), [GitHub Engineering](<https://devfeed.tech/sources/github.md>)

Topics: [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [long-running](<https://devfeed.tech/topics/long-running.md>), [state-management](<https://devfeed.tech/topics/state-management.md>), [GitHub Copilot](<https://devfeed.tech/topics/github-copilot.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [apps](<https://devfeed.tech/tags/apps.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [devices](<https://devfeed.tech/tags/devices.md>), [editors](<https://devfeed.tech/tags/editors.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [engineering-principles](<https://devfeed.tech/tags/engineering-principles.md>), [github](<https://devfeed.tech/tags/github.md>), [github-copilot](<https://devfeed.tech/tags/github-copilot.md>), [open](<https://devfeed.tech/tags/open.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [sessions](<https://devfeed.tech/tags/sessions.md>), [vs-code](<https://devfeed.tech/tags/vs-code.md>)

### AI overview

The Agent Host Protocol (AHP) lets agent sessions continue across clients and devices through a shared, open protocol instead of separate integrations tied to each app. It uses URI-identified channels and reducer-based state: servers arbitrate state, while clients send actions that can change it or trigger effects. Queued actions can be replayed and reconciled after network interruptions, and clients can interact with the same agents, history, and state. AHP focuses on interaction rather than prescribing agent behavior. VS Code and GitHub built separate hosts in TypeScript and Rust to meet different local and cloud infrastructure needs; implementing the protocol independently exposed portability gaps and assumptions. Libraries are available in Rust, TypeScript, Kotlin, Swift, .NET, and Go. The article describes connecting hosts through the Copilot app or VS Code, and launching or inspecting VS Code's host with `code agent host` and `code agent endpoints`.

### Source excerpt

Discover how we built the open Agent Host Protocol to keep your agent sessions accessible across editors, apps, phones, and the cloud. The post Building the Agent Host Protocol for sessions that continue across devices appeared first on The GitHub Blog.

## Stargate: Security Analysis and Mission-Aware Firewall for the CubeSat Space Protocol

DevFeed: [Stargate: Security Analysis and Mission-Aware Firewall for the CubeSat Space Protocol](<https://devfeed.tech/articles/stargate-security-analysis-and-mission-aware-firewall-for-the-cubesat-space-protocol-137020.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.18874>)

Author: Owen Ramsey, Carlos Gonzalez-Cortes, Efren Lopez-Morales

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [network security](<https://devfeed.tech/topics/network-security.md>), [Security](<https://devfeed.tech/topics/security.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [attack](<https://devfeed.tech/tags/attack.md>), [authorization](<https://devfeed.tech/tags/authorization.md>), [awareness](<https://devfeed.tech/tags/awareness.md>), [blocks](<https://devfeed.tech/tags/blocks.md>), [command](<https://devfeed.tech/tags/command.md>), [communication](<https://devfeed.tech/tags/communication.md>), [context](<https://devfeed.tech/tags/context.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [csp](<https://devfeed.tech/tags/csp.md>), [cubesat](<https://devfeed.tech/tags/cubesat.md>), [firewall](<https://devfeed.tech/tags/firewall.md>), [flight](<https://devfeed.tech/tags/flight.md>), [latency](<https://devfeed.tech/tags/latency.md>), [management](<https://devfeed.tech/tags/management.md>), [mission](<https://devfeed.tech/tags/mission.md>), [modular](<https://devfeed.tech/tags/modular.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [security](<https://devfeed.tech/tags/security.md>), [security-analysis](<https://devfeed.tech/tags/security-analysis.md>), [space](<https://devfeed.tech/tags/space.md>), [stargate](<https://devfeed.tech/tags/stargate.md>)

### AI overview

The study identifies CSP security weaknesses in its trust assumptions, network abstractions, management services, command semantics, and lack of mission context. Stargate is a modular firewall that enforces node and service authorization, command-level filtering, and mission-context constraints. In a virtual testbed based on a real-world CubeSat mission and flight software, it blocked 11 representative attacks across four classes and added 1.42 ms of median round-trip latency. These results are limited to the reported testbed evaluation.

### Source excerpt

arXiv:2611.18874v1 Announce Type: cross Abstract: The CubeSat Space Protocol (CSP) is widely used for communication in CubeSat missions, yet its security model and attack surface remain largely unexplored. In this work, we present a systematic security analysis of CSP and identify fundamental limitations in its trust assumptions, coarse-grained network abstractions, privileged management services, application command semantics, and lack of mission-context awareness. Based on these findings, we develop a taxonomy of CSP attacks spanning four classes: network identity abuse, management service abuse, application semantic abuse, and mission context abuse. We then introduce Stargate, a modular, mission-aware firewall that enforces CSP-specific policies derived from this taxonomy, including node and service authorization, command-level filtering, and mission-context constraints. We implement Stargate and evaluate it on a virtual testbed based on a real-world CubeSat mission and flight software. Stargate successfully blocks all 11 representative attacks across the four attack classes while introducing only 1.42 ms of additional median round-trip latency. Our results demonstrate that protocol- and mission-aware policy enforcement provides a practical approach for securing CSP-based spacecraft networks.

## ZDI-26-964: (Pwn2Own) Philips Hue Bridge HomeKit Accessory Protocol chacha20\_decrypt Integer Underflow Remote Code Execution Vulnerability

DevFeed: [ZDI-26-964: (Pwn2Own) Philips Hue Bridge HomeKit Accessory Protocol chacha20\_decrypt Integer Underflow Remote Code Execution Vulnerability](<https://devfeed.tech/articles/zdi-26-964-pwn2own-philips-hue-bridge-homekit-accessory-protocol-chacha20-decrypt-integer-underflow-remote-code-execution-vulnerability-133789.md>)

Original publisher: [Read original article](<http://www.zerodayinitiative.com/advisories/ZDI-26-964/>)

Published: 2026-11-13T06:00:00Z

Content type: news

Language: en

Sources: [Zero Day Initiative](<https://devfeed.tech/sources/zero-day-initiative.md>)

Topics: [Exploit](<https://devfeed.tech/topics/exploit.md>), [ChaCha](<https://devfeed.tech/topics/chacha-cipher.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [bridge](<https://devfeed.tech/tags/bridge.md>), [code-execution](<https://devfeed.tech/tags/code-execution.md>), [homekit](<https://devfeed.tech/tags/homekit.md>), [philips](<https://devfeed.tech/tags/philips.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [pwn2own](<https://devfeed.tech/tags/pwn2own.md>), [remote](<https://devfeed.tech/tags/remote.md>), [remote-code-execution](<https://devfeed.tech/tags/remote-code-execution.md>), [remote-code-execution-vulnerability](<https://devfeed.tech/tags/remote-code-execution-vulnerability.md>), [vulnerability](<https://devfeed.tech/tags/vulnerability.md>)

### AI overview

The Philips Hue Bridge HomeKit Accessory Protocol service has an integer underflow vulnerability that can let network-adjacent attackers execute code without authentication. The flaw occurs while parsing pairing requests on TCP port 8080 by default: inadequate validation of supplied data can cause an integer underflow before a memory write. The advisory identifies Bridge v2 Software version 1975170000 as the fix and assigns CVE-2026-126979 and a CVSS rating of 8.8.

### Source excerpt

This vulnerability allows network-adjacent attackers to execute arbitrary code on affected installations of Philips Hue Bridge. Authentication is not required to exploit this vulnerability. The ZDI has assigned a CVSS rating of 8.8. The following CVEs are assigned: CVE-2026-126979.

## This is the Meta MetaRoCE Network Adapter

DevFeed: [This is the Meta MetaRoCE Network Adapter](<https://devfeed.tech/articles/this-is-the-meta-metaroce-network-adapter-130994.md>)

Original publisher: [Read original article](<https://www.servethehome.com/this-is-the-meta-metaroce-network-adapter/>)

Author: Rohit Kumar

Published: 2026-11-12T04:51:39Z

Content type: news

Language: en

Sources: [ServeTheHome](<https://devfeed.tech/sources/servethehome.md>)

Topics: [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Network architectures](<https://devfeed.tech/topics/network-architectures.md>), [AI Infrastructure](<https://devfeed.tech/topics/ai-infrastructure.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [adapter](<https://devfeed.tech/tags/adapter.md>), [clusters](<https://devfeed.tech/tags/clusters.md>), [congestion-control](<https://devfeed.tech/tags/congestion-control.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [ethernet](<https://devfeed.tech/tags/ethernet.md>), [fast](<https://devfeed.tech/tags/fast.md>), [features](<https://devfeed.tech/tags/features.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [hints](<https://devfeed.tech/tags/hints.md>), [implement](<https://devfeed.tech/tags/implement.md>), [layer](<https://devfeed.tech/tags/layer.md>), [meta](<https://devfeed.tech/tags/meta.md>), [metaroce](<https://devfeed.tech/tags/metaroce.md>), [network](<https://devfeed.tech/tags/network.md>), [networking](<https://devfeed.tech/tags/networking.md>), [ocp](<https://devfeed.tech/tags/ocp.md>), [ocp-summit](<https://devfeed.tech/tags/ocp-summit.md>), [scale](<https://devfeed.tech/tags/scale.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

MetaRoCE is Meta's open RDMA transport proposal for scaling training networks to million-GPU clusters. Its listed features include per-path reliability and congestion control, receiver rate hints for faster incast convergence, tolerance of packet loss and reordering, and multiple streams across network paths on a single queue pair. It is designed for commodity Ethernet using ECN and ECMP without switch changes. Meta previously demonstrated the protocol on programmable AMD Pensando NICs, which the excerpt says could let Meta source hardware from multiple vendors; an OCP NIC 3.0 adapter was displayed at OCP Summit 2026.

### Source excerpt

At OCP Summit 2026, Meta showed off its MetaRoCE adapter designed to scale to million-GPU training clusters The post This is the Meta MetaRoCE Network Adapter appeared first on ServeTheHome.

## Monitoring One Channel Is Not Communication Control: Causal Evidence for Adaptive Reallocation of Joint Message--Route Codes

DevFeed: [Monitoring One Channel Is Not Communication Control: Causal Evidence for Adaptive Reallocation of Joint Message--Route Codes](<https://devfeed.tech/articles/monitoring-one-channel-is-not-communication-control-causal-evidence-for-adaptive-reallocation-of-joint-message-route-codes-128218.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.12959>)

Author: Liu Hung Ming (PARRAWA AI, cyril.liu@gmail.com, equal contribution), Tian Xia (PAII, TianXia0209@gmail.com, equal contribution)

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [agent to agent communication](<https://devfeed.tech/topics/agent-to-agent-communication.md>), [Monitoring](<https://devfeed.tech/topics/monitoring.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [communication](<https://devfeed.tech/tags/communication.md>), [control](<https://devfeed.tech/tags/control.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-it](<https://devfeed.tech/tags/cs-it.md>), [math-it](<https://devfeed.tech/tags/math-it.md>), [monitoring](<https://devfeed.tech/tags/monitoring.md>), [route](<https://devfeed.tech/tags/route.md>)

### AI overview

In a learned sender-receiver game, partial monitoring of one channel shifted communication toward an alternate route while preserving task accuracy and the measured contribution of messages. Across two independent 20-seed batches, protocols formed in 20/20 and 19/20 runs; shadow-route share rose by .701 and .575 over no monitoring, while accuracy remained .905 and .913. Complete route coverage reduced selective migration but did not eliminate communication. Frozen interventions indicate route carries meaning: shuffling joint message-route codes changed .668 of receiver predictions, and route alone achieved .388 accuracy against .25 chance. An explicit-silence cost made 18/20 policies fully silent and reduced mean sending to .050, but failed the strict suppression gate because two seeds continued communicating. Failed semantic-evasion and operational gates limit the conclusion to adaptive reallocation under partial monitoring, not open-world route discovery, emergent encryption, or a universal defense.

### Source excerpt

arXiv:2611.12959v1 Announce Type: new Abstract: Monitoring a visible channel can change how learned agents communicate without removing why communication is useful. We test this distinction in an end-to-end game where a sender and receiver learn a discrete protocol and route policy without communication supervision. In two independent 20-seed batches, 20/20 and 19/20 protocols form. Online partial coverage increases shadow-route share over no monitoring by .701 [.574,.826] and .575 [.412,.737], while task accuracy remains .905/.913 and signed frozen message contribution remains .592/.563. Complete coverage removes most selective migration without removing communication. Frozen interventions, including a fresh pre-outcome confirmation, show that route is semantic: joint message--route shuffling changes .668 of receiver predictions and route alone retains .388 accuracy versus .25 chance. A corrected explicit-silence cost makes 18/20 policies fully silent and lowers mean sending to .050, but its strict complete-suppression gate fails because two seeds retain communication. Failed semantic-evasion and operational gates further bound the result. The evidence supports adaptive reallocation of a joint message--route code under partial monitoring, not open-world route discovery, emergent encryption, or a universal defense.

## A Simple Phase-King Protocol with Predictions

DevFeed: [A Simple Phase-King Protocol with Predictions](<https://devfeed.tech/articles/a-simple-phase-king-protocol-with-predictions-126725.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.11370>)

Author: Antonia Giannoulea, George Papadoulis, Nikos Leonardos, Aris Pagourtzis

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [consensus algorithm](<https://devfeed.tech/topics/consensus-algorithm.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [2025](<https://devfeed.tech/tags/2025.md>), [2026](<https://devfeed.tech/tags/2026.md>), [about](<https://devfeed.tech/tags/about.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [applications](<https://devfeed.tech/tags/applications.md>), [approach](<https://devfeed.tech/tags/approach.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [better](<https://devfeed.tech/tags/better.md>), [bits](<https://devfeed.tech/tags/bits.md>), [but](<https://devfeed.tech/tags/but.md>), [can](<https://devfeed.tech/tags/can.md>), [communication](<https://devfeed.tech/tags/communication.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [complete](<https://devfeed.tech/tags/complete.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [predictions](<https://devfeed.tech/tags/predictions.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [simple](<https://devfeed.tech/tags/simple.md>), [with](<https://devfeed.tech/tags/with.md>)

### AI overview

The paper presents a deterministic Phase King protocol for synchronous binary Byzantine Agreement with predictions about which processes are honest or Byzantine. For fewer than n/3 Byzantine processes, it tolerates arbitrarily many prediction errors and terminates in O(P) rounds, where P = 1 + min{B/n, f}; B counts incorrect prediction bits held by honest processes, and f is the actual Byzantine count. It uses O(n²P) messages and O(n²P log n) bits, avoiding an initial cubic bit cost for exchanging full prediction vectors. Compared with the cited independent work, it has the same error tolerance and round complexity but weaker communication bounds; its stated advantage is a simpler Phase King design without involved preprocessing, which the authors say may suit time-evolving networks.

### Source excerpt

arXiv:2611.11370v1 Announce Type: new Abstract: Inspired by recent work (Ben-David, Dzulfikar, Ellen, and Gilbert, $\textit{Byzantine Agreement with Predictions}$, PODC 2025) we study synchronous binary Byzantine Agreement in the learning-augmented setting, where each process receives predictions about which processes are honest or Byzantine. We present a deterministic Phase King protocol for the anauthenticated setting, combining early stopping with a specifically designed prediction-aware king selection procedure. For at most $t3$ Byzantine processes, the protocol handles arbitrarily many prediction errors, improving upon the $O(n^{32})$ bound of Ben-David et al., and terminates within $O(P)$ communication rounds, where $P=1+\min\{\mathbf{B}/n,f\}$, $\mathbf{B}$ is the total number of incorrect prediction bits held by honest processes, and $f$ is the actual number of Byzantine processes. Our protocol uses $O(n^2P)$ messages and $O(n^2P\log n)$ bits, avoiding the initial cubic bit cost of exchanging complete prediction vectors. In comparison to very recent independent work (Dufay, Dzulfikar, and Gilbert, $\textit{Predictions Can Only Help! Communication Efficient Byzantine Agreement with Predictions}$, DISC 2026), which achieves the same error tolerance and round complexity but better communication bounds, our construction provides a much simpler Phase King approach that completely avoids involved preprocessing constructions, rendering it more practical, especially for achieving agreement in time-evolving networks. We believe that the novel prediction-aware king selection technique of our scheme is of independent interest and can find further applications in learning-augmented distributed consensus.

## CoordX Protocol: Peer to Peer Cryptographically Verified Shared Records

DevFeed: [CoordX Protocol: Peer to Peer Cryptographically Verified Shared Records](<https://devfeed.tech/articles/coordx-protocol-peer-to-peer-cryptographically-verified-shared-records-118695.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.06034>)

Author: David Hyland-Wood, Rob Ewin

Published: 2026-11-05T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [least privilege](<https://devfeed.tech/topics/least-privilege.md>)

Tags: [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [encrypted](<https://devfeed.tech/tags/encrypted.md>), [entries](<https://devfeed.tech/tags/entries.md>), [keys](<https://devfeed.tech/tags/keys.md>), [peer-to-peer](<https://devfeed.tech/tags/peer-to-peer.md>), [permission](<https://devfeed.tech/tags/permission.md>), [permissions](<https://devfeed.tech/tags/permissions.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [records](<https://devfeed.tech/tags/records.md>), [sealed](<https://devfeed.tech/tags/sealed.md>), [security](<https://devfeed.tech/tags/security.md>), [trust](<https://devfeed.tech/tags/trust.md>)

### AI overview

CoordX describes shared records without a central authority deciding permissions or maintaining a canonical copy. The record's author retains full permission; other parties receive explicit grants and keys, while an invitation only initiates contact. Records are causal trees of immutable, signed entries, each identifying the permission used to create it. Anyone can verify that permission independently, with the same result for the same bytes, keys, and local settings. Encrypted content remains sealed from relays. Excluding a party from future content requires the others to move to new keys. The protocol does not order entries by time, select a winning version, or require global agreement; applications determine what entries mean.

### Source excerpt

arXiv:2611.06034v1 Announce Type: new Abstract: People, companies and software agents often must work on shared records even when they do not trust each other. Today they usually give those records to a central server. The server keeps the canonical copy, authenticates users, and decides who has permissions to act on the record. The CoordX Protocol removes the need for that central server. In the CoordX protocol the author of a record holds full permission over it. Permission for any other party to create, read or update the record is assigned by explicit grants and keys. An invitation only starts contact between two parties. It gives no permission. Each record is a causal tree of signed entries, and each entry is immutable. Each entry names the permission that allowed it. Any party can get the proof of that permission and check it without help from anyone. Two honest parties that check the same bytes, with the same keys and local settings, always get the same answer. The content is encrypted, so the relays that may carry it in transit see only sealed bytes. To exclude a party from future content, the other parties move to new keys. The protocol does not choose a winning version, does not put entries in time order, and does not need global agreement. Applications decide what the entries mean above the level of the protocol.

## netlab: Testing Network Protocol Implementations

DevFeed: [netlab: Testing Network Protocol Implementations](<https://devfeed.tech/articles/netlab-testing-network-protocol-implementations-112470.md>)

Original publisher: [Read original article](<https://blog.ipspace.net/2026/11/netlab-device-test-harness/>)

Published: 2026-11-02T07:18:00Z

Content type: tutorial

Language: en

Sources: [ipSpace](<https://devfeed.tech/sources/ipspace-net-blog-2.md>)

Topics: [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [BGP](<https://devfeed.tech/topics/bgp.md>), [developer setup](<https://devfeed.tech/topics/developer-setup.md>)

Tags: [bgp](<https://devfeed.tech/tags/bgp.md>), [cisco](<https://devfeed.tech/tags/cisco.md>), [configuration](<https://devfeed.tech/tags/configuration.md>), [container](<https://devfeed.tech/tags/container.md>), [containers](<https://devfeed.tech/tags/containers.md>), [eigrp](<https://devfeed.tech/tags/eigrp.md>), [implementation](<https://devfeed.tech/tags/implementation.md>), [infrastructure](<https://devfeed.tech/tags/infrastructure.md>), [interoperability](<https://devfeed.tech/tags/interoperability.md>), [ios](<https://devfeed.tech/tags/ios.md>), [ios-xe](<https://devfeed.tech/tags/ios-xe.md>), [lab](<https://devfeed.tech/tags/lab.md>), [labs](<https://devfeed.tech/tags/labs.md>), [netlab](<https://devfeed.tech/tags/netlab.md>), [network-device](<https://devfeed.tech/tags/network-device.md>), [repository](<https://devfeed.tech/tags/repository.md>), [server](<https://devfeed.tech/tags/server.md>), [source-code](<https://devfeed.tech/tags/source-code.md>), [test](<https://devfeed.tech/tags/test.md>), [testing](<https://devfeed.tech/tags/testing.md>)

### AI overview

The excerpt reports that netlab worked for testing OpenEIGRP-Cisco IOS interoperability and gives setup guidance for similar protocol tests. It recommends container labs via the `clab` provider for faster startup than virtual machines; IOL is suggested for IOS/XE, with IOLL2 faster but not guaranteed to support all features. For Nexus OS, it suggests obtaining the latest registered download and using vrnetlab to make a container. Labs can use one topology per directory or multiple topology files, with filenames specified to `netlab create` or `netlab up` in the latter case; defaults can be project-wide. The author recommends putting FRR settings in defaults and using wildcard groups to assign device types. Netlab's EIGRP support is described as minimal and potentially insufficient, while it can handle other configuration such as addressing, OSPF, BGP, and static routes. Custom Jinja2 templates are suggested for EIGRP configuration, with possible later work toward generic support or OpenEIGRP integration.

### Source excerpt

Donnie Savage decided to use netlab to test OpenEIGRP-Cisco IOS interoperability (TL&DR: it works and the source code is in Donnie's EIGRP repository). He asked me for a few hints before setting up his test server. This is what I sent him; you might find it useful if you ever decide to use netlab to test a new network device/protocol implementation. Read more ...

## The LQ Digital Mode Family: Protocol Architecture and Reference Specification for Weak-Signal Communications

DevFeed: [The LQ Digital Mode Family: Protocol Architecture and Reference Specification for Weak-Signal Communications](<https://devfeed.tech/articles/the-lq-digital-mode-family-protocol-architecture-and-reference-specification-for-weak-signal-communications-107606.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.06427>)

Author: Luis Quesada

Published: 2026-10-30T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [amateur-radio](<https://devfeed.tech/tags/amateur-radio.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [communications](<https://devfeed.tech/tags/communications.md>), [cs-it](<https://devfeed.tech/tags/cs-it.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [digital](<https://devfeed.tech/tags/digital.md>), [eess-sp](<https://devfeed.tech/tags/eess-sp.md>), [math-it](<https://devfeed.tech/tags/math-it.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [reference](<https://devfeed.tech/tags/reference.md>), [signal](<https://devfeed.tech/tags/signal.md>), [specification](<https://devfeed.tech/tags/specification.md>)

### AI overview

LQ8 completes a structured two-way amateur-radio contact in four transmissions over 60 seconds, compared with six transmissions (90 seconds) for a canonical exchange or five (75 seconds) for an RR73 exchange. Variable-length prefix codes let a single 77-bit reply carry the answering station's grid locator and measured signal report, while preserving mutual acknowledgments. In pileups, one 50 Hz carrier can confirm up to two answering stations at once, with no stated RF power-splitting penalty; the abstract reports a peak 240 QSOs per hour (480 with dual carriers) and −21 dB SNR sensitivity. The family also specifies LQ16 for extreme sensitivity, LQ4 for VHF/UHF contesting, and LQ2 for fast-burst channels. These figures are claims in the supplied abstract; the excerpt does not provide the specification or supporting evaluation details.

### Source excerpt

arXiv:2609.06427v4 Announce Type: replace Abstract: This paper introduces LQ8, an open-source weak-signal digital mode for amateur radio that completes structured two-way contacts in 4 transmissions (60 s), achieving a 1.50x speedup over canonical 6-transmission exchanges (90 s) and 1.25x over 5-transmission RR73 exchanges (75 s) while preserving complete bidirectional exchange of Maidenhead grid locators, signal reports, and mutual acknowledgments. By replacing fixed-width message-type headers with variable-length prefix codes matched to physical-layer bit budgets, LQ8 packs the answering station's grid locator and measured signal report into a single 77-bit reply. In multi-station pileup operations, LQ8 confirms up to two answering stations simultaneously within a single-carrier 50.0 Hz transmission with a 0.0 dB RF power-splitting penalty, achieving a peak rate of 240 QSOs/h in continuous pileup (4x over single-carrier FT8; 480 QSOs/h dual-carrier) while retaining -21.0 dB SNR sensitivity. The protocol family also defines three extended profiles (LQ16, LQ4, and LQ2) tailored for extreme sensitivity, VHF/UHF contesting, and fast-burst channels.

## Agent Transfer Protocol: Server-Mediated Agent-to-Agent Communication Architecture for the Agentic Web

DevFeed: [Agent Transfer Protocol: Server-Mediated Agent-to-Agent Communication Architecture for the Agentic Web](<https://devfeed.tech/articles/agent-transfer-protocol-server-mediated-agent-to-agent-communication-architecture-for-the-agentic-web-108072.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.38398>)

Author: Yuqi Qiu, Zuyao Xu, Lu Sun, Xiang Li, Fasheng Miao, Fubin Wu, Haixin Duan, Zheli Liu

Published: 2026-10-30T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [agent to agent communication](<https://devfeed.tech/topics/agent-to-agent-communication.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [Data transmission](<https://devfeed.tech/topics/data-transmission.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [agent-communication](<https://devfeed.tech/tags/agent-communication.md>), [agent-to-agent-communication](<https://devfeed.tech/tags/agent-to-agent-communication.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agents](<https://devfeed.tech/tags/agents.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [building](<https://devfeed.tech/tags/building.md>), [collaboration](<https://devfeed.tech/tags/collaboration.md>), [communication](<https://devfeed.tech/tags/communication.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ma](<https://devfeed.tech/tags/cs-ma.md>), [domain](<https://devfeed.tech/tags/domain.md>), [domains](<https://devfeed.tech/tags/domains.md>), [execution](<https://devfeed.tech/tags/execution.md>), [independent](<https://devfeed.tech/tags/independent.md>), [infrastructure](<https://devfeed.tech/tags/infrastructure.md>), [integrity](<https://devfeed.tech/tags/integrity.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [server](<https://devfeed.tech/tags/server.md>), [web](<https://devfeed.tech/tags/web.md>)

### AI overview

ATP proposes server-mediated communication for cross-organization agents: each administrative domain maintains stable addresses and receiving entries for logical agents, while domain servers handle ongoing message transmission. The receiving domain verifies and stores messages for later retrieval, and the sending domain signs the full message envelope. A receiving instance can recheck the sender domain and message integrity after the original connection ends, provided the verification key remains trusted and obtainable. In a controlled LLM workflow, subsequent processing continued after agent instances went offline or were replaced, and an independent verifier validated saved messages. The evaluation also measured the communication and processing overhead of continuous server mediation; the excerpt gives no numerical latency results.

### Source excerpt

arXiv:2610.38398v1 Announce Type: new Abstract: The Agentic Web needs to support continuous collaboration among agents from different organizations. These collaborative relationships may span multiple tasks, network connections and execution instances. Such interactions require stable communication entries, message reception when instances are offline, and source verification after delayed reading. How to organize these responsibilities so that cross domain communication does not depend on specific execution instances being continuously online is a key issue for building long term agent interaction infrastructure. We propose ATP (Agent Transfer Protocol), a cross organization agent communication protocol adopting a domain mediated architecture. In this architecture, administrative domains maintain stable addresses and receiving entries for logical agents. The domain servers of both parties continuously undertake cross domain transmission. The receiving domain verifies and saves messages for execution instances to read later. The sending domain signs the complete message envelope. This allows the receiving instance to independently reverify the domain source and content integrity after the original connection ends, provided the original verification public key is still trusted and obtainable. We implemented an ATP prototype and evaluated it through a controlled cross organization LLM agent workflow, mechanism checks and latency measurements. The workflow completed subsequent business processing after instances went offline or were replaced. The independent verifier successfully verified the domain source and content integrity of saved messages. Latency measurements further quantified the communication and processing overhead introduced by the continuous mediation of domain servers.

## PCM: A Proof-Carrying Message Protocol for Verifiable Multi-Agent Communication

DevFeed: [PCM: A Proof-Carrying Message Protocol for Verifiable Multi-Agent Communication](<https://devfeed.tech/articles/pcm-a-proof-carrying-message-protocol-for-verifiable-multi-agent-communication-108154.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.39109>)

Author: Bravish Ghosh (Cygnux Labs)

Published: 2026-10-30T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [agent to agent communication](<https://devfeed.tech/topics/agent-to-agent-communication.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [A2A protocol](<https://devfeed.tech/topics/a2a-protocol.md>), [Benchmark](<https://devfeed.tech/topics/benchmark.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-ce](<https://devfeed.tech/tags/cs-ce.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-ma](<https://devfeed.tech/tags/cs-ma.md>), [multi-agent](<https://devfeed.tech/tags/multi-agent.md>), [pcm](<https://devfeed.tech/tags/pcm.md>), [protocol](<https://devfeed.tech/tags/protocol.md>)

### AI overview

PCM makes agents attach independently checkable evidence to each claim: records in an append-only Merkle log, inclusion proofs, and signatures from an attester the agent cannot control. Offline verification labels claims proven, unproven, or failed; an agent's own report alone cannot prove a claim. Authority is carried through grant chains rooted in recorded human approval, with each grant only narrowing authority. On a pre-specified benchmark of 926 messages, including 712 lies across 16 classes, PCM accepted 10 lies, all involving stale evidence (1.4%; 95% CI 0.8-2.6%). Plain A2A accepted all 712; models of six other protocols accepted 504-712. Two independent verifiers agreed on all verdicts, and verification took about 1 ms. The reported residual failures were stale evidence.

### Source excerpt

arXiv:2610.39109v1 Announce Type: cross Abstract: When one AI agent tells another that "the tests passed" or "a person approved this refund", the receiver has only the sender's word. A2A and MCP authenticate the channel, but the sender is the party in doubt, so a prompt-injected agent can launder fabricated facts and authority through a multi-agent system. We present Proof-Carrying Messages (PCM), a protocol in which each claim carries evidence: records from an append-only Merkle log that the agent cannot write, with inclusion proofs, signed by an attesting signer the agent cannot control. Receivers check messages offline and give each claim a three-valued result: proven, unproven or failed. A claim that rests only on the agent's own report is never proven. Authority travels as grant chains rooted in a recorded human approval, and the chains can only narrow. We specify four claim types, a typed caveat algebra, replay rules that survive restarts, and strict readings that make independent verifiers agree, and we prove the resulting security properties. On a pre-specified benchmark of 926 messages from real runs, 712 of them lies in 16 classes, PCM accepts 10 lies, all of them stale evidence (1.4%, 95% CI 0.8-2.6%). Plain A2A accepts all 712, and models of six deployed protocols (A2A with signed Agent Cards, uAgents, RFC 9421, SCITT, AP2, Verifiable Intent) accept 504-712. Two independent verifiers agree on all 926 verdicts, and verification takes about 1 ms.

## X.Org XCB Co-Creator Praises Wayland's Protocol Design

DevFeed: [X.Org XCB Co-Creator Praises Wayland's Protocol Design](<https://devfeed.tech/articles/x-org-xcb-co-creator-praises-wayland-s-protocol-design-104405.md>)

Original publisher: [Read original article](<https://www.phoronix.com/news/Jamey-Sharp-Praises-Wayland>)

Author: Michael Larabel

Published: 2026-10-28T12:54:28Z

Content type: news

Language: en

Sources: [Phoronix](<https://devfeed.tech/sources/phoronix.md>)

Topics: [Wayland](<https://devfeed.tech/topics/wayland.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Software Engineering](<https://devfeed.tech/topics/software-engineering.md>)

Tags: [abstractions](<https://devfeed.tech/tags/abstractions.md>), [client](<https://devfeed.tech/tags/client.md>), [clients](<https://devfeed.tech/tags/clients.md>), [code](<https://devfeed.tech/tags/code.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [design](<https://devfeed.tech/tags/design.md>), [desktop-linux](<https://devfeed.tech/tags/desktop-linux.md>), [developer](<https://devfeed.tech/tags/developer.md>), [flexibility](<https://devfeed.tech/tags/flexibility.md>), [globals](<https://devfeed.tech/tags/globals.md>), [linux-benchmarking](<https://devfeed.tech/tags/linux-benchmarking.md>), [linux-hardware-benchmarks](<https://devfeed.tech/tags/linux-hardware-benchmarks.md>), [linux-hardware-reviews](<https://devfeed.tech/tags/linux-hardware-reviews.md>), [linux-how-to](<https://devfeed.tech/tags/linux-how-to.md>), [linux-performance](<https://devfeed.tech/tags/linux-performance.md>), [linux-server-benchmarks](<https://devfeed.tech/tags/linux-server-benchmarks.md>), [low-level](<https://devfeed.tech/tags/low-level.md>), [mastodon](<https://devfeed.tech/tags/mastodon.md>), [open-source-graphics](<https://devfeed.tech/tags/open-source-graphics.md>), [phoronix](<https://devfeed.tech/tags/phoronix.md>), [phoronix-test-suite](<https://devfeed.tech/tags/phoronix-test-suite.md>), [program](<https://devfeed.tech/tags/program.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [protocol-design](<https://devfeed.tech/tags/protocol-design.md>), [qt](<https://devfeed.tech/tags/qt.md>), [sharp](<https://devfeed.tech/tags/sharp.md>), [ubuntu-benchmarks](<https://devfeed.tech/tags/ubuntu-benchmarks.md>), [ubuntu-hardware](<https://devfeed.tech/tags/ubuntu-hardware.md>), [wayland](<https://devfeed.tech/tags/wayland.md>), [x](<https://devfeed.tech/tags/x.md>), [x-org](<https://devfeed.tech/tags/x-org.md>)

### AI overview

After writing his first Wayland client, XCB co-creator Jamey Sharp praised Wayland's protocol design, saying it reflects lessons from X and XCB. His Rust program opened a window, flashed it between white and black, and measured timing statistics; it exceeded 300 lines partly because he chose not to use wayland-client's helpers for binding globals. Sharp argues that this low-level complexity enables handling more complicated scenarios, while toolkits such as GTK, Qt, or SDL provide simpler interfaces for common tasks. He considers that a deliberate tradeoff favoring protocol flexibility over making basic operations easy.

### Source excerpt

Open-source developer Jamey Sharp who is a longtime X.Org developer and co-creator of the X protocol C-language Binding (XCB) finally had the need to write a Wayland client and ended up praising its design...

## UniPCH: A Unified Framework for Cross-Chain Payments via Payment Channel Hubs

DevFeed: [UniPCH: A Unified Framework for Cross-Chain Payments via Payment Channel Hubs](<https://devfeed.tech/articles/unipch-a-unified-framework-for-cross-chain-payments-via-payment-channel-hubs-103369.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.36866>)

Author: Yuanming Shao, Yuming Feng, Weizhe Zhang, Bin Xiao, Song Guo, Zejun Wang

Published: 2026-10-28T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [cryptographic audit](<https://devfeed.tech/topics/cryptographic-audit.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [account](<https://devfeed.tech/tags/account.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [authorization](<https://devfeed.tech/tags/authorization.md>), [bandwidth](<https://devfeed.tech/tags/bandwidth.md>), [channel](<https://devfeed.tech/tags/channel.md>), [communication](<https://devfeed.tech/tags/communication.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [contracts](<https://devfeed.tech/tags/contracts.md>), [costs](<https://devfeed.tech/tags/costs.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [delay](<https://devfeed.tech/tags/delay.md>), [develop](<https://devfeed.tech/tags/develop.md>), [execution](<https://devfeed.tech/tags/execution.md>), [faster](<https://devfeed.tech/tags/faster.md>), [framework](<https://devfeed.tech/tags/framework.md>), [go](<https://devfeed.tech/tags/go.md>), [implement](<https://devfeed.tech/tags/implement.md>), [interfaces](<https://devfeed.tech/tags/interfaces.md>), [payment](<https://devfeed.tech/tags/payment.md>)

### AI overview

UniPCH separates native payment-channel execution from private cross-chain payment logic to make protocols easier to adapt across heterogeneous ledgers. Its UniPC layer defines shared state transitions and security requirements, separating task authorization from confirmation of the full channel state, with realizations for UTXO and smart-contract account ledgers. The upper layer uses selective re-signing blind conditional signatures (S-RBCS) to coordinate authorization across hubs in a four-phase payment protocol. The analysis establishes local UniPC security, griefing resistance, economic atomicity, and session unlinkability. A Go prototype reports modest computational overhead from the common interfaces; most evaluated configurations run faster than comparable schemes under network delay. In the account realization, reusing valid task evidence reduces computation and communication costs compared with full refresh.

### Source excerpt

arXiv:2610.36866v1 Announce Type: new Abstract: Payment channel hubs (PCHs) enable private cross-chain payments, but existing protocols remain difficult to extend across heterogeneous blockchains. Their payment flows often depend on how particular blockchains represent transactions, authorize channel updates, and settle balances. Some protocols do not explain how their channels are implemented on actual blockchains. Supporting a new ledger or execution model requires a corresponding channel realization and may also require protocol adaptation and security analysis. We present UniPCH, a framework with two layers that separates native channel execution from private cross-chain payment logic. The lower UniPC layer defines common state transitions and security requirements. It separates task authorization from confirmation of the complete channel state. We provide realizations for UTXO ledgers and account ledgers that support smart contracts. At the upper layer, we develop selective re-signing blind conditional signatures (S-RBCS) to coordinate conditional authorization across hubs. Using S-RBCS, we construct a payment protocol that coordinates different channels in four phases. Our analysis establishes local UniPC security, griefing resistance, economic atomicity, and session unlinkability. We implement a Go prototype and evaluate the running time and bandwidth of each phase under different network conditions and system parameters. Results show modest computational overhead from the common interfaces. Most evaluated configurations run faster than comparable schemes under network delay. A full refresh ablation shows that reusing valid task evidence reduces computation and communication costs in the account realization.

## Universal Commerce Protocol (/.well-known/ucp)

DevFeed: [Universal Commerce Protocol (/.well-known/ucp)](<https://devfeed.tech/articles/universal-commerce-protocol-well-known-ucp-105518.md>)

Original publisher: [Read original article](<https://specification.website/spec/agent-readiness/universal-commerce-protocol/>)

Author: Joost de Valk

Published: 2026-10-28T00:00:00Z

Content type: tutorial

Language: en

Sources: [The Website Specification](<https://devfeed.tech/sources/the-website-specification.md>)

Topics: [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [AI Bots](<https://devfeed.tech/topics/ai-bots.md>), [Shopify](<https://devfeed.tech/topics/shopify.md>), [Integration testing](<https://devfeed.tech/topics/integration-testing.md>), [OAuth 2.0](<https://devfeed.tech/topics/oauth2.md>)

Tags: [agent-readiness](<https://devfeed.tech/tags/agent-readiness.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agentic-commerce](<https://devfeed.tech/tags/agentic-commerce.md>), [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agent](<https://devfeed.tech/tags/ai-agent.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [ai-shopping](<https://devfeed.tech/tags/ai-shopping.md>), [auth](<https://devfeed.tech/tags/auth.md>), [business](<https://devfeed.tech/tags/business.md>), [cache](<https://devfeed.tech/tags/cache.md>), [capabilities](<https://devfeed.tech/tags/capabilities.md>), [checkout](<https://devfeed.tech/tags/checkout.md>), [commerce](<https://devfeed.tech/tags/commerce.md>), [optional](<https://devfeed.tech/tags/optional.md>), [products](<https://devfeed.tech/tags/products.md>), [profile](<https://devfeed.tech/tags/profile.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [store](<https://devfeed.tech/tags/store.md>), [ucp](<https://devfeed.tech/tags/ucp.md>), [universal-commerce-protocol](<https://devfeed.tech/tags/universal-commerce-protocol.md>), [well-known](<https://devfeed.tech/tags/well-known.md>)

### AI overview

UCP is a transaction contract for AI agents: a business publishes a JSON capability profile at `/.well-known/ucp`, allowing agents and stores to negotiate supported checkout services, capabilities, versions, and payment handlers. The profile contains no product, price, or stock data, so it does not make products discoverable; discovery still relies on structured data and merchant feeds. Implementation guidance includes checking whether a commerce platform already serves the profile, returning it directly over HTTPS with no redirect and cacheable headers, declaring only working endpoints and capabilities, and verifying calling platforms. The excerpt recommends end-to-end checkout testing and bounded caching and rate limits for discovery. UCP keeps the business as merchant of record and supports handing shoppers back through `continue_url` when an agent cannot complete checkout.

### Source excerpt

A store that wants AI agents to check out on a shopper's behalf publishes a Universal Commerce Protocol (UCP) business profile at `/.well-known/ucp`. The profile does not list products; it says which commerce capabilities the store supports, which protocol versions it speaks, and where the transactional endpoints live.

## The Fascinating World of IrDA and Other Infrared Protocols

DevFeed: [The Fascinating World of IrDA and Other Infrared Protocols](<https://devfeed.tech/articles/the-fascinating-world-of-irda-and-other-infrared-protocols-100487.md>)

Original publisher: [Read original article](<https://hackaday.com/2026/10/26/the-fascinating-world-of-irda-and-other-infrared-protocols/>)

Author: Maya Posch

Published: 2026-10-26T14:00:36Z

Content type: article

Language: en

Sources: [Hackaday](<https://devfeed.tech/sources/hackaday.md>)

Topics: [protocols](<https://devfeed.tech/topics/protocols.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Cryptography](<https://devfeed.tech/topics/cryptography.md>)

Tags: [classic-hacks](<https://devfeed.tech/tags/classic-hacks.md>), [featured](<https://devfeed.tech/tags/featured.md>), [infrared](<https://devfeed.tech/tags/infrared.md>), [irda](<https://devfeed.tech/tags/irda.md>), [led-hacks](<https://devfeed.tech/tags/led-hacks.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [skills](<https://devfeed.tech/tags/skills.md>)

### AI overview

Infrared remains useful where directional, low power, line-of-sight communication is an advantage: obstacles block the signal, and devices can communicate by being pointed at one another. Consumer remotes commonly use NEC, Sony SIRC or Philips protocols around a 36-38 kHz carrier; NEC uses pulse-distance encoding and Philips RC-5 uses Manchester encoding. IrDA extends the approach to data transfer, with defined speeds from SIR at 115 kbit/s through Giga-IR at 512 Mbit/s-1 Gbit/s. It is generally half-duplex, with range up to about two meters (around 20 cm for lower-power versions). Examples include power-meter readout, where short-range access can support privacy and low power use, and Nintendo 3DS peripherals using IrDA-SIR at low bandwidth. For DIY implementations, some MCUs such as ESP32 offer IrDA UART modes; MCP2120 adds IrDA-SIR encoding/decoding to a UART, while integrated transceivers handle the optical interface. A VS1838b receiver instead demodulates 38 kHz remote-control signals for an MCU to parse.

### Source excerpt

Infrared (IR) communication technologies are probably one of the most influential, yet also one of the least flashiest. The fact that IR communication tends to be highly directional and often ...read more

## Python Protocols: Leveraging Structural Subtyping

DevFeed: [Python Protocols: Leveraging Structural Subtyping](<https://devfeed.tech/articles/python-protocols-leveraging-structural-subtyping-100534.md>)

Original publisher: [Read original article](<https://realpython.com/python-protocol/>)

Author: Leodanis Pozo Ramos

Published: 2026-10-26T14:00:00Z

Content type: tutorial

Language: en

Sources: [Real Python](<https://devfeed.tech/sources/real-python.md>)

Topics: [Python](<https://devfeed.tech/topics/python.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Tutorial](<https://devfeed.tech/topics/tutorial.md>), [Learning](<https://devfeed.tech/topics/learning.md>)

Tags: [protocols](<https://devfeed.tech/tags/protocols.md>), [python](<https://devfeed.tech/tags/python.md>)

### AI overview

Python's `typing.Protocol` lets static type checkers use structural subtyping: a class satisfies a protocol by providing its required methods and attributes, without inheriting from it. The tutorial shows how this preserves duck typing while adding static checks, including custom, generic, inherited, and recursive protocols, and using `Iterable` to accept lists, tuples, sets, and other integer iterables. It contrasts protocols with abstract base classes (ABCs), which enforce interfaces through inheritance. It also notes limits: structural matches can accept unintended types, and `isinstance()` requires a protocol marked with `@runtime_checkable`.

### Source excerpt

Learn how Python protocols bring static duck typing to your code and help you get the most out of type hints and static type checkers.

## The 3DS Oracle: BIN Attack via the Network

DevFeed: [The 3DS Oracle: BIN Attack via the Network](<https://devfeed.tech/articles/the-3ds-oracle-bin-attack-via-the-network-100282.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.32206>)

Author: Wasif Faisal (BRAC University), Suprava Saha Dibya (BRAC University)

Published: 2026-10-26T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [network security](<https://devfeed.tech/topics/network-security.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [Web](<https://devfeed.tech/topics/web.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [attack](<https://devfeed.tech/tags/attack.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [authorization](<https://devfeed.tech/tags/authorization.md>), [braintree](<https://devfeed.tech/tags/braintree.md>), [browser](<https://devfeed.tech/tags/browser.md>), [channel](<https://devfeed.tech/tags/channel.md>), [classification](<https://devfeed.tech/tags/classification.md>), [continuation](<https://devfeed.tech/tags/continuation.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [defense](<https://devfeed.tech/tags/defense.md>), [disclosure](<https://devfeed.tech/tags/disclosure.md>), [documentation](<https://devfeed.tech/tags/documentation.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [formal](<https://devfeed.tech/tags/formal.md>), [governance](<https://devfeed.tech/tags/governance.md>), [identifier](<https://devfeed.tech/tags/identifier.md>), [integration](<https://devfeed.tech/tags/integration.md>), [invariants](<https://devfeed.tech/tags/invariants.md>), [network](<https://devfeed.tech/tags/network.md>), [oracle](<https://devfeed.tech/tags/oracle.md>)

### AI overview

In the tested browser-channel Braintree/Cardinal path, the first client-visible 3DS result distinguished researcher-owned anchor cards from bounded adjacent same-range comparison PANs in six of seven ACS/card-range cohorts. The authors argue that some integrations expose routing and authentication state before financial authorization, creating a profiling and screening channel. They cite public attacker tooling and illicit paid card-testing services as evidence that comparable signals are already used, but make no claim about network-wide prevalence or candidate issuance. The evaluation was ethically bounded, so its ceiling reflects researcher restraint, not an attacker-side scalability limit. The paper attributes persistence to systemic design and accountability issues and calls for consortium-level changes: minimize client-visible pre-authorization responses, make continuation behavior more uniform, and strengthen client authenticity and session binding.

### Source excerpt

arXiv:2610.32206v1 Announce Type: new Abstract: EMV 3-D Secure (3DS) requires a client-visible continuation boundary in browser-mediated flows; in some deployments, that boundary exposes a pre-authorization classification channel. This paper studies 3DS as a protocol, integration surface, and governance problem, combining standards analysis, architectural reconstruction, formal modeling, a documentation audit, disclosure history, and a bounded live evaluation. We show that client-visible integrations can reflect routing and authentication state before financial authorization, allowing 3DS to function as a profiling and screening channel for issuer controls and cardholder/account state rather than only as a defense. In the tested browser-channel Braintree/Cardinal path, the first client-visible result separated researcher-owned anchor cards from bounded adjacent same-range comparison PANs in six of seven distinct ACS/card-range cohorts; separate public evidence, including openly accessible attacker tooling, rotating-proxy support, and illicit paid 3DS card-testing services, shows that comparable signals are already operationalized in the wild. Our live study was deliberately bounded for ethical reasons, so the empirical ceiling reported here reflects researcher restraint rather than an attacker-side scalability limit, although we do not claim network-wide prevalence or candidate issuance. The deeper issue is systemic: decoupled pre-authorization authentication, weak requestor-boundary assumptions, identifier-linked routing invariants, and fragmented accountability let the exposure persist even when individual actors appear locally conformant. Meaningful remediation therefore requires consortium-level reform, including stricter minimization of client-visible pre-authorization responses, more uniform continuation behavior, and stronger client authenticity and session binding.

## EVSEFuzz : A Tool for Automated Testing of Protocol Implementations

DevFeed: [EVSEFuzz : A Tool for Automated Testing of Protocol Implementations](<https://devfeed.tech/articles/evsefuzz-a-tool-for-automated-testing-of-protocol-implementations-100299.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2610.32902>)

Author: Soham Gumaste, Michael Khan, Roland Varriale, Rigel Gjomemo

Published: 2026-10-26T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Fuzzing/Fuzz testing](<https://devfeed.tech/topics/fuzzing.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [automated](<https://devfeed.tech/tags/automated.md>), [automated-testing](<https://devfeed.tech/tags/automated-testing.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [python](<https://devfeed.tech/tags/python.md>), [security](<https://devfeed.tech/tags/security.md>), [testing](<https://devfeed.tech/tags/testing.md>), [tool](<https://devfeed.tech/tags/tool.md>), [tools](<https://devfeed.tech/tags/tools.md>), [vulnerabilities](<https://devfeed.tech/tags/vulnerabilities.md>)

### AI overview

EVSEFuzz automatically builds fuzzers to test the security of electric vehicle charging protocol implementations, including OCPP. It uses Python datatype validation packages and tools to interpret data types and message structures, then generates both compliant and non-compliant messages. The abstract reports successful tests against several open and closed-source implementations, finding vulnerabilities that led to two CVEs.

### Source excerpt

arXiv:2610.32902v1 Announce Type: new Abstract: The rapid adoption and development of electric vehicle (EV) networks has required the expansive deployment of EV charging infrastructure (EVCI) which relies on communication protocols such as the open charge point protocol (OCPP) to coordinate data transfer between charging network operators and the EV supply equipment. In this paper, we present EVSEFuzz, a tool for automatically building fuzzers to test the security of protocol implementations. To achieve this we make a novel use of Python datatype validation packages and tools to ``understand'' datatypes and message structures and generate both compliant and non-compliant messages. To date, EVSEFuzz has been tested successfully with several open and closed-source implementations and has found several vulnerabilities leading to the publication of two CVEs.

## SUDP: Secret-Use Delegation Protocol for Agentic Systems

DevFeed: [SUDP: Secret-Use Delegation Protocol for Agentic Systems](<https://devfeed.tech/articles/sudp-secret-use-delegation-protocol-for-agentic-systems-94497.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2604.24920>)

Author: Xiaohang Yu, Hejia Geng, Xinmeng Zeng, William Knottenbelt

Published: 2026-10-22T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [ai security](<https://devfeed.tech/topics/ai-security.md>), [Agentic AI](<https://devfeed.tech/topics/what-is-agentic-ai.md>), [Cybersecurity](<https://devfeed.tech/topics/cybersecurity.md>), [standard](<https://devfeed.tech/topics/standard.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [agentic](<https://devfeed.tech/tags/agentic.md>), [agentic-systems](<https://devfeed.tech/tags/agentic-systems.md>), [authorization](<https://devfeed.tech/tags/authorization.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [delegation](<https://devfeed.tech/tags/delegation.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [secret](<https://devfeed.tech/tags/secret.md>), [security](<https://devfeed.tech/tags/security.md>)

### AI overview

SUDP addresses the risk that an agent runtime holding reusable credentials can turn a prompt injection or tool compromise into lasting account access. A requester proposes a canonical operation; the user approves it with a fresh authenticator-backed grant; and a custodian redeems that grant to perform only the bounded operation, keeping reusable authority outside the requester. The protocol is designed for LLM agent tool calls that use user-enrolled authority-bearing material. Under standard cryptographic assumptions, it meets six of seven stated security properties. Runtime-memory confidentiality requires composition with a hardware-rooted runtime. The abstract reports sub-millisecond protocol overhead per mediated call.

### Source excerpt

arXiv:2604.24920v4 Announce Type: replace Abstract: Agentic systems now act with user secrets for APIs, messaging platforms, and cloud services. Today's agent runtimes typically implement authorization by exposure: enabling action means placing a reusable secret, or a reusable artifact derived from it, inside the runtime, so a transient prompt-injection or tool-side compromise becomes durable account compromise. Existing defenses cover adjacent pieces such as secret storage, scoped delegation, sender-constrained tokens, and runtime monitoring, but none states the combined requirement: an untrusted autonomous requester should be able to cause a user-authorized secret-backed operation without gaining reusable authority over it. We formalize this as the Agent Secret Use (ASU) problem and identify seven security properties any solution must satisfy, spanning authorization integrity and secret confidentiality. We propose the Secret-Use Delegation Protocol (SUDP), in which a requester proposes a canonical operation, the user authorizes it with a fresh authenticator-backed grant, and a custodian redeems the grant to perform the bounded use; reusable authority never crosses the requester boundary. We specialize SUDP for LLM-driven agents, where it applies whenever a tool call would exercise user-enrolled authority-bearing material. Under standard cryptographic assumptions, SUDP satisfies six of the seven properties; the seventh, runtime-memory confidentiality, is closed by composition with a hardware-rooted runtime. A reference implementation, available at https://github.com/xhyumiracle/sudp, adds sub-millisecond protocol overhead per mediated call.

## XIR: A Framework for Interoperability across Cross-Chain Protocols Based on a Verifiable Intermediate Representation

DevFeed: [XIR: A Framework for Interoperability across Cross-Chain Protocols Based on a Verifiable Intermediate Representation](<https://devfeed.tech/articles/xir-a-framework-for-interoperability-across-cross-chain-protocols-based-on-a-verifiable-intermediate-representation-94508.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.20010>)

Author: Yushen Li, Linpeng Jia, Jiaying Feng, Ziliang Liao, Yi Sun

Published: 2026-10-22T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [NEO](<https://devfeed.tech/topics/neo.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>), [gateway](<https://devfeed.tech/topics/gateway.md>)

Tags: [2025](<https://devfeed.tech/tags/2025.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [adapters](<https://devfeed.tech/tags/adapters.md>), [all](<https://devfeed.tech/tags/all.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [application](<https://devfeed.tech/tags/application.md>), [applications](<https://devfeed.tech/tags/applications.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [blockchain](<https://devfeed.tech/tags/blockchain.md>), [communication](<https://devfeed.tech/tags/communication.md>), [compose](<https://devfeed.tech/tags/compose.md>), [configuration](<https://devfeed.tech/tags/configuration.md>), [connect](<https://devfeed.tech/tags/connect.md>), [connectivity](<https://devfeed.tech/tags/connectivity.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [framework](<https://devfeed.tech/tags/framework.md>), [intermediate](<https://devfeed.tech/tags/intermediate.md>), [interoperability](<https://devfeed.tech/tags/interoperability.md>), [protocols](<https://devfeed.tech/tags/protocols.md>)

### AI overview

XIR uses a verifiable intermediate representation to bind an application message to an ordered record of authenticated cross-chain deliveries, preserving message identity and verification history across protocol boundaries. Gateways and Adapters compose existing connections into same-protocol and cross-protocol multi-hop paths. A prototype integrates Hyperlane and LayerZero and was evaluated locally and on public testnets. Analysis of about 25 million events from six protocols found direct connections among 286 active blockchains reached 14.64% of ordered pairs. With correctly configured connections, the authors report XIR raises reachability to 96.86% and avoids 67,018 point-to-point configurations--84.88% of the baseline requirement for the same reachable pairs.

### Source excerpt

arXiv:2609.20010v4 Announce Type: replace Abstract: Cross-chain protocols enable applications to exchange messages across blockchains. Under point-to-point configurations, communication depends on a direct connection between the source and destination blockchains, limiting blockchain reachability and requiring additional configurations to connect more blockchains. To quantify this problem, this paper analyzes approximately 25 million mainnet cross-chain transaction events collected from six protocols (Axelar, CCIP, Hyperlane, LayerZero, Relay, and Wormhole) between January and October 2025. The resulting graph covers 286 active blockchains and 11,935 directly connected ordered blockchain pairs. These connections provide a direct reachability of 14.64%, while full direct connectivity would require 81,510 point-to-point configurations. We present XIR, a framework for interoperability across cross-chain protocols based on a verifiable intermediate representation. This representation binds an application message to an ordered record of authenticated cross-chain protocol deliveries, preserving message identity and verification history across protocol boundaries. XIR Gateways and XIR Adapters use this representation to compose existing connections into same-protocol and cross-protocol multi-hop paths. We implement an XIR prototype integrating Hyperlane and LayerZero and evaluate it in local and public-testnet environments. Theoretical analysis and evaluation show that, with correctly configured cross-chain protocol connections, XIR avoids 67,018 additional point-to-point configurations, equivalent to 84.88% of the total required by a point-to-point configuration baseline serving the same reachable pairs, and increases reachability from 14.64% to 96.86% of all ordered blockchain pairs.

## Dual-Mode Wireless Devices for Adaptive Pull and Push-Based Communication

DevFeed: [Dual-Mode Wireless Devices for Adaptive Pull and Push-Based Communication](<https://devfeed.tech/articles/dual-mode-wireless-devices-for-adaptive-pull-and-push-based-communication-93843.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2507.23421>)

Author: Sara Cavallero, Fabio Saggese, Junya Shiraishi, Israel Leyva-Mayorga, Shashi Raj Pandey, Chiara Buratti, Petar Popovski

Published: 2026-10-21T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Network](<https://devfeed.tech/topics/network.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [communication](<https://devfeed.tech/tags/communication.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [data](<https://devfeed.tech/tags/data.md>), [devices](<https://devfeed.tech/tags/devices.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [energy](<https://devfeed.tech/tags/energy.md>), [energy-efficiency](<https://devfeed.tech/tags/energy-efficiency.md>), [event-driven](<https://devfeed.tech/tags/event-driven.md>), [framework](<https://devfeed.tech/tags/framework.md>), [mac](<https://devfeed.tech/tags/mac.md>), [mechanism](<https://devfeed.tech/tags/mechanism.md>), [network](<https://devfeed.tech/tags/network.md>), [packet](<https://devfeed.tech/tags/packet.md>), [performance](<https://devfeed.tech/tags/performance.md>), [performance-metrics](<https://devfeed.tech/tags/performance-metrics.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [query](<https://devfeed.tech/tags/query.md>), [radio](<https://devfeed.tech/tags/radio.md>), [wireless](<https://devfeed.tech/tags/wireless.md>)

### AI overview

The proposed framework combines query-driven pull responses with event-driven push reports in a shared time-frame structure. If a device detects an anomaly, it can preempt its regular query response; it can also proactively push critical data without waiting for a request. A wake-up radio and tailored MAC protocol support the traffic classes. The system-level analysis evaluates push-report success, pull-response success, and total energy, finding a trade-off between push and pull success as communication resources are allocated. The authors report up to 42% less energy per served packet than traditional approaches while supporting both modes; the excerpt does not specify the baseline or operating conditions for that maximum reduction.

### Source excerpt

arXiv:2507.23421v3 Announce Type: replace Abstract: This paper introduces a dual-mode communication framework for wireless devices that integrates query-driven (pull) and event-driven (push) transmissions within a unified time-frame structure. Devices typically respond to information requests in pull mode, but if an anomaly is detected, they preempt the regular response to report the critical condition. Additionally, push-based communication is used to proactively send critical data without waiting for a request. This adaptive approach ensures timely, context-aware, and efficient data delivery across different network conditions. To achieve high energy efficiency, we incorporate a wake-up radio mechanism and we design a tailored medium access control (MAC) protocol that supports data traffic belonging to the different communication classes. A comprehensive system-level analysis is conducted, accounting for the wake-up control operation and evaluating three key performance metrics: the success probability of anomaly reports (push traffic), the success probability of query responses (pull traffic) and the total energy consumption. Numerical results characterize the system's behavior and highlight the inherent trade-off between push and pull success probabilities as a function of allocated communication resources. Our analysis demonstrates that the proposed approach achieves up to a 42% reduction in energy consumption per served packet compared to traditional approaches, while maintaining reliable support for both communication paradigms.

## Figma co-founder Dylan Field thinks MCP is not a perfect protocol

DevFeed: [Figma co-founder Dylan Field thinks MCP is not a perfect protocol](<https://devfeed.tech/articles/figma-co-founder-dylan-field-thinks-mcp-is-not-a-perfect-protocol-90935.md>)

Original publisher: [Read original article](<https://techcrunch.com/2026/10/20/figma-co-founder-dylan-field-thinks-mcp-is-not-a-perfect-protocol/>)

Author: Ivan Mehta

Published: 2026-10-20T14:13:32Z

Content type: news

Language: en

Sources: [TechCrunch | AI News & Artificial Intelligence](<https://devfeed.tech/sources/techcrunch-ai-news-artificial-intelligence.md>)

Topics: [Figma](<https://devfeed.tech/topics/figma.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-agents](<https://devfeed.tech/tags/ai-agents.md>), [amp](<https://devfeed.tech/tags/amp.md>), [announcement](<https://devfeed.tech/tags/announcement.md>), [anthropic](<https://devfeed.tech/tags/anthropic.md>), [apps](<https://devfeed.tech/tags/apps.md>), [artifacts](<https://devfeed.tech/tags/artifacts.md>), [ceo](<https://devfeed.tech/tags/ceo.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [co-founder](<https://devfeed.tech/tags/co-founder.md>), [conference](<https://devfeed.tech/tags/conference.md>), [config](<https://devfeed.tech/tags/config.md>), [context](<https://devfeed.tech/tags/context.md>), [data](<https://devfeed.tech/tags/data.md>), [dylan-field](<https://devfeed.tech/tags/dylan-field.md>), [field](<https://devfeed.tech/tags/field.md>), [figma](<https://devfeed.tech/tags/figma.md>), [mcp](<https://devfeed.tech/tags/mcp.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [support](<https://devfeed.tech/tags/support.md>)

### AI overview

Figma announced 20 new MCP partners while co-founder Dylan Field said the protocol is imperfect, favors frontier labs, and has room to improve. He said Figma wants users to access its data through MCP, but the company's CEO cited a greater risk of abuse as more data is exposed. Field also criticized uneven sharing of cloud resources through MCP, arguing that debate over open versus closed systems overlooks asymmetric context sharing. The excerpt reports Figma's expansion and these concerns but does not detail the new integrations or specific safeguards.

### Source excerpt

Figma said it plans to support as many standards as possible without exposing all of its data.

## Codex MCP Server Removed: How to Migrate to the App Server

DevFeed: [Codex MCP Server Removed: How to Migrate to the App Server](<https://devfeed.tech/articles/codex-mcp-server-removed-how-to-migrate-to-the-app-server-89592.md>)

Original publisher: [Read original article](<https://www.developersdigest.tech/blog/codex-mcp-server-removed>)

Author: Developers Digest

Published: 2026-10-17T00:00:00Z

Content type: tutorial

Language: en

Sources: [Developers Digest](<https://devfeed.tech/sources/developers-digest.md>)

Topics: [codex](<https://devfeed.tech/topics/codex.md>), [mcp-steroid](<https://devfeed.tech/topics/mcp-steroid.md>), [Protocol (disambiguation)](<https://devfeed.tech/topics/protocol.md>)

Tags: [ai-coding](<https://devfeed.tech/tags/ai-coding.md>), [cli](<https://devfeed.tech/tags/cli.md>), [codex](<https://devfeed.tech/tags/codex.md>), [codex-cli](<https://devfeed.tech/tags/codex-cli.md>), [developer-tools](<https://devfeed.tech/tags/developer-tools.md>), [experimental](<https://devfeed.tech/tags/experimental.md>), [integration](<https://devfeed.tech/tags/integration.md>), [json-rpc](<https://devfeed.tech/tags/json-rpc.md>), [mcp](<https://devfeed.tech/tags/mcp.md>), [migrate](<https://devfeed.tech/tags/migrate.md>), [openai](<https://devfeed.tech/tags/openai.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [rpc](<https://devfeed.tech/tags/rpc.md>)

### AI overview

The Codex CLI removed its MCP server in version 0.154.0. The article explains how to move an integration to the experimental app server and its JSON-RPC protocol.

### Source excerpt

codex mcp-server is gone as of Codex CLI 0.154.0. Here is how to move an integration to the experimental app server and its JSON-RPC protocol.

[Next page](<https://devfeed.tech/topics/protocol.md?cursor=WyIyMDI2LTEwLTE3VDAwOjAwOjAwKzAwOjAwIiwgImYzNTJiYzc2LWY2N2MtNDQyZS04ZTQ1LTFhMTljMGViMDAxZCJd>)