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

SimpleSerialiZe (SSZ)

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

Table of contents

• Constants
• Typing
  • Basic types
  • Composite types
  • Aliases
• Serialization
  • "uintN"
  • "bool"
  • Vectors, containers, lists
• Deserialization
• Merkleization
• Self-signed containers
• Implementations

Constants

Name	Value	Description
BYTES_PER_CHUNK	32	Number of bytes per chunk.
BYTES_PER_LENGTH_PREFIX	4	Number of bytes per serialized length prefix.

Typing

Basic types

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

Composite types

• container: ordered heterogenous collection of values
  • key-pair curly bracket notation {}, e.g. {"foo": "uint64", "bar": "bool"}
• vector: ordered fixed-length homogeneous collection of values
  • angle bracket notation [type, N], e.g. ["uint64", N]
• list: ordered variable-length homogenous collection of values
  • angle bracket notation [type], e.g. ["uint64"]

We recursively define "variable-size" types to be lists and all types that contains a variable-size type. All other types are said to be "fixed-size".

Aliases

For convenience we alias:

• "byte" to "uint8" (this is a basic type)
• "bytes" to ["byte"] (this is not a basic type)
• "bytesN" to ["byte", N] (this is not a basic type)

Serialization

We recursively define the serialize function which consumes an object value (of the type specified) and returns a bytestring of type "bytes".

Note: In the function definitions below (serialize, hash_tree_root, signed_root, etc.) objects implicitly carry their type.

Basic Types

For basic types the serialize function is defined as follows.

"uintN"

A byte string of width N // 8 containing the little-endian encode integer.

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

"bool"

• The byte \x00 if the value is False
• The byte \x01 if the value is True

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

Composite Types (Vectors, Containers and Lists)

The serialized representation of composite types is comprised of two binary segments.

• The first segment is fixed size for all types, containing the concatenation of either
  • The serialized representation of value for each of the fixed size types
  • The "uint32" serialized offset where the serialized representation of the variable sized type is located in the second section.
• The second segment contains the concatenation of the serialized representations of only the variable size types.
  • This section is empty in the case of a purely fixed size type.

"vector", "container" and "list"

An implementation of the serialize function for "Vector", "Container" and "List" types would take the following form.

# The second section is just the concatenation of the serialized *variable size* elements
section_2_parts = [serialize(element) for element in value if is_variable_size(element)]
section_2_lengths = [len(part) for part in section_2_parts]
section_2 ''.join(section_2_parts)

# Serialize the *fixed size* elements
section_1_fixed_parts = [serialize(element) for element in value if is_fixed_size(element)]

# Compute the length of the first section
section_1_length = sum(len(part) for part in section_1_fixed_parts) + 4 * len(section_2_parts)

# Compute the offset values for each part of the second section
section_1_offsets = [
    section_1_length + sum(section_2_lengths[:index])
    for index in range(len(section_2_parts))
]
assert all(offset < 2**32 for offset in section_1_offsets)

# compute the appropriate indices for *fixed size* elements for the first section
fixed_size_element_indices = [index for index, element in enumerate(value) if is_fixed_size(element)]

# compute the appropriate indices for the offsets of the *variable size* elements
variable_size_element_indices = [index for index, element in enumerate(value) if is_variable_size(element)]

# create a list with placeholders for all values
section_1_parts = [None] * len(value)

# populate all of the serialized *fixed size* elements
for index, data in zip(fixed_size_element_indices, section_1_fixed_parts):
    section_1_parts[index] = data

# populate all of the serialized offsets for the *variable size* elements
for index, offset in zip(variable_size_element_indices, section_1_offsets):
    section_1_parts[index] = serialize(offset)

assert not any(part is None for part in section_1_parts)
section_1 = ''.join(section_1_parts)

return ''.join([section_1, section_2])

Deserialization

Because serialization is an injective function (i.e. two distinct objects of the same type will serialize to different values) any bytestring has at most one object it could deserialize to. Efficient algorithms for computing this object can be found in the implementations.

Merkleization

We first define helper functions:

• pack: Given ordered objects of the same basic type, serialize them, pack them into BYTES_PER_CHUNK-byte chunks, right-pad the last chunk with zero bytes, and return the chunks.
• merkleize: Given ordered BYTES_PER_CHUNK-byte chunks, if necessary append zero chunks so that the number of chunks is a power of two, Merkleize the chunks, and return the root.
• mix_in_length: Given a Merkle root root and a length length ("uint256" little-endian serialization) return hash(root + length).

We now define Merkleization hash_tree_root(value) of an object value recursively:

• merkleize(pack(value)) if value is a basic object or a vector 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 vector 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 value be a self-signed container object. The convention is that the signature (e.g. a "bytes96" BLS12-381 signature) be the last field of value. Further, the signed message for value is signed_root(value) = hash_tree_root(truncate_last(value)) where truncate_last truncates the last element of value.

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