mirror of
https://github.com/luxfi/verkle.git
synced 2026-10-30 15:13:33 +00:00
a25b55bc90
* refactor(tree): replace []byte with ExtStem []byte for stems use StemSize instead of 31 use ExtStem instead of []byte * refactor(tree): replace key/val size with const * Update tree.go * fix grammar in error message --------- Co-authored-by: Guillaume Ballet <[email protected]>
49 lines
1.7 KiB
Go
49 lines
1.7 KiB
Go
// This is free and unencumbered software released into the public domain.
|
|
//
|
|
// Anyone is free to copy, modify, publish, use, compile, sell, or
|
|
// distribute this software, either in source code form or as a compiled
|
|
// binary, for any purpose, commercial or non-commercial, and by any
|
|
// means.
|
|
//
|
|
// In jurisdictions that recognize copyright laws, the author or authors
|
|
// of this software dedicate any and all copyright interest in the
|
|
// software to the public domain. We make this dedication for the benefit
|
|
// of the public at large and to the detriment of our heirs and
|
|
// successors. We intend this dedication to be an overt act of
|
|
// relinquishment in perpetuity of all present and future rights to this
|
|
// software under copyright law.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
|
|
// IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
|
|
// OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
|
|
// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
// OTHER DEALINGS IN THE SOFTWARE.
|
|
//
|
|
// For more information, please refer to <https://unlicense.org>
|
|
|
|
package verkle
|
|
|
|
import (
|
|
"bytes"
|
|
)
|
|
|
|
const (
|
|
KeySize = 32
|
|
LeafValueSize = 32
|
|
NodeWidth = 256
|
|
NodeBitWidth byte = 8
|
|
StemSize = 31
|
|
)
|
|
|
|
func equalPaths(key1, key2 []byte) bool {
|
|
return bytes.Equal(KeyToStem(key1), KeyToStem(key2))
|
|
}
|
|
|
|
// offset2key extracts the n bits of a key that correspond to the
|
|
// index of a child node.
|
|
func offset2key(key []byte, offset byte) byte {
|
|
return key[offset]
|
|
}
|