Lets assume that there is a decentralized network $N$ with participants $A,B,C, D$ and that there was a message $m$ that all of $A,B,C,D$ agreed to. An outsider $X$ wants to know via signatures that $m$ was indeed agreed to by all of $N$.
Is there a way of combining the signatures of $A,B,C,D$ such that $X$ just has to check one signature? So if $m$ arrives at $A$ first, then $B,C, D$ they sign $D(C(B(A(m))))$ which would translate into $N(m)$ which $X$ only had to check once regardless of the order of $A,B,C,D$ in $D(C(B(A(m))))$? Is there any literature on this or does such an algorithm not exist (yet)?