eth2.0-specs/specs/simple-serialize.md

5.3 KiB

SimpleSerialiZe (SSZ)

This is a work in progress describing typing, serialization and Merkleization of Ethereum 2.0 objects.

Table of contents

Constants

Name Value Description
LENGTH_BYTES 4 Number of bytes for the length of variable-length serialized objects.
MAX_LENGTH 2**(8 * LENGTH_BYTES) Maximum serialization length.

Typing

Basic types

  • uintN: N-bit unsigned integer (where N in [8, 16, 32, 64, 128, 256])
  • bool: 1-bit unsigned integer

Composite types

  • container: ordered heterogenous collection of values
  • tuple: ordered fixed-length homogeneous collection of values
  • list: ordered variable-length homogenous collection of values

Notation

  • container: key-pair curly braket notation {} (e.g. {'key1': uint64, 'key2': bool})
  • tuple: angle braket notation [N] (e.g. uint64[N])
  • list: angle braket notation [] (e.g. uint64[])

Aliases

For convenience we alias:

  • byte to uint8
  • bytes to byte[]
  • bytesN to byte[N]
  • bit to bool

Serialization

We reccursively define the serialize function which consumes an object value (of the type specified) and returns a byte string of type bytes.

uintN

assert N in [8, 16, 32, 64, 128, 256]
return value.to_bytes(N // 8, 'little')

bool

assert value in (True, False)
return b'\x01' if value is True else b'\x00'

Containers, tuples, lists

serialized_bytes = ''.join([serialize(element) for element in value])
assert len(serialized_bytes) < MAX_LENGTH
serialized_length = len(serialized_bytes).to_bytes(LENGTH_BYTES, 'little')
return serialized_length + serialized_bytes

Deserialization

Given a type, serialization is an injective function from objects of that type to byte strings. That is, deserialization—the inverse function—is well-defined.

Merkleization

We first define helper functions:

  • pack: Given ordered objects of the same basic type, serialize them, pack them into 32-byte chunks, right-pad the last chunk with zero bytes, and return the chunks.
  • merkleize: Given ordered 32-byte chunks, right-pad them with zero chunks to the next power of two, Merkleize the chunks, and return the root.
  • mix_in_length: Given a Merkle root root and a length length (32-byte little-endian serialization) return hash(root + length).

Let value be an object. We now define object Merkleization hash_tree_root(value) recursively:

  • merkleize(pack(value)) if value is a basic object or a tuple of basic objects
  • mix_in_length(merkleize(pack(value)), len(value)) if value is a list of basic objects
  • merkleize([hash_tree_root(element) for element in value]) if value is a tuple of composite objects or a container
  • mix_in_length(merkleize([hash_tree_root(element) for element in value]), len(value)) if value is a list of composite objects

Self-signed containers

Let container be a self-signed container object. The convention is that the signature (e.g. a bytes96 BLS12-381 signature) be the last field of container. Further, the signed message for container is signed_root(container) = hash_tree_root(truncate_last(container)) where truncate_last truncates the last element of container.

Implementations

Language Project Maintainer Implementation
Python Ethereum 2.0 Ethereum Foundation https://github.com/ethereum/py-ssz
Rust Lighthouse Sigma Prime https://github.com/sigp/lighthouse/tree/master/beacon_chain/utils/ssz
Nim Nimbus Status https://github.com/status-im/nim-beacon-chain/blob/master/beacon_chain/ssz.nim
Rust Shasper ParityTech https://github.com/paritytech/shasper/tree/master/util/ssz
Javascript Lodestart Chain Safe Systems https://github.com/ChainSafeSystems/ssz-js/blob/master/src/index.js
Java Cava ConsenSys https://www.github.com/ConsenSys/cava/tree/master/ssz
Go Prysm Prysmatic Labs https://github.com/prysmaticlabs/prysm/tree/master/shared/ssz
Swift Yeeth Dean Eigenmann https://github.com/yeeth/SimpleSerialize.swift
C# Jordan Andrews https://github.com/codingupastorm/csharp-ssz
C++ https://github.com/NAKsir-melody/cpp_ssz