Applicative Bootloader is a Cairo0 program designed to aggregate and merge proofs in a tree-like structure. It performs two main tasks: verifying child proofs and applying merge operations on the outputs of child proofs. The process involves:
- Verification: Verifying the child proofs and extracting their outputs.
- Aggregation: Applying aggregation logic to the outputs, producing a final result from the Applicative Bootloader's run.
The trace of this run is then proven, allowing the data structure to continue building the next level.
The bootloader operates in two stages:
- Proof Verification and Output Extraction: A Cairo0 verifier multi-task bootloader verifies multiple proofs.
- Output Aggregation: A single-task bootloader applies the output aggregation logic to the extracted outputs.
The primary use case for the Applicative Bootloader is to merge multiple task proofs into a single proof that is scalable for an arbitrary number of tasks, optimizing public memory usage, preventing it from growing indefinitely as the complexity of the proof tree increases and applying custom aggregation logic defined externally.
