Happy to announce that our paper "Lay Down the Common Metrics: Evaluating Proof-of-Work Consensus Protocols' Security" is accepted at @IEEESSP (Oakland)! Thx @hashdag @socrates1024 @pwuille @adam3us for the discussion! Paper: https://www.esat.kuleuven.be/cosic/publications/article-3005.pdf … talk:https://www.youtube.com/watch?v=HiIQcdnKZBQ&feature=youtu.be …
-
-
Replying to @nirenzang @IEEESSP and
.
@nirenzang on game-theory analysis results of proposed variants to nakamoto consensus: result nakamoto consensus remains the best. it is comparatively simple and has good tradeoffs. KISS principle in action. (some of the PhD research work done while intern at@blockstream)2 replies 13 retweets 58 likes -
We've been using "nakamoto consensus" since before /r/btc was createdhttps://www.quora.com/What-is-the-Nakamoto-consensus …
1 reply 0 retweets 6 likes -
Replying to @socrates1024 @adam3us and
That's answer is 2015. That is not prior to the r\btc crowd attacking. Do you see anything earlier than that? I'm still sure without an actual early reference that the searches I did returned nothing at the time I was fighting the attempt to co-opt consensus via labelling.
2 replies 0 retweets 0 likes -
Mar 2015 https://eprint.iacr.org/2015/261
1 reply 0 retweets 3 likes -
Replying to @socrates1024 @adam3us and
Taht's rhe paper linked in the Quora answer isn't it..? I'm convinced I saw it before 2015; I'll check my post history. I definitely did an exhaustive search for the term at the time they were yelling it at me.
1 reply 0 retweets 0 likes -
Replying to @midmagic @socrates1024 and
And indeed I did. Here's
@NickSzabo4 referring to it in a Dec 2014 post: http://unenumerated.blogspot.com/2014/12/the-dawn-of-trustworthy-computing.html … And I'm sussing our some possible 2012-2013 references.1 reply 0 retweets 1 like -
Replying to @midmagic @socrates1024 and
I'm not part of the /r/btc/BU crowd either. I use it to refer to anonymous, probabilistic, and Sybil-resistant consensus, which first appeared in Bitcoin and is a fundamental computer science breakthrough vs. traditional identity-assuming & Sybil-vulnerable Byzantine consensus.
2 replies 1 retweet 18 likes
Traditional Byzantine consensus assumes that nodes are uniquely identifiable & thus countable. This is fine if the goal is reliability, not security & nodes are part of a fixed architecture, as with chips on an airplane.
-
-
Replying to @NickSzabo4 @midmagic and
The unique-and-countable node assumption seriously breaks when the goal is security among nodes on a public network, which is why Nakamoto consensus was such a huge advance in computer science.
0 replies 1 retweet 22 likesThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.