Skip to content

Commit e3a0c01

Browse files
committed
[VIndex] Document novelty of index
One of the key blind spots in this doc was why this VIndex design was chosen over something with a general ReduceFn. This addition is likely missing some arguments, but we can add these over time.
1 parent cd083d3 commit e3a0c01

1 file changed

Lines changed: 8 additions & 0 deletions

File tree

vindex/README.md

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -37,6 +37,14 @@ This provides two key guarantees:
3737

3838
The result is a system that extends the verifiability of the underlying log to its queries, preserving the end-to-end chain of trust while providing the efficiency modern systems require.
3939

40+
Using pointers as the values in this data structure is an important part of the design:
41+
42+
- Evolution of the value for a key is predictable: it's an append-only data structure
43+
- Values stay small: pointers to the values mean that the index doesn't need to duplicate values
44+
45+
Compare the above against the more powerful, but less efficient, general map (e.g. the [batchmap](https://github.com/google/trillian/tree/master/experimental/batchmap)).
46+
The vision is that the Verifiable Index will meet 80% of use-cases, and the general map (with general `ReduceFn`s) will be required for more advanced needs.
47+
4048
## Applications
4149

4250
This verifiable map can be applied to any log where users have a need to enumerate all values matching a specific query. For example:

0 commit comments

Comments
 (0)