Joachim Neu
Pronunciation:
Joachim [ˈjoːaxɪm] 🔊
Neu [nɔʏ̯] 🔊
Contact: user jneu at organization stanford.edu
Google Scholar /
DBLP /
Tse Lab @ Stanford /
ORCiD: 0000-0002-9777-6168 /
Twitter @jneu_net
Short bio:
Joachim is a 4th year PhD student at Stanford
working with David Tse on Internet-scale open-participation consensus
(in more hype terms: the technical foundations of blockchains).
His current research focus is provable consensus security for next-generation Ethereum,
and provable security and performance of proof-of-stake consensus under bandwidth constraints and network-level attacks.
While a Masters student at Technical University of Munich and a visiting student researcher at MIT, EPFL, and KAUST,
he published in information and coding theory.
He has been supported by
Protocol Labs PhD Fellowship,
Ethereum Foundation,
Stanford Graduate Fellowship,
and German Academic Scholarship Foundation.
Research
Decentralized systems and algorithms
Peer-reviewed
-
Two Attacks On Proof-of-Stake GHOST/Ethereum
Joachim Neu*, Ertem Nusret Tas*, David Tse
Forthcoming at ConsensusDay 2022 (workshop at ACM CCS), November 2022
[arXiv:2203.01315]
[ePrint:2022/289]
-
Longest Chain Consensus Under Bandwidth Constraint
Joachim Neu*, Srivatsan Sridhar*, Lei Yang*, David Tse, Mohammad Alizadeh
Forthcoming at 4th ACM Conference on Advances in Financial Technologies (AFT'22), September 2022
[arXiv:2111.12332]
[ePrint:2021/1545]
[Talk video (Protocol Labs research seminar)]
-
Longest Chain Consensus Under Bandwidth Constraint
Joachim Neu*, Srivatsan Sridhar*, Lei Yang*, David Tse, Mohammad Alizadeh
Accepted for presentation at 5th Science of Blockchain Conference (SBC'22), August 2022
-
Information Dispersal with Provable Retrievability for Rollups
Kamilla Nazirkhanova*, Joachim Neu*, David Tse
Forthcoming at 4th ACM Conference on Advances in Financial Technologies (AFT'22), September 2022
[arXiv:2111.12323]
[ePrint:2021/1544]
-
Three Attacks on Proof-of-Stake Ethereum
Caspar Schwarz-Schilling, Joachim Neu, Barnabé Monnot, Aditya Asgaonkar, Ertem Nusret Tas, David Tse
26th International Conference on Financial Cryptography and Data Security (FC'22), May 2022
[arXiv:2110.10086]
[ePrint:2021/1413]
[Talk video, presented by Caspar Schwarz-Schilling]
-
The Availability-Accountability Dilemma and its Resolution via Accountability Gadgets
Joachim Neu*, Ertem Nusret Tas*, David Tse*
26th International Conference on Financial Cryptography and Data Security (FC'22), May 2022
[arXiv:2105.06075]
[ePrint:2021/628]
[Source code: Accountability gadget prototype]
[Source code: Refined Gasper attack]
[ETHresear.ch: Refined Gasper attack]
-
The Availability-Accountability Dilemma and its Resolution via Accountability Gadgets
Joachim Neu*, Ertem Nusret Tas*, David Tse*
Protocol Labs Research ConsensusDays '21, October 2021
[Talk video]
-
Ebb-and-Flow Protocols: A Resolution of the Availability-Finality Dilemma
Joachim Neu*, Ertem Nusret Tas*, David Tse*
42nd IEEE Symposium on Security and Privacy (S&P'21), May 2021
[doi:10.1109/SP40001.2021.00045]
[IEEE Computer Society Digital Library]
[arXiv:2009.04987]
[ePrint:2020/1091]
[Source code: Ebb-and-Flow]
[Source code: Gasper attack]
[ETHresear.ch: Gasper attack]
[Video: IEEE S&P'21 60s preview]
[Video: IEEE S&P'21 presentation]
[Decentralized Thoughts blog post]
[Talk at LA Blockchain Summit, presented by David Tse]
[Talk at IBM Research Workshop on the Informational Lens, presented by David Tse]
[zkCapital This Week in Blockchain Research Issue #74]
-
Ebb-and-Flow Protocols: A Resolution of the Availability-Finality Dilemma
Joachim Neu*, Ertem Nusret Tas*, David Tse*
3rd Workshop on Theory and Practice of Blockchains, June 2021
[Talk video]
-
Boomerang: Redundancy Improves Latency and Throughput in Payment-Channel Networks
Vivek Bagaria*, Joachim Neu*, David Tse
24th International Conference on Financial Cryptography and Data Security (FC'20), February 2020
[doi:10.1007/978-3-030-51280-4_17]
[SpringerLink:10.1007/978-3-030-51280-4_17]
[arXiv:1910.01834]
[Source code]
-
Boomerang: Redundancy Improves Latency and Throughput in Payment-Channel Networks
Vivek Bagaria*, Joachim Neu*, David Tse
4th Stanford Blockchain Conference (SBC'20), February 2020
[Talk video]
[Bitcoin Optech Newsletter #86]
Technical reports
-
Snap-and-Chat Protocols: System Aspects
Joachim Neu*, Ertem Nusret Tas*, David Tse
October 2020
[arXiv:2010.10447]
Supplemental
Polar codes and quantization
Peer-reviewed
Master's thesis
-
Quantized Polar Code Decoders: Analysis and Design
Joachim Neu
Master's thesis at Technical University of Munich, September 2018
[arXiv:1902.10395]
-
Polar.jl: Julia implementation of polar coding
Joachim Neu
https://jneu.net/Polar.jl, January 2019
[Source code]
Supplemental
Multi-user information theory
Peer-reviewed
Supplemental
Coding for DNA storage
Peer-reviewed
-
Overcoming high nanopore basecaller error rates for DNA storage via basecaller-decoder integration and convolutional codes
Shubham Chandak, Joachim Neu, Kedar Tatwawadi, Jay Mardia, Billy Lau, Matthew Kubit, Reyna Hulett, Peter Griffin, Mary Wootters, Tsachy Weissman, Hanlee Ji
45th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), May 2020
[doi:10.1109/ICASSP40776.2020.9053441]
[IEEExplore:9053441]
[bioRxiv:10.1101/2019.12.20.871939]
[Supplementary material]
[Talk video, presented by Shubham Chandak]
-
Improved read/write cost tradeoff in DNA-based data storage using LDPC codes
Shubham Chandak, Kedar Tatwawadi, Billy Lau, Jay Mardia, Matthew Kubit, Joachim Neu, Peter Griffin, Mary Wootters, Tsachy Weissman, Hanlee Ji
57th Annual Allerton Conference on Communication, Control, and Computing, September 2019
[doi:10.1109/ALLERTON.2019.8919890]
[IEEExplore:8919890]
[bioRxiv:10.1101/770032]
Supplemental
-
Large blocklength LDPC codes for Illumina sequencing-based DNA storage
Shubham Chandak, Kedar Tatwawadi, Billy Lau, Matthew Kubit, Jay Mardia, Joachim Neu, Hanlee Ji, Tsachy Weissman, Peter Griffin, Mary Wootters
ISMB/ECCB, July 2019
(Poster)
[Talk video, presented by Shubham Chandak]
Coded distributed storage and content delivery
Peer-reviewed
* Contributed equally and listed alphabetically.