-
Work on [https://github.com/near/nearcore/pull/6241](https://github.com/near/nearcore/pull/6241) revealed that `TrieUpdate` is not an exclusive owner of `Trie`. In particular, in `fn apply` we use two…
-
- Spec: https://github.com/privacy-scaling-explorations/zkevm-specs/pull/136
- Implementation: https://github.com/privacy-scaling-explorations/zkevm-circuits/pull/398
First step is understanding the …
-
Given a Trie, I'd like to be able to search for a key `k`, and get either k or the closest thing on either side of `k`.
More precisely, the query would yield one of these:
- `k` and its value, if …
-
- Trie树Java模板
```
class Trie {
private final int SIZE = 26;
private Trie[] childern = new Trie[SIZE];
boolean isEnd = false;
/** Initialize your data structure here. */
pu…
-
The seek method is described as follows, here https://arxiv.org/abs/1210.0481 :
> *seek(int seekKey)*: Position the iterator at a least
> upper bound for seekKey,
> i.e. the least key ≥ seekKey, …
-
## Story
**AS A** Block Node Operator
**I WANT** to reduce the number of system calls needed to persist a single block
**SO THAT** I can minimize operating costs.
This task is to change block pe…
-
Currently, the DSA repository does not include an implementation of the Advanced Data Structure. I believe adding this data structure would greatly enhance the repository's offerings and provide a val…
-
Amazing! Went above and beyond what was expected! Implemented a Trie AND a Linked List of Hash Maps.
Decent documentation, could use a little more explaining what each function did/ what the retur…
-
The conversion of trie is run during the long synchronization of mainnet, along a block range: these blocks have the old state root, and the process calculates the new state root, based on a new trie …
-
Hi there,
I was implementing a trie/prefix tree data structure ([here](https://github.com/hummy123/string-tries-sml)) and, while considering how to implement fold on the data structure, I think I …