Documentation
¶
Index ¶
Constants ¶
const LeafSize = proof.NODE_SIZE
const MaxLayers = uint(35) // result of log2( 1 TiB / 32 )
MaxLayers is the current maximum height of the rust-fil-proofs proving tree.
const MaxPiecePayload = MaxPieceSize / 128 * 127
MaxPiecePayload is the maximum amount of data that one can Write() to the Calc object, before needing to derive a Digest(). Constrained by the value of MaxLayers.
const MaxPieceSize = uint64(1 << (MaxLayers + 5))
MaxPieceSize is the current maximum size of the rust-fil-proofs proving tree.
const MinPiecePayload = uint64(65)
MinPiecePayload is the smallest amount of data for which FR32 padding has a defined result. It is not possible to derive a Digest() before Write()ing at least this amount of bytes.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Calc ¶
type Calc struct {
// contains filtered or unexported fields
}
Calc is an implementation of a commP "hash" calculator, implementing the familiar hash.Hash interface. The zero-value of this object is ready to accept Write()s without further initialization.
func NewCommPWithSize ¶
func NewCommPWithSizeForTest ¶
func (*Calc) BlockSize ¶
BlockSize is the amount of bytes consumed by the commP algorithm in one go. Write()ing data in multiples of BlockSize would obviate the need to maintain an internal carry buffer. The BlockSize of this module is 127 bytes.
func (*Calc) DigestWithSnapShot ¶
func (*Calc) Reset ¶
func (cp *Calc) Reset()
Reset re-initializes the accumulator object, clearing its state and terminating all background goroutines. It is safe to Reset() an accumulator in any state.
func (*Calc) Size ¶
Size is the amount of bytes returned on Sum()/Digest(), which is 32 bytes for this module.
func (*Calc) Sum ¶
Sum is a thin wrapper around Digest() and is provided solely to satisfy the hash.Hash interface. It panics on errors returned from Digest(). Note that unlike classic (hash.Hash).Sum(), calling this method is destructive: the internal state is reset and all goroutines kicked off by Write() are terminated.
func (*Calc) Write ¶
Write adds bytes to the accumulator, for a subsequent Digest(). Upon the first call of this method a few goroutines are started in the background to service each layer of the digest tower. If you wrote some data and then decide to abandon the object without invoking Digest(), you need to call Reset() to terminate all remaining background workers. Unlike a typical (hash.Hash).Write, calling this method can return an error when the total amount of bytes is about to go over the maximum currently supported by Filecoin.
type NodeDigest ¶
type NodeDigest struct {
Hash [32]byte // 32 bytes
}
Source Files