0xdeafbeef

7 ms·

1.
by 0xdeafbeef 4mo ago
Todo type in rust will be a never type. Eg thing which exit or panic returns
2.
by 0xdeafbeef 5mo ago
Location: Belgrade, Serbia Remote: Yes Willing to relocate: Yes, preferably EU/UK Technologies: Rust, Python, C, RocksDB, PostgreSQL, Kafka, ClickHouse, TiDB, Vector, Linux hacking, eBPF, Docker, Kubernetes, Ansible, Terraform, GCP, Gi
3.
by 0xdeafbeef 6mo ago
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 shouldn't matter
4.
by 0xdeafbeef 6mo ago
Cost is 100+ times bigger signature size and more cpu usage. If you process several k per second it matters
5.
by 0xdeafbeef 6mo ago
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 examples, grounding and extremely fast. I'm payin
6.
by 0xdeafbeef 7mo ago
Care to opensource? I'd like to use it in firefox, will send a pr
7.
by 0xdeafbeef 7mo ago
Filed an issue for codex https://github.com/openai/codex/issues/11601
8.
by 0xdeafbeef 8mo ago
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; same with caching. So if your record is 8 bytes, you end up c
9.
by 0xdeafbeef 8mo ago
I've tested with wal enabled, got deadlock several times, so looks raw for now
10.
by 0xdeafbeef 8mo ago
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 inserts, when moved to the same region with sub ms ping it
11.
by 0xdeafbeef 8mo ago
Tidb should handle it nice. I've wrote 200к inserts / sec for hour in peak. Underlying lsm works better for writes
12.
by 0xdeafbeef 8mo ago
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
13.
by 0xdeafbeef 9mo ago
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
14.
by 0xdeafbeef 9mo ago
What the point, though? You will get compiling code, but later you would need to reachitecture code to avoid violating rust rules.
15.
by 0xdeafbeef 9mo ago
It takse long to regen on big codebases, but yes
16.
by 0xdeafbeef 9mo ago
https://www.shloked.com/writing/chatgpt-memory-bitter-lesson Mb something 've changed since post
17.
by 0xdeafbeef 9mo ago
Only your questions are in it though
18.
by 0xdeafbeef 9mo ago
much better https://chatgpt.com/s/t_693b489d5a8881918b723670eaca5734 than 5.1 https://chatgpt.com/s/t_6915c8bd1c80819183a54cd144b55eb2 . Same query - what romanian football player won the premier l
19.
by 0xdeafbeef 9mo ago
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
20.
by 0xdeafbeef 9mo ago
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 compiling code with the time crate because of a change in t
21.
by 0xdeafbeef 10mo ago
https://chatgpt.com/s/t_6915c8bd1c80819183a54cd144b55eb2 Damn this is a lot of self correcting
22.
by 0xdeafbeef 11mo ago
What to use instead?
23.
by 0xdeafbeef 1y ago
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 branch predictor caches, tlb. So it's not free at all
24.
by 0xdeafbeef 1y ago
There is already tidb :)
25.
by 0xdeafbeef 1y ago
Same for anthropic
26.
by 0xdeafbeef 1y ago
you need only to cache asm output. It will take a few kb and no waste of cpu cycles.
27.
by 0xdeafbeef 1y ago
#include <vector> #include <iostream> int main() { std::vector<int> vec = {1, 2, 3}; vec.reserve(3); std::cout << "Initial capacity: " << vec.capacity() << std::endl;
28.
by 0xdeafbeef 1y ago
Have you tried https://github.com/qarmin/czkawka ?
29.
by 0xdeafbeef 2y ago
TiDB, 200k inserts per second; 200b per row on average. Bursty insert pattern, e.g., can have 200k inserts for an hour, then almost 0 for days. 8k reads per second on average, mostly reads by primary key. 20 hosts; 16 threads x 128GB RAM, 8
30.
Sched_ext has been merged for Linux 6.12(git.kernel.org)
3 points by 0xdeafbeef 2y ago|1 comments

More ›