PSI
asami
PSI | asami | |
---|---|---|
3 | 6 | |
125 | 626 | |
0.0% | 0.0% | |
5.2 | 0.0 | |
26 days ago | about 2 years ago | |
C++ | Clojure | |
Apache License 2.0 | Eclipse Public License 1.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.
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).
asami
- Ask HN: What are some 'cool' but obscure data structures you know about?
-
Ask HN: Why are relational DBs are the standard instead of graph-based DBs?
Unlike some other commenters, I agree that graph models are usually a better fit for most data than relational models. There's been some interesting work in recent years developing this idea: in the Clojure world there's Datomic, XTDB, and a host of competitors, all of which build on work from Semantic Web/SPARQL/triplestores and logic programming. Some are even intended to be used as primary datastores: they support some amount of schema and constraints, have well-defined consistency and ACID guarantees, etc. This makes them unlike graph databases like Neo4J and others, which fill an architectural role more like Elasticsearch as a read-optimization tool. Here's an interesting talk making a case for triple-based databases.
- Introduction to the Asami Graph Database
-
How to query Datomic, Datascript, Asami, or other graph databases
Despite the documentation that exists, I've heard many people who have been confused about how to query Datomic, Datascript, Asami, or other graph databases. So I've made an attempt at explaining it https://github.com/threatgrid/asami/wiki/Introduction
- Introduction (To Graph Databases)
-
Asami
The first Graph implementation for Asami was a simple in-memory data structure, described in my ClojureD talk. The code for this appears in asami.index. This file started much smaller (as referenced above), but has since expanded with the needs extended functionality, such as transactions, and transitive closure operations.
What are some alternatives?
ctrie-java - Java implementation of a concurrent trie
datascript - Immutable database and Datalog query engine for Clojure, ClojureScript and JS
AspNetCoreDiagnosticScenarios - This repository has examples of broken patterns in ASP.NET Core applications
crux - General purpose bitemporal database for SQL, Datalog & graph queries. Backed by @juxt [Moved to: https://github.com/xtdb/xtdb]
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
datahike - A durable Datalog implementation adaptable for distribution.
cheerp-meta - Cheerp - a C/C++ compiler for Web applications - compiles to WebAssembly and JavaScript
datalevin - A simple, fast and versatile Datalog database
swift - the multiparty transport protocol (aka "TCP with swarming" or "BitTorrent at the transport layer")
Apache AGE - Graph database optimized for fast analysis and real-time data processing. It is provided as an extension to PostgreSQL. [Moved to: https://github.com/apache/age]
pvfmm - A parallel kernel-independent FMM library for particle and volume potentials
naga - Datalog based rules engine