# Simple and Composite Proofs

The **BSV Unified Merkle Path (BUMP)** standard redefines how **composite proofs** are structured and verified within the BSV ecosystem.

By combining multiple transaction verifications into a **single, unified format**, BUMP significantly boosts **data efficiency** and **reduces redundancy** across the network.

***

#### Efficiency Through Consolidation

In traditional Merkle proofs, verifying multiple nearby transactions in the same block often requires **duplicating** hash nodes.

BUMP recognizes this inefficiency and introduces a **methodical approach** to consolidating proofs.

Key optimizations include:

* **Consolidated Layers** – BUMP merges essential branches and leaves into one coherent proof. It integrates the base layer of a Merkle **sub-tree** with its connection to the overall **block Merkle Root**.
* **Optimized Data Structure** – By normalizing and reusing duplicate hash nodes, BUMP produces a **compact, efficient representation** of composite proofs that saves storage and bandwidth.

***

#### Example: Composite Proof in BUMP JSON Format

Below is a simplified **JSON encoding** example illustrating how BUMP handles composite proofs.

Notice how shared nodes are reused across transactions to minimize redundancy:

<figure><img src="/files/lao8eOhoLoAnPESwPm9w" alt=""><figcaption></figcaption></figure>

This example highlights how BUMP’s **composite proof design** eliminates duplication while maintaining clarity in the proof structure.

***

#### Simplified Validation and Flexibility

Despite the added complexity of combining multiple transactions, **BUMP’s structure keeps validation simple and efficient**:

* **Simplified Validation** – The standardized architecture allows SPV wallets and verification systems to parse and confirm proofs easily, even when multiple transactions are combined.
* **Flexible Application** – BUMP supports both **composite** and **simple** proofs using the same structure, ensuring full compatibility across all levels of complexity.

This adaptability makes BUMP equally suitable for **single-transaction proofs** and **batch verification scenarios** — such as verifying multiple outputs or transactions from a single block.

***

#### Practical Implications

The introduction of composite proofs under the BUMP standard delivers several network-wide advantages:

* **Network Efficiency** – Shared nodes and optimized encoding reduce bandwidth and storage requirements, resulting in faster verification and lower network load.
* **Future-Proof Design** – BUMP’s flexible structure is built to evolve with blockchain technology, supporting new proof aggregation and compression methods as they emerge.

***

#### Key Takeaway

By introducing **composite proofs**, BUMP enhances BSV’s scalability and efficiency.\
Through **data consolidation**, **duplicate elimination**, and **standardized encoding**, BUMP streamlines verification for both wallets and developers.\
This innovation strengthens the BSV network’s ability to handle **high transaction volumes** while maintaining **trust, speed, and data integrity** at scale.


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://hub.bsvblockchain.org/higher-learning/bsv-academy/bitcoin-primitives-merkle-trees/standardised-merkle-proof/simple-and-composite-proofs.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.