About

Rust implementation of two dimensional Reed-Solomon merkle tree data availability scheme.

This technique is used by Celestia for their data availability sampling solution.

The scheme is described in the Fraud and Data Availability Proofs: Maximising Light Client Security and Scaling Blockchains with Dishonest Majorities.

The implementation is inspired by the rsmt go implementation.

The 2D Reed-Solomon Merkle-Tree data architecture looks like this:

Getting Started

Prerequisites

• Rust

Installation

[TODO]

Usage

[TODO]

License

This project is licensed under the MIT license.

See LICENSE for more information.

Acknowledgements

• Huge props to Celestia of course for the original implementation in Go and the paper.