Efficient transaction retrieval beyond limit

[paberr]

Libmdbx supports set_lowerbound on cursors, which allows to seek to a specific duplicate data item efficiently.
This is because duplicate items are represented as another B+Tree.

We can thus also retrieve older transaction history efficiently.