On tables that show trees (e.g. /tree), we can sort and search by commit hash or tag, but the hash is only shown if the commit has no tag;
I suggest exposing both to the user (using abbreviated commit hash, probably), allowing sort by tag only (commit hash sorting is hardly useful), filtering by tagged commits, and visual verification that the displayed commit has the correct hash.
On tables that show trees (e.g.
/tree), we can sort and search by commit hash or tag, but the hash is only shown if the commit has no tag;I suggest exposing both to the user (using abbreviated commit hash, probably), allowing sort by tag only (commit hash sorting is hardly useful), filtering by tagged commits, and visual verification that the displayed commit has the correct hash.