rustreexo
rustreexo copied to clipboard
mit-dci
Utreexo in rust
fixes #46, #48. This fix is not backwards-compatible as the serialization encoding is changed. I have bumped the version number to reflect this.
``` #[test] fn test_display_empty() { let p = Pollard::new(); let _ = p.to_string(); } ```
``` use rustreexo::accumulator::{node_hash::NodeHash, pollard::Pollard}; #[test] fn test_pollard_serialization() { let mut p = Pollard::new(); let values = vec
I'm still trying to understand the design here, but would it be that you have a single accumulator per block or would it be feasible to have a single accumulator...
Pollard is a data structure that holds prune-able trees to represent the current accumulator, thus, creating a client that may prove arbitrary UTXOs. This PR implements a Pollard struct in...
For a node/wallet to used the rustreexo library, we need to support additional things in the current rustreexo library. - [x] add() method on stump needs to return new hashes...
This [WIP] PR implements the Pollard data structure and associated logic. TODO list: - [x] Implement basic Pollard - [x] Implement Modify as in the Go lib - [x] Make...
Pollard is an efficient implementation of the accumulator for keeping track of a subset of the whole tree. Instead of storing a proof for some leaves, it is more efficient...
This could be smaller with `hex-conservative::serde`, but unfortunately the `bitcoin-hashes/serde` feature does not enable `hex-conservative/serde`. Adding `hex-conservative` as a direct dependency in order to enable the feature would require manually...