brianpane

5 ms·

1.
by brianpane 3d ago
https://www.youtube.com/watch?v=tO5sxLapAts
2.
by brianpane 1mo ago
Have Eircodes improved the situation? I know they’re supposed to provide a postcode unique to a specific address, but I’m not clear on how thoroughly they’ve been implemented.
3.
by brianpane 5mo ago
This seems ill-advised. The protocol as documented is trivially exploitable by reflection attacks. The cat next door said one meow, and now every cat in the neighborhood is wailing in response.
4.
by brianpane 7mo ago
There is a rustls side project called Graviola that's building a fast crypto provider in Rust+ASM. It's taken an interesting approach: starting with an assembly library that's been formally proven correct, and then programmat
5.
by brianpane 2y ago
I basically did manual PGO because I was also reducing the size of several integer fields at the same time to pack more into each cache line. I’m excited to try out the rustc+LLVM PGO for future optimizations.
6.
by brianpane 2y ago
I contributed a number of performance patches to this release of zlib-rs. This was my first time doing perf work on a Rust project, so here are some things I learned: Even in a project that uses `unsafe` for SIMD and internal buffers, Rust
7.
by brianpane 15y ago
The way Chrome achieves this backward-compatibility is by using the SSL Next Protocol Negotiation (NPN) extension during SSL handshaking. When the browser is establishing an SSL session, it mentions to the server that it's willing to speak
8.
by brianpane 15y ago
I've found Ragel ( http://www.complang.org/ragel/ ) to be a good compromise: it's less error-prone and easier to maintain a Ragel grammar than a handwritten lexer, but Ragel lets you use regular expressions for all the little places near
9.
by brianpane 15y ago
In my experience, it's useful, even when writing high-level applications, to be aware of the relative cost of low-level operations. The "Numbers Everyone Should Know" slide from this deck is a reasonable starting point: http://research.go