Mapping protocols

Each party has a decision tree, the solution  is a convolution of their respective decision trees, leading to one of a finite paths through a set of one step exchanges.  You end up back with a graph convolution, a passage logic that tells each of the parties to jump or shift, really, down the tree.

The untrusted part come when one party drops the trade after the other commits.  This is a separate problem.   But we can ignore it, we have secure protocol convolvers.

I bring it up as a way to distinguish cash, it is a one step per party.  But if you take the idea of protocol complexity up a notch, give the decision tree a rank, then suddenly multiple parties are involved, you are in the smart layer.

A decision tree as a finite spanning graph.  This is a better model then connectors.  We can take a decision tree and append or prepend it with another decision tree.  The convolution mechanics remain the same, the composite tree remains minimum (np loops).   Then from there the new bankers can find aggregate, and typical, protocol forms, combine them and make a ledger business.

Always hire a mathematician and pay large quantities.