Asynchronous verifiable information dispersal (AVID) lets a sender spread a message across $N=3F+1$ nodes such that it remains recoverable despite up to $F$ Byzantine failures. Because dispersal must complete on $N-F$ responses, standard AVID protocols fix a $(F{+}1,\, N)$ erasure code and pay a $3\times$ storage blowup, whereas a synchronous system achieves the optimal $3/2\times$. This cost is p
The query appears to conflate two distinct research concepts: Asynchronous Verifiable Information Dispersal (AVID) and eAID (Elastic Asynchronous Information Dispersal).
Asynchronous Verifiable Information Dispersal (AVID) is a protocol where a sender disperses a message across $N$ nodes (typically tolerating up to $F < N/3$ Byzantine faults) such that the data is cryptographically verifiable and recoverable. Key characteristics include: Verifiability: Ensures that stored data is consistent and correct, even if up to one-third of servers exhibit Byzantine faults. Communication Efficiency: Recent protocols achieve near-optimal communication complexity, such as $O(|M| + \kappa n^2)$ for dispersal and $O(|M| + \kappa n)$ for retrieval, relying on collision-resistant hash functions or vector commitments. * Termination and Agreement: Honest nodes eventually finish dispersal if the client is honest, and all honest nodes agree on the dispersed data.
eAID (Elastic Asynchronous Information Dispersal) is a separate algorithm focused on storage efficiency and elasticity in asynchronous systems, often tolerating up to $F < N/2$ crash faults (not necessarily Byzantine). Its key features include: Post-Dissemination Pruning: After initial dissemination, eAID allows nodes to autonomously prune redundant fragments to reduce storage overhead without compromising recoverability. Elastic Encoding: It varies the number of disseminated fragments while keeping the recovery threshold fixed, allowing the system to tune storage efficiency against latency. * No Complex Metadata: Pruning is achieved without global coordination or per-entry metadata, using a fixed Reed-Solomon scheme.
The term "eAVID" is not a standard term in the provided search results; it likely refers to a hypothetical combination or a confusion between these two distinct lines of research. AVID prioritizes cryptographic verification against Byzantine faults, while eAID prioritizes storage elasticity and pruning in asynchronous environments.
The material studies asynchronous verifiable information dispersal (AVID), a setting in which a sender disperses a message to \(N = 3F+1\) nodes so that the message can still be reconstructed in the presence of