devcon 7 / based preconfirmations with mr mev boost
Duration: 00:09:51
Speaker: Lin Oshitani
Type: Lightning Talk
Expertise: Intermediate
Event: Devcon
Date: Nov 2024
A Modest Proposal for Ethereum 2.0
Vitalik Buterin gives his talk titled, "A Modest Proposal for Ethereum 2.0"
A proposer's perspective on preconfirmations: a new game in town?
This talk will provide a node operator's perspective on the preconf transaction pipeline by examining incentives and infrastructure best practices. Specifically, ways node operators may attempt to earn higher revenues than peers through custom optimizations will be discussed alongside, related risks, and potential mitigations.
Oracles for number values
We will overview the history and state of research on how to design a cryptoeconomic oracle that outputs a number value. One wants such tools for price oracles, but also for bringing other information on-chain, e.g. the damages to award from an on-chain insurance contract. We will look at approaches ranging from Vitalik's 2014 SchellingCoin proposal to ideas drawing from social choice theory, including based on recent research. We will explore tradeoffs including resistance to several attacks.
Sybil-Proof Mechanisms
I discuss a fundamental impossibility result on proposer selection mechanisms: If different actors can generate different value from block proposal (or sequencing) rights, the only sybil-proof and incentive compatible way of assigning proposal rights is through an (arguably centralizing) auction. In other words, any proposer selection mechanism can at most satisfy two out of three fundamental requirements: incentive compatibility, sybil-resistance and decentralization.
A DAG-Based Mechanism for Fairer and More Decentralized Reward Distribution
Ethereum rewards validators for their correct and timely votes, incentivizing honest behavior and ensuring security. Although Ethereum has advanced large-scale decentralization, its current mechanism for verifying timely attestations is not entirely decentralized. This presentation highlights a bottleneck in Ethereum's reward distribution that could compromise LMD GHOST security. We propose a distributed DAG-based reward mechanism to enhance security, fairness, and incentive compatibility.
Latency Advantage in CEX-DEX Arbitrage
We study the effects of having latency advantage in the CEX-DEX arbitrage in the first-come first-serve transaction ordering policies. We search for optimal strategies for a trader that owns such advantage. To find optimal strategies, we simulate price changes on CEX using real data and assume DEX price does not change in the latency advantage interval. We find that optimal strategy can even be to trade right away as soon as the price difference crosses a threshold where trading is profitable
Nano-payments on Ethereum
Piotr Janiu of Golem (http://golemproject.net/) presents on Nano-payments on the Ethereum blockchain
The CBC Casper Roadmap
The CBC Casper roadmap is a plan to implement Proof-of-Stake and Sharding for Ethereum using “correct-by-construction” (CBC) software design methodology. This talk will share new CBC Casper research, including specifications for light clients, liveness and sharding. It will include updates on formal verification and engineering efforts, and a roadmap for (eventual) release.
Demand-based recurring fees in practice
ALL 4 letter .COMs have been taken since 2013. Yet most only have a few natural buyers; hence, speculation doesn't make that market more efficient. Yet, in crypto-economics, we can already transcend private property to deter the monopolization of digital assets like domains. This talk explores solutions from Weyl, Posner, and Henry George. We'll show how pricing and allocative efficiency can be improved through Georgist land value tax for assets like real estate, domain names, or ad space.
Fair combinatorial auction for trade intents: how to design mechanisms without a numeraire
When designing mechanisms on the blockchain, there may be no single asset that can be used to reallocate the benefits of participating in the mechanism among its participants. Hence, the designer cannot separately address achieving an objective and sharing the resulting gains, as the objective affects how/whether these gains can be shared. This raises fairness concerns. We discuss the relevance of this issue for trade intent auctions and propose a novel mechanism: the fair combinatorial auction.