> ## Documentation Index
> Fetch the complete documentation index at: https://docs.parallaxprotocol.org/llms.txt
> Use this file to discover all available pages before exploring further.

# Data Structures & Encoding

Parallax creates, stores and transfers large volumes of data. This data must get formatted in standardized and memory-efficient ways to allow anyone to run a node on relatively modest consumer-grade hardware. To achieve this, several specific data structures are used on the Parallax stack.

## Prerequisites

You should understand the fundamentals of Parallax and [client software](/protocol/foundational-topics/nodes-and-clients). Familiarity with the networking layer and [the Ethereum whitepaper](https://ethereum.org/en/whitepaper/) is recommended.

## Data structures

### Patricia merkle tries

Patricia Merkle Tries are structures that encode key-value pairs into a deterministic and cryptographically authenticated trie. These are used extensively across Parallax.

[More on Patricia Merkle Tries](/protocol/advanced/data-structures/patricia-trie)

### Recursive Length Prefix

Recursive Length Prefix (RLP) is a serialization method used extensively across Parallax.

[More on RLP](/protocol/advanced/data-structures/rlp)

***

*Adapted from [Data structures and encoding](https://ethereum.org/developers/docs/data-structures-and-encoding/) on ethereum.org, © ethereum.org contributors, under the MIT License. See the [third-party notices](https://github.com/ParallaxProtocol/parallax-docs/blob/main/THIRD_PARTY_NOTICES.md).*


This documentation is built and hosted on [Mintlify](https://mintlify.com), a developer documentation platform.