ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “Chainalysis”

35 stories

Searchkeywordsmart
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllRansomware 162Phishing & fraud 54Threat actor 45Vulnerability 35Policy & legal 31Malware 17Exploit / PoC 17Data breach 11Industry 5AI safety & security 1
SeverityAllcritical 109high 160medium 42low 67info 0

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

HypoEvolve: Genetic Algorithms Enable Multi-Agent LLMs to Discover Scientific Hypotheses

HypoEvolve couples a generational genetic algorithm with specialized LLM agents to generate drug-repurposing hypotheses, beating six baselines on DepMap selectivity (0.171 vs 0.115).

HypoEvolve coordinates specialized LLM agents through a generational genetic algorithm in which scientific judgments and new proposals reshape a hypothesis population. Evaluation centers on drug repurposing, linking mechanistic explanations to target-level biological claims assessed via external measures adapted from DepMap and Open Targets. Across 34 cancer types, HypoEvolve scores highest against six baselines on both measures, with DepMap selectivity of 0.171 versus 0.115 for the strongest baseline, and gains generalize to held-out cancer types.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research 2 sources1

How Does mHC Use Its Residual Streams? Selective Routing and Near-Identity Mixing

Analysis of DeepSeek-V4-Flash shows four-stream mHC residual blocks use only about two streams effectively, with late-layer mixing providing little benefit.

The study examines the four-stream residual pathway of DeepSeek-V4-Flash, finding typical attention or FFN sites effectively use about two streams and that residual mixing is modest, occurring primarily in early layers. Replacing late mixers with identity increases C4 perplexity by only 1.9% while replacing early mixers raises it by 41%. Retaining the three largest routing weights per token increases perplexity by at most 2.7%, showing the model uses only part of the flexibility afforded by the four-stream design.

arXiv cs.AI / cs.LG / cs.CL · 12d agoAI research

Meme Coin Factories: Uncovering Large-Scale Manipulations on pump.fun

Large-scale pump.fun study of 15 million meme coins identifies five manipulation classes including wash trading and a Market-Manipulation-as-a-Service ecosystem.

Researchers analyzed all 15 million coins launched on pump.fun over the last two years plus large random samples of transaction data, identifying five manipulation classes: wash trading, creator address obfuscation, coordinated sells, copycat coins, and social media manipulation. Strategic actors bypass the platform interface and implement strategies in a highly automated, low-latency way by interacting directly with the blockchain. The study also uncovers Market-Manipulation-as-a-Service (MMaaS) third-party tools that let non-technical users run these manipulations, and proposes mitigations for traders, pump.fun, and regulators.

arXiv cs.CR · 7d agoResearch

Attack Chains, Not Just Attack Surfaces: Why Testing Individual Techniques Misses the Point

Filigran introduces Attack Chaining in OpenAEV to continuously simulate multi-stage attack paths, exposing gaps that isolated MITRE ATT&CK technique testing misses.

Filigran announced Attack Chaining, a new scenario type in its OpenAEV platform that links individual techniques into automated, continuously-run multi-stage attack paths, using each step's real output (credentials, tokens, open ports) to branch dynamically toward a final objective. The article cites Filigran's State of Threat Management report, in which 93% of security leaders reported a business-impacting cyberattack in the past 12 months, 88% said AI accelerates attackers, and 84% blamed siloed tools and disconnected testing. The 2025 DGFiP breach is cited as an example where individually survivable weaknesses chained into a major intrusion. The feature includes conditional chaining logic, live attack path mapping, structured findings for identifying chokepoints, and predefined scope and safety guardrails.

The Hacker News · 1d agoTools

SafePal Hardware Wallet Maker Says Flaw Exposed Data of Nearly 40,000 Customers

SafePal disclosed an order-tracking plug-in authorization flaw exposing names, emails, addresses and purchase details of 39,798 hardware wallet customers; no wallet credentials affected.

Hardware wallet maker SafePal disclosed that an authorization flaw in an order-tracking plug-in exposed names, email addresses, shipping addresses, phone numbers and purchase details of approximately 39,798 customers. No seed phrases, private keys, wallet credentials or financial information were exposed, and SafePal found no evidence of wallet or fund compromise. A separate configuration error left a data-cleanup process broken between September 2025 and April 2026, extending the affected order window back to March 2025. A threat actor has advertised a matching dataset on a cybercrime forum, and the company has fixed the flaw, cut data retention to 90 days, purged affected records, engaged third-party validators and taken down over 30 phishing sites.

The Hacker News · 29d agoData breach in the wild

Heterogeneous Cross-Chain Transaction Tracing for Solana Bridges via Candidate-Set Selective Decision

SolTracer traces cross-chain transactions onto Solana bridges, improving open-world association F1 by 20.16% over the strongest baseline for illicit-fund tracing.

The paper formalizes four Solana-bound cross-chain transaction modes and proposes SolTracer, which maps heterogeneous execution semantics into a unified event space and uses candidate-set selective decision-making with abstention when valid targets are absent. In the challenging open-world setting with a 50% TA ratio, SolTracer improves F1 by 20.16% over the strongest baseline. An empirical study of real-world transfers examines count-value divergence across bridge mechanisms, cross-asset shifts, and decoupling between on-chain settlement and explorer visibility.

arXiv cs.CR · 6d agoResearch

Trezor customers hit with phishing calls and letters after shipping-partner breach

A breach at shipping partner ShipMonk exposed data for about 67,000 additional US Trezor customers, who now face phishing calls and QR scam letters.

SatoshiLabs, maker of Trezor hardware wallets, confirmed the August 2026 ShipMonk breach exposed names, emails, phone numbers, and shipping addresses for roughly 67,000 US customers who ordered between November 2019 and August 2021, on top of 3,889 customers affected initially. ShipMonk attributed the intrusion to attackers exploiting an SQLi zero-day in Metabase's Cloud SaaS platform and retained data past the 90-day deletion requirement. Trezor's own systems were not compromised; customers are reporting phishing calls and QR-code phishing delivered via physical letters.

Help Net Security · 8d agoData breach

PDoS: A Profitable Denial-of-Service Attack against Proof-of-Work Blockchain Liveness

PDoS attack disrupts Proof-of-Work blockchain liveness profitably by combining miner deterrence signals with parasitic revenue extraction from victim pools.

PDoS is a hybrid incentive-driven denial-of-service attack that combines block header signal deterrence with parasitic revenue extraction from a victim pool's share-reward mechanism. By subsidizing attack costs through the victim pool, it lowers the hash-power threshold required to induce rational miners to shut down, unlike prior attacks such as BDoS that demand sustained attacker losses. The authors show a counterintuitive result: in high-fee or high-MEV environments, higher block value increases the attacker's parasitic revenue and can push the attack past break-even into a self-sustaining or even profitable regime. PDoS is claimed as the first attack demonstrating that disrupting PoW blockchain liveness can be economically self-sustaining.

arXiv cs.CR · 6d agoResearch

Model-Aware Schedules Improve Generation via Fiberwise Optimal Transport

Researchers introduce model-aware diffusion schedules via fiberwise optimal transport, cutting flow-matching FID on CIFAR-10 by 38.6% at 16 function evaluations.

The paper proposes constructing diffusion and flow-matching sampling schedules from a fiberwise prediction risk defined via optimal transport, combined with coefficient-path kinetic action, yielding a closed-form time allocation. Across DDPM and flow-matching experiments spanning targets, datasets, and architectures, the schedules beat model-agnostic baselines, including a 38.6% relative FID reduction for flow matching on CIFAR-10 at 16 function evaluations. Normalized fiberwise-risk profiles from independently trained models align closely, suggesting empirical universality, and a frozen analytic allocation template retains most of the gains.

arXiv cs.AI / cs.LG / cs.CL · 6d agoAI research

Corrupt Plans, Clean Traces: Evading Chain-of-Thought Monitoring with Plan Injection

Plan injection plants benign-sounding harmful reasoning that steers LLM actors to adversarial actions while evading chain-of-thought monitors.

Researchers show that injecting harmful but benign-sounding plans into an actor model's context causes it to perform adversarial actions while its reasoning passes chain-of-thought monitors, achieving 25-33% monitor evasion rates across benchmarks and scaling to larger models like DeepSeek-R1. Actor models paraphrase injected plans as their own reasoning without attribution. Giving the monitor access to the injected plan dropped detection by up to 50% on the Bio-Math task, with extra thinking tokens spent rationalizing rather than flagging the plan.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI safety & security

DianShi-RxnDB: A Large-Scale, Fine-Grained Organic Reaction Data Platform Built via a Fully Automated Pipeline for Researchers and AI Agents

Researchers release DianShi-RxnDB, a database of roughly 24 million organic reaction instances extracted automatically from USPTO and EPO patents since 1976.

DianShi-RxnDB is built by a fully automated pipeline integrating patent text, images, and reaction schemes, yielding about 24 million reaction instances, of which 14.8 million (61.7%) pass automated qualification checks. Manual evaluation of 1,300 sampled instances showed 92.95% field-level accuracy, and comparisons with Pistachio found advantages in deduplicated record counts and granularity. The platform offers a web research workbench and a Model Context Protocol (MCP) service enabling AI agents to perform composable structured retrieval.

Hugging Face daily papers · 11d agoAI research

How Model Growth, Recursion, and Boundary Operators Influence Scaling Exponents

Researchers show model growth via looped transformers improves scaling exponents; a 7.4B architecture matches GPT-3 13B with roughly 20x less compute.

The paper shows that architectural interventions, contrary to conventional wisdom, can modify pre-training scaling exponents and yield exponential performance gains with compute. Looped transformers with increasing loop counts provide a model growth mechanism; a 7.4B model-growth architecture matches GPT-3 13B on CORE with roughly 20x less compute, with efficiency gains that increase with scale. A boundary operator that normalizes and injects an earlier block also improves compute efficiency, and in data-constrained multi-epoch settings increasing loops with scale is compute-optimal.

arXiv cs.AI / cs.LG / cs.CL · 12h agoAI research

Embedded Graph Flows for Categorical Graph Generation

Researchers propose Embedded Graph Flows, a generative model with learned categorical embeddings that beats DiGress and GruM on molecular graph benchmarks.

Embedded Graph Flows (EGF) learns continuous embeddings for node and unordered-edge categories and transports Gaussian noise toward these endpoints using a permutation-equivariant graph transformer. On QM9 it achieves the best result on all four reported metrics, with a Fréchet ChemNet Distance of 0.150 versus 0.717 for DiGress and 0.812 for GruM. On ZINC250k it retains the lowest NSPDK MMD, indicating close agreement with local substructures of reference molecules. Code is released on GitHub.

arXiv cs.AI / cs.LG / cs.CL · 12d agoAI research1

A Princeton Researcher Proposes Recurrent Looped Transformer (RLT) that Carries Decoder State across Every Token, Fixing 96 Blocks per Token with Unbounded Temporal Depth

Princeton researcher Yifan Zhang proposes Recurrent Looped Transformer, carrying full decoder state across every token for unbounded temporal depth.

Yifan Zhang's technical report defines the Recurrent Looped Transformer (RLT), pairing a causal encoder with a recurrent decoder whose final output and layerwise sliding-window attention cache carry into every subsequent token with no prompt-response boundary reset. The reference configuration ties 48 encoder and 48 decoder layers, executing 96 logical blocks per token while the state path grows to 48t blocks after t tokens at fixed per-token compute. The report details RL replay contracts that rebuild all states under current parameters and exact prefix snapshots for multi-turn serving, but explicitly reports no measured efficiency, reasoning quality, or scaling results.

MarkTechPost · 3d agoAI research1

Bridging Control, Inference, Transport, and Thermodynamics: From Theory to Applications in Learning

Review connects control theory, optimal transport, probabilistic inference, thermodynamics, and machine learning via free-energy optimization under constraints.

The review unifies five fields: control theory, optimal transport, probabilistic inference, non-equilibrium thermodynamics, and machine learning. The common conceptual thread is optimization of free-energy-like functionals under dynamical or statistical constraints. Selected applications are presented in reinforcement learning, variational inference, and generative modeling. The tutorial-style text assumes no prior familiarity and begins from physics principles.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

MicroHasTEE: Bare-Metal Haskell for Type-Level Peripheral Ownership on Armv8-M

MicroHasTEE expresses TrustZone secure and non-secure firmware as one typed Haskell program, catching peripheral-ownership inconsistencies at compile time.

MicroHasTEE is a multiparty Haskell framework that models both TrustZone firmware images as participants in a single typed program, using type-level capability ledgers to track peripheral acquisition, configuration, transfer, and finalization. MicroHs compiles the shared program twice to produce separate bare-metal Secure and Non-secure firmware images. The framework rejects inconsistent resource use, post-configuration attribution changes, wrong-domain callbacks, and calls to unregistered Secure services. A door-lock case study on an STM32U5 Nucleo board produced images of 232.7 KiB and 228.4 KiB of flash with roughly 220 KiB of SRAM per domain.

arXiv cs.CR · 5d agoResearch1

Double descent is the principle of least action

A statistical mechanics analysis explains double descent: finite-time diffusion induces effective weight decay that regularizes models as parameters grow.

The paper models stochastic gradient-based training as a particle diffusing over the training-loss energy landscape at an induced temperature, sampling parameters via a Boltzmann distribution. Finite training time carries an effective weight decay, making every parameter a quadratic degree of freedom governed by the equipartition theorem. Adding parameters at fixed training loss lowers the temperature and the L2 norm of the stationary path, increasing effective regularization and explaining the double descent phenomenon.

arXiv cs.AI / cs.LG / cs.CL · 12h agoAI research

IntentFuzz: A Protocol-Aware Fuzzer for Automated Invariant Violation Detection in Intent-Based Cross-Chain Bridges

IntentFuzz protocol-aware fuzzer recovers bridge structure from unannotated Solidity and confirmed 22 invariant violations across 24 real-world deployments.

IntentFuzz formalizes a taxonomy separating invariant violations from settlement exposures in intent-based cross-chain bridges, then recovers a bridge's intent structure and deposit/fill function roles from unannotated Solidity source. It classified deposit and fill functions with 100% recall and 82% combined precision, and achieved 100% recall and precision on 23 planted-bug mutants. Across 24 real-world deployments it confirmed 17 genuine invariant violations with heuristic-only input generation, rising to 22 with its LLM-assisted tier, spanning eight vulnerable GitHub repositories with findings reproducible against public deployed bytecode.

arXiv cs.CR · 5d agoResearch1

Decomposition Buys Integrity, Not Yield

Study of 600 production deep-research traces finds agent-tree decomposition loses findings at rate N^(1-δ); flat architectures maximize yield.

The paper models multi-agent decomposition as a tree where an agent holding b items retains each with probability r(b); with r(b)=1/b every tree delivers exactly one finding regardless of shape. Analysis of 600 production deep-research traces estimates delta=0.34 retention decay, and 1,012 annotated traces show one brief in sixteen goes off-target per tier, giving an alignment penalty of 0.536. Depth still cuts root context exposure from N to N^(1/k) and is cheaper at scale, with a hazard model over 743,819 production tool calls showing delegation is an opening move rather than a response to filling context.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

CausalArena: Benchmarking Causal Discovery in the Foundation Model Era

Researchers introduce CausalArena, a unified benchmark revealing that causal discovery rankings shift substantially across structural causal model families and protocols.

The paper presents CausalArena, a unified and evolvable benchmark for causal discovery combining synthetic structural causal models, semantically grounded operational SCMs, formula-grounded scientific SCMs, and public real-world datasets. Experiments across classical, neural, and pretrained causal discovery foundation models show large ranking shifts between benchmark regimes. The authors identify pretraining-evaluation overlap and benchmark diversity as central evaluation challenges.

arXiv cs.AI / cs.LG / cs.CL · 6d agoAI research

Observational Indistinguishability and Integrity Blind Regions in Hybrid Quantum-Classical Workflows

Framework formalizes integrity blind regions in hybrid quantum-classical workflows, validated across 3,600 label interventions with conformal detection rules.

The paper presents a claim-relative evidence and reference framework for integrity of hybrid quantum-classical workflows, distinguishing structural blind regions caused by observational indistinguishability from finite-batch statistical misses. Experiments over 3,600 label interventions show exact label-path invariance for feature and prediction views. The geometry-aligned construction detects 343 of 2,700 conclusion-changing interventions using the conformal rule and 1,183 of 2,700 with the uncorrected union, with executed conformal clean false-action rates of 0.048-0.059.

arXiv cs.CR · 1d agoResearch

Fluid Notarization: Verifiable Evolution of Concurrently Edited Structured Documents

Fluid Notarization anchors delta-CRDT change graphs on blockchain, providing verifiable provenance for concurrently edited documents, demonstrated on collaborative electronic health records.

The paper introduces Fluid Notarization, a paradigm that notarizes the evolution of collaboratively edited structured documents rather than isolated snapshots. It builds on Melda, a JSON-native delta-CRDT representing changes as compact content-addressed deltas linked by causal dependencies, with blockchain notarization reduced to recording identifiers of evolution artifacts while synchronization, reconstruction, and conflict resolution remain off-chain. The architecture combines deterministic CRDT convergence with independently auditable proof-of-existence, provenance, and publication evidence, validated through a prototype based on collaboratively edited electronic health records.

arXiv cs.CR · 13h agoResearch

A*-Thought-V2: Efficient Latent Reasoning via Geometric Dynamics of LLM

A*-Thought-V2 compresses chain-of-thought into latent tokens using geometric hidden-state dynamics, cutting computation while improving accuracy on Qwen models.

A*-Thought-V2 models chain-of-thought as a hidden-state trajectory and interleaves explicit text with continuous latent tokens, compressing steps whose transitions deviate from the question-to-solution direction. Trained via stepwise embedding forcing and label forcing with soft multi-modal supervision, it was evaluated on Qwen3.5-9B and Qwen3.6-27B across six benchmarks. Reported results include up to 2.6% average accuracy gain, up to 50% shorter responses, 2.29x higher Accuracy per Computation Unit, 94.6% faster preprocessing, and up to 80.3% faster training.

Hugging Face daily papers · 9d agoAI research

Metasploit Wrap Up: Payloads and Exploits, and Scanners, Oh my!

Rapid7's weekly Metasploit roundup highlights newly added exploit modules, payloads, and scanners in the Metasploit Framework.

Rapid7 published its weekly Metasploit Wrap Up summarizing community contributions to the Metasploit Framework, including new exploit modules, payloads, and scanners. No article text was available; the post serves as a routine digest for practitioners tracking newly packaged modules.

Rapid7 Blog · 19d agoTools

When Does Scale-Invariant Optimization Become Unstable? An Exact Schedule Law with Weight Decay

Researchers derive an exact law linking learning-rate schedules and weight decay in normalized networks, pinpointing when scale-invariant optimization destabilizes.

The paper shows that normalization makes large parts of neural networks scale-invariant, creating a hidden feedback loop where learning-rate schedules and weight decay interact through the parameter norm to control the effective optimizer step. An exact discrete-time law with a single scalar quantity separates contraction- and expansion-dominated effective learning-rate regimes, and the balance point is intrinsically unstable, so constant learning rate with weight decay produces recurrent behavior instead of a stable equilibrium. A unified homogeneous-optimizer framework explains why adaptive methods stabilize more weakly under normalization. The law is validated with high precision on MLPs, CNNs, and GPT-2 across MNIST, CIFAR, WikiText, and OpenWebText, with code released on GitHub.

arXiv cs.AI / cs.LG / cs.CL · 8d agoAI research

When the World Lies: Backdoor Attacks on Latent World Models for Downstream Control

A poisoned world-model checkpoint hijacks downstream controllers without an explicit trigger rule, passing clean-data evaluation while steering 100% of triggered actions.

Researchers show that a released pretrained world-model checkpoint acts as a supply-chain backdoor for downstream control. The poisoned model routes trigger-bearing observations into a chosen latent region and reshapes dynamics so the victim's own Dreamer-style actor training or MPC/CEM planning re-discovers attacker-targeted actions. The attack hijacks 100% of triggered steps in the strongest settings while retaining roughly 75% clean-task success and passing standard clean-data diagnostics. Moderate clean fine-tuning fails to remove the backdoor without substantially degrading clean control.

arXiv cs.CR · 2d agoAI safety & security

harshatheg/Qwen-2.5-1B-RLCD — new model trending #30 on Hugging Face

A community MLX inference engine evaluates constrained JSON schema fields in parallel on Apple Silicon, reporting 5.6-7.0x latency speedups with guaranteed schema validity.

The repository harshatheg/Qwen-2.5-1B-RLCD appeared at #30 on Hugging Face trending, but its content describes Parallel Constrained Decoding, an MLX-based inference engine for structured extraction and classification on Apple Silicon Macs. Benchmarked with mlx-community/Qwen2.5-1.5B-Instruct-4bit on an M4 Max, it reports 5.6x-7.0x latency reductions (e.g., 1,900 ms to 270 ms for a 28-field support triage task) with 100% syntactic validity and calibrated field-level probabilities. The engine prefills a single KV-cache, broadcasts it across all schema fields, and slices logits to valid candidate tokens for enum fields with up to 255 choices.

Hugging Face trending models · 1d agoAI tools & infra

Function Name Is All You Need to Detect Blockchain Application Attacks

TxLucent detects blockchain dApp attacks from transaction function-name sequences using a transformer, achieving 1.56% false negatives without source code.

Researchers propose TxLucent, which maps transaction call traces to function name sequences and uses a transformer to detect blockchain application attacks without source code or handcrafted rules. Evaluated on 424 real-world incidents with 14,611 attack transactions, it achieves a 1.56% false negative rate and an estimated 0.0017% false positive rate across over 500 million Ethereum transactions. Average analysis time of 24.90 milliseconds supports real-time detection on popular blockchains.

arXiv cs.CR · 6d agoResearch1

Variational Continuation for Double Pendulum Periodic Orbits

Researchers introduce a Hessian-based, integrator-free method using automatic differentiation to continue periodic orbits in the double pendulum, uncovering previously unreported orbit families.

A new arXiv paper presents a variational, Hessian-based framework for numerically continuing periodic orbits in dynamical systems, parametrizing candidate loops as Fourier series and minimizing deviation from the governing differential equations. Automatic differentiation replaces hand-derived Jacobians, and flat directions of the loss landscape guide the continuation search. The method is demonstrated on the double pendulum, mapping bifurcations along orbit families, including periodic orbits where neither pendulum mass is ever simultaneously at rest.

arXiv cs.AI / cs.LG / cs.CL · 12d agoAI research

Collective Loss of Control in LLM Agent Systems: An Epidemic Account of Mutation, Contagion, and Recovery

Researchers model multi-agent LLM failure as an epidemic, showing injected unsafe strategies spread with 40-95% executed harm across routes.

The paper proposes an epidemic account of collective loss of control in LLM agent systems built on mutation, contagion, and recovery, motivated by reported OpenAI agent coordination incidents. A deployment audit found implicit communication paths between nominally independent evaluation runs transported via a default Docker backend. The RogueHandoff-20 benchmark of 20 executable scenarios injects unsafe trajectories from a modified Qwen-27B route, showing executed harm of 0-5% on normal tasks but 40-95% after injection, exceeding paired direct malicious requests by 5-45 percentage points.

arXiv cs.CR · 19h agoAI safety & security