2023-04-13 19:11:40 +00:00
|
|
|
# beacon_chain
|
|
|
|
# Copyright (c) 2018-2023 Status Research & Development GmbH
|
|
|
|
# Licensed and distributed under either of
|
|
|
|
# * MIT license (license terms in the root directory or at https://opensource.org/licenses/MIT).
|
|
|
|
# * Apache v2 license (license terms in the root directory or at https://www.apache.org/licenses/LICENSE-2.0).
|
|
|
|
# at your option. This file may not be copied, modified, or distributed except according to those terms.
|
|
|
|
|
|
|
|
{.push raises: [].}
|
|
|
|
|
2023-08-29 16:46:25 +00:00
|
|
|
import ../spec/datatypes/deneb
|
|
|
|
from std/sequtils import mapIt
|
|
|
|
from std/strutils import join
|
2023-04-13 19:11:40 +00:00
|
|
|
|
|
|
|
const
|
|
|
|
MaxBlobs = SLOTS_PER_EPOCH * MAX_BLOBS_PER_BLOCK
|
|
|
|
|
|
|
|
type
|
|
|
|
BlobQuarantine* = object
|
2023-08-29 16:46:25 +00:00
|
|
|
blobs*: OrderedTable[(Eth2Digest, BlobIndex), ref BlobSidecar]
|
2023-04-28 12:57:35 +00:00
|
|
|
BlobFetchRecord* = object
|
|
|
|
block_root*: Eth2Digest
|
|
|
|
indices*: seq[BlobIndex]
|
2023-04-13 19:11:40 +00:00
|
|
|
|
2023-04-28 12:57:35 +00:00
|
|
|
func shortLog*(x: seq[BlobIndex]): string =
|
|
|
|
"<" & x.mapIt($it).join(", ") & ">"
|
|
|
|
|
|
|
|
func shortLog*(x: seq[BlobFetchRecord]): string =
|
|
|
|
"[" & x.mapIt(shortLog(it.block_root) & shortLog(it.indices)).join(", ") & "]"
|
2023-04-13 19:11:40 +00:00
|
|
|
|
|
|
|
func put*(quarantine: var BlobQuarantine, blobSidecar: ref BlobSidecar) =
|
|
|
|
if quarantine.blobs.lenu64 > MaxBlobs:
|
2023-08-29 16:46:25 +00:00
|
|
|
# FIFO if full. For example, sync manager and request manager can race to
|
|
|
|
# put blobs in at the same time, so one gets blob insert -> block resolve
|
|
|
|
# -> blob insert sequence, which leaves garbage blobs.
|
|
|
|
var oldest_blob_key: (Eth2Digest, BlobIndex)
|
|
|
|
for k in quarantine.blobs.keys:
|
|
|
|
oldest_blob_key = k
|
|
|
|
break
|
|
|
|
quarantine.blobs.del oldest_blob_key
|
2023-04-13 19:11:40 +00:00
|
|
|
discard quarantine.blobs.hasKeyOrPut((blobSidecar.block_root,
|
|
|
|
blobSidecar.index), blobSidecar)
|
|
|
|
|
|
|
|
func blobIndices*(quarantine: BlobQuarantine, digest: Eth2Digest):
|
|
|
|
seq[BlobIndex] =
|
|
|
|
var r: seq[BlobIndex] = @[]
|
2023-04-28 12:57:35 +00:00
|
|
|
for i in 0..<MAX_BLOBS_PER_BLOCK:
|
2023-04-13 19:11:40 +00:00
|
|
|
if quarantine.blobs.hasKey((digest, i)):
|
|
|
|
r.add(i)
|
|
|
|
r
|
|
|
|
|
2023-08-29 16:46:25 +00:00
|
|
|
func hasBlob*(quarantine: BlobQuarantine, blobSidecar: BlobSidecar): bool =
|
2023-04-13 19:11:40 +00:00
|
|
|
quarantine.blobs.hasKey((blobSidecar.block_root, blobSidecar.index))
|
|
|
|
|
|
|
|
func popBlobs*(quarantine: var BlobQuarantine, digest: Eth2Digest):
|
|
|
|
seq[ref BlobSidecar] =
|
|
|
|
var r: seq[ref BlobSidecar] = @[]
|
2023-04-28 12:57:35 +00:00
|
|
|
for i in 0..<MAX_BLOBS_PER_BLOCK:
|
2023-04-13 19:11:40 +00:00
|
|
|
var b: ref BlobSidecar
|
|
|
|
if quarantine.blobs.pop((digest, i), b):
|
|
|
|
r.add(b)
|
|
|
|
r
|
|
|
|
|
|
|
|
func hasBlobs*(quarantine: BlobQuarantine, blck: deneb.SignedBeaconBlock):
|
|
|
|
bool =
|
|
|
|
let idxs = quarantine.blobIndices(blck.root)
|
2023-08-27 07:45:24 +00:00
|
|
|
if len(blck.message.body.blob_kzg_commitments) != len(idxs):
|
2023-04-13 19:11:40 +00:00
|
|
|
return false
|
2023-04-28 19:27:28 +00:00
|
|
|
for i in 0..<len(idxs):
|
2023-04-13 19:11:40 +00:00
|
|
|
if idxs[i] != uint64(i):
|
|
|
|
return false
|
|
|
|
true
|
2023-04-28 12:57:35 +00:00
|
|
|
|
|
|
|
func blobFetchRecord*(quarantine: BlobQuarantine, blck: deneb.SignedBeaconBlock):
|
|
|
|
BlobFetchRecord =
|
|
|
|
var indices: seq[BlobIndex]
|
|
|
|
for i in 0..<len(blck.message.body.blob_kzg_commitments):
|
|
|
|
let idx = BlobIndex(i)
|
|
|
|
if not quarantine.blobs.hasKey((blck.root, idx)):
|
|
|
|
indices.add(idx)
|
|
|
|
BlobFetchRecord(block_root: blck.root, indices: indices)
|