minisketch
berty
Our great sponsors
minisketch | berty | |
---|---|---|
10 | 76 | |
301 | 7,291 | |
- | 1.1% | |
0.0 | 8.5 | |
3 days ago | 1 day ago | |
C++ | Go | |
MIT License | GNU General Public License v3.0 or later |
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.
minisketch
-
Invertible Bloom Lookup Tables with Less Randomness and Memory
Anyone interested in IBLT with low failure probablity should also be aware of pinsketch and, particularly, our implementation of it: minisketch ( https://github.com/sipa/minisketch/ ).
Our implementation communicates a difference of N b-bit entries with exactly N*b bits with 100% success. The cost for this communications efficiency and reliability is that the decoder takes CPU time quadratic in N, instead of IBLT's linear decoder. However, when N is usually small, if the implementation is fast this can be fine -- especially since you wouldn't normally want to use set recon unless you were communications limited.
Pinsketches and iblt can also be combined-- one can use pinsketches as the cells of an iblt and one can also use a small pinsketch to improve the failure rate of an iblt (since when a correctly sized IBLT fails, it's usually just due to a single undecodable cycle).
- Minisketch: an optimized library for BCH-based set reconciliation
-
Peer-to-Peer Encrypted Messaging
Since the protocol appears to use adhoc synchronization, the authors might be interested in https://github.com/sipa/minisketch/ which is a library that implements a data structure (pinsketch) that allows two parties to synchronize their sets of m b-bit elements which differ by c entries using only b*c bits. A naive protocol would use m*b bits instead, which is potentially much larger.
I'd guess that under normal usage the message densities probably don't justify such efficient means-- we developed this library for use in bitcoin targeting rates on the order of a dozen new messages per second and where every participant has many peers with potentially differing sets--, but it's still probably worth being aware of. The pinsketch is always equal or more efficient than a naive approach, but may not be worth the complexity.
The somewhat better known IBLT data structure has constant overheads that make it less efficient than even naive synchronization until the set differences are fairly large (particular when the element hashes are small); so some applications that evaluated and eschewed IBLT might find pinsketch applicable.
-
Ask HN: What are some 'cool' but obscure data structures you know about?
I love the set reconciliation structures like the IBLT (Iterative Bloom Lookup Table) and BCH set digests like minisketch.
https://github.com/sipa/minisketch
Lets say you have a set of a billion items. Someone else has mostly the same set but they differ by 10 items. These let you exchange messages that would fit in one UDP packet to reconcile the sets.
-
Here is how Ethereum COULD scale without increasing centralisation and without depending on layer two's.
Sipa is working on a better version of that for a while. The technical term is a "set reconciliation protocol", but Bitcoin Core been doing a more basic version of this for a while. Note that the "BCH" there isn't the same as Bcash
-
ish: Sketches for Zig
I'd also have to say that Zig is a pretty neat library for this. In order to implement PBS I needed the MiniSketch-library (written in C/C++) and I'll have to say that integrating with it has been a breeze. Some fiddling in build.zig so that I can avoid Makefile, and after that everything has worked amazingly.
-
The Pinecone Overlay Network
Networks that need to constrain themselves to limited typologies to avoid traffic magnification do so at the expense of robustness, especially against active attackers that grind their identifiers to gain privileged positions.
Maybe this is a space where efficient reconciliation ( https://github.com/sipa/minisketch/ ) could help-- certainly if the goal were to flood messages to participants reconciliation can give almost optimal communication without compromising robustness.
- Is it any easier to find A, B such that sha256(A) ^ sha256(B) = sha256(C)?
berty
-
How to explore writing an app for ipfs with rust?
Not written in Rust, but may be Berty can give you some ideas?
-
Daily General Discussion - February 22, 2023
Berty is an open source, secure, private, censorship resilient messaging protocol. Berty is designed to work with NO internet connection. Thanks to Bluetooth LE and mDNS, messages can be securely and privately relayed, peer to peer to create an adhoc network. Of course old fashioned networks still work, and if you’re connected to a “hostile” network that’s being surveilled, the Berty protocol can still operate safely and securely thanks to e2e encryption. Super nice!
- So there's no online messaging service that's private, anonymous and secure?
- Looking for free crossplatform communication tool that can hide IPs
- Berty: Privacy-first messaging app
-
Hacker News top posts: Nov 21, 2022
Berty: Privacy-first messaging app\ (34 comments)
-
Berty: The privacy-first messaging app
Well, in fact they have a CLI client ( that I haven't tested ) [1] and their site says they're going to be available also for Mac, Windows and Linux.
- Peer-to-Peer Encrypted Messaging
What are some alternatives?
wormhole-william-mobile - End-to-end encrypted file transfer for Android and iOS. A Magic Wormhole Mobile client.
session-desktop - Session Desktop - Onion routing based messenger
ctrie-java - Java implementation of a concurrent trie
jami-cli - Jami client for terminal
tries-T9-Prediction - Its artificial intelligence algorithm of T9 mobile
session-android - A private messenger for Android.
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
orbitdb - Peer-to-Peer Databases for the Decentralized Web
sdsl-lite - Succinct Data Structure Library 2.0
ipfs-chat - Real-time P2P messenger using go-ipfs pubsub. TUI. End-to-end encrypted texting & file-sharing. NAT traversal.
ann-benchmarks - Benchmarks of approximate nearest neighbor libraries in Python
Element - A glossy Matrix collaboration client for the web.