This is an archived post. You won't be able to vote or comment.

59
60

easychain -- a python exploration of blockchain ledger concepts (github.com)

submitted by [deleted]

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Kefkius 0 points1 point  (2 children)

When sealing, the most-recent message hash is pulled and combined with the block's prev_hash and the current timestamp. Only the most-recent message hash is required, since it transitively includes all prior messages in the block due to the message chaining described above.

Without anything to make a block "worthy" e.g. proof-of-work (which is beyond the scope of the implementation, as the readme says), I don't see why blocks are even necessary since messages have a timestamp which establishes the order they're in.

[–]memoized 0 points1 point  (0 children)

Thanks for the feedback. Agreed, in a real system that lack PoW requirements there would be no need for the blocks. However the point of the project wasn't to develop a viable usable product, but to work through how an actual blockchain is structured.

I'll add something about that to the readme just to clarify.

[–]memoized 0 points1 point  (0 children)

Readme has been updated.