Viewing profile — age123456gpg

Very similar, in the same way non-compacting and non-generational collector is similar to compacting generational :shrug:

I've implemented ML-KEM by the spec as an exercise recently ( https://github.com/AlexanderYastrebov/mlkem ) and here are related links that helped me understand the math: * [Enough…

Here is the video featuring data collection https://www.youtube.com/watch?v=PyGkn9DYm9s

Hi, I've stumbled upon this channel and was amazed by the precision and performance of the real-world object manipulation. It looks like that for many tasks you don't really need f…

20%

Hi all! Check out this Handy app https://github.com/cjpais/Handy - a free, open source, and extensible speech-to-text application that works completely offline. I am using it daily…

Related, Using go fix to modernize Go code https://go.dev/blog/gofix

Here [1] is a related trick in the old Unix to run either `foo`, `/bin/foo` or `/usr/bin/foo` (apparently before `PATH` convention existed): char string[10000]; strp = string; for …

You can get yourself a vanity key using https://github.com/AlexanderYastrebov/wireguard-vanity-key tool: % wireguard-vanity-key -prefix=NAS/ private public attempts duration attemp…

Official stance about supporting interpreter mode for the reference https://github.com/golang/go/issues/24118

Indeed, be careful with anything that involves secret bits. This tool uses proper crypto/rand initialisation of the starting key https://github.com/AlexanderYastrebov/onion-vanity-…

You can generate yourself a vanity .onion address using https://github.com/AlexanderYastrebov/onion-vanity-address tool. It can also generate vanity client authorization keypair.

WireGuard over WireGuard (WireGuard end-to-end encrypted hub and spoke) example https://www.procustodibus.com/blog/2021/12/wireguard-e2ee-hu...

// hashItem computes the slot an item hashes to, given a total number of slots. func hashItem(item string, nslots uint64) uint64 { digest := md5.Sum([]byte(item)) digestHigh := bin…

Prefix check is a fast operation compared to candidate key generation so checking several prefixes adds a small overhead compared to checking just one. Wildcard support has low val…

It also supports distributed search, e.g. you can run it in Kubernetes without exposing the secret key to the cluster, see https://github.com/AlexanderYastrebov/onion-vanity-addres…

Thanks, great question! In short: I got obsessed by making it as fast as possible and read a ton of elliptic curve cryptography papers. It was a journey that started from reading W…

Hello, I've built the tool to generate vanity Tor Onion Service addresses: $ onion-vanity-address allium Found allium... in 12s after 558986486 attempts (48529996 attempts/s) --- h…

You can create prefixed keys (aka vanity key) for each peer using https://github.com/AlexanderYastrebov/wireguard-vanity-key $ wireguard-vanity-key --prefix=mac/ private public att…

Hello, I built a tool that generates age (modern file encryption https://github.com/FiloSottile/age ) keys with vanity prefixes. The key innovation is using the fastest search algo…