age123456gpg

6 ms·

1.
by age123456gpg 2mo ago
Very similar, in the same way non-compacting and non-generational collector is similar to compacting generational :shrug:
2.
by age123456gpg 4mo ago
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 Polynomials and Linear Algebra to
3.
by age123456gpg 4mo ago
Here is the video featuring data collection https://www.youtube.com/watch?v=PyGkn9DYm9s
4.
Generalist AI – building general intelligence for the physical world(youtube.com)
2 points by age123456gpg 4mo ago|2 comments
5.
by age123456gpg 4mo ago
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 five finger palm and chops sticks is enough. Its al
6.
by age123456gpg 4mo ago
20%
7.
by age123456gpg 7mo ago
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 to drive Claude and it works really-w
8.
by age123456gpg 7mo ago
Related, Using go fix to modernize Go code https://go.dev/blog/gofix
9.
by age123456gpg 9mo ago
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 (i=0; i<9; i++)
10.
by age123456gpg 9mo ago
You can get yourself a vanity key using https://github.com/AlexanderYastrebov/wireguard-vanity-key tool: % wireguard-vanity-key -prefix=NAS/ private public
11.
by age123456gpg 9mo ago
Official stance about supporting interpreter mode for the reference https://github.com/golang/go/issues/24118
12.
by age123456gpg 11mo ago
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-address/b... Check out my ot
13.
by age123456gpg 11mo ago
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.
14.
by age123456gpg 1y ago
WireGuard over WireGuard (WireGuard end-to-end encrypted hub and spoke) example https://www.procustodibus.com/blog/2021/12/wireguard-e2ee-hu...
15.
by age123456gpg 1y ago
// 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 := binary.BigEndian.Uint64(digest[8:16])
16.
by age123456gpg 1y ago
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 value for the use case in my opinion, compare: helloyebjc
17.
by age123456gpg 1y ago
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-address?t...
18.
by age123456gpg 1y ago
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 WireGuard kernel sources, then I was thinking about deriving
19.
Show HN: Fast Tor Onion Service vanity address generator(github.com)
16 points by age123456gpg 1y ago|6 comments
20.
by age123456gpg 1y ago
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
21.
Show HN: Generate age encryption keys with custom prefixes(github.com)
3 points by age123456gpg 1y ago|0 comments