stutter
PSI
| stutter | PSI | |
|---|---|---|
| 1 | 3 | |
| 73 | 125 | |
| - | 0.0% | |
| 1.8 | 5.2 | |
| almost 2 years ago | 21 days ago | |
| C | C++ | |
| MIT License | 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.
stutter
-
Ask HN: What are some 'cool' but obscure data structures you know about?
This. Roughly a year ago I got interested in efficient immutability for my write-from-scratch-in-C Lisp [0] and started to write a HAMT implementation in C [1], along with a (somewhat hacky, you have been warned) benchmarking suite [2].
The docs are only 70% done (in particular the "putting it all together" part is missing) but it has been a really interesting and enlightening journey so far and can only recommend embarking on this path to everyone.
[0]: https://github.com/mkirchner/stutter
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?
ravi-compiler - Parser and compiler for Ravi and Lua
ctrie-java - Java implementation of a concurrent trie
Caffeine - A high performance caching library for Java
AspNetCoreDiagnosticScenarios - This repository has examples of broken patterns in ASP.NET Core applications
us - An alternative interface to Sia
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
sdsl-lite - Succinct Data Structure Library 2.0
cheerp-meta - Cheerp - a C/C++ compiler for Web applications - compiles to WebAssembly and JavaScript
pyroscope - Continuous Profiling Platform. Debug performance issues down to a single line of code [Moved to: https://github.com/grafana/pyroscope]
swift - the multiparty transport protocol (aka "TCP with swarming" or "BitTorrent at the transport layer")
FusionCache - FusionCache is an easy to use, fast and robust cache with advanced resiliency features and an optional distributed 2nd level.
pvfmm - A parallel kernel-independent FMM library for particle and volume potentials