ComputeDealPlacement takes in PieceInfos with Comm and Size, computes their placement in the tree and them in form of merkletree.CommAndLoc also returns number of bytes required and any errors.

DataSegmentIndexStartOffset takes in the padded size of the deal and returns the starting offset of data segment index in unpadded units.

MaxIndexEntriesInDeal defines the maximum number of index entries in for a given size of a deal.

NewAggregate creates the structure for verifiable deal aggregation based on target deal size and subdeals that should be included.

ParseDataSegmentIndex takes in a reader of of unppaded deal data, it should start at offset returned by DataSegmentIndexStartOffset After parsing use IndexData#ValidEntries() to gather valid data segments.

SegmentRoot computes the root of the client's segment's subtree treeDepth is the depth of the tree where the client segment is located segmentSize is the amount of leafs needed for the client's segment segmentOffset is the index of the first leaf where the client's segment starts.

SerializeIndex encodes a data segment Inclusion into a byte array, after validating that the structure is valid.

VerifierDataForPieceInfo returns information provided by the verifier based on PieceInfo.

DataAggregationProof is the top level proof structure provided by the aggregator after the deal lands on chain.

InclusionAuxData is required for verification of the proof and needs to be cross-checked with the chain state.

InclusionPoof is produced by the aggregator (or possibly by the SP).

InclusionVerifierData is the information required for verification of the proof and is sourced from the client.

SegmentDesc contains a data segment description to be contained as two Fr32 elements in 2 leaf nodes of the data segment index.