minisketch
FusionCache
Our great sponsors
minisketch | FusionCache | |
---|---|---|
10 | 9 | |
301 | 1,285 | |
- | 11.7% | |
0.0 | 8.8 | |
10 days ago | 2 days ago | |
C++ | C# | |
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)?
FusionCache
-
Release Radar • March 2024 Edition
Want an easy to use cache with advanced resiliency features? Look no further than FusionCache. It's built for performance, good refresh rates, better auto-setup, better logs, and more. Congrats to the team on shipping your first major and stable version 🎉 and receiving over 3.8 million downloads.
- FusionCache Is Now v1.0
-
Caching as a cross cutting concern using MediatR's pipeline behavior
I wrote an internal nuget package for our team that does similar stuff to your work, although I called mine ICachedRequest. Unlike you I denied myself the enjoyment of exploring a custom caching solution and ended up injecting FusionCache into my mediatr behavior.
-
17 Amazing Community Packages for .NET Developers
The most undervalued library from that list is FusionCache. The rest is either well-known (like FluentAssertions) or pretty specific to the guy's experience (like the WPF stuff).
-
Multi level cache library (in memory + Redis)
The instances (using FusionCache for instance) sync over Redis pub/sub.
- What your hidden nuget gems ?
-
How to implement cache
LazyCache is amazing. Btw I'm using FusionCache and it is good too
-
Ask HN: What are some 'cool' but obscure data structures you know about?
If you are in the .NET space I suggest you to take a look at FusionCache. It has cache stampede protection built in, plus some other nice features like a fail-safe mechanism and soft/hard timeouts https://github.com/jodydonetti/ZiggyCreatures.FusionCache
What are some alternatives?
wormhole-william-mobile - End-to-end encrypted file transfer for Android and iOS. A Magic Wormhole Mobile client.
Lazy Cache - An easy to use thread safe in-memory caching service with a simple developer friendly API for c#
ctrie-java - Java implementation of a concurrent trie
Cache Tower - An efficient multi-layered caching system for .NET
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
EasyCaching - :boom: EasyCaching is an open source caching library that contains basic usages and some advanced usages of caching which can help us to handle caching more easier!
tries-T9-Prediction - Its artificial intelligence algorithm of T9 mobile
SqliteCache for ASP.NET Core - An ASP.NET Core IDistributedCache provider backed by SQLite
sdsl-lite - Succinct Data Structure Library 2.0
NCache - NCache: Highly Scalable In-Memory Distributed Cache for .NET
ann-benchmarks - Benchmarks of approximate nearest neighbor libraries in Python
CacheCow - An implementation of HTTP Caching in .NET Core and 4.5.2+ for both the client and the server