Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.00005

A Multi-Venue Solana/DeFi Microstructure Data Corpus: The RED-2400 Family v2

Arati Uday Kamat
View original source ↗Read source document ↗Export metadata ↓

Abstract

Empirical research on decentralized and Solana-native market microstructure is constrained less by method than by data: the strongest results in the field rest on a small number of Ethereum-centric datasets, and public, record-level tapes of Solana venues, cross-chain flows, and on-chain oracle behavior remain scarce. We release and document the RED-2400 family v2, a corpus of five public benchmark datasets assembled by a single public-blockchain observer over a concurrent 57-day 2026 window (2026-05-08 to 2026-07-05) under one methodology (free-tier and public feeds only, no paid data, no private accounts, no trading), each with fixed-seed reproducibility scripts, SHA-256 manifests, and a CC-BY-4.0 licence. The five datasets characterize, respectively, Pyth oracle staleness against centralized-exchange prices (164,002 observations), an Aave utilization and Ethereum liquidation panel (18,750 liquidations plus a four-chain utilization series), spot-perpetual basis and funding coupling (244,719 observations), a Solana CEX-versus-DEX spread tape with realized impact (328,186 observations), and a Wormhole cross-chain source-flow tape (360,714 messages). Across the corpus we report three descriptive findings, one honest null, and one field-completeness characterization; none is presented as a causal estimate. The contribution is a coherent, reproducible benchmark family that complements the Ethereum canon and lowers the data barrier for Solana and cross-chain microstructure research.

Explore related subjects

q-fin.TRq-fin.CPq-fin.ST

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arati Uday Kamat. 2026-07-09. A Multi-Venue Solana/DeFi Microstructure Data Corpus: The RED-2400 Family v2. https://arxiv.org/abs/2610.00005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Mixture-of-Experts for Cryptocurrency Order Execution: Training Stability, Tail Risk, and Failure Modes

Deep reinforcement-learning policies for order execution can vary substantially across training seeds, so apparent architectural gains may reflect favourable training realisations rather than reproducible properties of the architecture. We evaluate vanilla Double Deep Q-Learning (DDQL), K-means-partitioned mixtures of DDQL experts at $K \in \{2, 4, 8\}$, and dense networks parameter-matched to the $K{=}4$ and $K{=}8$ expert budgets on 5-minute mean-aggregated BTC/USDT limit order book data from Binance. No learned configuration significantly improves mean implementation shortfall over DDQL. Under the reported specification, all have higher mean shortfall than TWAP (0.39 bps) and immediate liquidation (0.21 bps) in an environment whose frictionless replay and terminal-urgency penalty make early liquidation nearly costless; 11/100 vanilla-DDQL runs, versus none in either MoE $K{\geq}4$ arm, converge to a policy that waits until forced liquidation. We then decompose this specification on a device-matched baseline. Annealed exploration alone eliminates observed collapses (12/100 to 0/100; exact McNemar $p{=}4.9{\times}10^{-4}$), matching the elimination under expert partitioning. Combining annealed exploration with the aligned reward restores collapse in 19/30 runs; with all three specification changes, it rises to 48/100. In this environment, expert partitioning is unnecessary to suppress collapse and appears to mask a training-specification failure rather than confer an intrinsic performance benefit. No MoE $K{=}8$ run collapses under any of the six specifications tested. Across-seed dispersion is lowest at $K{=}8$ but non-monotone and not robust to family-wise adjustment, while within-policy tail risk worsens monotonically with $K$. The apparent attribution of the failure mode reverses between 30 and 100 seeds, illustrating the importance of repeated-seed evaluation.

q-fin.TR↗
arXiv2026

Post-Rejection Follow-up Sampling: Measuring Outcomes of Rejected Decisions in Algorithmic DEX Trading

Note (Oct 2026): data were collected by a tracker with a 10-minute sweep, 24-hour cap and one record per token, not the PRFS schedule of v1-v2; headline counts unchanged. Filter-gated algorithmic trading systems on decentralised exchanges reject most candidate tokens they evaluate, yet the observed forward market trajectory of those rejected candidates is rarely measured on the same live venue that produced the rejection. This paper introduces Post-Rejection Follow-up Sampling (PRFS), an observational measurement methodology in which a separate tracking subsystem samples each rejected token's price and liquidity from the same live oracle path used by the rejecting scanner, at a scheduled cadence, from the moment of rejection out to a fixed analytic horizon. The methodology is defined through a formal specification of the observation window and the reason-attribution rule, a reference implementation (prfs v2.0.0) with executable coverage and reason-ledger tests, and a secondary cross-check implementation that re-derives every headline number through a distinct code path. The companion dataset contains 67,000 forward-observation rows across 2,997 rejection events collected on a single Solana automated-market-maker sub-venue during a launch-dynamics window of 8.63 calendar days across 457 unique mints. Under the primary reason-aware three-field event key, 1,455 events (48.55 percent) receive a matched forward observation; under the reason-agnostic two-field diagnostic key, 1,641 events (54.75 percent) match. Mint-level coverage is 100 percent. The 253-row reason-conflict ledger and 8,593 unaligned outcome rows are disclosed, and coverage is shown to be filter-associated (chi-square(6) = 401.29) and source-associated (z = 14.78). No causal or counterfactual claim of a hypothetical acceptance outcome is made; the reported estimand is the observed post-rejection forward return.

q-fin.TR↗
arXiv2026

Neural Estimation of Irreversibility in Real and Simulated Limit Order Book Paths

A path indistinguishable from its own reverse carries no arrow of time, so time irreversibility is a necessary condition for a directed mechanism to be readable from trajectories alone. In finance it has been measured only on scalar series such as returns and volatility. We define the irreversibility rate of a coarse-grained limit order book path as the forward-to-reverse log-density ratio per event, and estimate it from three weeks of Nasdaq market-by-order data with an order-invariant MLP and a temporal convolutional network that receive identical blocks. For NVDA, the order-invariant and order-sensitive estimates are 0.036 and 0.054 nats per event, respectively. Their difference, the ordering increment, is 0.018. A surrogate preserving the coarse one-step transition table recovers 30 percent less irreversibility than the observed paths. The increment is positive for all twelve symbols on every held-out daytime date, and for NVDA in each session window. It changes more than tenfold with the coarse-graining scale. Neither a linear score nor any single feature group reproduces the full fitted rate. A queue-reactive simulator calibrated on the same days matches the market's ordered rate, 0.052 against 0.054, yet its ordering increment is 0.0006 against 0.018, building temporal asymmetry out of block composition instead of block order. We propose the ordering and scale profile of path irreversibility as a benchmark for order book simulators. Code and audit materials are available at https://github.com/hjyeo30/lob-irreversibility.

q-fin.TR↗