Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat: progress on tree constructions
- Loading branch information
1 parent
6f05d29
commit 5e1f867
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,80 @@ | ||
| // Largely taken from the CometBFT repo. | ||
| // Source: https://github.com/cometbft/cometbft/blob/main/crypto/merkle/tree.go | ||
| package utils | ||
|
|
||
| import ( | ||
| "bytes" | ||
| "crypto/sha256" | ||
| "hash" | ||
| "math/bits" | ||
|
|
||
| "github.com/cometbft/cometbft/crypto/tmhash" | ||
| ) | ||
|
|
||
| // TODO: make these have a large predefined capacity | ||
| var ( | ||
| leafPrefix = []byte{0} | ||
| innerPrefix = []byte{1} | ||
| ) | ||
|
|
||
| // HashFromByteSlices computes a Merkle tree where the leaves are the byte slice, | ||
| // in the provided order. It follows RFC-6962. | ||
| func HashFromByteSlices(items [][]byte) []byte { | ||
| return hashFromByteSlices(sha256.New(), items) | ||
| } | ||
|
|
||
| func hashFromByteSlices(sha hash.Hash, items [][]byte) []byte { | ||
| switch len(items) { | ||
| case 0: | ||
| return emptyHash() | ||
| case 1: | ||
| return leafHashOpt(sha, items[0]) | ||
| default: | ||
| k := getSplitPoint(int64(len(items))) | ||
| a := hashFromByteSlices(sha, items[:k]) | ||
| b := hashFromByteSlices(sha, items[k:]) | ||
|
|
||
| var left, right []byte | ||
| if bytes.Compare(a, b) == -1 { | ||
| left, right = a, b | ||
| } else { | ||
| right, left = a, b | ||
| } | ||
| return innerHashOpt(sha, left, right) | ||
| } | ||
| } | ||
|
|
||
| // returns tmhash(<empty>) | ||
| func emptyHash() []byte { | ||
| return tmhash.Sum([]byte{}) | ||
| } | ||
|
|
||
| // returns tmhash(0x00 || leaf) | ||
| func leafHashOpt(s hash.Hash, leaf []byte) []byte { | ||
| s.Reset() | ||
| s.Write(leafPrefix) | ||
| s.Write(leaf) | ||
| return s.Sum(nil) | ||
| } | ||
|
|
||
| func innerHashOpt(s hash.Hash, left []byte, right []byte) []byte { | ||
| s.Reset() | ||
| s.Write(innerPrefix) | ||
| s.Write(left) | ||
| s.Write(right) | ||
| return s.Sum(nil) | ||
| } | ||
|
|
||
| // getSplitPoint returns the largest power of 2 less than length | ||
| func getSplitPoint(length int64) int64 { | ||
| if length < 1 { | ||
| panic("Trying to split a tree with size < 1") | ||
| } | ||
| uLength := uint(length) | ||
| bitlen := bits.Len(uLength) | ||
| k := int64(1 << uint(bitlen-1)) | ||
| if k == length { | ||
| k >>= 1 | ||
| } | ||
| return k | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,22 @@ | ||
| package utils | ||
|
|
||
| import ( | ||
| cmtcrypto "github.com/cometbft/cometbft/crypto" | ||
| "github.com/cometbft/cometbft/crypto/secp256k1" | ||
| ) | ||
|
|
||
| const ( | ||
| SEDAKeysIndexSecp256k1 = 0 | ||
| ) | ||
|
|
||
| // SEDAKeysGenerators is a map from SEDA Key Index to the | ||
| // corresponding private key generator function. | ||
| var SEDAKeysGenerators = map[uint32]PrivKeyGenerator{ | ||
| SEDAKeysIndexSecp256k1: secp256k1GenPrivKey, | ||
| } | ||
|
|
||
| type PrivKeyGenerator func() cmtcrypto.PrivKey | ||
|
|
||
| func secp256k1GenPrivKey() cmtcrypto.PrivKey { | ||
| return secp256k1.GenPrivKey() | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.