谛听Diting Lab

Crypto & Blockchain · Sat, Oct 24, 2026

Bitcoin, Ethereum, stablecoins, DeFi, smart contracts, scaling and consensus.

arXiv cs.GT

More Meters or More Prices? One- vs. Multi-dimensional Fee Mechanisms on Ethereum

In briefMore Meters or More Prices? Comparing Single and Multi-Dimensional Ethereum Fee Designs

SummaryThis paper examines Ethereum's shift from a one-dimensional transaction fee mechanism to a multi-dimensional one that prices execution, data, and state creation separately. The authors build a demand model calibrated from 2025 block-capacity increases and find that state creation is the most price-responsive resource. Combining this model with transaction-level metering reconstruction and block-level simulation, they report that the multi-dimensional design removes fee coupling and yields more execution throughput at similarly low congestion.

Fei Wu, Maria In\^es Silva, Stefanos Leonardos et al.

arXiv cond-mat.mes-hall · quant-ph

Zeptojoule Microwave Calorimetry with Nanosecond Recovery in Graphene

In briefGraphene microwave calorimeter with zeptojoule sensitivity and nanosecond recovery

SummaryThe study calibrates a graphene Josephson-junction microwave calorimeter using nanosecond pulses and independently measures the thermal parameters of the same device. At 110 mK, the calibrated pulses give a switching-energy scale of 18.1 meV (2.90 zJ), and two-pulse thermometry gives an intrinsic relaxation time of 19.5 ns. The measured electronic heat capacity and electron-phonon coupling are larger than ideal estimates, and a thermal model using these measured values predicts 21.2 meV, matching the observed switching response.

Seunghan Lee, Woochan Jung, Jayeon Kim et al.

arXiv cs.DC · cs.CR

Quantum Cadence: Post-Quantum Consensus with Multiple Concurrent Proposers

In briefQuantum Cadence: a post-quantum consensus protocol for multiple concurrent proposers that avoids certificates

SummaryMost high-performance blockchains rely on quorum certificates built from aggregated signatures, which large-scale quantum computers could break, and no post-quantum scheme matches their size and aggregation speed. This paper presents Quantum Cadence, in which each validator counts quorums from the messages it has received, so no certificates are needed. Its fast path keeps the optimal latency of Chorus, and when that fails it falls back to Coda, a signature-free Byzantine agreement. In simulations with 200 validators, its latency is comparable to Chorus and it scales better as the number of proposers grows.

Mohammad Mussadiq Jalalzai, Tobias Klenze, Jovan Komatovic