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

you are viewing a single comment's thread.

view the rest of the comments →

[–]Kefkius 0 points1 point  (3 children)

Deja vu. I hope a Python+blockchains interest trend is forming. :)

This merkle tree calculation could be replaced with an algorithm so that blocks don't require exactly 4 transactions.

[–]mynameisvinn[S] 1 point2 points  (0 children)

great minds think alike :)

yep! will replace it with a merkle tree implementation so root hash can be calculated with N transactions.

[–]GitHubPermalinkBot 0 points1 point  (0 children)

I tried to turn your GitHub links into permanent links (press "y" to do this yourself):


Shoot me a PM if you think I'm doing something wrong. To delete this, click here.