Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Dynamic Hierarchical Deterministic Key Trees |
|---|---|
| What the text proposes | A desk note on BIP 83 (Dynamic Hierarchical Deterministic Key Trees). The file's status is Closed. The note records the text. It does not measure who runs it. |
| Who may write | Eric Lombrozo |
| What is settled | The file's own opening line says: This BIP defines a scheme for key derivation that allows for dynamic creation of key hierarchies based on the algorithm described in BIP32. |
| Load-bearing assumption | Status Closed is not evidence that any node you run has shipped the change. |
| What this library says afterwards | Status on the file: Closed. A reading of the public text, not a client release note. |
| Rights | Licensed for redistribution |