Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Blockchain Quick Reference

You're reading from   Blockchain Quick Reference A guide to exploring decentralized blockchain application development

Arrow left icon
Product type Paperback
Published in Aug 2018
Publisher Packt
ISBN-13 9781788995788
Length 350 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (4):
Arrow left icon
Brenn Hill Brenn Hill
Author Profile Icon Brenn Hill
Brenn Hill
Paul Valencourt Paul Valencourt
Author Profile Icon Paul Valencourt
Paul Valencourt
Samanyu Chopra Samanyu Chopra
Author Profile Icon Samanyu Chopra
Samanyu Chopra
Mariko Amekodommo Mariko Amekodommo
Author Profile Icon Mariko Amekodommo
Mariko Amekodommo
Arrow right icon
View More author details
Toc

Table of Contents (24) Chapters Close

Preface 1. Blockchain 101 2. Components and Structure of Blockchain FREE CHAPTER 3. Decentralization Versus Distributed Systems 4. Cryptography and Mechanics Behind Blockchain 5. Bitcoin 6. Altcoins 7. Achieving Consensus 8. Advanced Blockchain Concepts 9. Cryptocurrency Wallets 10. Alternate Blockchains 11. Hyperledger and Enterprise Blockchains 12. Ethereum 101 13. Solidity 101 14. Smart Contracts 15. Ethereum Development 16. Ethereum Accounts and Ether Tokens 17. Decentralized Applications 18. Mining 19. ICO 101 20. Creating Your Own Currency 21. Scalability and Other Challenges 22. Future of Blockchain 23. Other Books You May Enjoy

Proof of Elapsed time

The Hyperledger Sawtooth project introduced a new consensus mechanism called proof-of-elapsed-time or PoET. Hyperledger deals mostly with permissioned blockchains, chains in which only a specified number of participants are allowed on the network, similar to PoA chains.

The basic approach is simple:

  • Each node must wait a random amount of time
  • The first node to stop waiting gets to create a block

There are two things that we must be able to do for this to work. First, we must be able to verify that the waiting time for all participants was actually random, or else a simple attack would be to pretend to wait a random time and then just immediately create a new block. Second, it must be verifiable that not only was the length of time chosen random, but that the node actually waited the full period of time before acting.

The solution to these issues comes from...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at €18.99/month. Cancel anytime