-
> The Merkle hash root does not indicate the tree depth, enabling a second-preimage attack in which an attacker creates a document other than the original that has the same Merkle hash root. For the e…
-
does salting members before construction prevent forgery attacks on unbalanced binary merkle trees?
Would be nice to cite a source regarding this.
rfc9162 seems unconcerned, but their tree com…
-
RFC9162 defines merkle trees with some assumptions which might not map well to selective disclosure.
This spec defines merkle trees based on basicaly the "bitcoin / bittorrent" construction + some …
-
Assuming I write code in a file merkle.py that turns a list into a (merkle) tree by doing this:
Iterate through a list of transaction hashes recursively, get two consecutive hashes at a time, hash …
-
**Github username:** --
**Twitter username:** --
**Submission hash (on-chain):** 0x1fa8659dd2efe45d37c0008b42ac8093589363ff81837b5dd011af77e6e2347e
**Severity:** high
**Description:**
**Description*…
-
https://support.github.com/contact/report-abuse?category=report-content&report=BingX-API&report_content_url=https%3A%2F%2Fgithub.com%2FBingX-API%2FBingX-proof-of-reserves&report_id=63694385&report_typ…
-
## Summary
Merkle tree, valid roots and last sync blocks are necessary to generate and validate proof.
This information is retrieved from the blockchain.
Accessing the blockchain represent seve…
-
#21
-
## Context
The emulator is starting to be used to create "reader nodes" in production for some dapps where it advances and saves a machine snapshot, then when an inspect comes the saved machine sna…
-
I am generating a merkle tree with a few hundred thousand leaves. Once I have the final tree, I would like to save it to a file and reload it. So far I've generated the leaves and saved them to a JSO…