minisketch
OnionShare
minisketch | OnionShare | |
---|---|---|
10 | 130 | |
301 | 6,059 | |
- | 1.1% | |
6.3 | 9.5 | |
11 days ago | 3 days ago | |
C++ | Python | |
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)?
OnionShare
-
A Beginner's Guide to Hosting a Dark Web Chat Interface
Open the Tor browser and navigate to the OnionShare website (https://onionshare.org/).
-
Ten years from Snowden revelations – what's next for Tor and privacy online?
Wasn't expecting to find something amazing from this blog post, but this project looks amazing! and has a few big partners behind it so I hope it does not vaporware https://onionshare.org/
- Dormi com Loss, acordei com o “r/pennystocks” para o sub vai mudar de vida, obrigado Sr. Williams!
- Lugar com vista da Avenida Marechal Floriano
- A casa é 220,a geladeira 110,isso foi o custo total do reparo do meu padrasto. gatilho do borrifador quebrou, precisei improvisar
-
Are there fully anonymous alternatives to Session/Telegram?
OnionShare (chat/file transfer feature)
- O Contrato não menciona nada sobre o lucro- CSLLL e o que fazer?
-
What is the correct process for informing a package maintainer of an issue? (onionshare)
After researching, I see there is an onionshare github issue that notes that the errors are specific to v2.5 of the app and are not present with v2.6. Looking further, I noticed that v2.6 was actually released Oct 9, 2022 - about 7 months ago and a little over a month before the Fedora 37 release on Nov 15, 2022... In other words, plenty of time has elapsed for the new version to have been picked up via autobuild scripts so I am assuming that some sort of manual notification would be required to inform the maintainer that a new release exists / request it be added to Fedora repos. But I have no idea on the process for this...
-
What apps to synchronize share TEXT securely between Android / iOS / MacOS / Windows
https://onionshare.org/ (not ready yet)
-
Overwriting your Windows partition
Could you share the project file, pretty please? :D Maybe using OnionShare (https://onionshare.org/) or Firefox Send (https://github.com/timvisee/send-instances/)?
What are some alternatives?
wormhole-william-mobile - End-to-end encrypted file transfer for Android and iOS. A Magic Wormhole Mobile client.
transfer.sh - Easy and fast file sharing from the command-line.
ctrie-java - Java implementation of a concurrent trie
droppy
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
securedrop - GitHub repository for the SecureDrop whistleblower platform. Do not submit tips here!
tries-T9-Prediction - Its artificial intelligence algorithm of T9 mobile
ProjectSend - ProjectSend is a free, open source software that lets you share files with your clients, focused on ease of use and privacy. It supports clients groups, system users roles, statistics, multiple languages, detailed logs... and much more!
sdsl-lite - Succinct Data Structure Library 2.0
ipfs.pics - Content-addressable, peer-to-peer method of storing and sharing images on the internet.
ann-benchmarks - Benchmarks of approximate nearest neighbor libraries in Python
lufi - Read-only mirror of https://framagit.org/fiat-tux/hat-softwares/lufi/