User blog comment:Edwin Shade/Rank-on-Rank Turing Ordinals and Beyond/@comment-26454151-20180123022125

If we're doing non-recursive countable ordinals now, then the Nish-Shade ordinal wouldn't actually be that big. Once everything is ironed out, it would still be vastly overpowered by recursively inaccessible and recursively Mahlo ordinals.