Interesting, I’m surprised he doesn’t talk directly about Directed Acyclic Graph networks – expressing Proof of Work and distributed voting weight of nodes without the need for mining. It eliminates the scaling/hash expenditure issue while maintaining near-instant confirmations. Such things are being demonstrated already with Nano for instance.

Source link


Please enter your comment!
Please enter your name here

This site uses Akismet to reduce spam. Learn how your comment data is processed.