METASHREW provides an implementation of using BST structures for searchable sat ranges.
There is no use of hardcoded block subsidies in the METASHREW implementation of ordinals, so it is compatible with Dogecoin, in addition to Bitcoin. This also enables any BTC-compatible format to be indexed for ordinality with the same program, regardless of the block reward structure of the host network.
The repository is hosted at:
Metaprotocols running on METASHREW can import the Index class as a dependency to extend the inscriptions metaprotocol, and build metaprotocols without touching the core ordinals indexing logic. Alternatively, the metashrew-ord repository can be forked for more granular modification of the base indexer.
For example, a DNS metaprotocol could be built on inscriptions whereby rights to assign records are custodied by the holder of an inscription, which may contain the traditional data structure used in DNS. State transitions to represent updates to records associated with a given name might be encoded as child inscriptions which encode a plaintext representation of the DDNS protocol, a battle-tested format designed to solve a similar problem. In this example, a view function could be implemented which could query a name for a complete set of records.
There are infinitely many possibilities to extend inscriptions, and metashrew-ord contains the sources to scaffold rapidly.
