|
|
|
@ -32,19 +32,22 @@ const
|
|
|
|
|
|
|
|
|
|
type
|
|
|
|
|
SszReader* = object
|
|
|
|
|
stream: ByteStreamVar
|
|
|
|
|
stream: InputStream
|
|
|
|
|
maxObjectSize: int
|
|
|
|
|
|
|
|
|
|
SszWriter* = object
|
|
|
|
|
stream: OutputStreamVar
|
|
|
|
|
stream: OutputStream
|
|
|
|
|
|
|
|
|
|
BasicType = char|bool|SomeUnsignedInt|StUint|ValidatorIndex
|
|
|
|
|
|
|
|
|
|
SszChunksMerkelizer = ref object of RootObj
|
|
|
|
|
SszChunksMerkelizer = ref object
|
|
|
|
|
combinedChunks: array[maxChunkTreeDepth, Eth2Digest]
|
|
|
|
|
totalChunks: uint64
|
|
|
|
|
limit: uint64
|
|
|
|
|
|
|
|
|
|
SszHashingStream = ref object of OutputStream
|
|
|
|
|
merkleizer: SszChunksMerkelizer
|
|
|
|
|
|
|
|
|
|
TypeWithMaxLen*[T; maxLen: static int64] = distinct T
|
|
|
|
|
|
|
|
|
|
SizePrefixed*[T] = distinct T
|
|
|
|
@ -68,11 +71,11 @@ template sizePrefixed*[TT](x: TT): untyped =
|
|
|
|
|
SizePrefixed[T](x)
|
|
|
|
|
|
|
|
|
|
proc init*(T: type SszReader,
|
|
|
|
|
stream: ByteStreamVar,
|
|
|
|
|
stream: InputStream,
|
|
|
|
|
maxObjectSize = defaultMaxObjectSize): T =
|
|
|
|
|
T(stream: stream, maxObjectSize: maxObjectSize)
|
|
|
|
|
|
|
|
|
|
proc mount*(F: type SSZ, stream: ByteStreamVar, T: type): T =
|
|
|
|
|
proc mount*(F: type SSZ, stream: InputStream, T: type): T =
|
|
|
|
|
mixin readValue
|
|
|
|
|
var reader = init(SszReader, stream)
|
|
|
|
|
reader.readValue(T)
|
|
|
|
@ -108,7 +111,7 @@ template toSszType*(x: auto): auto =
|
|
|
|
|
elif useListType and x is List: seq[x.T](x)
|
|
|
|
|
else: x
|
|
|
|
|
|
|
|
|
|
func writeFixedSized(c: var WriteCursor, x: auto) =
|
|
|
|
|
proc writeFixedSized(c: var WriteCursor, x: auto) =
|
|
|
|
|
mixin toSszType
|
|
|
|
|
|
|
|
|
|
when x is byte:
|
|
|
|
@ -136,14 +139,14 @@ func writeFixedSized(c: var WriteCursor, x: auto) =
|
|
|
|
|
else:
|
|
|
|
|
unsupported x.type
|
|
|
|
|
|
|
|
|
|
template writeFixedSized(s: OutputStreamVar, x: auto) =
|
|
|
|
|
template writeFixedSized(s: OutputStream, x: auto) =
|
|
|
|
|
writeFixedSized(s.cursor, x)
|
|
|
|
|
|
|
|
|
|
template supports*(_: type SSZ, T: type): bool =
|
|
|
|
|
mixin toSszType
|
|
|
|
|
anonConst compiles(fixedPortionSize toSszType(default(T)))
|
|
|
|
|
|
|
|
|
|
func init*(T: type SszWriter, stream: OutputStreamVar): T =
|
|
|
|
|
func init*(T: type SszWriter, stream: OutputStream): T =
|
|
|
|
|
result.stream = stream
|
|
|
|
|
|
|
|
|
|
template enumerateSubFields(holder, fieldVar, body: untyped) =
|
|
|
|
@ -152,9 +155,9 @@ template enumerateSubFields(holder, fieldVar, body: untyped) =
|
|
|
|
|
else:
|
|
|
|
|
enumInstanceSerializedFields(holder, _, fieldVar): body
|
|
|
|
|
|
|
|
|
|
func writeVarSizeType(w: var SszWriter, value: auto) {.gcsafe.}
|
|
|
|
|
proc writeVarSizeType(w: var SszWriter, value: auto) {.gcsafe.}
|
|
|
|
|
|
|
|
|
|
func beginRecord*(w: var SszWriter, TT: type): auto =
|
|
|
|
|
proc beginRecord*(w: var SszWriter, TT: type): auto =
|
|
|
|
|
type T = TT
|
|
|
|
|
when isFixedSize(T):
|
|
|
|
|
FixedSizedWriterCtx()
|
|
|
|
@ -190,7 +193,7 @@ template endRecord*(w: var SszWriter, ctx: var auto) =
|
|
|
|
|
when ctx is VarSizedWriterCtx:
|
|
|
|
|
finalize ctx.fixedParts
|
|
|
|
|
|
|
|
|
|
func writeVarSizeType(w: var SszWriter, value: auto) =
|
|
|
|
|
proc writeVarSizeType(w: var SszWriter, value: auto) =
|
|
|
|
|
trs "STARTING VAR SIZE TYPE"
|
|
|
|
|
mixin toSszType
|
|
|
|
|
type T = type toSszType(value)
|
|
|
|
@ -227,7 +230,7 @@ func writeVarSizeType(w: var SszWriter, value: auto) =
|
|
|
|
|
writeField w, ctx, astToStr(field), field
|
|
|
|
|
endRecord w, ctx
|
|
|
|
|
|
|
|
|
|
func writeValue*(w: var SszWriter, x: auto) {.gcsafe.} =
|
|
|
|
|
proc writeValue*(w: var SszWriter, x: auto) {.gcsafe.} =
|
|
|
|
|
mixin toSszType
|
|
|
|
|
type T = type toSszType(x)
|
|
|
|
|
|
|
|
|
@ -238,7 +241,7 @@ func writeValue*(w: var SszWriter, x: auto) {.gcsafe.} =
|
|
|
|
|
else:
|
|
|
|
|
unsupported type(x)
|
|
|
|
|
|
|
|
|
|
func writeValue*[T](w: var SszWriter, x: SizePrefixed[T]) =
|
|
|
|
|
proc writeValue*[T](w: var SszWriter, x: SizePrefixed[T]) =
|
|
|
|
|
var cursor = w.stream.delayVarSizeWrite(10)
|
|
|
|
|
let initPos = w.stream.pos
|
|
|
|
|
w.writeValue T(x)
|
|
|
|
@ -260,21 +263,21 @@ template fromSszBytes*[T; N](_: type TypeWithMaxLen[T, N],
|
|
|
|
|
proc readValue*[T](r: var SszReader, val: var T) =
|
|
|
|
|
when isFixedSize(T):
|
|
|
|
|
const minimalSize = fixedPortionSize(T)
|
|
|
|
|
if r.stream[].ensureBytes(minimalSize):
|
|
|
|
|
val = readSszValue(r.stream.readBytes(minimalSize), T)
|
|
|
|
|
if r.stream.readable(minimalSize):
|
|
|
|
|
val = readSszValue(r.stream.read(minimalSize), T)
|
|
|
|
|
else:
|
|
|
|
|
raise newException(MalformedSszError, "SSZ input of insufficient size")
|
|
|
|
|
else:
|
|
|
|
|
# TODO Read the fixed portion first and precisely measure the size of
|
|
|
|
|
# the dynamic portion to consume the right number of bytes.
|
|
|
|
|
val = readSszValue(r.stream.readBytes(r.stream.endPos), T)
|
|
|
|
|
val = readSszValue(r.stream.read(r.stream.endPos), T)
|
|
|
|
|
|
|
|
|
|
proc readValue*[T](r: var SszReader, val: var SizePrefixed[T]) =
|
|
|
|
|
let length = r.stream.readVarint(uint64)
|
|
|
|
|
if length > r.maxObjectSize:
|
|
|
|
|
raise newException(SszMaxSizeExceeded,
|
|
|
|
|
"Maximum SSZ object size exceeded: " & $length)
|
|
|
|
|
val = readSszValue(r.stream.readBytes(length), T)
|
|
|
|
|
val = readSszValue(r.stream.read(length), T)
|
|
|
|
|
|
|
|
|
|
const
|
|
|
|
|
zeroChunk = default array[32, byte]
|
|
|
|
@ -321,39 +324,39 @@ func getZeroHashWithoutSideEffect(idx: int): Eth2Digest =
|
|
|
|
|
{.noSideEffect.}:
|
|
|
|
|
zeroHashes[idx]
|
|
|
|
|
|
|
|
|
|
func addChunk(merkelizer: SszChunksMerkelizer, data: openarray[byte]) =
|
|
|
|
|
func addChunk(merkleizer: SszChunksMerkelizer, data: openarray[byte]) =
|
|
|
|
|
doAssert data.len > 0 and data.len <= bytesPerChunk
|
|
|
|
|
|
|
|
|
|
if not getBitLE(merkelizer.totalChunks, 0):
|
|
|
|
|
let chunkStartAddr = addr merkelizer.combinedChunks[0].data[0]
|
|
|
|
|
if not getBitLE(merkleizer.totalChunks, 0):
|
|
|
|
|
let chunkStartAddr = addr merkleizer.combinedChunks[0].data[0]
|
|
|
|
|
copyMem(chunkStartAddr, unsafeAddr data[0], data.len)
|
|
|
|
|
zeroMem(chunkStartAddr.offset(data.len), bytesPerChunk - data.len)
|
|
|
|
|
trs "WROTE BASE CHUNK ", merkelizer.combinedChunks[0]
|
|
|
|
|
trs "WROTE BASE CHUNK ", merkleizer.combinedChunks[0]
|
|
|
|
|
else:
|
|
|
|
|
var hash = mergeBranches(merkelizer.combinedChunks[0], data)
|
|
|
|
|
var hash = mergeBranches(merkleizer.combinedChunks[0], data)
|
|
|
|
|
|
|
|
|
|
for i in 1 .. high(merkelizer.combinedChunks):
|
|
|
|
|
for i in 1 .. high(merkleizer.combinedChunks):
|
|
|
|
|
trs "ITERATING"
|
|
|
|
|
if getBitLE(merkelizer.totalChunks, i):
|
|
|
|
|
if getBitLE(merkleizer.totalChunks, i):
|
|
|
|
|
trs "CALLING MERGE BRANCHES"
|
|
|
|
|
hash = mergeBranches(merkelizer.combinedChunks[i], hash)
|
|
|
|
|
hash = mergeBranches(merkleizer.combinedChunks[i], hash)
|
|
|
|
|
else:
|
|
|
|
|
trs "WRITING FRESH CHUNK AT ", i, " = ", hash
|
|
|
|
|
merkelizer.combinedChunks[i] = hash
|
|
|
|
|
merkleizer.combinedChunks[i] = hash
|
|
|
|
|
break
|
|
|
|
|
|
|
|
|
|
inc merkelizer.totalChunks
|
|
|
|
|
inc merkleizer.totalChunks
|
|
|
|
|
|
|
|
|
|
func getFinalHash(merkelizer: SszChunksMerkelizer): Eth2Digest =
|
|
|
|
|
let limit = merkelizer.limit
|
|
|
|
|
func getFinalHash(merkleizer: SszChunksMerkelizer): Eth2Digest =
|
|
|
|
|
let limit = merkleizer.limit
|
|
|
|
|
|
|
|
|
|
if merkelizer.totalChunks == 0:
|
|
|
|
|
if merkleizer.totalChunks == 0:
|
|
|
|
|
let limitHeight = if limit != 0: bitWidth(limit - 1) else: 0
|
|
|
|
|
return getZeroHashWithoutSideEffect(limitHeight)
|
|
|
|
|
|
|
|
|
|
let
|
|
|
|
|
bottomHashIdx = firstOne(merkelizer.totalChunks) - 1
|
|
|
|
|
submittedChunksHeight = bitWidth(merkelizer.totalChunks - 1)
|
|
|
|
|
bottomHashIdx = firstOne(merkleizer.totalChunks) - 1
|
|
|
|
|
submittedChunksHeight = bitWidth(merkleizer.totalChunks - 1)
|
|
|
|
|
topHashIdx = if limit <= 1: submittedChunksHeight
|
|
|
|
|
else: max(submittedChunksHeight, bitWidth(limit - 1))
|
|
|
|
|
|
|
|
|
@ -364,12 +367,12 @@ func getFinalHash(merkelizer: SszChunksMerkelizer): Eth2Digest =
|
|
|
|
|
if bottomHashIdx != submittedChunksHeight:
|
|
|
|
|
# Our tree is not finished. We must complete the work in progress
|
|
|
|
|
# branches and then extend the tree to the right height.
|
|
|
|
|
result = mergeBranches(merkelizer.combinedChunks[bottomHashIdx],
|
|
|
|
|
result = mergeBranches(merkleizer.combinedChunks[bottomHashIdx],
|
|
|
|
|
getZeroHashWithoutSideEffect(bottomHashIdx))
|
|
|
|
|
|
|
|
|
|
for i in bottomHashIdx + 1 ..< topHashIdx:
|
|
|
|
|
if getBitLE(merkelizer.totalChunks, i):
|
|
|
|
|
result = mergeBranches(merkelizer.combinedChunks[i], result)
|
|
|
|
|
if getBitLE(merkleizer.totalChunks, i):
|
|
|
|
|
result = mergeBranches(merkleizer.combinedChunks[i], result)
|
|
|
|
|
trs "COMBINED"
|
|
|
|
|
else:
|
|
|
|
|
result = mergeBranches(result, getZeroHashWithoutSideEffect(i))
|
|
|
|
@ -377,52 +380,49 @@ func getFinalHash(merkelizer: SszChunksMerkelizer): Eth2Digest =
|
|
|
|
|
|
|
|
|
|
elif bottomHashIdx == topHashIdx:
|
|
|
|
|
# We have a perfect tree (chunks == 2**n) at just the right height!
|
|
|
|
|
result = merkelizer.combinedChunks[bottomHashIdx]
|
|
|
|
|
result = merkleizer.combinedChunks[bottomHashIdx]
|
|
|
|
|
else:
|
|
|
|
|
# We have a perfect tree of user chunks, but we have more work to
|
|
|
|
|
# do - we must extend it to reach the desired height
|
|
|
|
|
result = mergeBranches(merkelizer.combinedChunks[bottomHashIdx],
|
|
|
|
|
result = mergeBranches(merkleizer.combinedChunks[bottomHashIdx],
|
|
|
|
|
getZeroHashWithoutSideEffect(bottomHashIdx))
|
|
|
|
|
|
|
|
|
|
for i in bottomHashIdx + 1 ..< topHashIdx:
|
|
|
|
|
result = mergeBranches(result, getZeroHashWithoutSideEffect(i))
|
|
|
|
|
|
|
|
|
|
let HashingStreamVTable = OutputStreamVTable(
|
|
|
|
|
writePage: proc (s: OutputStreamVar, data: openarray[byte])
|
|
|
|
|
{.nimcall, gcsafe, raises: [Defect, IOError].} =
|
|
|
|
|
let SszHashingStreamVTable = OutputStreamVTable(
|
|
|
|
|
writePageSync: proc (s: OutputStream, data: openarray[byte])
|
|
|
|
|
{.nimcall, gcsafe, raises: [Defect, IOError].} =
|
|
|
|
|
trs "ADDING STREAM CHUNK ", data
|
|
|
|
|
SszChunksMerkelizer(s.outputDevice).addChunk(data)
|
|
|
|
|
SszHashingStream(s).merkleizer.addChunk(data)
|
|
|
|
|
,
|
|
|
|
|
flush: proc (s: OutputStreamVar) {.nimcall, gcsafe.} =
|
|
|
|
|
flushSync: proc (s: OutputStream) {.nimcall, gcsafe.} =
|
|
|
|
|
discard
|
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
func getVtableAddresWithoutSideEffect: ptr OutputStreamVTable =
|
|
|
|
|
# TODO this is a work-around for the somewhat broken side
|
|
|
|
|
# effects analysis of Nim - reading from global let variables
|
|
|
|
|
# is considered a side-effect.
|
|
|
|
|
{.noSideEffect.}:
|
|
|
|
|
unsafeAddr HashingStreamVTable
|
|
|
|
|
|
|
|
|
|
func newSszHashingStream(merkelizer: SszChunksMerkelizer): ref OutputStream =
|
|
|
|
|
new result
|
|
|
|
|
result.initWithSinglePage(pageSize = bytesPerChunk,
|
|
|
|
|
maxWriteSize = bytesPerChunk,
|
|
|
|
|
minWriteSize = bytesPerChunk)
|
|
|
|
|
result.outputDevice = merkelizer
|
|
|
|
|
result.vtable = getVtableAddresWithoutSideEffect()
|
|
|
|
|
func newSszHashingStream(merkleizer: SszChunksMerkelizer): OutputStream =
|
|
|
|
|
result = SszHashingStream(vtable: vtableAddr SszHashingStreamVTable,
|
|
|
|
|
pageSize: bytesPerChunk,
|
|
|
|
|
maxWriteSize: bytesPerChunk,
|
|
|
|
|
minWriteSize: bytesPerChunk,
|
|
|
|
|
merkleizer: merkleizer)
|
|
|
|
|
result.initWithSinglePage()
|
|
|
|
|
|
|
|
|
|
func mixInLength(root: Eth2Digest, length: int): Eth2Digest =
|
|
|
|
|
var dataLen: array[32, byte]
|
|
|
|
|
dataLen[0..<8] = uint64(length).toBytesLE()
|
|
|
|
|
hash(root.data, dataLen)
|
|
|
|
|
|
|
|
|
|
func merkelizeSerializedChunks(merkelizer: SszChunksMerkelizer,
|
|
|
|
|
func merkelizeSerializedChunks(merkleizer: SszChunksMerkelizer,
|
|
|
|
|
obj: auto): Eth2Digest =
|
|
|
|
|
var hashingStream = newSszHashingStream merkelizer
|
|
|
|
|
hashingStream.writeFixedSized obj
|
|
|
|
|
hashingStream.flush
|
|
|
|
|
merkelizer.getFinalHash
|
|
|
|
|
|
|
|
|
|
var hashingStream = newSszHashingStream merkleizer
|
|
|
|
|
{.noSideEffect.}:
|
|
|
|
|
# We assume there are no side-effects here, because the
|
|
|
|
|
# SszHashingStream is keeping all of its output in memory.
|
|
|
|
|
hashingStream.writeFixedSized obj
|
|
|
|
|
hashingStream.flush
|
|
|
|
|
merkleizer.getFinalHash
|
|
|
|
|
|
|
|
|
|
func merkelizeSerializedChunks(obj: auto): Eth2Digest =
|
|
|
|
|
merkelizeSerializedChunks(SszChunksMerkelizer(), obj)
|
|
|
|
@ -430,12 +430,12 @@ func merkelizeSerializedChunks(obj: auto): Eth2Digest =
|
|
|
|
|
func hash_tree_root*(x: auto): Eth2Digest {.gcsafe.}
|
|
|
|
|
|
|
|
|
|
template merkelizeFields(body: untyped): Eth2Digest {.dirty.} =
|
|
|
|
|
var merkelizer {.inject.} = SszChunksMerkelizer()
|
|
|
|
|
var merkleizer {.inject.} = SszChunksMerkelizer()
|
|
|
|
|
|
|
|
|
|
template addField(field) =
|
|
|
|
|
let hash = hash_tree_root(field)
|
|
|
|
|
trs "MERKLEIZING FIELD ", astToStr(field), " = ", hash
|
|
|
|
|
addChunk(merkelizer, hash.data)
|
|
|
|
|
addChunk(merkleizer, hash.data)
|
|
|
|
|
trs "CHUNK ADDED"
|
|
|
|
|
|
|
|
|
|
template addField2(field) {.used.}=
|
|
|
|
@ -448,10 +448,10 @@ template merkelizeFields(body: untyped): Eth2Digest {.dirty.} =
|
|
|
|
|
|
|
|
|
|
body
|
|
|
|
|
|
|
|
|
|
merkelizer.getFinalHash
|
|
|
|
|
merkleizer.getFinalHash
|
|
|
|
|
|
|
|
|
|
func bitlistHashTreeRoot(merkelizer: SszChunksMerkelizer, x: BitSeq): Eth2Digest =
|
|
|
|
|
trs "CHUNKIFYING BIT SEQ WITH LIMIT ", merkelizer.limit
|
|
|
|
|
func bitlistHashTreeRoot(merkleizer: SszChunksMerkelizer, x: BitSeq): Eth2Digest =
|
|
|
|
|
trs "CHUNKIFYING BIT SEQ WITH LIMIT ", merkleizer.limit
|
|
|
|
|
|
|
|
|
|
var
|
|
|
|
|
totalBytes = ByteList(x).len
|
|
|
|
@ -461,8 +461,8 @@ func bitlistHashTreeRoot(merkelizer: SszChunksMerkelizer, x: BitSeq): Eth2Digest
|
|
|
|
|
if totalBytes == 1:
|
|
|
|
|
# This is an empty bit list.
|
|
|
|
|
# It should be hashed as a tree containing all zeros:
|
|
|
|
|
let treeHeight = if merkelizer.limit == 0: 0
|
|
|
|
|
else: log2trunc(merkelizer.limit)
|
|
|
|
|
let treeHeight = if merkleizer.limit == 0: 0
|
|
|
|
|
else: log2trunc(merkleizer.limit)
|
|
|
|
|
return mergeBranches(getZeroHashWithoutSideEffect(treeHeight),
|
|
|
|
|
getZeroHashWithoutSideEffect(0)) # this is the mixed length
|
|
|
|
|
|
|
|
|
@ -485,7 +485,7 @@ func bitlistHashTreeRoot(merkelizer: SszChunksMerkelizer, x: BitSeq): Eth2Digest
|
|
|
|
|
chunkStartPos = i * bytesPerChunk
|
|
|
|
|
chunkEndPos = chunkStartPos + bytesPerChunk - 1
|
|
|
|
|
|
|
|
|
|
merkelizer.addChunk ByteList(x).toOpenArray(chunkEndPos, chunkEndPos)
|
|
|
|
|
merkleizer.addChunk ByteList(x).toOpenArray(chunkEndPos, chunkEndPos)
|
|
|
|
|
|
|
|
|
|
var
|
|
|
|
|
lastChunk: array[bytesPerChunk, byte]
|
|
|
|
@ -496,8 +496,8 @@ func bitlistHashTreeRoot(merkelizer: SszChunksMerkelizer, x: BitSeq): Eth2Digest
|
|
|
|
|
|
|
|
|
|
lastChunk[bytesInLastChunk - 1] = lastCorrectedByte
|
|
|
|
|
|
|
|
|
|
merkelizer.addChunk lastChunk.toOpenArray(0, bytesInLastChunk - 1)
|
|
|
|
|
let contentsHash = merkelizer.getFinalHash
|
|
|
|
|
merkleizer.addChunk lastChunk.toOpenArray(0, bytesInLastChunk - 1)
|
|
|
|
|
let contentsHash = merkleizer.getFinalHash
|
|
|
|
|
mixInLength contentsHash, x.len
|
|
|
|
|
|
|
|
|
|
func hashTreeRootImpl[T](x: T): Eth2Digest =
|
|
|
|
@ -555,19 +555,19 @@ func hash_tree_root*(x: auto): Eth2Digest =
|
|
|
|
|
const maxLen = x.maxLen
|
|
|
|
|
type T = type valueOf(x)
|
|
|
|
|
const limit = maxChunksCount(T, maxLen)
|
|
|
|
|
var merkelizer = SszChunksMerkelizer(limit: uint64(limit))
|
|
|
|
|
var merkleizer = SszChunksMerkelizer(limit: uint64(limit))
|
|
|
|
|
|
|
|
|
|
when T is BitList:
|
|
|
|
|
result = merkelizer.bitlistHashTreeRoot(BitSeq valueOf(x))
|
|
|
|
|
result = merkleizer.bitlistHashTreeRoot(BitSeq valueOf(x))
|
|
|
|
|
elif T is seq:
|
|
|
|
|
type E = ElemType(T)
|
|
|
|
|
let contentsHash = when E is BasicType:
|
|
|
|
|
merkelizeSerializedChunks(merkelizer, valueOf(x))
|
|
|
|
|
merkelizeSerializedChunks(merkleizer, valueOf(x))
|
|
|
|
|
else:
|
|
|
|
|
for elem in valueOf(x):
|
|
|
|
|
let elemHash = hash_tree_root(elem)
|
|
|
|
|
merkelizer.addChunk(elemHash.data)
|
|
|
|
|
merkelizer.getFinalHash()
|
|
|
|
|
merkleizer.addChunk(elemHash.data)
|
|
|
|
|
merkleizer.getFinalHash()
|
|
|
|
|
result = mixInLength(contentsHash, valueOf(x).len)
|
|
|
|
|
else:
|
|
|
|
|
unsupported T # This should never happen
|
|
|
|
@ -583,7 +583,7 @@ iterator hash_tree_roots_prefix*[T](lst: openarray[T], limit: auto):
|
|
|
|
|
# Eth1 deposit case is the only notable example -- the usual uses of a
|
|
|
|
|
# list involve, at some point, tree-hashing it -- finalized hashes are
|
|
|
|
|
# the only abstraction that escapes from this module this way.
|
|
|
|
|
var merkelizer = SszChunksMerkelizer(limit: uint64(limit))
|
|
|
|
|
var merkleizer = SszChunksMerkelizer(limit: uint64(limit))
|
|
|
|
|
for i, elem in lst:
|
|
|
|
|
merkelizer.addChunk(hash_tree_root(elem).data)
|
|
|
|
|
yield mixInLength(merkelizer.getFinalHash(), i + 1)
|
|
|
|
|
merkleizer.addChunk(hash_tree_root(elem).data)
|
|
|
|
|
yield mixInLength(merkleizer.getFinalHash(), i + 1)
|
|
|
|
|