Aequitas

[jaybny]

Kelkar, M., Zhang, F., Goldfeder, S., & Juels, A. (2020). Order-Fairness for Byzantine Consensus. In Advances in Cryptology – CRYPTO 2020 (pp. 451–480). Springer International Publishing. https://doi.org/10.1007/978-3-030-56877-1_16

https://eprint.iacr.org/2020/269.pdf

Paper describes transaction order fairness protocol.

4.1 Condorcet paradox and the impossibility of fair ordering.

we propose a second definition, block-order-fairness

We note that Ord can be defined using a simple alphabetical or ascending order.

in summary this can be used instead stellar consensus algorithm - as it automatically creates block of transaction where the ordering between the blocks has consensus. Then we can just use our re-ordering highested bidder technique on the orders that are "tied" - in the same block.

in this paper a "block" of transaction refers only to transactions where the ordering between then is undefined.

[jaybny]

maybe related - graph of permutations?