By definition changing a node implies rehashing all the related nodes of the tree right? What do you mean by “modifiable”?
-
-
-
Yep, basically I need to maintain a Merkle tree with the elements of an array as leaves, and be able to: (1) insert a new element at the end of the array, and (2) change an arbitrary element. Pretty standard binary trees suffice, but I didn't find a library for it yet.
Kraj razgovora
Novi razgovor -
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.