cheerp-meta VS PSI

Yours is a fair question. I think that, right now, adoption of WebAssembly is quite limited. On the other hand (here at LeanigTech) we are extremely bullish about its potential.

We believe that this technology would be adopted more with better tooling. Our main contribution to this space is Cheerp: A C++-to-WebAssembly _and_ JavaScript compiler (https://github.com/leaningtech/cheerp-meta/). It is designed to seamlessly take advantage of Wasm without sacrificing easy access to Web APIs, all from within C++ with no need of post-processing and glue code.

We know for a fact that amazing products can be build with Cheerp, because we have done it ourselves.

CheerpX is a x86 virtual machine running in the browser, fully written in C++ and compiled with Cheerp. It includes a JIT-compiler that is able to analyze x86 binary code and emit new WebAssembly modules on the fly.

Our most impressive demo yet (WebVM) is available here: https://webvm.io/

A similar project, for WebAssembly so with limited scope is this: https://github.com/bytecodealliance/wizer. And somehow similar but limited on LLVM IR a colleague worked on this for Cheerp (the compiler used here as backend): https://github.com/leaningtech/cheerp-meta/wiki/Cheerp-PreExecuter.

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

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...

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).