Tootfinder

Themis Consensus Extension v1: MEV Mitigation by Randomized Delayed Execution and Intent-Hiding Transactions in Application-Specific Blockchains
Shoeb Siddiqui, Mateusz Nowakowski, Stanislav Vozarik, Gleb Urvanov, Peter Kris
https://arxiv.org/abs/2607.21406 https://arxiv.org/pdf/2607.21406 https://arxiv.org/html/2607.21406
arXiv:2607.21406v1 Announce Type: new
Abstract: Maximal extractable value (MEV) arises when privileged participants select, exclude, insert, or reorder pending transactions for private gain. We specify and analyze the Themis Consensus Extension v1, first published by Mangata in 2021. The design separates value extraction by reordering (VER) from value extraction by denial (VED). For VER, block construction and execution occur across consecutive producers: one producer commits a transaction set, and the next derives a publicly verifiable, deterministic, previously un- predictable seed and executes a seed-determined, dependency-preserving permutation. For selective VED, a user may encrypt a transaction for a designated builder and executor. The builder removes an outer layer and commits the opaque inner ciphertext; the executor reveals and executes the plaintext only after commitment. Under selfish but non-colluding validators, an adversary below the underlying consensus fault threshold, secure cryptography, and accountable role performance, the construction limits unilateral post-commit ordering control and hides transaction intent from relays and the builder. It does not provide send-order or receive-order fairness, complete censorship resistance, resistance to builder-executor collusion, or per-transaction price guarantees. We analyze probabilistic extraction, spam, dependent transactions, decryption liveness, session boundaries, total denial, and threshold coalitions. We also document the initial Aura-based Substrate implementation and its subsequent transition to a BABE-based sr25519/VRF seed path, together with delayed execution, Fisher-Yates shuffling, and Xoshiro256 . The result preserves the original proposal while narrowing its claims to explicit assumptions.
toXiv_bot_toot

Evaluating Large Language Models for Symbolic Security Protocol Analysis
Paolo Modesti, Syed Ahmed, Ioannis Sfyrakis, Derek Enodolomwanyi
https://arxiv.org/abs/2607.20712 https://arxiv.org/pdf/2607.20712 https://arxiv.org/html/2607.20712
arXiv:2607.20712v1 Announce Type: new
Abstract: Security protocol verification relies on formal tools such as ProVerif and OFMC. This study evaluates whether Large Language Models (LLMs) can perform comparable analysis. We test GPT and DeepSeek in chat and reasoning modes over three runs on 130 obfuscated AnB/AnBx protocols covering 388 security goals, scored against ProVerif and OFMC. Chat models reach 69 to 81% recall at precision below 31%. Reasoning models reverse this trade-off, reaching 66.5% precision for GPT and 45.4% for DeepSeek, but detect just over half the attacks. DeepSeek's two modes share one underlying model, so the comparison isolates reasoning itself, which raises precision from 27.2% to 45.4%. The GPT contrast spans a model-version change and is only suggestive. All models perform worst on authentication goals: reasoning models detect well under half of injective and non-injective agreement attacks, whereas chat models over-flag them at low precision. Confidentiality is the exception, with F1 up to 95.7% in reasoning mode. Verdicts are unstable across runs, identical on 89.7% of goals for GPT but 74.0% for DeepSeek. Self-reported confidence is uniformly high yet shows no meaningful correlation with correctness. On this benchmark LLMs do not match formal verification, but may serve, at best, as pre-screening filters.
toXiv_bot_toot

How the fly holds a single goal: normalization, not selection, in Drosophila FC2
Gioele Nanni, Christopher Lee
https://arxiv.org/abs/2607.18969 https://arxiv.org/pdf/2607.18969 https://arxiv.org/html/2607.18969
arXiv:2607.18969v1 Announce Type: new
Abstract: A walking fly steers toward a goal direction, held as a bump of activity across the FC2 neurons of the fan-shaped body. These neurons also inhibit one another over distance, more strongly the farther apart they are, a feedback proposed to keep the fly on a single goal. We asked, from the connectome, what circuit produces this inhibition, and whether it lets FC2 actively choose one goal among competitors (a winner-take-all) or simply keeps a goal set elsewhere as one clean bump. Tracing the wiring in a single FlyWire brain, we find the inhibition is almost entirely global: four FB5A cells inhibit every FC2 neuron roughly equally, with a smaller, distance-dependent contribution from hDelta interneurons and a negligible direct component. A ring-attractor winner-take-all (the kind the compass uses) requires local recurrent excitation that the FC2 wiring lacks, so this geometry cannot build one; and across a range of dynamical models, including a spiking network, no version of the circuit locks onto a winner at the connectome-scaled reference coupling. FC2 therefore normalizes an externally set goal rather than selecting it, with FB5A likely acting as the global normalizer, much as the APL neuron does in the mushroom body. We are explicit about two open points: a different mechanism, mutual inhibition between two competing goals (which hDelta supplies), could in principle select at very strong coupling, and we bound rather than exclude it; and FB5A's inhibitory identity is a low-confidence prediction of the connectome's transmitter classifier, not yet measured, and likely not GABAergic. We then ask where the goal is actually set: the connectome nominates an upstream hDelta network and rules out the leading proposed alternative, whose neurons supply under 0.2% of FC2's input. Finally, we propose a direct experiment, silencing FB5A while imaging FC2, that would test the account.
toXiv_bot_toot

Discrete Boltzmann model at Burnett level for compressible multicomponent flows under external forces
Demei Li, Huilin Lai, Chuandong Lin, Suni Chen
https://arxiv.org/abs/2607.20029 https://arxiv.org/pdf/2607.20029 https://arxiv.org/html/2607.20029
arXiv:2607.20029v1 Announce Type: new
Abstract: This work extends the Burnett-level discrete Boltzmann model (DBM) from single-component to multicomponent compressible flows under external forces, building on the fundamental framework of the high-precision discrete kinetic method. A high-isotropy 25-discrete-velocity set is adopted to guarantee numerical stability and spatial symmetry, while a rigorous moment-matching strategy is developed to construct the equilibrium distribution function and external force term. Different from the single-component counterpart, the present model intrinsically incorporates interspecies mass diffusion effects and multi-component thermodynamic nonequilibrium behaviors, which are critical for complex compressible multicomponent systems. The Chapman--Enskog expansion verifies that the proposed model can exactly recover the Burnett-level governing equations for forced multicomponent compressible flows in the continuum limit. Five canonical benchmark cases, including multicomponent mass diffusion, compressible Sod shock tube, thermal Couette flow, Kelvin--Helmholtz instability, and Rayleigh--Taylor instability, are systematically performed. Numerical results demonstrate that the developed Burnett-level multicomponent DBM achieves high accuracy and robustness in capturing both hydrodynamic evolution and multicomponent nonequilibrium characteristics under external forces.
toXiv_bot_toot

Physical Properties of 6.7 Million Galaxies from the DESI Bright Galaxy Survey: Spectral Fitting and Systematic Tests with Mock Spectra
Niu Li, Hu Zou, Jinfu Gou, Weijian Guo, Wenxiong L, Haoming Song, Jipeng Sui, Xi Tan, Yunao Xiao, Jingyi Zhang
https://arxiv.org/abs/2607.19162 https://arxiv.org/pdf/2607.19162 https://arxiv.org/html/2607.19162
arXiv:2607.19162v1 Announce Type: new
Abstract: We present a comprehensive analysis of the physical properties of galaxies in the Dark Energy Spectroscopic Instrument (DESI) Data Release 1 (DR1) Bright Galaxy Survey (BGS), based on full spectral fitting of $\sim 6.7$ million galaxy spectra. Using a customized spectral fitting pipeline, we derive key physical parameters including stellar mass, stellar velocity dispersion, stellar population age, dust attenuation, and emission-line properties. To quantify the reliability and systematic uncertainties of our measurements, we construct a large set of mock spectra that closely reproduce the observed properties of DESI data, including realistic noise and spectral features. By comparing the recovered parameters with the known inputs, we assess the performance of the spectral fitting as a function of stellar continuum signal-to-noise ratio (S/N, defined as the ratio of the median continuum flux to its associated error) and redshift. We find that stellar masses can be robustly recovered with negligible bias for spectra with $\mathrm{S/N} \gtrsim 5$, while low-S/N spectra ($\mathrm{S/N} \lesssim 5$) show a mild systematic overestimation of $\sim 0.1$ dex and increased scatter. Similar trends are observed for stellar population parameters, while emission-line fluxes are recovered with high accuracy and minimal bias. We further validate our stellar mass estimates by comparison with independent measurements from photometric spectral energy distribution fitting, finding good overall consistency within the expected systematic uncertainties. The value-added catalog presented in this work enables a wide range of statistical studies of galaxy evolution with DESI, and provides a foundation for future analyses.
toXiv_bot_toot

Color-Rule-Function Encoding for Combinatorial Memory
Alexander Khitun
https://arxiv.org/abs/2606.11365 https://arxiv.org/pdf/2606.11365 https://arxiv.org/html/2606.11365
arXiv:2606.11365v1 Announce Type: new
Abstract: Combinatorial memory is a class of memory in which information is encoded in the set of paths through a structured mesh. In this work, we introduce a systematic encoding framework, referred to as the Color-Rule-Function (CRF) approach, for representing information in combinatorial memory. The method consists of four key steps: selecting a sequence of paths in the mesh, assigning values (e.g., colors) to each cell, defining a set of rules based on the values encountered along each path, and constructing a Boolean function that determines the state of each path. . The coding procedure is illustrated by several examples. The design space scales of the CRF scale fundamentally faster compared to conventional memory. This apparent advantage arises from the use of rule-based and functional representations but is accompanied by increased hardware complexity. A possible hardware realization of the CRF framework is discussed. Importantly, the hardware overhead can be substantially reduced through the use of customized modules. The examples of the customized design are described in the text. The combination of CRF coding with customized module design may lead to a practical advantage in data storage density. According to the estimates, the data storage density may exceed Exabit per centimeter squared. A key problem that requires further investigation is related to the minimum Hamming distance between an arbitrary target bit sequence and the closest sequence realizable within the CRF framework under fixed hardware constraints.
toXiv_bot_toot

Parameterized Verification of Deterministic MPI Programs
Stephen F. Siegel
https://arxiv.org/abs/2607.18049 https://arxiv.org/pdf/2607.18049 https://arxiv.org/html/2607.18049
arXiv:2607.18049v1 Announce Type: new
Abstract: We consider the problem of verifying a message passing program in which the number of processes is a parameter NP and each process knows its unique ID. Processes communicate using send and receive commands which specify a single destination or source. To verify the program, the user provides functions specifying the number of messages sent from process i to process j, the level of each communication event in the happens-before hierarchy, and a fact that holds for the k-th message sent from i to j. These are used to transform the program to a parameterized sequential program which can be verified using any techniques appropriate for such programs. We realize this approach in an extension to Frama-C/Wp to verify C/MPI programs.
toXiv_bot_toot

Replaced article(s) found for quant-ph. https://arxiv.org/list/quant-ph/new
[1/5]:
- Tight Bounds for Quantum Phase Estimation and Related Problems
Nikhil S. Mande, Ronald de Wolf
https://arxiv.org/abs/2305.04908 https://mastoxiv.page/@arXiv_quantph_bot/110337460439591382
- Quantum thermodynamics of the Caldeira-Leggett model with non-equilibrium Gaussian reservoirs
Vasco Cavina, Massimiliano Esposito
https://arxiv.org/abs/2405.00215 https://mastoxiv.page/@arXiv_quantph_bot/112370293649586776
- A quantum implementation of high-order power method for estimating geometric entanglement of pure...
Andrii Semenov, Niall Murphy, Simone Patscheider, Alessandra Bernardi, Elena Blokhina
https://arxiv.org/abs/2405.19134 https://mastoxiv.page/@arXiv_quantph_bot/112528797708787049
- Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
Yu Cao, Shi Jin, Nana Liu
https://arxiv.org/abs/2411.03180 https://mastoxiv.page/@arXiv_quantph_bot/113435338816776896
- Mixed-State Topological Order under Coherent Noise
Seunghun Lee, Eun-Gook Moon
https://arxiv.org/abs/2411.03441 https://mastoxiv.page/@arXiv_quantph_bot/113440883864687961
- Quest for quantum advantage: Monte Carlo wave-function simulations of the Coherent Ising Machine
Manushan Thenabadu, Run Yan Teh, Jia Wang, Simon Kiesewetter, Margaret D Reid, Peter D Drummond
https://arxiv.org/abs/2501.02681 https://mastoxiv.page/@arXiv_quantph_bot/113786139350946567
- Honest-binding quantum bit commitment from separable operations
Ziad Chaoui, Anna Pappa, Matteo Rosati
https://arxiv.org/abs/2501.07351 https://mastoxiv.page/@arXiv_quantph_bot/113825499573295523
- Expressivity of Quantum Reservoir Computers
Sch\"utte, G\"otting, M\"untinga, List, Brunner, Gies
https://arxiv.org/abs/2501.15528 https://mastoxiv.page/@arXiv_quantph_bot/113904787967762788
- Additivity and chain rules for quantum entropies via multi-index Schatten norms
Omar Fawzi, Jan Kochanowski, Cambyse Rouz\'e, Thomas Van Himbeeck
https://arxiv.org/abs/2502.01611 https://mastoxiv.page/@arXiv_quantph_bot/113944408733032864
- On the Addressability Problem on CSS Codes
J\'er\^ome Guyot, Samuel Jaques
https://arxiv.org/abs/2502.13889 https://mastoxiv.page/@arXiv_quantph_bot/114035128180919513
- Robust Mixed-State Cluster States and Spurious Topological Entanglement Negativity
Seunghun Lee, Eun-Gook Moon
https://arxiv.org/abs/2504.16165 https://mastoxiv.page/@arXiv_quantph_bot/114391788348136547
toXiv_bot_toot

Uniform-Loss Automated Market Making for Prediction Markets
Ciamac C. Moallemi, Dan Robinson, Brian Zhu
https://arxiv.org/abs/2607.17428 https://arxiv.org/pdf/2607.17428 https://arxiv.org/html/2607.17428
arXiv:2607.17428v1 Announce Type: new
Abstract: Automated market makers (AMMs) for prediction markets descend from market scoring rules, where a mechanism operator subsidizes a market to aggregate beliefs about uncertain events. The existing literature has focused on bounding the total worst-case loss to the subsidizer, but has not addressed how that loss is distributed across price states or over time. We use the framework of loss-versus-rebalancing (LVR) to study this distribution and introduce \textit{uniform AMMs}, defined by the property that instantaneous LVR is proportional to pool value and independent of the current token price. In a static setting, we show that for a broad class of \textit{win-martingales} -- processes that converge to 0 or 1 at a fixed resolution time -- there exists a pricing function that achieves uniform LVR under that process, and conversely, that any sufficiently regular pricing function induces a win-martingale under which it is uniform. We then extend the framework to dynamic liquidity management, showing that liquidity levels can be adjusted over time to implement a prescribed target expected cumulative loss schedule. This theory is illustrated with canonical examples of win-martingales and pricing functions. Our results can inform AMM designers and liquidity providers on how the inevitable cost of subsidizing price discovery can be shaped and controlled across both price and time.
toXiv_bot_toot

Copyright Attorney identifies legal mistakes made by Bricks & Minifigs in their public statement, while trying to deflect blame from their $90M company.
▶️ Fired, closed, blamed: What the Press Release Gave Away - Lawful Masses with Leonard French
https://youtube.com/watch?v=55FMmihiDw