<zimoun>yeah for sure, the issue is that in “distributed” mode, you need to specificy the source of authority. Pijul (implementing stuff à la Darc) tries to have the same resulting “database” but considering that some edges can commute.
<zimoun>Somehow Pijul extends to have more useful properties. :-)
<civodul>it's a completely different beast than a Merkle DAG, but it's definitely interesting
<zimoun>If you give a look at the paper, the current implementation is “Approach 1: signing each update“.
<zimoun>Basically, “Approach 3: Efficiently updatable hashing. Ideally, we want to take an approach that provides integrity of updates using a computation that does not depend on the size of the database or the total number of updates.”
<zimoun>then later, “Merkle trees [Mer87] provide a partial solution to this problem.”
<zimoun>So my point is that, instead of TUF and friends that do not apply for the Guix model, maybe we should take inspiration with “secure update propagation of database”.
<civodul>we do have a solution though, and one that's generally applicable :-)