ctrie-java
PSI
ctrie-java | PSI | |
---|---|---|
1 | 3 | |
1 | 125 | |
- | 0.0% | |
10.0 | 5.2 | |
almost 4 years ago | 20 days ago | |
Java | C++ | |
Apache License 2.0 | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
ctrie-java
-
Ask HN: What are some 'cool' but obscure data structures you know about?
Concurrent tries with non-blocking snapshots [0]
Say that you have a dataset that needs to be ordered, easily searchable, but is also updated quite frequently. Fast accesses are a pain if you decide to use traditional read-write locks.
Ctries are entirely lock-free, thus there is no waiting for your read operations when an update is happening, i.e. you run lookups on snapshots while updates happen.
They are also a lot of fun to implement, especially if you aren't familiar with lock-free algorithms! I did learn a lot doing it myself [1]
[0] http://aleksandar-prokopec.com/resources/docs/ctries-snapsho...
[1] https://github.com/mabeledo/ctrie-java
PSI
-
Can a new form of cryptography solve the internet’s privacy problem?
There are other techniques that aren't generally included in the "Zero Knowledge Proofs" set of techniques that are perhaps more practical for general development.
For example, I fine private set intersection[1] as implemented by OpenMined a really useful primative a bunch of privacy enhancing applications can be built on top of.
My colleagues and I recently published a pre-print[2] showing how to use this for sharing locations you and another person have had in common, without being able to see other locations. The paper talks about a social network built around this but I also think there are useful applications in things like real-world games (scavenger hunts etc)
[1] https://github.com/OpenMined/PSI/blob/master/private_set_int...
[2] https://arxiv.org/abs/2210.01927
-
Ask HN: What are some 'cool' but obscure data structures you know about?
I came here to say Golomb compressed sets except now I see it's part of the question!
They are used by default in the OpenMined implementation of Private Set Intersection[1] - a multi-party computation technique.
[1] https://github.com/OpenMined/PSI/blob/master/private_set_int...
-
Is there a Private Set Intersection protocol where the server learns the length of the intersection?
I was using OpenMinded/PSI exploring some PSI implementations, but I would like a way for the server to know the intersection size. Say Signal wants to calculate the average number of users from one person's address book (or whatever).
What are some alternatives?
minisketch - Minisketch: an optimized library for BCH-based set reconciliation
AspNetCoreDiagnosticScenarios - This repository has examples of broken patterns in ASP.NET Core applications
sdsl-lite - Succinct Data Structure Library 2.0
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
CPython - The Python programming language
cheerp-meta - Cheerp - a C/C++ compiler for Web applications - compiles to WebAssembly and JavaScript
Folly - An open-source C++ library developed and used at Facebook.
swift - the multiparty transport protocol (aka "TCP with swarming" or "BitTorrent at the transport layer")
RoaringBitmap - A better compressed bitset in Java: used by Apache Spark, Netflix Atlas, Apache Pinot, Tablesaw, and many others
pvfmm - A parallel kernel-independent FMM library for particle and volume potentials
us - An alternative interface to Sia
gring - Golang circular linked list with array backend