This may be a niche thing, but hopefully interesting to some people.

At my previous job, I spent quite a bit of time implementing a production-quality multi-party ECDSA protocol, described in the corresponding whitepaper in terms of rounds. This is ubiquitous in cryptography papers, but the amount of problems I encountered made me consider an alternative approach --- computation graphs. Let the rounds be a low-level detail and only worry about dependencies between data.

ayatori is a framework for writing protocols in such a way. The mdbook enumerates the problems with the round-based approach, introduces the protocol graph notation, and demonstrates how to write, run, and test a protocol.

I made a release just to allow the mdbook link to docs.rs, but there are still some problems to tackle until the API is complete.…