Ercan Ozturk
Ercan Ozturk
I see that there is this function in `device.c`: ``` int8_t ctap_store_key(uint8_t index, uint8_t * key, uint16_t len); ``` 1. Can it be used to store any type of key/data...
Does `mt_deserialize` check for correctness of the tree, i.e., root is correct given the nodes in the tree?
Is it possible to verify Merkle proofs using only the (1) path of the node and (2) root node without needing to have the complete tree? Normally, this should be...
We are working on a project in which we need Merkle tree leaves to be updatable (which should propagate to the root and update the root hash). Is there support...
`get_user_state` currently is not using the cache and rather queries the requested data (according to the filters) from MySQL. We should consider caching user states and implementing a filtering mechanism....
AKD currently supports a 1 User : N Keys use-cases. In certain cases, there are multiple Users that map to the same Key. We should add support for such cases...
AKD currently supports a single tree in a single database -- in result a single transparency use case. To support multiple use-cases, we should add support for multiple trees. This...
Encountered this while doing some tests (bench [code](https://github.com/eozturk1/akd-bench/commit/096c590139a1743517ec379ae58b28da7ccae3f0)]: ``` pub fn generate_key_entries(num_entries: u64) -> Vec { let mut label = BytesMut::with_capacity(LABEL_VALUE_SIZE_BYTES); let mut value = BytesMut::with_capacity(LABEL_VALUE_SIZE_BYTES); (0..num_entries) .map(|i| { label.put_u64(i);...
To improve the efficiency of bulk/multi lookups, we could call lookups async and await on the results of all lookups -- rather than awaiting on them individually.
In `batch_lookup` we can batch `get_user_state` as well.