UNPKG

@lodestar/beacon-node

Version:

A Typescript implementation of the beacon chain

194 lines 9.23 kB
import { digest as sha256Digest } from "@chainsafe/as-sha256"; import { Tree } from "@chainsafe/persistent-merkle-tree"; import { BYTES_PER_CELL, BYTES_PER_FIELD_ELEMENT, CELLS_PER_EXT_BLOB, FIELD_ELEMENTS_PER_BLOB, KZG_COMMITMENT_GINDEX0, NUMBER_OF_COLUMNS, VERSIONED_HASH_VERSION_KZG, } from "@lodestar/params"; import { signedBlockToSignedHeader } from "@lodestar/state-transition"; import { isGloasDataColumnSidecar, ssz, } from "@lodestar/types"; import { kzg } from "./kzg.js"; export function kzgCommitmentToVersionedHash(kzgCommitment) { const hash = sha256Digest(kzgCommitment); // Equivalent to `VERSIONED_HASH_VERSION_KZG + hash(kzg_commitment)[1:]` hash[0] = VERSIONED_HASH_VERSION_KZG; return hash; } export function computePreFuluKzgCommitmentsInclusionProof(fork, body, index) { const bodyView = ssz[fork].BeaconBlockBody.toView(body); const commitmentGindex = KZG_COMMITMENT_GINDEX0 + index; return new Tree(bodyView.node).getSingleProof(BigInt(commitmentGindex)); } /** * SPEC FUNCTION get_blob_sidecars * https://github.com/ethereum/consensus-specs/blob/v1.6.0-alpha.4/specs/deneb/validator.md#sidecar */ export function getBlobSidecars(config, signedBlock, blobs, proofs) { const blobKzgCommitments = signedBlock.message.body.blobKzgCommitments; if (blobKzgCommitments === undefined) { throw Error("Invalid block with missing blobKzgCommitments for computeBlobSidecars"); } const signedBlockHeader = signedBlockToSignedHeader(config, signedBlock); const fork = config.getForkName(signedBlockHeader.message.slot); return blobKzgCommitments.map((kzgCommitment, index) => { const blob = blobs[index]; const kzgProof = proofs[index]; const kzgCommitmentInclusionProof = computePreFuluKzgCommitmentsInclusionProof(fork, signedBlock.message.body, index); return { index, blob, kzgCommitment, kzgProof, signedBlockHeader, kzgCommitmentInclusionProof }; }); } /** * If the node obtains 50%+ of all the columns, it SHOULD reconstruct the full data matrix via the recover_matrix helper * See https://github.com/ethereum/consensus-specs/blob/v1.6.0-alpha.4/specs/fulu/das-core.md#recover_matrix */ export async function dataColumnMatrixRecovery(partialSidecars) { const columnCount = partialSidecars.size; if (columnCount < NUMBER_OF_COLUMNS / 2) { // We don't have enough columns to recover return null; } if (columnCount === NUMBER_OF_COLUMNS) { // full columns, no need to recover return Array.from(partialSidecars.values()); } // Sort data columns by index in ascending order before passing for kzg operations const partialSidecarsSorted = Array.from(partialSidecars.values()).sort((a, b) => a.index - b.index); const firstDataColumn = partialSidecarsSorted[0]; if (firstDataColumn == null) { // should not happen because we check the size of the cache before this throw new Error("No data column found in cache to recover from"); } const blobCount = firstDataColumn.column.length; const fullColumns = Array.from({ length: NUMBER_OF_COLUMNS }, () => new Array(blobCount)); const blobProofs = Array.from({ length: blobCount }); // https://github.com/ethereum/consensus-specs/blob/v1.6.0-alpha.4/specs/fulu/das-core.md#recover_matrix const cellsAndProofs = await Promise.all(blobProofs.map((_, blobIndex) => { const cellIndices = []; const cells = []; for (const dataColumn of partialSidecarsSorted) { cellIndices.push(dataColumn.index); cells.push(dataColumn.column[blobIndex]); } // recovered cells and proofs are of the same row/blob, their length should be NUMBER_OF_COLUMNS return kzg.asyncRecoverCellsAndKzgProofs(cellIndices, cells); })); for (let blobIndex = 0; blobIndex < blobCount; blobIndex++) { const recoveredCells = cellsAndProofs[blobIndex].cells; blobProofs[blobIndex] = cellsAndProofs[blobIndex].proofs; for (let columnIndex = 0; columnIndex < NUMBER_OF_COLUMNS; columnIndex++) { fullColumns[columnIndex][blobIndex] = recoveredCells[columnIndex]; } } const result = new Array(NUMBER_OF_COLUMNS); for (let columnIndex = 0; columnIndex < NUMBER_OF_COLUMNS; columnIndex++) { let sidecar = partialSidecars.get(columnIndex); if (sidecar) { // We already have this column result[columnIndex] = sidecar; continue; } if (isGloasDataColumnSidecar(firstDataColumn)) { sidecar = { index: columnIndex, column: fullColumns[columnIndex], kzgProofs: Array.from({ length: blobCount }, (_, rowIndex) => blobProofs[rowIndex][columnIndex]), slot: firstDataColumn.slot, beaconBlockRoot: firstDataColumn.beaconBlockRoot, }; } else { sidecar = { index: columnIndex, column: fullColumns[columnIndex], kzgCommitments: firstDataColumn.kzgCommitments, kzgProofs: Array.from({ length: blobCount }, (_, rowIndex) => blobProofs[rowIndex][columnIndex]), signedBlockHeader: firstDataColumn.signedBlockHeader, kzgCommitmentsInclusionProof: firstDataColumn.kzgCommitmentsInclusionProof, }; } result[columnIndex] = sidecar; } return result; } /** * Reconstruct blobs from a set of data columns, at least 50%+ of all the columns * must be provided to allow to reconstruct the full data matrix */ export async function reconstructBlobs(sidecars, indices) { if (sidecars.length < NUMBER_OF_COLUMNS / 2) { throw Error(`Expected at least ${NUMBER_OF_COLUMNS / 2} data columns to reconstruct blobs, received ${sidecars.length}`); } const blobCount = sidecars[0].column.length; for (const index of indices ?? []) { if (index < 0 || index >= blobCount) { throw Error(`Invalid blob index ${index}, must be between 0 and ${blobCount - 1}`); } } const indicesToReconstruct = indices ?? Array.from({ length: blobCount }, (_, i) => i); const recoveredCells = await recoverBlobCells(sidecars, indicesToReconstruct); if (recoveredCells === null) { // Should not happen because we check the column count above throw Error("Failed to recover cells to reconstruct blobs"); } const blobs = new Array(indicesToReconstruct.length); for (let i = 0; i < indicesToReconstruct.length; i++) { const blobIndex = indicesToReconstruct[i]; const cells = recoveredCells.get(blobIndex); if (!cells) { throw Error(`Failed to get recovered cells for blob index ${blobIndex}`); } blobs[i] = cellsToBlob(cells); } return blobs; } /** * Recover cells for specific blob indices from a set of data columns */ async function recoverBlobCells(partialSidecars, blobIndices) { const columnCount = partialSidecars.length; if (columnCount < NUMBER_OF_COLUMNS / 2) { // We don't have enough columns to recover return null; } const recoveredCells = new Map(); // Sort data columns by index in ascending order const partialSidecarsSorted = partialSidecars.slice().sort((a, b) => a.index - b.index); if (columnCount === NUMBER_OF_COLUMNS) { // Full columns, no need to recover for (const blobIndex of blobIndices) { // 128 cells that make up one "extended blob" row const cells = partialSidecarsSorted.map((col) => col.column[blobIndex]); recoveredCells.set(blobIndex, cells); } return recoveredCells; } await Promise.all(blobIndices.map(async (blobIndex) => { const cellIndices = []; const cells = []; for (const dataColumn of partialSidecarsSorted) { cellIndices.push(dataColumn.index); cells.push(dataColumn.column[blobIndex]); } // Recover cells for this specific blob row const recovered = await kzg.asyncRecoverCellsAndKzgProofs(cellIndices, cells); recoveredCells.set(blobIndex, recovered.cells); })); return recoveredCells; } /** * Concatenate the systematic half (columns 0‑63) of a row of cells into * the original 131072 byte blob. The parity half (64‑127) is ignored as * it is only needed for erasure‑coding recovery when columns are missing. */ function cellsToBlob(cells) { if (cells.length !== CELLS_PER_EXT_BLOB) { throw Error(`Expected ${CELLS_PER_EXT_BLOB} cells to reconstruct blob, received ${cells.length}`); } const blob = new Uint8Array(BYTES_PER_FIELD_ELEMENT * FIELD_ELEMENTS_PER_BLOB); // Only the first 64 cells hold the original bytes for (let i = 0; i < CELLS_PER_EXT_BLOB / 2; i++) { const cell = cells[i]; if (cell.length !== BYTES_PER_CELL) { throw Error(`Cell ${i} has incorrect byte size ${cell.length} != ${BYTES_PER_CELL}`); } blob.set(cell, i * BYTES_PER_CELL); } return blob; } //# sourceMappingURL=blobs.js.map