Our project implements tree-style folding in the HyperNova folding scheme. That is, our fork of the Nexus HyperNova repo recursively applies the folding technique to the chunks of a large circuit in a binary tree, following the pattern of the Mangrove paper. We demonstrate our implementation with the generation of a folding proof of a circuit composed of 64 sub circuits, folded in 6 steps, with each tree layer folded in parallel. This method can be applied to large, structured circuits including: hash chains, signature aggregation, ZK light clients, and (eventually) a folding zkVM.