BIP352: PSBT support

The discussion revolves around the optimization of storing proofs in a system, specifically questioning the feasibility of maintaining a cumulative or running sum of Discrete Logarithm Equality (DLEQ) proofs, rather than having to store individual proofs for each input and output. This approach is favored as it would streamline the process and reduce storage requirements, highlighting a need for efficiency in handling proofs within the system.

Furthermore, there's an openness to the idea of attaching a proof with each input as a possible solution, although the preference leans towards finding a more consolidated method like the running proof sum. The exploration of other systems and protocols for potential solutions is also mentioned, with a specific reference to reviewing the Musig2 Partially Signed Bitcoin Transactions (PSBT) Bitcoin Improvement Proposal (BIP) draft. The aim here is to draw parallels and possibly adopt strategies from Musig2's approach, which is believed to share conceptual similarities with the current challenge being addressed. This indicates a proactive strategy in seeking out and learning from existing methodologies to apply to their own system’s needs.