pb

type Proof struct {
	// Start index of the leaves that match the queried namespace.ID.
	Start int64 `protobuf:"varint,1,opt,name=start,proto3" json:"start,omitempty"`
	// End index (non-inclusive) of the leaves that match the queried
	// namespace.ID.
	End int64 `protobuf:"varint,2,opt,name=end,proto3" json:"end,omitempty"`
	// Nodes hold the tree nodes necessary for the Merkle range proof.
	Nodes [][]byte `protobuf:"bytes,3,rep,name=nodes,proto3" json:"nodes,omitempty"`
	// leaf_hash contains the namespace.ID if NMT does not have it and
	// it should be proven. LeafHash is necessary to prove the Absence Proof.
	// This field will be empty in case of Inclusion Proof.
	LeafHash []byte `protobuf:"bytes,4,opt,name=leaf_hash,json=leafHash,proto3" json:"leaf_hash,omitempty"`
	// The is_max_namespace_ignored flag influences the calculation of the
	// namespace ID range for intermediate nodes in the tree.
	IsMaxNamespaceIgnored bool `` /* 129-byte string literal not displayed */
}