Viewing profile — 0xdeafbeef
0xdeafbeef
HN member- Joined
- Fri, May 28, 2021, 8:55 AM UTC
- HN karma
- 801
- Public activity
- 42 items
- HN profile
- View on Hacker News ↗
About 0xdeafbeef
No profile information was provided.
Recent public activity
-
comment
Comment #48387303
Todo type in rust will be a never type. Eg thing which exit or panic returns
-
comment
Comment #47985647
Location: Belgrade, Serbia Remote: Yes Willing to relocate: Yes, preferably EU/UK Technologies: Rust, Python, C, RocksDB, PostgreSQL, Kafka, ClickHouse, TiDB, Vector, Linux hacking…
-
comment
Comment #47597956
I was thinking about transaction processing, eg visa/blockchain. And here storing and sending almost full packet for signature instead of 32 bytes matters. For sessions this should…
-
comment
Comment #47594899
Cost is 100+ times bigger signature size and more cpu usage. If you process several k per second it matters
-
comment
Comment #47412181
Try g.ai. It's stupid fast and uses google indexes. Kagi? sometimes doesn't correctly parse intent, in Google thing you can just ask function doing this and gives you it, with exam…
-
comment
Comment #47023033
Care to opensource? I'd like to use it in firefox, will send a pr
-
comment
Comment #46990850
Filed an issue for codex https://github.com/openai/codex/issues/11601
-
comment
Comment #46807215
Bftree solves one non-obvious pain point - caching when your data set is random (the key is a hash) and the data is smaller than the page size. LSM reads are based on block size; s…
-
comment
Comment #46803415
I've tested with wal enabled, got deadlock several times, so looks raw for now
-
comment
Comment #46729821
It was 1 year ago. Around 15 tikv serves, 32 cpu, 128 ram each, 4 tb nvme. In this case latency matters a lot. When i had load server in different region with ping of 3ms I got 70k…
-
comment
Comment #46726574
Tidb should handle it nice. I've wrote 200к inserts / sec for hour in peak. Underlying lsm works better for writes
-
comment
Comment #46511146
Also, won't most of the lib be removed due to dead code elimination? And used code will be inlined where applicable, so nothing to dedup in reality
-
comment
Comment #46453444
Rust can set restricts to all pointers, because 1 mut xor many shared refs rule. Borrow checker empowers this. https://en.wikipedia.org/wiki/Restrict
-
comment
Comment #46453426
What the point, though? You will get compiling code, but later you would need to reachitecture code to avoid violating rust rules.
-
comment
Comment #46370150
It takse long to regen on big codebases, but yes
-
comment
Comment #46281921
https://www.shloked.com/writing/chatgpt-memory-bitter-lesson Mb something 've changed since post
-
comment
Comment #46238504
Only your questions are in it though
-
comment
Comment #46238359
much better https://chatgpt.com/s/t_693b489d5a8881918b723670eaca5734 than 5.1 https://chatgpt.com/s/t_6915c8bd1c80819183a54cd144b55eb2 . Same query - what romanian football player …
-
comment
Comment #46234700
Retry is fine, but imagine being unable to pay for something within 10 minutes in month. And 10m in 1M is 99.98% sla. So it depends
-
comment
Comment #46218674
Yeah yeah, every gcc update I need to patch rocksb sources somehow, because now compiler doesn't ship some includes by default. I remember only a single breakage of previously comp…
-
comment
Comment #45913907
https://chatgpt.com/s/t_6915c8bd1c80819183a54cd144b55eb2 Damn this is a lot of self correcting
-
comment
Comment #45777635
What to use instead?
-
comment
Comment #45394491
Page cache reclamation is mostly single threaded. It's much simpler, than you can create in a user space, it has no weight for specific pages etc. Traveling into kernel flushes bra…
-
comment
Comment #44307125
There is already tidb :)
-
comment
Comment #44245905
Same for anthropic