minisketch
wormhole-william-mobile
Our great sponsors
minisketch | wormhole-william-mobile | |
---|---|---|
10 | 9 | |
301 | 149 | |
- | - | |
0.0 | 6.2 | |
8 days ago | 5 months ago | |
C++ | Go | |
MIT License | MIT License |
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)?
wormhole-william-mobile
-
Croc: Easily and securely send things from one computer to another
I made the android† port of Wormhole William[1] specifically to help transfer some encryption keys that I didn't want to ever live unencrypted on a server in the cloud.
[1]: https://github.com/psanford/wormhole-william-mobile
†: There's also a working iOS port but its not released on the App Store because of how hostile Apple makes that process to open source developers.
- Looking for snapdrop alternative
-
Tailscale changes its Android app to support the open source Headscale server
That is totally fair. I will say that I got quite a lot of value from being able to see how tailscale-android works when building my own gioui app[0]. I suspect that being able to see the same thing for a modern iOS app would be useful to some small set of developers, even if they couldn't produce a fully working tailscale binary on their own dev machines.
It really does feel like Apple just doesn't care that their app policies are hostile to developers because they have such a strong monopoly on mobile app distribution.
[0]: https://github.com/psanford/wormhole-william-mobile
-
⟳ 2 apps added, 7 updated at apt.izzysoft.de
Wormhole William (version 8): End-to-end encrypted file transfer for Android. An Android Magic Wormhole client
-
GPG-Tui, a Terminal User Interface for GnuPG
TLDR at the bottom.
It seems the answer is Brian Warner's magic-wormhole. You're gonna see lots of file transfer sites with wormhole in their name, but if you want security you should use the original one, which is BW's m-w.
It is implemented in Python [1], so it's hard to install.
So someone made a Go version of it [2] that has binaries for windows, Mac, Linux, BSD etc. But it's command line so maybe not suitable for lay people.
So another person made a GUI for it that also has binaries for all OS [3].
Also there is an android app [4]. Someone needs to implement an iOS one.
[1] https://github.com/magic-wormhole/magic-wormhole/
[2] https://github.com/psanford/wormhole-william/
[3] https://github.com/Jacalz/wormhole-gui/
[4] https://github.com/psanford/wormhole-william-mobile/
TLDR: ask them to install [5] and [6].
[5] https://github.com/Jacalz/wormhole-gui/releases/
(click on 'Assets' under 'Latest release' and download the zip or tar.gz for your OS)
[6] https://play.google.com/store/apps/details?id=io.sanford.wor...
Try it, it's usage is cute and really feels like magic.
- Magic-Wormhole: Get Things from One Computer to Another, Safely
- Why Decentralised Applications Don’t Work
- The Pinecone Overlay Network
- Wormhole-crypto: Streaming encryption based on Encrypted Content-Encoding
What are some alternatives?
ctrie-java - Java implementation of a concurrent trie
wormhole-gui - Cross-platform application for easy encrypted file, folder, and text sharing between devices. [Moved to: https://github.com/Jacalz/rymdport]
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
webwormhole - Peer authenticated WebRTC.
tries-T9-Prediction - Its artificial intelligence algorithm of T9 mobile
a-news-provider - A simple RSS feed android application.
sdsl-lite - Succinct Data Structure Library 2.0
hyperboot - offline webapp bootloader
ann-benchmarks - Benchmarks of approximate nearest neighbor libraries in Python
sshcrypt
entt - Gaming meets modern C++ - a fast and reliable entity component system (ECS) and much more
age - A simple, modern and secure encryption tool (and Go library) with small explicit keys, no config options, and UNIX-style composability.