An Archive of Ideas Across Disciplines
We establish upper bounds on coherence time in open quantum systems at physiological temperatures, with implications for biological quantum sensing.
A statistical analysis of branching patterns in mammalian circulatory systems reveals self-similar structures across seven orders of magnitude.
Experimental evidence for second-order phase transitions in driven granular systems challenges existing mean-field predictions.
A novel protocol for privacy-preserving identity verification using succinct non-interactive arguments of knowledge on Ethereum L2.
We demonstrate that state-space models combined with local attention achieve superior performance on long-context tasks at reduced compute cost.
An automated framework for proving temporal properties of Solidity contracts using bounded model checking and abstraction refinement.
Cross-national comparison of financial regulatory sandbox outcomes in 14 jurisdictions reveals significant variation in startup survival rates.
An analysis of conflicting national data residency requirements and their impact on cross-border cloud computing infrastructure design.
We model the relationship between governance token velocity and protocol revenue, establishing conditions for sustainable tokenomic design.
Experimental evidence that interface design significantly influences voting behavior in on-chain governance, with implications for participation equity.
A philosophical framework for encoding uncertainty acknowledgment into automated decision systems, drawing on virtue epistemology traditions.
When a digital twin diverges from its physical counterpart, questions of identity persistence arise that classical mereology cannot resolve.
This paper revisits the classic Byzantine Generals Problem through the lens of modern distributed systems, demonstrating that no consensus protocol can simultaneously satisfy safety, liveness, and fairness under asynchronous network conditions with more than one-third Byzantine actors.
We introduce a formal definition of "procedural fairness" for consensus mechanisms and prove through constructive proof that any protocol achieving safety and liveness must sacrifice fairness in at least one execution trace. Our impossibility result extends the FLP theorem to include fairness as a first-class constraint.
The practical implications are significant: existing proof-of-stake protocols that claim fair validator selection necessarily relax either safety or liveness guarantees during network partitions. We propose a relaxed fairness notion -- epsilon-fairness -- that permits bounded unfairness while preserving the other two properties.
Efficient lattice-based key exchange protocol resistant to quantum attacks, with formal security proof in the random oracle model.
Mar 2026Field trial results from gene drive deployment targeting malaria-vector mosquitoes in controlled island environments. Three-year longitudinal data.
Feb 2026Modeling CBDC adoption patterns across 40 economies using diffusion theory.
Jan 2026Systematic comparison of algorithmic impact assessment frameworks in the EU, Canada, and New Zealand, identifying structural gaps in accountability mechanisms.
Dec 2025Training dynamics and scaling laws for sparse MoE models beyond 100B parameters, with novel load-balancing loss.
Nov 2025Experimental demonstration of topologically protected acoustic edge states in a programmable metamaterial lattice at audible frequencies.
Oct 2025Quadratic funding with pairwise coordination subsidies for public goods provision in digital communities.
Sep 2025Statistical analysis of how climate-related litigation filings correlate with improved corporate emissions disclosure in G20 nations.
Aug 2025