We need a new RPC method that supports more robust querying of the claim trie. This will eventually replace getclaimsforname, and it will need a corresponding "proof" RPC method that returns the merkle tree for the queried data. Requirements:
Allow querying on name, where it will return the winning bid for that claim name.
Allow querying on name and claim_id or partial claim_id.
Allow querying on name and sequence number (creation order).
Allow querying on name and bid number (according to current bid order).
Include an option to not return the value/metadata field.
Can it support a partial name if there is only one hit for that name? Maybe, but this isn't critical. Can it support no name or a partial name if the claim_id is given in full? Sure.
We need a new RPC method that supports more robust querying of the claim trie. This will eventually replace getclaimsforname, and it will need a corresponding "proof" RPC method that returns the merkle tree for the queried data. Requirements:
Can it support a partial name if there is only one hit for that name? Maybe, but this isn't critical. Can it support no name or a partial name if the claim_id is given in full? Sure.