Timeline for Why using hash trees instead using a single hash value?

Current License: CC BY-SA 4.0

16 events

when toggle format	what		by	license	comment
Dec 10, 2022 at 20:53	history	edited	kelalaka	CC BY-SA 4.0	A visit after a new upvote, an is forgotten
Dec 21, 2020 at 12:45	comment	added	kelalaka		Yes, That is the point.
Dec 21, 2020 at 12:37	comment	added	funidentifier		Thanks for your answer. Whether the tree is binary or not, I think that the point of "efficient verifications" still hold. Am I right?
Dec 21, 2020 at 12:36	vote	accept	funidentifier
Dec 21, 2020 at 1:25	comment	added	kelalaka		@funidentifier There are works in Academia about those, Obviously, the depth of the tree is decreased, however, one will need more siblings than the depth. One needs to look at each case. Note that by Definition a Merkle Tree is Binary Tree.
Dec 21, 2020 at 1:12	comment	added	funidentifier		But this way you're assuming that the tree is binary. What if the tree is not binary?
S Dec 20, 2020 at 13:49	history	suggested	wizzwizz4	CC BY-SA 4.0	Fixed broken formatting.
Dec 20, 2020 at 13:38	review	Suggested edits
S Dec 20, 2020 at 13:49
Dec 20, 2020 at 13:24	history	edited	kelalaka	CC BY-SA 4.0	added 42 characters in body
Dec 20, 2020 at 13:18	history	edited	kelalaka	CC BY-SA 4.0	added 42 characters in body
Dec 20, 2020 at 13:06	history	edited	kelalaka	CC BY-SA 4.0	polish
Dec 19, 2020 at 23:17	history	edited	kelalaka	CC BY-SA 4.0	edited body
Dec 19, 2020 at 22:51	history	edited	kelalaka	CC BY-SA 4.0	polish
Dec 19, 2020 at 22:39	history	edited	kelalaka	CC BY-SA 4.0	polish
Dec 19, 2020 at 22:16	comment	added	kelalaka		Whoever upvotes this answer, please go and read and upvote the Squamish's amazing answer, too. It is linked.
Dec 19, 2020 at 22:12	history	answered	kelalaka	CC BY-SA 4.0

toggle format