Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func GetterWithRandSquare ¶ added in v0.6.2
GetterWithRandSquare provides a share.Getter filled with 'n' NMT trees of 'n' random shares, essentially storing a whole square.
func Node ¶
func Node(dn *availability_test.TestDagNet) *availability_test.TestNode
Node creates a new empty Full Node.
func RandNode ¶
func RandNode(dn *availability_test.TestDagNet, squareSize int) (*availability_test.TestNode, *share.Root)
RandNode creates a Full Node filled with a random block of the given size.
Types ¶
type ShareAvailability ¶
type ShareAvailability struct {
// contains filtered or unexported fields
}
ShareAvailability implements share.Availability using the full data square recovery technique. It is considered "full" because it is required to download enough shares to fully reconstruct the data square.
func NewShareAvailability ¶
func NewShareAvailability( store *eds.Store, getter share.Getter, disc *discovery.Discovery, ) *ShareAvailability
NewShareAvailability creates a new full ShareAvailability.
func TestAvailability ¶
func TestAvailability(t *testing.T, getter share.Getter) *ShareAvailability
func (*ShareAvailability) SharesAvailable ¶
func (fa *ShareAvailability) SharesAvailable(ctx context.Context, header *header.ExtendedHeader) error
SharesAvailable reconstructs the data committed to the given Root by requesting enough Shares from the network.
Source Files
Click to show internal directories.
Click to hide internal directories.