IOHK | Dr. Peter Gaži, presenting Ouroboros at MIT.
Vložit
- čas přidán 30. 07. 2024
- Developing a secure proof of stake algorithm is one of the big challenges in cryptocurrency. The Ouroboros protocol has the distinction of being the first proof of stake algorithm that is provably secure and has been peer reviewed at a leading cryptography conference, Crypto 2017.
This is essential for a protocol that is to be the foundation of a cryptocurrency, an infrastructure that must be relied on to carry billions of dollars worth of value. In addition to security, if blockchains are going to become infrastructure for new financial systems they must be able to comfortably handle millions of users. The key to scaling up is proof of stake, a far more energy efficient and cost effective algorithm, and as such this research represents a significant step forward in cryptography. Ouroboros is the only provably secure, peer reviewed proof of stake protocol to be implemented - the protocol is an integral part of Cardano, a blockchain system launched in September 2017 and undergoing further extensive development.
iohk.io/research/papers/#XJ6M...
Peter Gaži did his master studies in Computer Science at Comenius University in Bratislava, and obtained his PhD. in Cryptography from ETH Zurich under the supervision of Prof. Ueli Maurer. Later he worked as a postdoc in the Cryptography research group of Prof. Krzysztof Pietrzak at Institute of Science and Technology Austria. Currently, he is a full-time research fellow at IOHK.
Peter’s research interests include problems related to security analysis of symmetric cryptography constructions, hash functions and memory-hard functions. His work at IOHK is mostly focused on cryptocurrencies and blockchains.
iohk.io/team/peter-gazi/
--
Input Output
See more at: iohk.io
Get our latest news updates: iohk.io/blog/
Meet the team: iohk.io/team/
Learn about our projects: iohk.io/projects/cardano/
Read our papers: iohk.link/paper-ouroboros
Visit our library: iohk.io/research/library/
In the press: iohk.io/press/
Work with us: iohk.io/careers/
See more on Cardano: iohk.io/projects/cardano/ - Věda a technologie
New and improved with all slides by popular request!
Thanks god !! Great job
Thank you for all the new video updates. If I make a suggestion, the background music/sound in the video is distracting. It would be more pleasant to listen to the lectures without this added layer of music/sound.
Hi guys :) On question for you. Cardano has slot-leaders; how resistant network will be to DDoS attacks?
I was there for this presentation. Excelsior!
This is the beginning. We have not heard of how quantum computing will break this in milliseconds and alternative solutions💃
Appreciate this presentation. More info please!
Crypto is a technical marvel. It's amazing how much human ingenuity goes into creating these assets of all humanity.
I love IOHK's style.
Awesome presentation! I feel like I've learned alot and I'm ecstatic to start staking my ADA!
You might be a millionaire by now !😊👍
At 33:24: let's say a malicious node, when it's slot leader, feeds a block to half the network, and nothing to the other half. Then let's say the next slot leader is an honest node that builds off the malicious block. Doesn't this mean that half the network will see this new block as coming from a block that doesn't exist? I know it'll contain the hash of the previous block, but one can imagine this happening beyond one "missing" block. In general, how would they catch up?
On a related note, at 21:54, it says that adversarial parties can send messages to "arbitrary subsets" of the network -- but how can they guarantee this unless they know the network topology? If the network is a greater-than-2-edge connected graph, shouldn't it be impossible for a single node to, say, split the nodes in half and send only messages to one half?
so underviewed
what happens when adversary has the majority of stake?? And isn't that going to happen at some point when staking rewards are being proportionally paid??
This isn't an easy watch for a laymen like me. Could this be improved?? I've watched every youtube video on "probably safe" and find them a challengin watch
I've been wondering for a while why not use network ping as source for randomness... I.e. one node pings another node and uses the hash of that ping when selecting the next block generator. Network traffic changes all the time and thus ping is effectively random.
PROBABLY because given a set of physical parameters, one could narrow down the "randomness" of one's ping across a fairly common normal distribution. True random number generators are a hard problem because there are nearly no physical phenomena which are NOT deterministic or stochasitically deterministic... That said, neat idea!
Because it would be impossible for other nodes to verify what the result of the ping was, and thus adversarial node would just cheat and say the ping was such that it gave him another slot as a leader.
Local randomness is not verifiable across the network.
Wow, 52:00 pretty much sums it all up
카르다노 가즈아~~
Why is Cardano down so much?
Estratégia das baleias, logo logo atingirá 5,10$$$.
Be patient. Fiat will crash withing next few years. And then you will get returns in the range 10x to 100x.
So, now every QE you hear about is a good news.
Did you held your ADA?
will ouroboro rise? why does it seem died? is ouroboro a good investment?
boooooooooooooooooooooooom