-
Can we avoid merge conflicts and decrease maintenance costs for updating to upstream (tendermint) master by using `replace`?
- https://golang.org/ref/mod#go
- https://github.com/golang/go/wiki/Mo…
-
In https://github.com/lazyledger/lazyledger-specs/blob/master/specs/data_structures.md#binary-merkle-tree
we state:
> Binary Merkle trees are constructed in the same fashion as described in Certifi…
-
## Description
Currently tendermint uses simple merkle tree to compute "data hash" (what we currently call `availableDataRoot` in [the spec](https://github.com/LazyLedger/lazyledger-specs/blob/mast…
-
Also: should recover_parity_chunks_too be merged with master branch?
-
https://github.com/lazyledger/lazyledger-specs/blob/master/specs/data_structures.md#sparse-merkle-tree
> For leaf node of leaf message m with key k, its value v is:
Better to use a different wor…
-
This tendermint fork was renamed and lives under a different organization. Some trivial changes are necessary to make this repository useable (and not still use the orig tendermint
- [x] replace pat…
-
In building LazyLedger, we would like to use Tendermint for two purposes, that are somewhat independent from each other, that requires a different set of modifications:
1. **Optimistic rollups.** A…
-
This issue drafts changes of a first iteration of modifying the block header to support data availability proofs.
Basically be a variant of what we spec'ed out in https://github.com/LazyLedger/laz…
-
Define scope of the spec via chapters/structure.
-
LazyLedger, as all blockchains uses numerous cryptographic primitives (most notably, hash functions and ecdsa or other cryptographic signature algorithms, e.g. BLS).
We need to choose among these an…