pyroscope
minisketch
pyroscope | minisketch | |
---|---|---|
56 | 10 | |
7,382 | 301 | |
- | - | |
9.6 | 6.3 | |
about 1 year ago | 14 days ago | |
Go | C++ | |
GNU Affero General Public License v3.0 | 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.
pyroscope
- Grafana Phlare, open source database for continuous profiling at scale
-
The pros and cons of eBPF profiling in K8s
What do you mean? pyroscope.io was slow for you? or the blog?
- Go garbage collector doesn't release memory
- Pyroscope - Continuous profiling platform
-
Ask HN: What are some 'cool' but obscure data structures you know about?
Tries (or prefix trees).
We use them a lot at Pyroscope for compressing strings that have common prefixes. They are also used in databases (e.g indexes in Mongo) or file formats (e.g debug symbols in macOS/iOS Mach-O format are compressed using tries).
We have an article with some animations that go into details about tries in case anyone's interested [0].
[0] https://github.com/pyroscope-io/pyroscope/blob/main/docs/sto...
- How to add dynamic tags/labels to Java profiles (example)
-
Question: How do you handle oversized heap analysis?
You could use continuous profiling with Pyroscope which uses async-profiler under the hood, but with the added functionality that you can add relevant tags to your VMs (example).
-
JFR (Java Flight Recorder) Parser written in Go
Java Flight Recorder (JFR) is a format for collecting diagnostic and profiling data from Java applications. A while back someone created an issue for Pyroscope , an open source continuous profiler written in Go, to support ingesting profiles in JFR format, but there were no existing parsers that were also written in Go.
-
flamegraph.com - a new website for uploading, analyzing, and sharing pprof profiles
This cloud version is actually a slimmed-down version of Pyroscope which is open source and so you can run it locally.
-
We created flamegraph.com - A website for uploading, analyzing, and sharing flamegraphs
At Pyroscope (open source continuous profiling) we use flamegraphs extensively to visualize and analyze profiling data. However, one of the worst parts about using flamegraphs for analysis is that they are kind of annoying to share.
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)?
What are some alternatives?
parca - Continuous profiling for analysis of CPU and memory usage, down to the line number and throughout time. Saving infrastructure cost, improving performance, and increasing reliability.
wormhole-william-mobile - End-to-end encrypted file transfer for Android and iOS. A Magic Wormhole Mobile client.
profefe - Continuous profiling for long-term postmortem analysis
ctrie-java - Java implementation of a concurrent trie
barrier - Open-source KVM software
t-digest - A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means
Grafana - The open and composable observability and data visualization platform. Visualize metrics, logs, and traces from multiple sources like Prometheus, Loki, Elasticsearch, InfluxDB, Postgres and many more.
tries-T9-Prediction - Its artificial intelligence algorithm of T9 mobile
SheetJS js-xlsx - 📗 SheetJS Spreadsheet Data Toolkit -- New home https://git.sheetjs.com/SheetJS/sheetjs
sdsl-lite - Succinct Data Structure Library 2.0
Oat++ - 🌱Light and powerful C++ web framework for highly scalable and resource-efficient web application. It's zero-dependency and easy-portable.
ann-benchmarks - Benchmarks of approximate nearest neighbor libraries in Python