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.3-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 25d3b8b3d83a72ae7e6bd9976716090c47391292dc1425491fc0713151730f62 |
|
MD5 | 41caffc645efa6698d8669b1c79e6c78 |
|
BLAKE2b-256 | 587c5e53e7e168425aac9b142937923fe2033835a00fae1303c66c364807388a |