minisketch
duckduckgo-locales
Our great sponsors
minisketch | duckduckgo-locales | |
---|---|---|
10 | 2,076 | |
301 | 94 | |
- | - | |
0.0 | 0.0 | |
8 days ago | 6 days ago | |
C++ | Perl | |
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)?
duckduckgo-locales
- A24's New AI-Generated 'Civil War' Ads Generate Controversy
-
DuckDuckGo AI Chat
AI Chat is separate from the search engine. On the search engine we have DuckAssist, which is currently grounded in Wikipedia (more sources coming): https://duckduckgo.com/?q=what+is+the+stoichiometric+ratio+b...
- Collection of notebooks showcasing some fun and effective ways of using Claude
-
Microsoft killed my favorite keyboard
that one is good, but I detest keyboards with their own magic little dongle since it's a damn fine thing to misplace
I'm surprised OP didn't enjoy https://www.microsoft.com/en-us/d/surface-ergonomic-keyboard... which is currently listed as out of stock but I dunno if that means "permanently" or what, but they seem to be available via 3rd party channels
Its "klacking" aside, pour one out for https://duckduckgo.com/?q=microsoft+natural+elite+keyboard&t... which I loved, although I'll be straight that I love the Surface Ergonomic better because I think its keytravel is much, much nicer and no weirdo + shaped cursor keys, the inverted T like $diety intended
-
Ask HN: Where are all the touch-based art forms?
Sculpture can be tactile. I know it's not purely tactile, but thinking of it in that way is becoming a lot more common (eg at the Louvre). And then I went to find a URL for the tactile dome at the Exploratorium in San Francisco (https://www.exploratorium.edu/visit/tactile-dome) and it turns out there are lots of tactile galleries now:
https://duckduckgo.com/?q=tactile+gallery&t=fpas&ia=web
- Show HN: QR Builder
- Find My Device on Android
-
Insurers Are Spying on Your Home from the Sky
https://duckduckgo.com/?q=ontario+minimum+automobile+insuran...
https://www.ontario.ca/document/official-mto-drivers-handboo...
https://www.ibc.ca/insurance-basics/auto/types-of-auto-cover...
For the US:
https://www.forbes.com/advisor/car-insurance/minimum-require...
-
Ask HN: How to stay up to date with advances in Alzheimer's research?
It seems the Mediterranean diet may provide some protection... https://duckduckgo.com/?t=ftsa&q=%E2%80%9CMediterranean+diet...
- Ubuntu 24.04 Beta Delayed Due to XZ Nightmare
What are some alternatives?
wormhole-william-mobile - End-to-end encrypted file transfer for Android and iOS. A Magic Wormhole Mobile client.
Searx - Privacy-respecting metasearch engine
ctrie-java - Java implementation of a concurrent trie
hn-search - Hacker News Search
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
brave-browser - Brave browser for Android, iOS, Linux, macOS, Windows.
tries-T9-Prediction - Its artificial intelligence algorithm of T9 mobile
Tutanota makes encryption easy - Tuta is an email service with a strong focus on security and privacy that lets you encrypt emails, contacts and calendar entries on all your devices.
sdsl-lite - Succinct Data Structure Library 2.0
SimpleLogin - The SimpleLogin back-end and web app
ann-benchmarks - Benchmarks of approximate nearest neighbor libraries in Python
torsocks - Library to torify application - NOTE: upstream has been moved to https://gitweb.torproject.org/torsocks.git