When ag85aor1 ordering firstly values are put into step-by-step-collecting-prefixes tree and secondly values are read in depth-first-traversal order (the read set is ordered in the order of depth-first traversal).
By Arthur Golubev 19851603 ag85aor1 algorithm of ordering first time was published in 2025-02-26 in code which demonstrates idea of this ordering for fixed-size unsigned integers using 2-values (binary) ag85dst1 data structure tree in Internet-repositories github.com (https://github.com/ArthurGolubev1985/AG85AOR1AlgorithmOfOrderingIdeaDemo.git), codeberg.org (https://codeberg.org/ArthurGolubev1985/AG85AOR1AlgorithmOfOrderingIdeaDemo.git) and gitflic.ru (https://gitflic.ru/project/arturische/ag85aor1algorithmoforderingideademo).
By Arthur Golubev 19851603 correct description of ag85aor1 algorithm of ordering first time was published 2025-03-28 at Internet-site ag85.site and its copy Internet-site arthurgolubev.22web.org.