ethresearch

Levalicious (Lev) 21-Feb-19 08:43 AM
I thought this might be share-worthy. Benedikt Bunz (co-author of Bulletproofs), Dan Bohen et al. proposed Zether, the first privacy mechanism built specifically for Ethereum, i.e. account-based smart contract platforms. All notable blockchain privacy mechanisms developed so...
For background, see Tradeoffs in Account Abstraction Proposals In this post I’ll make an account abstraction proposal that I would argue achieves significantly greater simplicity, and greater generality, than anything proposed so far, but at a price: transactions whose gas...
We are very excited to release an updated version of the NOCUST academic paper. NOCUST is a Commit-Chain or non-custodial side-chain to scale Blockchains through layer 2. We added passive delivery (recipients can now be offline), added an experimental evaluation with gas cos...
Is this assumption correct? If the operator fails to cancel orders of someone exiting directly from the smart contract, this can be detected and proven via “Exit Insolvency Fraud proof” Who is running the Orderbook? The operator Were any fund safety guarantees d...
Hi, I want to share a summary of a work I have done regarding a paper about Fraud Proofs written by Mustafa, Alberto, and Vitalik. The original idea was to verify the results presented in Table 1 by simulating the network instead of using mathematical closed-formulas (which...
On my journey to join the club of people who possess a reasonable understanding of ZKP cryptography, I stumbled upon many invaluable resources that provided to be very helpful. The problem was that they were rather scattered on the web. The awesome ZKP repo is indeed awesome ...
Version 3 is now up for discussion. Main changes compared to version 2: Replay protection for externally owned accounts changed from temporal to non-temporal to ensure that account nonces are never reused (reuse of nonces allow re-creation of contracts) Lock-ups are replac...
Prerequisite: https://vitalik.ca/general/2018/12/05/cbc_casper.html I propose a version of the LMD GHOST fork choice rule and an algorithm that makes it easy to tell whether or not a given block is valid under the CBC validity condition of “a block B with parent P is valid...
Hi All! I am Cheng, founder of Alephium project. We found a novel sharding protocol which supports native cross-shard transactions, i.e. no two-phase commit is needed for cross-shard txs. We call it blockflow. It’s a general sharding algorithm, but the idea could be applie...
THIS IS A WORK IN PROGRESS! The goal of this post is to provide a rough outline of what phase 2 might look like, to help make the discussion about state and execution more concrete as well as to give us an idea of the level and types of complexity that would be involved in im...
I have started to evaluate what is going on with whisper and with secure messaging in ethereum in general. I found out, that whisper is barely used. Some projects propose to use 3rd party messaging like rabbitMQ, others try develop an own messaging protocol like PSS in Swarm...
Currently, validators are able to enter and leave the validator set relatively quickly: each time a validator set transition happens, 1/64 of the validator set can switch in or out, and so in the normal case, every validator can switch out within a day. There is a much slower...
let me start first with what we want to achieve for the end-user to get mass-adoption: being able to create for free an immutable account being able to receive for free assets linked to an account being able to send assets linked to an account and pay potentially som...
The mechanism of encumberments has come up under different names in cross-shard communication and plasma. We argue that recognizing this allows us to systematically construct better mechanisms, e.g. channels-on-plasma with short dispute times, and argue for plasma dispute tim...
RSA accumulators can efficiently store primes, but are (as far as I know) not efficient with non-prime numbers. My goal is to store arbitrary values, just like you can do in a Merkle tree, but having a shorter proof size. This can have multiple applications, such as in zk-sta...
For background on CBC Casper, see: https://vitalik.ca/general/2018/12/05/cbc_casper.html There are two key implementation challenges with CBC Casper as described in this post: Evaluating whether or not a block is valid requires executing the LMD GHOST fork choice rule, whi...
Authors BarryWhitehat, Alex Gluchowski, HarryR, Yondon Fu, Philippe Castonguay Overview A snark based side chain is introduced. It requires constant gas per state transition independent of the number of transactions included in each transition. This limits scalability at the...
TL;DR: In the past, it has been questioned whether Avalanche RANDAO and verifiable delay functions (vdfs) are compatible, because Avalanche RANDAO allows large parties in the staking pool a “lookahead” on the entropy, so that they can start the vdf computation early. Howe...
Data unavailability is addressed the same way as MVP/plasma classic. There is a mass exit. This is made practical by halting the chain first to avoid gas pressure/network congestion.
I had not quite understood if registration was even the right model. I see. We’re not even talking about account keys, but validator’s signatures. In that case, there isn’t so much difference between the threat models anyways, so probably fine. I’m asking about ...
I’d like to argue against a widespread perception that under the initial sharding protocol, the only way to do cross-shard transactions will be with asynchronous messages (i.e. contract locking/yanking, and so on). I do agree that if we expect the least amount of innovation...
We can define a version of MIMC that works as follows: SimplifiedMiMCHash(x, d) = f^{512}(x), where f(x) = x^3 + d; that is, we apply the permutation x \rightarrow x^3 + d 512 times. Security claim: partial collision resistance - if y = SimplifiedMimChash(....SimplifiedMiMCH...
This is an interesting idea. I think I get the gist of it, you are essentially organizing the validators into a binary tree and performing a commit/reveal ceremony at each level of the tree. This essentially takes away the opportunity (or minimizes the likelihood) for a val...
⧉infominer 22-Feb-19 07:20 PM
TL;DR We propose a protocol of verifiable formal verification of smart contracts, which provides a way for wallet apps, dapp browsers and even smart contracts to know whether a target contract is secure and satisfies certain specifications by SN[T]ARKs over formal verificatio...