Tootfinder

SYK model based $\beta$ regime dependent two-qubit dynamical wormhole-inspired teleportation protocol simulation
Sudhanva Joshi, Sunil Kumar Mishra
https://arxiv.org/abs/2506.15373

SYK model based $β$ regime dependent two-qubit dynamical wormhole-inspired teleportation protocol simulation
This study aims to provide insights into various aspects of quantum chaos and teleportation by implementing the recently developed Wormhole-Inspired Teleportation Protocol (WITP). We commence by constructing an analog of a traversable wormhole utilizing the Sachdev-Ye-Kitaev (SYK) model in conjunction with the Thermofield Double (TFD) state framework, implemented within a quantum circuit. Subsequently, we manipulate various parameters, including temperature ($β$) and the location of the messag…

Fair Data Exchange with Constant-Time Proofs
Majid Khabbazian
https://arxiv.org/abs/2506.14944 https://arxiv.org/pdf/2506.14944

Fair Data Exchange with Constant-Time Proofs
The Fair Data Exchange (FDE) protocol introduced at CCS 2024 offers atomic pay-per-file transfers with constant-size proofs, but its prover and verifier runtimes still scale linearly with the file length n. We collapse these costs to essentially constant by viewing the file as a rate-1 Reed-Solomon (RS) codeword, extending it to a lower-rate RS code with constant redundancy, encrypting this extended vector, and then proving correctness for only a small random subset of the resulting ciphertexts…

Benchmarks for protocol control in nonequilibrium statistical mechanics
Stephen Whitelam, Corneel Casert, Megan Engel, Isaac Tamblyn
https://arxiv.org/abs/2506.15122

Benchmarks for protocol control in nonequilibrium statistical mechanics
We present a set of computer codes designed to test methods for optimizing time-dependent control protocols in fluctuating nonequilibrium systems. Each problem consists of a stochastic model, an optimization objective, and C++ and Python implementations that can be run on Unix-like systems. These benchmark systems are simple enough to run on a laptop, but challenging enough to test the capabilities of modern optimization methods. This release includes five problems and a worked example. The pro…

A Comparative Study on Proactive and Passive Detection of Deepfake Speech
Chia-Hua Wu, Wanying Ge, Xin Wang, Junichi Yamagishi, Yu Tsao, Hsin-Min Wang
https://arxiv.org/abs/2506.14398

A Comparative Study on Proactive and Passive Detection of Deepfake Speech
Solutions for defending against deepfake speech fall into two categories: proactive watermarking models and passive conventional deepfake detectors. While both address common threats, their differences in training, optimization, and evaluation prevent a unified protocol for joint evaluation and selecting the best solutions for different cases. This work proposes a framework to evaluate both model types in deepfake speech detection. To ensure fair comparison and minimize discrepancies, all model…

@… say, what was the page switching protocol you've encountered with PHYs before? reg 0xD/0xE appears to be 802.3 standard

MPLS (network protocol) is pronounced

Model Context Protocol (MCP) at First Glance: Studying the Security and Maintainability of MCP Servers
Mohammed Mehedi Hasan, Hao Li, Emad Fallahzadeh, Bram Adams, Ahmed E. Hassan
https://arxiv.org/abs/2506.13538

Model Context Protocol (MCP) at First Glance: Studying the Security and Maintainability of MCP Servers
Although Foundation Models (FMs), such as GPT-4, are increasingly used in domains like finance and software engineering, reliance on textual interfaces limits these models' real-world interaction. To address this, FM providers introduced tool calling-triggering a proliferation of frameworks with distinct tool interfaces. In late 2024, Anthropic introduced the Model Context Protocol (MCP) to standardize this tool ecosystem, which has become the de facto standard with over eight million weekly SD…

Non-Gaussian state preparation and enhancement using weak-value amplification
Xiao-Xi Yao, Yusuf Turek
https://arxiv.org/abs/2506.14632 https://

Non-Gaussian state preparation and enhancement using weak-value amplification
We introduce a protocol for generating a broad class of non-Gaussian (nG) quantum states via postselected weak measurement techniques. The scheme involves injecting an arbitrary quantum state and a single photon into the signal and idler ports, respectively, of an interference setup that incorporates a third-order nonlinear medium. A nG state is conditionally produced at the signal output, heralded by the detection of a single photon in one of the idler output channels. The protocol exploits a …

LLMs the Model Context Protocol (MCP) are the Yang to the Semantic Web Project's Yin.
We now have a solution to the final hurdle—visualization.
Years of Linked Data work now come alive. I explain this, with demonstrations, in a new newsletter post.
www.linkedin.com/pulse/semant...
#MCP

Robot Context Protocol (RCP): A Runtime-Agnostic Interface for Agent-Aware Robot Control
Lambert Lee, Joshua Lau
https://arxiv.org/abs/2506.11650 https://

Robot Context Protocol (RCP): A Runtime-Agnostic Interface for Agent-Aware Robot Control
The Robot Context Protocol (RCP) is a lightweight, middleware-agnostic communication protocol designed to simplify the complexity of robotic systems and enable seamless interaction between robots, users, and autonomous agents. RCP provides a unified and semantically meaningful interface that decouples client-facing operations from backend implementations, supporting a wide range of deployment environments including physical robots, cloud-based orchestrators, and simulated platforms. Built on HT…

Self-Stabilizing Replicated State Machine Coping with Byzantine and Recurring Transient Faults
Shlomi Dolev, Amit Hendin, Maurice Herlihy, Maria Potop Butucaru, Elad Michael Schiller
https://arxiv.org/abs/2506.12900

Self-Stabilizing Replicated State Machine Coping with Byzantine and Recurring Transient Faults
The ability to perform repeated Byzantine agreement lies at the heart of important applications such as blockchain price oracles or replicated state machines. Any such protocol requires the following properties: (1) \textit{Byzantine fault-tolerance}, because not all participants can be assumed to be honest, (2) r\textit{ecurrent transient fault-tolerance}, because even honest participants may be subject to transient ``glitches'', (3) \textit{accuracy}, because the results of quantitative queri…

If you are also annoyed by Firefox for some reason now trimming the protocol in the address bar you can fix that behavior by setting "browser.urlbar.trimURLs" in about:config to get URLs you can properly copy and use back.

Thermodynamic control of non-equilibrium systems
Dana Kamp, Karel Proesmans
https://arxiv.org/abs/2506.14416 https://arxiv.org/pdf/25…

Thermodynamic control of non-equilibrium systems
We study the thermodynamic cost associated with driving systems between different non-equilibrium steady states. In particular, we combine a linear-response framework for non-equilibrium Markov systems with Lagrangian techniques to minimize the dissipation associated with driving processes. We then apply our framework to a simple toy model. Our results show several remarkable properties for the optimal protocol, such as diverging parameters and finite entropy production in the slow-driving limi…

Towards the Autonomous Optimization of Urban Logistics: Training Generative AI with Scientific Tools via Agentic Digital Twins and Model Context Protocol
Haowen Xu, Yulin Sun, Jose Tupayachi, Olufemi Omitaomu, Sisi Zlatanov, Xueping Li
https://arxiv.org/abs/2506.13068

Towards the Autonomous Optimization of Urban Logistics: Training Generative AI with Scientific Tools via Agentic Digital Twins and Model Context Protocol
Optimizing urban freight logistics is critical for developing sustainable, low-carbon cities. Traditional methods often rely on manual coordination of simulation tools, optimization solvers, and expert-driven workflows, limiting their efficiency and scalability. This paper presents an agentic system architecture that leverages the model context protocol (MCP) to orchestrate multi-agent collaboration among scientific tools for autonomous, simulation-informed optimization in urban logistics. The …

Dynamical decoupling of interacting spins through group factorization
Colin Read, Eduardo Serrano-Ens\'astiga, John Martin
https://arxiv.org/abs/2506.15382

Dynamical decoupling of interacting spins through group factorization
Dynamical decoupling (DD) is a well-known open-loop protocol for suppressing unwanted interactions in a quantum system, thereby drastically extending the coherence time of useful quantum states. In the original framework of evolution symmetrization, a DD sequence was shown to enforce a symmetry on the unwanted Hamiltonian, thereby suppressing it if the symmetry was inaccessible. In this work, we show how symmetries already present in the undesired Hamiltonian can be harnessed to reduce the comp…

US broadband provider Astound, aka RCN, (#AS6079). I've asked if this FAQ is outdated, it doesn't sound right.
"Disabling IPv6
For CA, OR, TX and WA
[...]
IPv6 is not yet widely adopted; most software, routers, modems, and other network equipment does not support this emerging protocol"

Analog Quantum Phase Estimation with Single-Mode Readout
Wei-Chen Lin, Chiao-Hsuan Wang
https://arxiv.org/abs/2506.15668 https://arxi…

Analog Quantum Phase Estimation with Single-Mode Readout
Eigenvalue estimation is a central problem for demonstrating quantum advantage, yet its implementation on digital quantum computers remains limited by circuit depth and operational overhead. We present an analog quantum phase estimation (aQPE) protocol that extracts the eigenenergies of a target Hamiltonian via continuous time evolution and single-mode cavity measurement. By encoding eigenvalue information as conditional cavity phase-space rotations, the scheme avoids deep quantum circuits and …

Distributed Learning for Reliable and Timely Communication in 6G Industrial Subnetworks
Samira Abdelrahman, Hossam Farag, Gilberto Berardinelli
https://arxiv.org/abs/2506.11749

Distributed Learning for Reliable and Timely Communication in 6G Industrial Subnetworks
Emerging 6G industrial networks envision autonomous in-X subnetworks to support efficient and cost-effective short range, localized connectivity for autonomous control operations. Supporting timely transmission of event-driven, critical control traffic is challenging in such networks is challenging due to limited radio resources, dynamic device activity, and high mobility. In this paper, we propose a distributed, learning-based random access protocol that establishes implicit inter-subnetwork c…

Beyond Formal Semantics for Capabilities and Skills: Model Context Protocol in Manufacturing
Luis Miguel Vieira da Silva, Aljosha K\"ocher, Felix Gehlhoff
https://arxiv.org/abs/2506.11180

Beyond Formal Semantics for Capabilities and Skills: Model Context Protocol in Manufacturing
Explicit modeling of capabilities and skills -- whether based on ontologies, Asset Administration Shells, or other technologies -- requires considerable manual effort and often results in representations that are not easily accessible to Large Language Models (LLMs). In this work-in-progress paper, we present an alternative approach based on the recently introduced Model Context Protocol (MCP). MCP allows systems to expose functionality through a standardized interface that is directly consumab…

Temporal Entanglement and Witnesses of Non-Classicality
Giuseppe Di Pietra, Gaurav Bhole, James Eaton, Andrew J. Baldwin, Jonathan A. Jones, Vlatko Vedral, Chiara Marletto
https://arxiv.org/abs/2506.15474

Temporal Entanglement and Witnesses of Non-Classicality
The universality of quantum theory has been questioned ever since it was proposed. Key to this long-unsolved question is to test whether a given physical system has non-classical features. Here we connect recently proposed witnesses of non-classicality, based on information-theoretic ideas, with the theory of temporal entanglement. We provide a protocol to witness the non-classicality of a system by probing it with a qubit: we show that, assuming a general conservation law, violating temporal B…

Practical Improvements of A/B Testing with Off-Policy Estimation
Sakhi Otmane, Gilotte Alexandre, Rohde David
https://arxiv.org/abs/2506.10677 https://

Practical Improvements of A/B Testing with Off-Policy Estimation
We address the problem of A/B testing, a widely used protocol for evaluating the potential improvement achieved by a new decision system compared to a baseline. This protocol segments the population into two subgroups, each exposed to a version of the system and estimates the improvement as the difference between the measured effects. In this work, we demonstrate that the commonly used difference-in-means estimator, while unbiased, can be improved. We introduce a family of unbiased off-policy e…

With moving my calendar away from Google I was looking for a Caldev solution, but ...
Interesting take on CalDev and encryption on Cryptpad's github page.
No chance that that will happen encrypted.
It's waiting for an solution in the Caldev protocol. 😇
[Feature request] Possibility to have CalDAV for the Calendar · Issue #823 · cryptpad/cryptpad

A Language-Agnostic Logical Relation for Message-Passing Protocols
Tesla Zhang, Sonya Simkin, Rui Li, Yue Yao, Stephanie Balzer
https://arxiv.org/abs/2506.10026

A Language-Agnostic Logical Relation for Message-Passing Protocols
Today's computing landscape has been gradually shifting to applications targeting distributed and *heterogeneous* systems, such as cloud computing and Internet of Things (IoT) applications. These applications are predominantly *concurrent*, employ *message-passing*, and interface with *foreign objects*, ranging from externally implemented code to actual physical devices such as sensors. Verifying that the resulting systems adhere to the intended protocol of interaction is challenging -- the usu…

“Our parents kept us carefully isolated - from birth - from even witnessing examples of other children being disrespectful, and even the faintest disobedience gets slapped out of you starting as a baby.”
https://open.substack.com/pub/aella/p/the-joy-is-not-optional…

Experimental demonstration of high-fidelity logical magic states from code switching
Lucas Daguerre, Robin Blume-Kohout, Natalie C. Brown, David Hayes, Isaac H. Kim
https://arxiv.org/abs/2506.14169

Experimental demonstration of high-fidelity logical magic states from code switching
Preparation of high-fidelity logical magic states has remained as a necessary but daunting step towards building a large-scale fault-tolerant quantum computer. One approach is to fault-tolerantly prepare a magic state in one code and then switch to another, a method known as code switching. We experimentally demonstrate this protocol on an ion-trap quantum processor, yielding a logical magic state encoded in an error-correcting code with state-of-the-art logical fidelity. Our experiment is base…

Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate
Shival Dasu, Simon Burton, Karl Mayer, David Amaro, Justin A. Gerber, Kevin Gilmore, Dan Gresh, Davide DelVento, Andrew C. Potter, David Hayes
https://arxiv.org/abs/2506.14688

Breaking even with magic: demonstration of a high-fidelity logical non-Clifford gate
Encoding quantum information to protect it from errors is essential for performing large-scale quantum computations. Performing a universal set of quantum gates on encoded states demands a potentially large resource overhead and minimizing this overhead is key for the practical development of large-scale fault-tolerant quantum computers. We propose and experimentally implement a magic-state preparation protocol to fault-tolerantly prepare a pair of logical magic states in a [[6,2,2]] quantum er…

mimic-one: a Scalable Model Recipe for General Purpose Robot Dexterity
Elvis Nava, Victoriano Montesinos, Erik Bauer, Benedek Forrai, Jonas Pai, Stefan Weirich, Stephan-Daniel Gravert, Philipp Wand, Stephan Polinski, Benjamin F. Grewe, Robert K. Katzschmann
https://arxiv.org/abs/2506.11916…

mimic-one: a Scalable Model Recipe for General Purpose Robot Dexterity
We present a diffusion-based model recipe for real-world control of a highly dexterous humanoid robotic hand, designed for sample-efficient learning and smooth fine-motor action inference. Our system features a newly designed 16-DoF tendon-driven hand, equipped with wide angle wrist cameras and mounted on a Franka Emika Panda arm. We develop a versatile teleoperation pipeline and data collection protocol using both glove-based and VR interfaces, enabling high-quality data collection across dive…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

Looking at the Common Alert Protocol (https://docs.oasis-open.org/emergency/cap/v1.2/CAP-v1.2-os.html), for our Service Alerts (

Couple of notes, #DailyMail
1. Obviously the story's overblown scaremongering, used here purely as a stick to beat the gov with;
2. IDK the details, but it sounds very much like the standard NHS protocol for anonymised mass data, it's not "Let's look up Jonathan Harmsworth's doctors notes, so as to embarrass, understand & predict, blackmail or manipulate…

Esto se ve realmente interesante. Una herramienta que permite migrar cuentas entre activitypub y ATprotocol conservando publicaciones y seguidores. Y, según entiendo, también permite migrar entre plataformas del mismo protocolo. Habrš que ver qué tal va.
https://blog.anew.social/bounce-a-cros…

Construction of ergodic IDLA forests in $\mathbb{Z}^d$
Nicolas Chenavier (LMPA), David Coupier (IMT Nord Europe), Keenan Penner (LMPA), Arnaud Rousselle (UBE)
https://arxiv.org/abs/2506.10476

Construction of ergodic IDLA forests in $\mathbb{Z}^d$
We prove the existence of infinite-volume IDLA forests in $\mathbb{Z}^d$ , with $d \geq 2$, based on a multi-source IDLA protocol. Unlike IDLA aggregates, the laws of the IDLA forests studied here depend on the trajectories of particles, and then do not satisfy the famous Abelian property. Their existence is due to a stabilization result (Theorem 1.1, our main result) that we establish using percolation tools. Although the sources are infinitely many, we also prove that each of them play the sa…

Digital Quantum Simulation of the Kitaev Quantum Spin Liquid
Seongjun Park, Eun-Gook Moon
https://arxiv.org/abs/2506.09156 https://ar…

Digital Quantum Simulation of the Kitaev Quantum Spin Liquid
The ground state of the Kitaev quantum spin liquid on a honeycomb lattice is an intriguing many-body state characterized by its topological order and massive entanglement. One of the significant issues is to prepare and manipulate the ground state as well as excited states in a quantum simulator. Here, we provide a protocol to manipulate the Kitaev quantum spin liquid via digital quantum simulation. A series of unitary gates for the protocol is explicitly constructed, showing its circuit depth …

Some of you probably remember WAIS. An Internet search engine from the Gopher era (more specific: a search protocol). TIL: Thinking Machines (those with the massive red blinkenlights servers) were the main driver and developer of WAIS: https://en.wikipedia.org/wiki/Wide_area_information…

lol this project can go fuck itself
https://www.theregister.com/2025/06/10/xlibre_new_xorg_fork/

Forked-off Xlibre tells Wayland display protocol to DEI in a fire
: Project to modernize the X.org X11 server seems to actively court controversy

Ça bouge bien côté Bluesky pour faire vivre le AT Protocol en dehors du contrôle de Bluesky !
ATmosphere Report 120 https://fediversereport.com/atmosphere-report-120/

ATmosphere Report – #120
WordPress plugins on ATProto, managing digital badges and attestations, and more.

\textit{QuantMCP}: Grounding Large Language Models in Verifiable Financial Reality
Yifan Zeng
https://arxiv.org/abs/2506.06622 https://

\textit{QuantMCP}: Grounding Large Language Models in Verifiable Financial Reality
Large Language Models (LLMs) hold immense promise for revolutionizing financial analysis and decision-making, yet their direct application is often hampered by issues of data hallucination and lack of access to real-time, verifiable financial information. This paper introduces QuantMCP, a novel framework designed to rigorously ground LLMs in financial reality. By leveraging the Model Context Protocol (MCP) for standardized and secure tool invocation, QuantMCP enables LLMs to accurately interfac…

A Study on the MCP x A2A Framework for Enhancing Interoperability of LLM-based Autonomous Agents
Cheonsu Jeong
https://arxiv.org/abs/2506.01804 https://

A Study on the MCP x A2A Framework for Enhancing Interoperability of LLM-based Autonomous Agents
This paper provides an in-depth technical analysis and implementation methodology of the open-source Agent-to-Agent (A2A) protocol developed by Google and the Model Context Protocol (MCP) introduced by Anthropic. While the evolution of LLM-based autonomous agents is rapidly accelerating, efficient interactions among these agents and their integration with external systems remain significant challenges. In modern AI systems, collaboration between autonomous agents and integration with external t…

Secure Data Access in Cloud Environments Using Quantum Cryptography
S. Vasavi Venkata Lakshmi, Ziaul Haque Choudhury
https://arxiv.org/abs/2506.10028 https…

Secure Data Access in Cloud Environments Using Quantum Cryptography
Cloud computing has made storing and accessing data easier but keeping it secure is a big challenge nowadays. Traditional methods of ensuring data may not be strong enough in the future when powerful quantum computers become available. To solve this problem, this study uses quantum cryptography to protect data in the cloud environment. Quantum Key Distribution (QKD) creates secure keys by sending information using quantum particles like photons. Specifically, we use the BB84 protocol, a simple …

This is really neat.
https://mastodon.social/@pid_eins/114618473677694301

Analysis of X's new XChat shows that X can probably decrypt users' messages, as it holds users' private keys on its servers (Matthew Green/A Few Thoughts ...)
https://blog.cryptographyengineering.com/2025/06/09/a-bi…

A bit more on Twitter/X’s new encrypted messaging
Matthew Garrett has a nice post about Twitter (uh, X)’s new end-to-end encryption messaging protocol, which is now called XChat. The TL;DR of Matthew’s post is that from a cryptographic…

Frosty for partial synchrony
Stephen Buttolph, Andrew Lewis-Pye, Kevin Sekniqi
https://arxiv.org/abs/2506.09823 https://arxiv.org/pdf…

Frosty for partial synchrony
Snowman is the consensus protocol used by blockchains on Avalanche. Recent work has shown both how to augment Snowman with a `liveness' module called `Frosty' that protects against liveness attacks, and also how to modify Snowman so as to be consistent in partial synchrony. Since Frosty assumes (a strong form of) synchrony, the aim of this note is to show how to modify Frosty to deal with the partially synchronous version of Snowman.

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

Starting to think about GPU acceleration of protocol decodes (rather than just basic math blocks) in ngscopeclient.
Here's the filter graph I'm thinking of using as a benchmark: dual lane QSGMII, 20M points per channel.
The filter graph takes 944 ms end to end to run on my box (2x Xeon 6144 2080 Ti).
Major time consumers:
* Eye pattern (~345 ms)
* QSGMII (~337 ms)
* CDR PLL (~310 ms)
* 8B10B (~160 ms)
* SGMII (~120 ms)
Note that the …

Rumors on evolving graphs through stationary times
Vicenzo Bonasorte
https://arxiv.org/abs/2506.04386 https://arxiv.org/pdf/2506.0438…

Rumors on evolving graphs through stationary times
We study rumor spreading in dynamic random graphs. Starting with a single informed vertex, the information flows until it reaches all the vertices of the graph (completion), according to the following process. At each step $k$, the information is propagated to neighbors of the informed vertices, in the $k$-th generated random graph. The way this information propagates from vertex to vertex at each step will depend on the ``protocol". We provide a method based on strong stationary times to study…

my #gemini server is back online at
gemini://gemini.jasonsanta.xyz
#gemini_protocol

This https://arxiv.org/abs/2405.00295 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csGT_…

Proof of Sampling: A Nash Equilibrium-Based Verification Protocol for Decentralized Systems
This paper introduces the Proof of Sampling (PoSP) protocol, a Nash Equilibrium-based verification mechanism, and its application to decentralized machine learning inference through spML. Our protocol has a pure strategy Nash Equilibrium, compelling rational participants to act honestly. It economically disincentivizes dishonest behavior, making it costly for participants to compromise the network's integrity. In our spML protocol, we apply PoSP to decentralized inference for AI applications vi…

A Two-stage Optimization Method for Wide-range Single-electron Quantum Magnetic Sensing
Shiqian Guo, Jianqing Liu, Thinh Le, Huaiyu Dai
https://arxiv.org/abs/2506.13469

A Two-stage Optimization Method for Wide-range Single-electron Quantum Magnetic Sensing
Quantum magnetic sensing based on spin systems has emerged as a new paradigm for detecting ultra-weak magnetic fields with unprecedented sensitivity, revitalizing applications in navigation, geo-localization, biology, and beyond. At the heart of quantum magnetic sensing, from the protocol perspective, lies the design of optimal sensing parameters to manifest and then estimate the underlying signals of interest (SoI). Existing studies on this front mainly rely on adaptive algorithms based on bla…

Looking at the Common Alert Protocol (https://docs.oasis-open.org/emergency/cap/v1.2/CAP-v1.2-os.html), for our Service Alerts (

Aucamp: An Underwater Camera-Based Multi-Robot Platform with Low-Cost, Distributed, and Robust Localization
Jisheng Xu, Ding Lin, Pangkit Fong, Chongrong Fang, Xiaoming Duan, Jianping He
https://arxiv.org/abs/2506.09876

Aucamp: An Underwater Camera-Based Multi-Robot Platform with Low-Cost, Distributed, and Robust Localization
This paper introduces an underwater multi-robot platform, named Aucamp, characterized by cost-effective monocular-camera-based sensing, distributed protocol and robust orientation control for localization. We utilize the clarity feature to measure the distance, present the monocular imaging model, and estimate the position of the target object. We achieve global positioning in our platform by designing a distributed update protocol. The distributed algorithm enables the perception process to si…

This week’s edition of my @… newsletter shines a light on the impact of the Model Context Protocol (MCP) across multiple computing eras—leading right up to today.
We’ve arrived at a moment where loose coupling principles are cool (and super useful) again.
Naturally, there are some live demo nuggets in the post to help bring it all to life:
🔗

The Model Context Protocol: Bridging Generational Computing Experiences
The Model Context Protocol (MCP) is emerging as a transformative force in computing, with its significance uniquely appreciated across generational lines. This new protocol serves as crucial middleware for LLM-powered productivity tools, addressing needs that previous computing paradigms couldn't fu

No stream today. However, I will be looking into Bittorrent's DHT protocol tomorrow! Hope to see you then. 0530 MDT.

This https://arxiv.org/abs/2504.20618 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Statistical Channel Based Low-Complexity Rotation and Position Optimization for 6D Movable Antennas Enabled Wireless Communication
Six-dimensional movable antenna (6DMA) is a promising technology to fully exploit spatial variation in wireless channels by allowing flexible adjustment of three-dimensional (3D) positions and rotations of antennas at the transceiver. In this paper, we investigate the practical low-complexity design of 6DMA-enabled communication systems, including transmission protocol, statistical channel information (SCI) acquisition, and joint position and rotation optimization of 6DMA surfaces based on the …

Hybrid Stabilization Protocol for Cross-Chain Digital Assets Using Adaptor Signatures and AI-Driven Arbitrage
Shengwei You, Andrey Kuehlkamp, Jarek Nabrzyski
https://arxiv.org/abs/2506.05708

Hybrid Stabilization Protocol for Cross-Chain Digital Assets Using Adaptor Signatures and AI-Driven Arbitrage
Stablecoins face an unresolved trilemma of balancing decentralization, stability, and regulatory compliance. We present a hybrid stabilization protocol that combines crypto-collateralized reserves, algorithmic futures contracts, and cross-chain liquidity pools to achieve robust price adherence while preserving user privacy. At its core, the protocol introduces stabilization futures contracts (SFCs), non-collateralized derivatives that programmatically incentivize third-party arbitrageurs to cou…

Agentic Semantic Control for Autonomous Wireless Space Networks: Extending Space-O-RAN with MCP-Driven Distributed Intelligence
Eduardo Baena, Paolo Testolina, Michele Polese, Sergi Aliaga, Andrew Benincasa, Dimitrios Koutsonikolas, Josep Jornet, Tommaso Melodia
https://arxiv.org/abs/2506.10925

Agentic Semantic Control for Autonomous Wireless Space Networks: Extending Space-O-RAN with MCP-Driven Distributed Intelligence
Lunar surface operations impose stringent requirements on wireless communication systems, including autonomy, robustness to disruption, and the ability to adapt to environmental and mission-driven context. While Space-O-RAN provides a distributed orchestration model aligned with 3GPP standards, its decision logic is limited to static policies and lacks semantic integration. We propose a novel extension incorporating a semantic agentic layer enabled by the Model Context Protocol (MCP) and Agent-…

From July 1 if a new maintainer isn't found then tcpflow will be archived. From the GitHub page:
> tcpflow is a program that captures data transmitted as part of TCP connections (flows), and stores the data in a way that is convenient for protocol analysis and debugging.
https://github.com/simsong/tc…

This https://arxiv.org/abs/2505.19253 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIR_…

DeepResearchGym: A Free, Transparent, and Reproducible Evaluation Sandbox for Deep Research
Deep research systems represent an emerging class of agentic information retrieval methods that generate comprehensive and well-supported reports to complex queries. However, most existing frameworks rely on dynamic commercial search APIs, which pose reproducibility and transparency challenges in addition to their cost. To address these limitations, we introduce DeepResearchGym, an open-source sandbox that combines a reproducible search API with a rigorous evaluation protocol for benchmarking d…

More than $12 million stolen from crypto platform Cork Protocol https://therecord.media/cork-protocol-defi-12million-crypto-theft

Universal cooling of quantum systems via randomized measurements
Josias Langbehn, George Mouloudakis, Emma King, Rapha\"el Menu, Igor Gornyi, Giovanna Morigi, Yuval Gefen, Christiane P. Koch
https://arxiv.org/abs/2506.11964

Universal cooling of quantum systems via randomized measurements
It is generally believed that the design of cooling protocols requires knowledge of the system's spectrum. In contrast, cooling processes in nature occur whenever the system is coupled to a cold bath. But how does nature know how to cool quantum systems? Here we address this question by mimicking a natural cold bath with a reservoir of "meter" qubits that are initialized in their ground state and interact with the system sequentially for a specified time before being discarded. This protocol is…

This is just one example. "MCP" the protocol for "AI agents" is basically without security measures. It's like running random code on your infrastructure and data.
(Original title: GitHub MCP Exploited: Accessing private repositories via MCP)
https://simonwillison.net…

Efficient Modular Multiplier over GF (2^m) for ECPM
Ruby Kumari, Gaurav Purohit, Abhijit Karmakar
https://arxiv.org/abs/2506.09464 https://

Efficient Modular Multiplier over GF (2^m) for ECPM
Elliptic curve cryptography (ECC) has emerged as the dominant public-key protocol, with NIST standardizing parameters for binary field GF(2^m) ECC systems. This work presents a hardware implementation of a Hybrid Multiplication technique for modular multiplication over binary field GF(2m), targeting NIST B-163, 233, 283, and 571 parameters. The design optimizes the combination of conventional multiplication (CM) and Karatsuba multiplication (KM) to enhance elliptic curve point multiplication (E…

Survey of LLM Agent Communication with MCP: A Software Design Pattern Centric Review
Anjana Sarkar, Soumyendu Sarkar
https://arxiv.org/abs/2506.05364 https…

Survey of LLM Agent Communication with MCP: A Software Design Pattern Centric Review
This survey investigates how classical software design patterns can enhance the reliability and scalability of communication in Large Language Model (LLM)-driven agentic AI systems, focusing particularly on the Model Context Protocol (MCP). It examines the foundational architectures of LLM-based agents and their evolution from isolated operation to sophisticated, multi-agent collaboration, addressing key communication hurdles that arise in this transition. The study revisits well-established pa…

Optimal protocol for collisional Brownian engines
Gustavo A. L. For\~ao
https://arxiv.org/abs/2506.05078 https://arxiv.org/pdf/2506.0…

Optimal protocol for collisional Brownian engines
Collisional Brownian engines have recently gained attention as alternatives to conventional nanoscale engines. However, a comprehensive optimization of their performance, which could serve as a benchmark for future engine designs, is still lacking. In this work, we address this gap by deriving and analyzing the optimal driving protocol for a collisional Brownian engine. By maximizing the average output work, we show that the optimal protocol consists of linear force segments separated by impuls…

The Secure Overview and Analysis OF 3GPP MAC CE
Jin Cao, Yuanyuan Yang, Ruhui Ma, Sheng Li, Hui Li
https://arxiv.org/abs/2506.09502 https://

The Secure Overview and Analysis OF 3GPP MAC CE
To more effectively control and allocate network resources, MAC CE has been introduced into the network protocol, which is a type of control signaling located in the MAC layer. Since MAC CE lacks encryption and integrity protection mechanisms provided by PDCP, the control signaling carried by MAC CE is vulnerable to interception or tampering by attackers during resource scheduling and allocation. Currently, the 3GPP has analyzed the security risks of Layer 1/Layer 2 Triggered Mobility (LTM), wh…

Do we know if Anthropic named their (technically garbage) "Agentic AI" protocol MCP in refence to the antagonist of the TRON movie?

Singularity Protocol for Cross Chain AMM without Intermediate Tokens or Bridges
Sumit Vohra
https://arxiv.org/abs/2505.24337 https://…

Singularity Protocol for Cross Chain AMM without Intermediate Tokens or Bridges
Automated Market Makers (AMMs) are decentralized exchange protocols that provide continuous access to token liquidity without the need for order books or traditional market makers. However, this innovation has failed to scale when it comes to cross-chain swaps. Modern cross-chain swaps employ double-sided AMMs, which are not only inefficient due to liquidity fragmentation but also require an intermediate token. This introduces inherent volatility risk as well as blockchain and bridging risk, es…

Figma releases Dev Mode Model Context Protocol server, which provides more context about how AI designs are created in Figma (Jess Weatherbed/The Verge)
https://www.theverge.com/news/679439/figma-dev-mode-mcp-server-beta-release

Figma will let your AI access its design servers
Figma is launching a Dev Mode MCP Server that can help AI models more effectively translate designs into fully coded applications.

Improved Byzantine Agreement under an Adaptive Adversary
Fabien Dufoulon, Gopal Pandurangan
https://arxiv.org/abs/2506.04919 https://…

Improved Byzantine Agreement under an Adaptive Adversary
Byzantine agreement is a fundamental problem in fault-tolerant distributed computing that has been studied intensively for the last four decades. Much of the research has focused on a static Byzantine adversary, where the adversary is constrained to choose the Byzantine nodes in advance of the protocol's execution. This work focuses on the harder case of an adaptive Byzantine adversary that can choose the Byzantine nodes \emph{adaptively} based on the protocol's execution. While efficient $O(\l…

Explicit C*-algebraic Protocol for Exact Universal Embezzlement of Entanglement
Li Liu
https://arxiv.org/abs/2506.10736 https://arxiv…

Explicit C*-algebraic Protocol for Exact Universal Embezzlement of Entanglement
We present an explicit construction of a universal embezzlement protocol in the C*-algebraic model of quantum information, that is equivalent to the commuting operator model. Our protocol enables exact embezzlement of arbitrary bipartite pure states using a single, fixed catalyst state. Unlike prior constructions that achieve only approximate embezzlement or require state-dependent catalysts, our approach is both exact and state-independent. The construction is explicit, based on simple *-autom…

contact: Haggle human proximity network (2006)
A network of human proximities, as measured by carried wireless devices. Each node represents a person, and an edge denotes when two people were within a certain proximity of each other, as measured by a wireless protocol (Bluetooth or Wifi). The edges are timestamped.
This network has 274 nodes and 28244 edges.
Tags: Social, Offline, Unweighted, Timestamps

The Model Context Protocol acts as a universal translator between LLMs and data sources, eliminating complex platform-specific requirements. Our new open source MCP server for ODBC (mcp-odbc-server) enables seamless integration of any ODBC-accessible data into RAG pipelines.
Read more in my latest newsletter!

What's The Model Context Protocol & Why Is It Important?
The way Large Language Models (LLMs) interact with the vast world of data sources and APIs (Application Programming Interface) is undergoing a significant transformation, thanks to the emergence of the Model Context Protocol (MCP). MCP servers act as a crucial middleware layer, a kind of "universal

This https://arxiv.org/abs/2503.12177 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNI_…

Open Wireless Digital Twin: End-to-End 5G Mobility Emulation in O-RAN Framework
This paper presents an end-to-end wireless digital twin platform constructed using open-source software and open data to enhance the evaluation of mobile communication systems. The proposed open wireless digital twin (OWDT) integrates OpenAirInterface (OAI) for 5G NR protocol stack emulation and NVIDIA Sionna RT for high-resolution ray tracing based radio propagation modeling. This integration enables realistic emulation of vehicular mobility scenarios, leveraging real-world geographic and buil…

MULTISS: un protocole de stockage confidentiel {\`a} long terme sur plusieurs r{\'e}seaux QKD
Thomas Pr\'evost (I3S), Olivier Alibart (INPHYNI), Marc Kaplan, Anne Marin
https://arxiv.org/abs/2506.04800

MULTISS: un protocole de stockage confidentiel {à} long terme sur plusieurs r{é}seaux QKD
This paper presents MULTISS, a new protocol for long-term storage distributed across multiple Quantum Key Distribution (QKD) networks. This protocol is an extension of LINCOS, a secure storage protocol that uses Shamir secret sharing for secret storage on a single QKD network. Our protocol uses hierarchical secret sharing to distribute a secret across multiple QKD networks while ensuring perfect security. Our protocol further allows for sharing updates without having to reconstruct the entire s…

Network Hexagons Under Attack: Secure Crowdsourcing of Geo-Referenced Data
Okemawo Obadofin, Joao Barros
https://arxiv.org/abs/2506.05601 https://

Network Hexagons Under Attack: Secure Crowdsourcing of Geo-Referenced Data
A critical requirement for modern-day Intelligent Transportation Systems (ITS) is the ability to collect geo-referenced data from connected vehicles and mobile devices in a safe, secure and anonymous way. The Nexagon protocol, which builds on the IETF Locator/ID Separation Protocol (LISP) and the Hierarchical Hexagonal Clustering (H3) geo-spatial indexing system, offers a promising framework for dynamic, privacy-preserving data aggregation. Seeking to address the critical security and privacy v…

Experimental Verification of Entangled States in the Adversarial Scenario
Wen-Hao Zhang, Zihao Li, Gong-Chu Li, Xu-Song Hong, Huangjun Zhu, Geng Chen, Chuan-Feng Li, Guang-Can Guo
https://arxiv.org/abs/2506.10655

Experimental Verification of Entangled States in the Adversarial Scenario
Efficient verification of entangled states is crucial to many applications in quantum information processing. However, the effectiveness of standard quantum state verification (QSV) is based on the condition of independent and identical distribution (IID), which impedes its applications in many practical scenarios. Here we demonstrate a defensive QSV protocol, which is effective in all kinds of non-IID scenarios, including the extremely challenging adversarial scenario. To this end, we build a …

An LLM Agent for Functional Bug Detection in Network Protocols
Mingwei Zheng, Chengpeng Wang, Xuwei Liu, Jinyao Guo, Shiwei Feng, Xiangyu Zhang
https://arxiv.org/abs/2506.00714

An LLM Agent for Functional Bug Detection in Network Protocols
Functional correctness is critical for ensuring the reliability and security of network protocol implementations. Functional bugs, instances where implementations diverge from behaviors specified in RFC documents, can lead to severe consequences, including faulty routing, authentication bypasses, and service disruptions. Detecting these bugs requires deep semantic analysis across specification documents and source code, a task beyond the capabilities of traditional static analysis tools. This p…

A Reinforcement Learning-Based Telematic Routing Protocol for the Internet of Underwater Things
Mohammadhossein Homaei, Mehran Tarif, Agustin Di Bartolo, Oscar Mogollon Gutierrez, Mar Avila
https://arxiv.org/abs/2506.00133

A Reinforcement Learning-Based Telematic Routing Protocol for the Internet of Underwater Things
The Internet of Underwater Things (IoUT) faces major challenges such as low bandwidth, high latency, mobility, and limited energy resources. Traditional routing protocols like RPL, which were designed for land-based networks, do not perform well in these underwater conditions. This paper introduces RL-RPL-UA, a new routing protocol that uses reinforcement learning to improve performance in underwater environments. Each node includes a lightweight RL agent that selects the best parent node based…

Beyond the Protocol: Unveiling Attack Vectors in the Model Context Protocol Ecosystem
Hao Song, Yiming Shen, Wenxuan Luo, Leixin Guo, Ting Chen, Jiashui Wang, Beibei Li, Xiaosong Zhang, Jiachi Chen
https://arxiv.org/abs/2506.02040

Beyond the Protocol: Unveiling Attack Vectors in the Model Context Protocol Ecosystem
The Model Context Protocol (MCP) is an emerging standard designed to enable seamless interaction between Large Language Model (LLM) applications and external tools or resources. Within a short period, thousands of MCP services have already been developed and deployed. However, the client-server integration architecture inherent in MCP may expand the attack surface against LLM Agent systems, introducing new vulnerabilities that allow attackers to exploit by designing malicious MCP servers. In th…

fediverse: Fediverse network (2018)
An early snapshot of the federation network among web publishers using the ActivityPub protocol. Nodes are instances, and a directed edge exists if an instance follows another instance.
This network has 4860 nodes and 484164 edges.
Tags: Social, Online, Information
https://ne…

Optical tweezer-controlled entanglement gates with trapped ion qubits
David Schwerdt, Lee Peleg, Gal Dekel, Lekshmi Rajagopal, Oz Matoki, Avram Gross, Yotam Shapira, Nitzan Akerman, Roee Ozeri
https://arxiv.org/abs/2506.08565

Optical tweezer-controlled entanglement gates with trapped ion qubits
We propose an entanglement protocol where ions illuminated by optical tweezers serve as control qubits. We experimentally demonstrate this proposal with a controlled M$ø$lmer-S$ø$rensen operation on a three-ion chain, analogous to the canonical Toffoli gate. Our demonstration features cases in which the control qubit was in one of its logical basis states, and not in their superposition, due to dephasing by tweezer beam intensity fluctuations. Finally, we discuss how our protocol generalizes …

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
Yuichi Sudo
https://arxiv.org/abs/2505.23649 …

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
We study the self-stabilizing leader election (SS-LE) problem in the population protocol model, assuming exact knowledge of the population size $n$. Burman, Chen, Chen, Doty, Nowak, Severson, and Xu (PODC 2021) showed that this problem can be solved in $O(n)$ expected time with $O(n)$ states. Recently, Gąsieniec, Grodzicki, and Stachowiak (PODC 2025) proved that $n+O(\log n)$ states suffice to achieve $O(n \log n)$ time both in expectation and with high probability (w.h.p.). If substantially m…

BEAR: BGP Event Analysis and Reporting
Hanqing Li, Melania Fedeli, Vinay Kolar, Diego Klabjan
https://arxiv.org/abs/2506.04514 https://

BEAR: BGP Event Analysis and Reporting
The Internet comprises of interconnected, independently managed Autonomous Systems (AS) that rely on the Border Gateway Protocol (BGP) for inter-domain routing. BGP anomalies--such as route leaks and hijacks--can divert traffic through unauthorized or inefficient paths, jeopardizing network reliability and security. Although existing rule-based and machine learning methods can detect these anomalies using structured metrics, they still require experts with in-depth BGP knowledge of, for example…

This https://arxiv.org/abs/2506.03940 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

Depermissioning Web3: a Permissionless Accountable RPC Protocol for Blockchain Networks
In blockchain networks, so-called "full nodes" serve data to and relay transactions from clients through an RPC interface. This serving layer enables integration of "Web3" data, stored on blockchains, with "Web2" mobile or web applications that cannot directly participate as peers in a blockchain network. In practice, the serving layer is dominated by a small number of centralized services ("node providers") that offer permissioned access to RPC endpoints. Clients register with these providers …

Quantum secret sharing in a triangular superconducting quantum network
Haoxiong Yan, Allen Zang, Joel Grebel, Xuntao Wu, Ming-Han Chou, Gustav Andersson, Christopher R. Conner, Yash J. Joshi, Shiheng Li, Jacob M. Miller, Rhys G. Povey, Hong Qiao, Eric Chitambar, Andrew N. Cleland
https://arxiv.org/abs/2506.10878

Quantum secret sharing in a triangular superconducting quantum network
We present a three-node quantum communication testbed with a triangular topology, each side of the triangle formed by a 1.3-meter-long transmission line. We demonstrate state transfer and entanglement generation between any two nodes, generate genuine multipartite entangled GHZ states, and implement quantum secret sharing (QSS) of classical information. Our experiments show that the QSS protocol can effectively detect eavesdropping, ensuring the secure sharing of secrets. This device forms a te…

This https://arxiv.org/abs/2506.02040 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

Beyond the Protocol: Unveiling Attack Vectors in the Model Context Protocol Ecosystem
The Model Context Protocol (MCP) is an emerging standard designed to enable seamless interaction between Large Language Model (LLM) applications and external tools or resources. Within a short period, thousands of MCP services have already been developed and deployed. However, the client-server integration architecture inherent in MCP may expand the attack surface against LLM Agent systems, introducing new vulnerabilities that allow attackers to exploit by designing malicious MCP servers. In th…

Fault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates
Josias Old, Stephan Tasler, Michael J. Hartmann, Markus M\"uller
https://arxiv.org/abs/2506.09029

Fault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates
Quantum error correction (QEC) is considered a deciding component in enabling practical quantum computing. Stabilizer codes, and in particular topological surface codes, are promising candidates for implementing QEC by redundantly encoding quantum information. While it is widely believed that a strictly fault-tolerant protocol can only be implemented using single- and two-qubit gates, several quantum computing platforms, based on trapped ions, neutral atoms and also superconducting qubits suppo…

Next Generation Authentication for Data Spaces: An Authentication Flow Based On Grant Negotiation And Authorization Protocol For Verifiable Presentations (GNAP4VP)
Rodrigo Men\'endez, Andres Munoz-Arcentales, Joaqu\'in Salvach\'ua, Carlos Aparicio, Irene Plaza, Gabriel Huecas
https://arxiv.org/abs/2505.24698

Next Generation Authentication for Data Spaces: An Authentication Flow Based On Grant Negotiation And Authorization Protocol For Verifiable Presentations (GNAP4VP)
Identity verification in Data Spaces is a fundamental aspect of ensuring security and privacy in digital environments. This paper presents an identity verification protocol tailored for shared data environments within Data Spaces. This protocol extends the Grant Negotiation and Authorization Protocol (GNAP) and integrates OpenID Connect for Verifiable Presentations (OIDC4VP) along with support for Linked Verifiable Presentations (LVP), providing a robust foundation for secure and privacy-preser…

Random Exclusion Codes: Quantum Advantages of Single-Shot Communication
Joonwoo Bae, Kieran Flatt, Teiko Heinosaari, Oskari Kerppo, Karthik Mohan, Andr\'es Mu\~noz-Moller, Ashutosh Rai
https://arxiv.org/abs/2506.07701

Random Exclusion Codes: Quantum Advantages of Single-Shot Communication
Identifying information tasks that offer advantages over their classical counterparts by exploiting quantum resources finds the usefulness of quantum information technologies. In this work, we introduce a two-party communication primitive, Random Exclusion Code (REC), which is a single-shot prepare-and-measure protocol where a sender encodes a random message into a shorter sequence and a receiver attempts to exclude a randomly chosen letter in the original message. We present quantum advantages…

Ancilla measurement-based Quantum Otto engine using double-pair spin architecture
S R Rathnakaran, Asoka Biswas
https://arxiv.org/abs/2506.05948 https://…

Ancilla measurement-based Quantum Otto engine using double-pair spin architecture
We present a quantum heat engine model utilizing a dual spin-pair architecture, wherein an Otto-like cycle is implemented using a single heat bath. The conventional cold bath is replaced by a measurement protocol, enabling engine operation without the need for a second thermal reservoir. Unlike standard quantum heat engines, our framework employs an ancillary spin pair in a two-dimensional configuration to regulate performance. Operating in finite time, the engine attains finite power, which is…

This https://arxiv.org/abs/2305.03748 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Certifying the activation of Bell nonlocality with finite data
The activation of Bell nonlocality is a protocol that enables the violation of a Bell inequality from a system that initially did not allow for any such violation because the state of the system was Bell-local. This activation of hidden Bell nonlocality has been demonstrated in experiments; however, while the certification of Bell nonlocality is conceptional straightforward, a statistically rigorous verification that the initial state is Bell-local has not yet been achieved. This is due to two …

This https://arxiv.org/abs/2207.06611 has been replaced.
link: https://scholar.google.com/scholar?q=a

Suppression of spin bath and low-frequency noise for sub-MHz AC magnetometry based on double-dressed spin qubit in diamond
We experimentally demonstrate a protocol that effectively suppresses the qubit-bath interaction in diamond and enables detection of weak AC signals (below 1 MHz) with enhanced signal-to-noise ratio (SNR) up to SNR = 17. The method is based on AC magnetometry with single- and double-dressed states that are adiabatically transferred from the initial qubit states using concatenated continuous dynamical decoupling. This work paves a way toward sensitive detection of weakly coupled nuclear spins in …

This https://arxiv.org/abs/2405.15089 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

Targeted Nakamoto: A Bitcoin Protocol to Balance Network Security and Energy Consumption
In a Proof-of-Work blockchain such as Bitcoin mining hashrate is increasing in the block reward. An increase in hashrate reduces network vulnerability to attack (a reduction in security cost) while increasing carbon emissions and electricity cost (an increase in externalities cost). This implies a tradeoff in total cost at different levels of hashrate and the existence of a hashrate interval where total cost is minimized. Targeted Nakamoto is a Proof-of-Work protocol augmentation that incentivi…

Looking for Attention: Randomized Attention Test Design for Validator Monitoring in Optimistic Rollups
Suhyeon Lee
https://arxiv.org/abs/2505.24393 https:/…

Looking for Attention: Randomized Attention Test Design for Validator Monitoring in Optimistic Rollups
Optimistic Rollups (ORUs) significantly enhance blockchain scalability but inherently suffer from the verifier's dilemma, particularly concerning validator attentiveness. Current systems lack mechanisms to proactively ensure validators are diligently monitoring L2 state transitions, creating a vulnerability where fraudulent states could be finalized. This paper introduces the Randomized Attention Test (RAT), a novel L1-based protocol designed to probabilistically challenge validators in ORUs, t…

This https://arxiv.org/abs/2409.07138 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

Contiguous Zero-Copy for Encrypted Transport Protocols
We propose in this paper to revisit the design of existing encrypted transport protocols to improve their efficiency. We call the methodology "Reverso" from reversing the order of field elements within a protocol specification. We detail how such a benign-looking change within the specifications may unlock implementation optimizations for encrypted protocols during data transport. To demonstrate our findings, we release quiceh, a QUIC implementation of QUIC VReverso, an extension of the QUIC V1…

A double selection entanglement distillation-based state estimator
Joshua Carlo A. Casapao, Ananda G. Maity, Naphan Benchasattabuse, Michal Hajdu\v{s}ek, Akihito Soeda, Rodney Van Meter, David Elkouss
https://arxiv.org/abs/2505.24280

A double selection entanglement distillation-based state estimator
With the advent of practical quantum communication networks drawing closer, there is a growing need for reliable estimation protocols that can efficiently characterize quantum resources with minimum resource overhead requirement. A novel approach to this problem is to integrate an estimator into an existing network task, thereby removing the need for an additional characterization protocol. In this work, we show that the measurement statistics of a double selection distillation protocol alone c…

This https://arxiv.org/abs/2405.12042 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCR_…

Attribute-Based Authentication in Secure Group Messaging for Distributed Environments
Messaging Layer security (MLS) and its underlying Continuous Group Key Agreement (CGKA) protocol allows a group of users to share a cryptographic secret in a dynamic manner, such that the secret is modified in member insertions and deletions. Although this flexibility makes MLS ideal for implementations in distributed environments, a number of issues need to be overcome. Particularly, the use of digital certificates for authentication in a group goes against the group members' privacy. In this …

Bayesian and Markovian classical feedforward for discriminating amplitude damping channels
Milajiguli Rexiti, Stefano Mancini
https://arxiv.org/abs/2506.01851

Bayesian and Markovian classical feedforward for discriminating amplitude damping channels
We address the issue of multishot discrimination between two qubit-amplitude damping channels by invoking a simple adaptive protocol that employs Helstrom measurement at each step and classical information feedforward. We contrast the performance of Bayesian and Markovian strategies. We show that the former is only slightly advantageous for a limited parameters' region.

Electro-optic sampling of the electric-field operator for ultrabroadband pulses of Gaussian quantum light
Geehyun Yang, Sandeep Sharma, Andrey S. Moskalenko
https://arxiv.org/abs/2506.01730

Electro-optic sampling of the electric-field operator for ultrabroadband pulses of Gaussian quantum light
Quantum light pulses (QLPs) can be described by spatio-temporal modes, each of which is associated with a quantum state. In the mid-infrared spectral range, electro-optic sampling (EOS) provides a means to characterize quantum fluctuations in the electric field of such light pulses. Here, we present a protocol based on the two-port EOS technique that enables the complete characterization of multimode Gaussian quantum light, demonstrating robustness to both the shot noise and cascading effects. …

This https://arxiv.org/abs/2505.23581 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

Quantum Hilbert Transform
The Hilbert transform has been one of the foundational transforms in signal processing, finding it's way into multiple disciplines from cryptography to biomedical sciences. However, there does not exist any quantum analogue for the Hilbert transform. In this work, we introduce a formulation for the quantum Hilbert transform (QHT)and apply it to a quantum steganography protocol. By bridging classical phase-shift techniques with quantum operations, QHT opens new pathways in quantum signal process…

This https://arxiv.org/abs/2408.02383 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_qu…

A Novel Stabilizer-based Entanglement Distillation Protocol for Qudits
Entanglement distillation, the process of converting weakly entangled states into maximally entangled ones using Local Operations and Classical Communication (LOCC), is pivotal for robust entanglement-assisted quantum information processing in error-prone environments. A construction based on stabilizer codes offers an effective method for designing such protocols. By analytically investigating the effective action of stabilizer protocols for systems of prime dimension $d$, we establish a stand…