Thanks for your response.
On 23/10/25 10:43, Niels Möller via Sigsum-general wrote:
I think generating proofs corresponding to a shared tree head is generally useful. I haven't though about ways to also compact the inclusion proofs.
For the same tree head, this could be a feature of sigsum-submit (which already is rather complex). Or you could use sigsum-submit to get the entries into the log(s), and then have a separate tool that collects new proofs. For a separate tool, one could consider a sigsum-submit mode that submits items and waits for a 200 response to each leaf request, and for each item only outputs the log that it was committed to.
Thanks, it makes sense. I think here's what I'll do. Given what you say about sigsum-submit, I’d rather write a separate tool that mainly interacts with the log. Since we also need to fetch STHs programmatically for the "timestamping" use case, it could also handle fetching newer proofs for older entries, and collecting multiple proofs for either the most recent STH or a specified one.
I'll prototype it in Go using the existing components, so that later it can be decided whether it makes sense to merge it as an additional utility or keep it elsewhere.
Cheers, Giulio