tsenart

6 ms·

1.
by tsenart 19d ago
Hi. Performance testing in your CI/CD pipeline will catch performance regressions of what your team has covered with benchmarks or load tests. Anything else will fall through the cracks. Even the most capable performance conscious team
2.
Superhuman Attention(perfloop.ai)
22 points by tsenart 20d ago|7 comments
3.
Show HN: Gilfoyle. An SRE Agent that finds truth while you're still guessing(gilfoyle.sh)
17 points by tsenart 8mo ago|2 comments
4.
by tsenart 1y ago
This was missing in the Go world.
5.
by tsenart 1y ago
Proprietary.
6.
by tsenart 1y ago
Author here, indeed a variation of bloom filters: https://x.com/lemire/status/1971279371131646063
7.
by tsenart 2y ago
This is to implement a database, not use one.
8.
The kicker about Stables' LLM skepticism(twitter.com)
1 points by tsenart 2y ago|0 comments
9.
by tsenart 2y ago
Yes! A typical use case is to efficiently implement ORDER BY LIMIT N in SQL databases in a way that doesn’t require sorting the entire column just to get those first N items.
10.
by tsenart 2y ago
Author here! Will do eventually.
11.
Kth: High-Performance Selection Algorithms for Go(github.com)
79 points by tsenart 2y ago|6 comments
12.
Pdqselect: Pattern-Defeating QuickSelect for Go(github.com)
1 points by tsenart 2y ago|0 comments
13.
Cool, hot, fast zero-copy(twitter.com)
1 points by tsenart 2y ago|0 comments
14.
by tsenart 3y ago
Do share your findings!
15.
by tsenart 3y ago
Author here. Agree 100%! It's often what didn't work that is omitted. But there's so much juice in failed experiments — it's important to share with others.
16.
by tsenart 3y ago
Our Go ULID package has millisecond precision + monotonic random bytes for disambiguation while preserving ordering within the same millisecond. https://github.com/oklog/ulid
17.
by tsenart 5y ago
This, please! Native support for read-replicas would be awesome. Ideally it would now if a query is read-only or not without application changes.
18.
After 2 years, Vegeta is truly over 9000(github.com)
5 points by tsenart 8y ago|0 comments
19.
by tsenart 8y ago
Could you elaborate on the differences a bit deeper? I’m really interested in understanding.
20.
by tsenart 8y ago
How does it compare to https://github.com/tdunning/t-digest ?
21.
Vegeta v9.0.0 released with a better HTML plot command(github.com)
1 points by tsenart 8y ago|0 comments
22.
by tsenart 8y ago
#MakeMonolithsGreatAgain https://twitter.com/tsenart/status/1017061272188280833
23.
by tsenart 9y ago
http://blog.aventine.se/2014/03/09/a-silly-review-of-dec64.h...
24.
by tsenart 9y ago
OptioPay | Engineering | Berlin, Germany | ONSITE, VISA, FULL-TIME We're on a mission to create the most beneficial payout ecosystem in the world and fundamentally change the way people receive money! Now hiring: Backend Engineer, Fron
25.
by tsenart 10y ago
OptioPay | Frontend UI Engineer, Backend Engineer, SRE, Security Engineer | Berlin, Germany | ONSITE, VISA, FULL-TIME We're on a mission to create the most beneficial payout ecosystem in the world and fundamentally change the way peopl
26.
by tsenart 10y ago
> A user of these IDs my not realize that the reliability of the ordering can be substantially reduced depending on where the IDs are generated. That can only be addressed with improved documentation and shared understanding of the subtl
27.
by tsenart 10y ago
Fellow PHP implementation: https://github.com/Lewiscowles1986/ulid
28.
by tsenart 10y ago
> What is the use of 48 bites of time? It reduces the overall entropy, for what? If time is important then why not make the id literally time (i.e. UnixNano), if it isn't they why not make all bits rand? For some designs it's u
29.
by tsenart 10y ago
Yes, there's always a negligible chance of collision.
30.
by tsenart 10y ago
Yes if you use a good source of entropy. In Go, the easiest and most secure is the `crypto/rand.Reader`. But it's also slow. If you don't need the security properties, an instance of `math/rand.Rand` should suffice. Othe

More ›