AG85AOR1 ordering is a way of ordering values in binary presentation. When ordering by this way ag85dst1 tree is used.

As a first step of ag85aor1 ordering values are to be put into ag85dst1 tree and then both link-by-link reading from the tree in zero-marking-descender-first depth-first order with hierarchically sharing prefixes among values automatically provides bit-by-bit presentations of values in increasing order and link-by-link reading from the tree in one-marking-descender-first depth-first order with hierarchically sharing prefixes among values automatically provides bit-by-bit presentations of values in decreasing order.

There is published in 2025-02-26 code which demonstrates idea of this ordering in public repository services github.com (https://github.com/ArthurGolubev1985/FastOrderingIdeaDemo), codeberg.org (https://codeberg.org/ArthurGolubev1985/FastOrderingIdeaDemo) and gitflic.ru (https://gitflic.ru/project/arturische/fastorderingideademo).