shared

Documentation

Overview

nolint

Index

• Constants
• func FiatShamir(challenge []byte, spaceSize uint64, securityParam uint8) map[uint64]bool
• func MakeLabelFunc() ...
• func Retry(retryable func() error, numRetries int, interval time.Duration, ...) error
• type MerkleProof
  • func (t *MerkleProof) DecodeScale(dec *scale.Decoder) (total int, err error)
  • func (t *MerkleProof) EncodeScale(enc *scale.Encoder) (total int, err error)

Constants

const (
	// T is the security param which determines the number of leaves
	// to be included in a non-interactive proof.
	T uint8 = 150

	// OwnerReadWrite is a standard owner read / write file permission.
	OwnerReadWrite = os.FileMode(0o600)
)

Functions

func FiatShamir

func FiatShamir(challenge []byte, spaceSize uint64, securityParam uint8) map[uint64]bool

FiatShamir generates a set of indices to include in a non-interactive proof.

func MakeLabelFunc

func MakeLabelFunc() func(hash func(data []byte) []byte, labelID uint64, leftSiblings [][]byte) []byte

MakeLabelFunc returns a function which generates a PoET DAG label by concatenating a representation of the labelID with the list of left siblings and then hashing the result using the provided hash function.

⚠️ The resulting function is NOT thread-safe, however different generated instances are independent. The code is optimized for performance and memory allocations.

func Retry

func Retry(retryable func() error, numRetries int, interval time.Duration, logger func(msg string)) error

Retry provides generic capability for retryable function execution.

Types

type MerkleProof

type MerkleProof struct {
	Root         []byte
	ProvenLeaves [][]byte
	ProofNodes   [][]byte
}

func (*MerkleProof) DecodeScale

func (t *MerkleProof) DecodeScale(dec *scale.Decoder) (total int, err error)

func (*MerkleProof) EncodeScale

func (t *MerkleProof) EncodeScale(enc *scale.Encoder) (total int, err error)