Currently the full node merge function will add the liabilities, the blinding factors, and the Pedersen commitments. We can decrease build time and memory requirements for tree build by removing the Pedersen commitments and only calculating those later when generating inclusion proofs (of course this will slightly increase inclusion proof generation time).
Currently the full node merge function will add the liabilities, the blinding factors, and the Pedersen commitments. We can decrease build time and memory requirements for tree build by removing the Pedersen commitments and only calculating those later when generating inclusion proofs (of course this will slightly increase inclusion proof generation time).