-
Today, the block hash is computed from the JSON encoding of its Body.
We could do something smarter using Merkle trees. This would be helpful because we could then
create Merkle proofs that things…
-
On platforms such as ARM or RISC-V we'll want to use device trees.
(here's a good overview of device trees: http://www.ofitselfso.com/BeagleNotes/AboutTheDeviceTree.pdf)
This is related to how dri…
-
Hey,
I found grovedb extremely useful however I have troubles to tell if it fits certain use cases, for instance now I'm trying to spike a data model to index whole Bitcoin into where I could use s…
-
One thing missing from both git and ipfs object model currently is the concept of an overlay, similar to Linux's aufs/unionfs/etc
The idea is to have the ability to re-use trees, with other (smaller?…
risen updated
5 years ago
-
With the progress of the Poseidon implementation #104 , it would be nice to begin a discussion on how we could implement the hash trait(s). Hopefully, this will also steer the discussion towards the g…
-
Making trees to hold one item per 12.5 bits often fails. For instance, the constructor makes a filter of size 3 mebibytes when asked to construct a filter to hold 2,013,265 items, but this is too ambi…
-
1. Adhoc
2. Queue
3. Stack
4. Priority Queue
5. Array
6. Linked List
7. Trees
8. 2D-Array
9. Graph+Algo
10. DP+Algo
11. Big Numbers
12. Hash Table
13. Disjoint Sets
14. String Processin…
-
Bugs found in OPAM packages:
xmldiff: zoggy/xmldiff#4
calendar: https://forge.ocamlcore.org/tracker/index.php?func=detail&aid=1748&group_id=83&atid=415
yojson: mjambon/yojson#20 (reproduced, not …
-
> K9 Algorithms, logic and data structures relevant to software development for example:- arrays- stacks- queues- linked lists- trees- graphs- hash tables- sorting algorithms- searching algorithms- cr…
-
It would be useful to maintain different trees if the data source contained many hosts or days.
can we add this as Option?
i think it would be easy as adding an extra level of dictionary for ea…