This commit is contained in:
arnaucube
2019-09-10 16:31:12 +02:00
parent 57fc963ef4
commit 0f9282e74e
6 changed files with 16 additions and 11 deletions

View File

@@ -1,7 +1,12 @@
[package] [package]
name = "merkletree-rs" name = "merkletree-rs"
version = "0.0.1" version = "0.0.1"
authors = ["arnaucube <arnaucube@gmail.com>"] authors = ["arnaucube <root@arnaucube.com>"]
edition = "2018"
license = "GPL-3.0"
description = "Sparse MerkleTree"
repository = "https://github.com/arnaucube/merkletree-rs"
readme = "README.md"
[dependencies] [dependencies]
tiny-keccak = "1.4.2" tiny-keccak = "1.4.2"

View File

@@ -1,4 +1,4 @@
# merkletree-rs [![Build Status](https://travis-ci.org/arnaucube/merkletree-rs.svg?branch=master)](https://travis-ci.org/arnaucube/merkletree-rs) # merkletree-rs [![Crates.io](https://img.shields.io/crates/v/merkletree-rs.svg)](https://crates.io/crates/merkletree-rs) [![Build Status](https://travis-ci.org/arnaucube/merkletree-rs.svg?branch=master)](https://travis-ci.org/arnaucube/merkletree-rs)
Sparse MerkleTree implementation in Rust. Sparse MerkleTree implementation in Rust.
The MerkleTree is optimized in the design and concepts, to have a faster and lighter MerkleTree, maintaining compatibility with a non optimized MerkleTree. In this way, the MerkleRoot of the optimized MerkleTree will be the same that the MerkleRoot of the non optimized MerkleTree. The MerkleTree is optimized in the design and concepts, to have a faster and lighter MerkleTree, maintaining compatibility with a non optimized MerkleTree. In this way, the MerkleRoot of the optimized MerkleTree will be the same that the MerkleRoot of the non optimized MerkleTree.

View File

@@ -2,7 +2,7 @@ extern crate rusty_leveldb;
use self::rusty_leveldb::DB; use self::rusty_leveldb::DB;
use constants; use super::constants;
pub struct Db { pub struct Db {
storage: DB, storage: DB,

View File

@@ -6,10 +6,10 @@ extern crate tiny_keccak;
use rustc_hex::ToHex; use rustc_hex::ToHex;
mod constants; pub mod constants;
mod db; pub mod db;
mod node; pub mod node;
mod utils; pub mod utils;
type Result<T> = std::result::Result<T, String>; type Result<T> = std::result::Result<T, String>;

View File

@@ -1,5 +1,5 @@
use constants; use super::constants;
use utils; use super::utils;
pub struct TreeNode { pub struct TreeNode {
pub child_l: [u8; 32], pub child_l: [u8; 32],

View File

@@ -1,5 +1,5 @@
use constants; use super::constants;
use node; use super::node;
use tiny_keccak::Keccak; use tiny_keccak::Keccak;
pub fn hash_vec(b: Vec<u8>) -> [u8; 32] { pub fn hash_vec(b: Vec<u8>) -> [u8; 32] {