forked from TrueCloudLab/neoneo-go
ec7e17ffa6
Simplifies a lot of code and removes some duplication. Unfortunately I had to move test_util random functions in same commit to avoid cycle dependencies. One of these random functions was also used in core/transaction testing, to simplify things I've just dropped it there and used a static string (which is nice to have for a test anyway). There is still sha256 left in wallet (but it needs to pass Hash structure into the signing function).
92 lines
2 KiB
Go
92 lines
2 KiB
Go
package crypto
|
|
|
|
import (
|
|
"errors"
|
|
|
|
"github.com/CityOfZion/neo-go/pkg/crypto/hash"
|
|
"github.com/CityOfZion/neo-go/pkg/util"
|
|
)
|
|
|
|
// MerkleTree implementation.
|
|
|
|
type MerkleTree struct {
|
|
root *MerkleTreeNode
|
|
depth int
|
|
}
|
|
|
|
// NewMerkleTree returns new MerkleTree object.
|
|
func NewMerkleTree(hashes []util.Uint256) (*MerkleTree, error) {
|
|
if len(hashes) == 0 {
|
|
return nil, errors.New("length of the hashes cannot be zero")
|
|
}
|
|
|
|
nodes := make([]*MerkleTreeNode, len(hashes))
|
|
for i := 0; i < len(hashes); i++ {
|
|
nodes[i] = &MerkleTreeNode{
|
|
hash: hashes[i],
|
|
}
|
|
}
|
|
|
|
root, err := buildMerkleTree(nodes)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
return &MerkleTree{
|
|
root: root,
|
|
depth: 1,
|
|
}, nil
|
|
}
|
|
|
|
// Root return the computed root hash of the MerkleTree.
|
|
func (t *MerkleTree) Root() util.Uint256 {
|
|
return t.root.hash
|
|
}
|
|
|
|
func buildMerkleTree(leaves []*MerkleTreeNode) (*MerkleTreeNode, error) {
|
|
if len(leaves) == 0 {
|
|
return nil, errors.New("length of the leaves cannot be zero")
|
|
}
|
|
if len(leaves) == 1 {
|
|
return leaves[0], nil
|
|
}
|
|
|
|
parents := make([]*MerkleTreeNode, (len(leaves)+1)/2)
|
|
for i := 0; i < len(parents); i++ {
|
|
parents[i] = &MerkleTreeNode{}
|
|
parents[i].leftChild = leaves[i*2]
|
|
leaves[i*2].parent = parents[i]
|
|
|
|
if i*2+1 == len(leaves) {
|
|
parents[i].rightChild = parents[i].leftChild
|
|
} else {
|
|
parents[i].rightChild = leaves[i*2+1]
|
|
leaves[i*2+1].parent = parents[i]
|
|
}
|
|
|
|
b1 := parents[i].leftChild.hash.Bytes()
|
|
b2 := parents[i].rightChild.hash.Bytes()
|
|
b1 = append(b1, b2...)
|
|
parents[i].hash = hash.DoubleSha256(b1)
|
|
}
|
|
|
|
return buildMerkleTree(parents)
|
|
}
|
|
|
|
// MerkleTreeNode represents a node in the MerkleTree.
|
|
type MerkleTreeNode struct {
|
|
hash util.Uint256
|
|
parent *MerkleTreeNode
|
|
leftChild *MerkleTreeNode
|
|
rightChild *MerkleTreeNode
|
|
}
|
|
|
|
// IsLeaf returns whether this node is a leaf node or not.
|
|
func (n *MerkleTreeNode) IsLeaf() bool {
|
|
return n.leftChild == nil && n.rightChild == nil
|
|
}
|
|
|
|
// IsRoot returns whether this node is a root node or not.
|
|
func (n *MerkleTreeNode) IsRoot() bool {
|
|
return n.parent == nil
|
|
}
|