Search arXiv⌕ Search

arXiv subjects

Qin Wang

Publications and source records attributed to Qin Wang.

At least 19 recordsLinked to original sources

Your Model Is Leaking: Covert Information Transfer through LLM Residual Streams

Privacy-sensitive organizations may run large language models (LLMs) in restricted or air-gapped environments while exporting selected diagnostic artifacts. We show that a compromised runtime component can hide sensitive information in intermediate activations that are allowed to leave the restricted environment. An offline observer can recover this information with a simple linear decoder. The attack requires no model retraining or weight modification, no attacker-controlled egress, and no control over the recorder or transfer process. We introduce a residual-stream covert-channel attack that maps messages to codewords and injects them into an intermediate residual stream through a compromised runtime hook. To maintain recoverability, the injection strength is scaled with the local residual norm using the signal-to-residual-norm ratio. Across eleven models from seven architecture families, our evaluation shows 91--100% recovery on nine models with KL divergence 0.001--0.007, while evaluated activation-level detectors remain close to random guessing (AUC <= 0.56). Tested post-hoc defenses do not reliably eliminate the channel. Thus, an activation artifact can be schema-valid while carrying information that is not authorized to cross the boundary.

cs.CR↗

The Coarse Novikov Conjecture for Finite Products of Fibred Coarsely Embeddable Spaces

In this paper, we prove that the coarse Novikov conjecture holds for finite products of bounded-geometry proper metric spaces whose factors admit fibred coarse embeddings into possibly different target spaces. A key ingredient is the construction of suitable coarsely proper algebras adapted to product spaces. Our other main tool is an iterated approach to relative higher index theory. By constructing the corresponding multi-stage Roe algebras and index maps, we establish a reduction theorem that bridges these iterated relative statements with the global coarse Novikov conjecture.

math.OA↗

SkelOT: Reusing AOT Compilation Across EVM Contract Families

Ahead-of-time (AOT) compilers (e.g., revmc, evmone, and DTVM) for the Ethereum Virtual Machine (EVM) reuse compilation artifacts at contract-code-hash granularity. This granularity is poorly matched to real EVM workloads dominated by \emph{contract families}: factory-, proxy-, and template-driven deployments that share instruction structure but differ in a small set of embedded constants. Across four EVM chains (Base, Ethereum, BSC, and Arbitrum), we find that 23.1--47.6\% of unique compilable bytecodes map to shared family skeletons within 10K-block windows. Per-hash AOT therefore redundantly recompiles structurally equivalent code, inflating compile time and artifact footprint while reducing workload coverage under finite compile budgets. We present \textsc{SkelOT}, an AOT framework that lifts the unit of compilation reuse from code hash to family skeleton. \textsc{SkelOT} compiles one native artifact per family, bakes invariant constants into the artifact, and reads variant constants from a per-contract runtime table. Built on revmc/LLVM and evaluated on a 10K-block Base mainnet corpus (3.52M transactions), \textsc{SkelOT} reduces compilation units by 47.5\%, artifact footprint by 57.4\%, and compile time by $2.19\times$, while preserving byte-identical execution outcomes versus per-hash AOT. At runtime, \textsc{SkelOT} delivers a $1.31\times$ median per-contract speedup across family members. Under a compile budget targeting 75\% execution-time coverage, \textsc{SkelOT} needs far fewer artifacts than per-hash AOT, and the advantage holds at every coverage target.

cs.CR↗

MixGuard: Towards Detecting and Understanding Mixer Laundering on Ethereum

Mixers protect privacy by concealing deposit--withdrawal links, but are also abused to launder illicit funds. Existing anti-money laundering studies do not specifically target mixer laundering, while mixer research focuses on deanonymization rather than identifying laundering-related transactions. Public reports remain fragmented, leaving no public case-level dataset for systematic measurement and detection. To fill this void, this paper presents the first comprehensive study of mixer laundering on Ethereum. We first construct \textsc{MixLaunder}, the first public case-level dataset of mixer laundering. It covers 27 cases involving Tornado Cash and Railgun from 2020 to 2025 and labels 9,300 laundering-related transactions with case identities and observable upstream and downstream fund flows, including deposits totaling approximately \$1.1 billion. By comparing these transactions with background mixer usage, we identify five common strategies, showing that laundering evidence spans complementary behavioral and fund-flow contexts, while same-case activity is locally tight but weakly connected across bursts. Our analysis further reveals coverage gaps in mixer-side risk screening and representative deanonymization heuristics. Guided by these findings, we develop \textsc{MixGuard}, which combines tri-view representation learning with two-stage grouping for transaction-level detection and case-aware grouping. Under strict case-level holdout evaluation, \textsc{MixGuard} outperforms representative baselines, achieving 97.89\% detection precision and 98.73\% group purity, while its top ten groups cover 95.09\% of each case's transactions on average.

cs.CR↗

K-Bench: A Benchmark for LLM Unlearning in Agentic Deployments

Unlearning benchmarks such as TOFU and MUSE certify forgetting by reading the model's final answer, where a model that refuses to answer already counts as having forgotten. We show that this model-level certificate does not transfer once the model is deployed as an agent. We introduce K-Bench, a benchmark that scores LLM unlearning under agentic deployment. K-Bench inspects all six channels a ReAct agent exposes, including its chain-of-thought (CoT), tool calls and tool observations, and elicited summary. A query counts as leaked if the secret appears in any of them. Each experiment places the secret in exactly one of the agent's three sources (the weights, the prompt, or the retrieval store). The K-Score is computed separately for each source and credits forgetting only when the agent remains usable. Clearing the answer channel does not make the secret unrecoverable. On structured retrieval, the secret stays verbatim in the tool-observation channel and the aggregate leak rate is unchanged. When the secret lives in the prompt or the retrieval store, TOFU and MUSE report no leakage, while the deployed agent still leaks it on 22--86\% of queries. When the secret is in the weights, none of the twenty evaluated published methods demonstrably removes it, and only an input-corruption intervention reaches selective forgetting under the evaluated observer. The top-ranked method changes across base models. A refusal-tuning method resists the evaluated extraction without verified knowledge removal.

cs.AI↗

DAO to (Anonymous) DAO Transactions

Blockchain assets are increasingly controlled by organizations rather than individuals. DAO treasuries, consortium wallets, and custodial exchanges rely on threshold authorization and multi-party key management, yet existing payment mechanisms still target single-user wallets, leaving no unified solution for organizational transfers. We formalize the problem of \emph{DAO-to-(anonymous)-DAO} transactions and present \textsc{Dao$^2$}, a framework that enables one threshold-controlled organization to pay another, optionally with recipient anonymity, while keeping received funds under distributed control. \textsc{Dao$^2$} combines three components: \emph{distributed key derivation} (DKD) for non-stealth child addresses, \emph{distributed stealth-address generation} (DSAG) for unlinkable one-time destinations, and \qw{\emph{threshold ECDSA}} for authorization. For ordinary transfers, the receiver derives a non-stealth address via DKD; for anonymous transfers, it derives a stealth address via DSAG. The sender then threshold-signs the payment, and the receiver redeems the funds without reconstructing any master secret. We formally prove its security and evaluate a prototype. The core of an anonymous DAO-to-DAO transaction for a typical-sized (e.g., 7-member) DAO finishes in under 28\,ms with about 2.8\,KB of communication, and scales linearly with DAO size.

cs.CR↗

Are Unreachable Nodes Truly Safe? Fully Eclipsing Monero's P2P Network!

Eclipse attacks isolate a blockchain node by monopolizing its network connections. Existing attacks on Monero (NDSS'25), Bitcoin (USENIX'15/21, S&P'20) and Ethereum (WWW'26) implicitly assume that the adversary can establish inbound connections, thereby excluding a large and practically dominant class of nodes: \textit{unreachable nodes} operating behind NATs. Such nodes are widely believed to enjoy stronger networks. We challenge this assumption and show that unreachability does NOT imply the expected resilience! We present the first eclipse attacks tailored to unreachable nodes in Monero's P2P network. Our attacks require no inbound access to the victim. Instead, they first poison the peerlist of reachable nodes, which subsequently act as propagation relays to contaminate unreachable nodes' whitelists. The adversary then exploits Monero's built-in outbound connection refresh logic to evict benign neighbors and eventually monopolize all outbound connections. We instantiate this strategy in two attacks: Nyx, which targets long-running unreachable nodes and achieves a complete and persistent eclipse through network-wide poisoning; and Moros, a stealthier attack that exploits the bootstrapping phase to rapidly eclipse newly joined unreachable nodes. We ethically evaluate both attacks. Nyx is validated via large-scale simulations on a Monero network constructed using the SEED Emulator, while Moros is demonstrated on the Monero mainnet against controlled targets. Our results show that unreachable nodes can be reliably driven into stable, long-lived eclipse states. We also propose countermeasures.

cs.CR↗

FlowShield: cryptocurrency anti-money laundering with transaction semantics parsing and fund flow tracking

Cryptocurrency anti-money laundering (Crypto AML) is increasingly challenged by sophisticated laundering behaviors that rapidly fragment stolen assets through diverse semantics and across multiple blockchains. Existing Crypto AML methods often simplify transaction semantics, rely on topology-centric signals, or output isolated detection labels. In this paper, we present \textsc{FlowShield}, a Crypto AML framework for transaction-level laundering detection and investigator-facing report generation. \textsc{FlowShield} first recovers behavior-level semantics from observable relations, making laundering intents explicit. To trace value provenance and redistribution, \textsc{FlowShield} reconstructs fund-flow subgraphs from three complementary perspectives. It then employs a text--structure fusion mechanism, enabling the interplay between large language model (LLM)-encoded semantics and flow texts with graph convolutional network (GCN)-encoded structure. Beyond mere detection, \textsc{FlowShield} further generates readable suspicious activity reports (SARs), offering investigators concise summaries and explainable red flags. To address the data scarcity in multi-chain detection, we construct and open-source \textit{BybitML}, the first public multi-chain laundering dataset. We evaluate \textsc{FlowShield} on \textit{BybitML} and two public laundering datasets and experimental results demonstrate that \textsc{FlowShield} achieves the best overall performance, with an average F1 score of 98.0\%. Further behavior and SAR analyses demonstrate that \textsc{FlowShield} can reveal diverse laundering strategies and produce readable reports for investigating complex multi-hop fund flows.

cs.CR↗

SoK: Cross-Chain Transaction Identification and Matching

Cross-chain bridges, instant cryptocurrency exchanges, and centralized cross-ledger platforms move assets across an increasingly multi-chain ecosystem. However, these systems have repeatedly become targets of high-value attacks and channels for cross-chain money laundering. Cross-chain transactions are substantially harder to analyze than single-chain transactions: no single ledger records an entire cross-chain transfer, its evidence is scattered across the source chain, the destination chain, and off-chain systems, and the availability and reliability of that evidence vary widely across systems. In this paper, we present a systematization of knowledge (SoK) on cross-chain transaction identification and matching. First, we classify deposit and withdrawal identification methods into four approaches and transaction matching methods into three mechanisms: deterministic identifier matching, field-constraint heuristics, and model-assisted matching. We find that their applicability and reported performance are shaped mainly by the evidence the underlying system exposes, and we further examine how matched pairs support downstream attack detection and fund tracing. Second, we assess the availability of existing datasets and artifacts, finding that fewer than half remain obtainable, and distill three artifact failure modes. Finally, we outline four open challenges toward auditable, reproducible, and actionable cross-chain analysis.

cs.CR↗

Some Dwork-type $q$-supercongruences from a $_6ϕ_5$ summation formula

With the help of a $_6ϕ_5$ summation formula and Guo and Zudilin's method, we shall establish some Dwork-type $q$-supercongruences in this paper. When $q\to1$, these $q$-supercongruences are able to engender the corresponding supercongruences. One of them may be stated as follows: for any prime $p\geq5$ and any positive integer $s$, \begin{align*} &\sum_{k=0}^{p^s-1}(6k-1)\frac{(-\frac{1}{3})_k^3}{(1)_k^3} \equiv 0\pmod{p^{3s}}. \end{align*}

math.NT↗

Growth and characterization of GaN/Ga2O3 Nanowire Heterostructures for Ultraviolet Optoelectronics

Ultraviolet-range GaN/b-Ga2O3 heterostructures were fabricated and investigated in both planar and nanowire geometries using pulsed laser deposition and reactive magnetron sputtering from a liquid gallium target for b-Ga2O3 deposition, while both GaN nanowire arrays and planar p-type Mg-doped GaN layers were grown by metal-organic chemical vapor deposition. Precise control of film uniformity and thickness was achieved as confirmed by structural and morphology studies using X-ray diffraction, X-ray photoelectron spectroscopy, atomic force microscopy and scanning electron microscopy. Planar n-Ga2O3/p-GaN heterojunction diodes were electrically and photoelectronically characterized, exhibiting pronounced rectifying behavior, high forward current and a visible-blind ultraviolet photoresponse under zero external bias, demonstrating intrinsic self-powered operation. Furthermore, GaN/b-Ga2O3 core/shell nanowire heterostructures were developed and systematically studied with a focus on morphology control and process optimization. The influence of deposition parameters on shell thickness, uniformity, and tapering was investigated, enabling improved conformality of the b-Ga2O3 coating on the M-plane facets of GaN nanowires. The results highlight the viability of physical vapor deposition techniques for forming GaN/b-Ga2O3 heterostructures and establish a pathway toward nanowire-based ultraviolet optoelectronic devices.

cond-mat.mtrl-sci↗

JUNO: Aggregated Vector Consensus for Optimal Asynchronous Common Subset

In this paper, we propose \textit{aggregated vector consensus}, a new vector consensus primitive designed for asynchronous networks. The primitive achieves agreement by outputting a vector of values aggregated from independent process inputs. We then introduce \textsc{Juno}, an asynchronous common subset (ACS) protocol that fully implements our aggregated vector consensus to attain optimal $\mathcal{O}(n^2)$ message complexity. We further implement and evaluate \textsc{Juno} in comparison with the legacy HoneyBadgerBFT and the state-of-the-art Dory. Experiment results demonstrate its efficacy and efficiency. Our protocol demonstrates an average throughput performance improvement of 93\% compared with HoneyBadgerBFT and a 47\% improvement compared with Dory. Notably, our study makes significant progress in addressing the gap in applying vector consensus protocol in fully asynchronous networks.

cs.CR↗

The impact of large-scale EV charging on the real-time operation of distribution systems: A comprehensive review

With the large-scale integration of electric vehicles (EVs) in the distribution grid, the unpredictable nature of EV charging introduces considerable uncertainties to the grid's real-time operations. This can exacerbate load fluctuations, compromise power quality, and pose risks to the grid's stability and security. However, due to their dual role as controllable loads and energy storage devices, EVs have the potential to mitigate these fluctuations, balance the variability of renewable energy sources, and provide ancillary services that support grid stability. By leveraging the bidirectional flow of information and energy in smart grids, the adverse effects of EV charging can be minimized and even converted into beneficial outcomes through effective real-time management strategies. This paper explores the negative impacts of EV charging on the distribution system's real-time operations and outlines methods to transform these challenges into positive contributions. Additionally, it provides an in-depth analysis of the real-time management system for EV charging, focusing on state estimation and management strategies.

eess.SY↗

Can Trustless Agents Be Trusted? An Empirical Study of the ERC-8004 Decentralized AI Agent Ecosystem

As autonomous AI agents increasingly transact across organizational boundaries, a fundamental trust challenge emerges: how can an agent assess whether an unknown counterpart is trustworthy? The ERC-8004 protocol addresses this challenge with the first permissionless trust layer for AI agent economies, built around three on-chain registries for Identity, Reputation, and Validation. Despite its rapid adoption, the protocol has not been studied empirically, leaving it unclear whether the information it records provides a trustworthy basis for decision-making. To address this gap, we present the first empirical study of ERC-8004 across three chains: Ethereum, BNB Smart Chain (BSC), and Base, covering the period from protocol deployment through May 13, 2026. We crawl on-chain Identity and Reputation events, off-chain files, and x402 payment transactions. On the identity side, we find that most registrations are placeholders rather than active agents, with only a small fraction (3%, 4%, and 15% across Ethereum, BSC, and Base) exposing a valid ERC-8004 registration file with at least one live service endpoint. On the reputation side, we show that the Registry, as currently deployed, cannot function as a trust signal: values are not commensurable, feedback records are rarely grounded in verifiable interactions, and reputation can be manipulated at minimal cost. Consistent with these design weaknesses, we find that a substantial fraction of reviewers (73.5%, 59.2%, and 90.6% across Ethereum, BSC, and Base) exhibit coordinated Sybil behavior. After removing Sybil-flagged feedback, 15.8%, 77.9%, and 86.8% of rated agents, respectively, are left with no valid feedback. We then turn these findings into concrete recommendations for future revisions of ERC-8004. Our study yields actionable protocol-design implications and establishes an empirical baseline for research on AI agent markets.

cs.CR↗

Deanonymizing Monero Transactions in Tor Network

Monero is a privacy-focused cryptocurrency that deploys the Dandelion++ protocol and incorporates anonymity networks (such as Tor and I2P) to prevent malicious attackers from linking transactions with their source IPs. In this paper, we demonstrate that Monero's integration of the Tor network introduces a fundamental vulnerability: a Monero Tor node's originated transactions are exclusively forwarded to two outgoing Tor hidden service nodes (proxy nodes) prior to clearnet propagation, enabling an adversary to capture originated transactions by occupying the target node's outgoing connections. Based on this observation, we propose \textit{ProxyMark}, a three-stage deanonymization framework for the Monero Tor network, comprising node role identification, originated transaction identification, and node location deanonymization. Through experiments on the live Tor network, Monero mainnet, and testnet, we empirically demonstrate the effectiveness of \textit{ProxyMark} in successfully deanonymizing transactions originating from Monero nodes over Tor.

cs.CR↗

Supercritical fluid of quantum electrons in three-dimensional superconducting fullerides

The supercritical fluid (SCF) of quantum electrons at the Mott metal-insulator transition without symmetry breaking is one of the most elusive phenomena in strongly correlated electron physics. Prior studies of Cr-doped V2O3 and organic Mott systems reported discrepant critical exponents. A key limitation is that the scaling analysis relies on a single experimental observable, leaving the roles of phase coexistence, inhomogeneity, and percolation unaddressed. Here we report the first experimental identification of a thermodynamically equilibrated SCF phase and its associated Mott endpoint in the three-dimensional superconducting fullerides CsxRb3-xC60, using two independent probes of electrical conductivity and magnetic susceptibility, which reveal two distinct metal-insulator transition lines converging at a single Mott endpoint. A hypothesis-free two-particle analysis of magnetic susceptibilities yields a metal-insulator coexisting SCF by exhibiting the maximum two-phase mixing entropy, in agreement with a picture of a thermodynamically equilibrated Widom line. Simultaneously, conductivity scaling yields a critical exponent in the regime of quantum critical predictions. Our new dual-probe approach provides a unified microscopic picture of the Mott SCF with a characteristic length scale below current diffraction resolution, in addition to a new interpretation on the origin of superconducting Tc-dome.

cond-mat.str-el↗

Gromov-Hausdorff Convergence of Spectral Truncations for Quantum Groups

We study the quantum Gromov-Hausdorff convergence of spectral truncations for compact quantum groups. Using a proper length function, we define a Dirac operator and the associated spectral truncations. This work extends the previous convergence results for tori (Leimbach-van Suijlekom) to a broad class of quantum groups, and provides Gromov-Hausdorff convergence result for spectral truncations on quantum groups, encompassing both compact and discrete quantum groups. Our results are applicable to $SU(N)$,$SO(N)$ and discrete quantum groups with rapid decay.

math.OA↗

Spectral Invariance and Gevrey Regularity for Groups with strongly subexponential growth

We study spectral invariance and Gevrey regularity for convolution operators with kernels in suitable weighted function spaces on locally compact groups equipped with a locally bounded length function $\ell$. The main analytic scale is given by the subexponential weights. For groups whose volume growth is bounded above by $e^{R^γ}$ for some $0<γ<1$, we establish spectral comparison result for compactly supported functions. For compactly supported Hermitian functions, we prove spectral radius invariance across the symmetric $q$-pseudofunction $*$-algebra, the weighted and unweighted group algebras, and the full and reduced group $C^*$-algebras. For unimodular groups satisfying strong subexponential growth of exponent at most $β$, we construct a Gevrey-Beurling operator algebra inside the unitized $q$-pseudofunction algebra. We prove that this algebra is inverse-closed and that its inclusion induces an isomorphism in topological $K$-theory. The inverse-closedness theorem may be viewed as a quantitative Gevrey-type noncommutative Wiener lemma. As an application, we show that whenever a convolution operators with kernels in the corresponding weighted Gevrey-Beurling space is invertible in the unitized $q$-pseudofunction algebra, then its inverse belongs to the same Gevrey-Beurling operator algebra and satisfies explicit Gevrey seminorm estimates. We also develop a relative theory for pairs of finitely generated groups using Schreier graph lengths and quasi-regular representations. This provides a subexponential analogue of rapid decay for group pairs, when subgroup is normal, it reduces to the usual theory on the quotient. The framework can apply to intermediate-growth examples, including the Grigorchuk group, and is stable under products with polynomial growth groups and under compact extensions.

math.OA↗