Alternative construction to merkle trees

Hi Trillian team,

I want to point out a (semi-)new design for transparency logs I developed (not peer-reviewed yet) that outperforms the Merkle-tree-based design used in trillian (briefly: consistency proofs are ca 95% of the size, inclusion proofs for item `i` from the signed tree head for item `i` have constant size): https://arxiv.org/pdf/2308.15058.pdf

I suppose given the state and scope of trillian and CT there is little actionable follow-up, but as far as I know this is the first improvement over Merkle trees of this kind, so it would make sense for you to be aware of the paper. If you have any questions, or see any flaws in the construction, feel free to ping me.

Kind regards,
Aljoscha