The security of Proof-of-Replication (as well as other Proof-of-Space schemes) relies on the best known attacks to Depth Robust Graphs.
An (e,d)-depth-robust directed acyclic graph (DAG) has the property that after removing any subset of up to e nodes (and adjacent edges) there remains a directed path of length d.
The algorithm we are using for generating Depth Robust Graph is based off the DRSample algorithm described by Alwen et. al and BucketSample by Fisch et al. and have been implemented in drgraph.rs. Both papers describe the best known attacks to these graphs.
The output of this work is to implement the current best known attacks in Rust and run them against the DRSample, BucketSample and ZigZag graphs.
The text was updated successfully, but these errors were encountered: