Typed mutable SSZ views over cached and immutable binary merkle trees
Project description
remerkleable
Re-merkle-able: Typed mutable SSZ views over cached and immutable binary Merkle trees.
Features
- Types:
custom byte-vector view for Python bytes-like behavior
bitfields: bitlist, bitvector
list, container, vector
basic types
- Functionality:
Serialize all types. Into output stream (returning the written count) and as bytes
Deserialize all types. From input stream (and scope) and from bytes
Hash-tree-root all types
- Merkle-based data-sharing:
every view can be initialized/backed by a binary Merkle tree
complex views have backings, and can share data.
complex views provide a nice mutable interface, and replace their backing. And this also works for child-views through view-hooks.
SSZ-Partials: if a partial proof is loaded as backing, a view can be overlaid, and the partial backing works as long as no excluded branches are accessed.
- Calculate byte lengths:
Type min/max byte length
Byte length for fixed-length types
Output byte length for a value, without serializing
Navigation: construct paths from types, and convert to generalized indices.
History: traverse a sequence of nodes, and get the changelog for a given subtree location.
Project Links
Also see
Contact
Author: @protolambda
License
MIT, see LICENSE file.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Hashes for remerkleable-0.1.8-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | f2740a1ad846a9ff7c8530cf31d110ae43fca5053e49043e11ab36c710d1572f |
|
MD5 | 83cc3ddbf042f5d8915f876e9d26f70f |
|
BLAKE2b-256 | 6aef52bd60ff46cf6be012e18d60bec0f02c555dd965d64242f7799096a2509a |