HNHacker News
TopNewBestAskShowJobs

0xdeafbeef

802 karma · joined May 28, 2021

submissionscomments
0xdeafbeef··on Drawgent: Coding agent on a live Excalidraw canvas
https://likec4.dev/ It's a bit different usecase, but llms are proficient with it
0xdeafbeef··on Fearless SIMD v1.0
Sounds similar to https://mlir.llvm.org/
0xdeafbeef··on Gleam v1.17.0
Todo type in rust will be a never type. Eg thing which exit or panic returns
0xdeafbeef··on Ask HN: Who wants to be hired? (May 2026)
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, GitLab CI, GitHub Actions Résumé/CV: Available on request. GitHub: github.com/0xdeafbeef, LinkedIn: linkedin.com/in/petrzhikovskii Email: vovkap97@gmail.com
0xdeafbeef··on Securing Elliptic Curve Cryptocurrencies Against Quantum Vulnerabilities [pdf]
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
0xdeafbeef··on Securing Elliptic Curve Cryptocurrencies Against Quantum Vulnerabilities [pdf]
Cost is 100+ times bigger signature size and more cpu usage. If you process several k per second it matters
0xdeafbeef··on Kagi Small Web
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 paying for kagi since the begging and I guess id cancel it because it gives not so much added value
0xdeafbeef··on Show HN: GitHub "Lines Viewed" extension to keep you sane reviewing long AI PRs
Care to opensource? I'd like to use it in firefox, will send a pr
0xdeafbeef··on Improving 15 LLMs at Coding in One Afternoon. Only the Harness Changed
Filed an issue for codex

https://github.com/openai/codex/issues/11601

0xdeafbeef··on Bf-Tree: modern read-write-optimized concurrent larger-than-memory range index
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 caching the remaining ~4 KB, and the hit rate will be pretty low.
0xdeafbeef··on Bf-Tree: modern read-write-optimized concurrent larger-than-memory range index
I've tested with wal enabled, got deadlock several times, so looks raw for now
0xdeafbeef··on Scaling PostgreSQL to power 800M ChatGPT users
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 went to thousands
0xdeafbeef··on Scaling PostgreSQL to power 800M ChatGPT users
Tidb should handle it nice. I've wrote 200к inserts / sec for hour in peak. Underlying lsm works better for writes
0xdeafbeef··on Brave overhauled its Rust adblock engine with FlatBuffers, cutting memory 75%
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
0xdeafbeef··on Rust--: Rust without the borrow checker
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
0xdeafbeef··on Rust--: Rust without the borrow checker
What the point, though? You will get compiling code, but later you would need to reachitecture code to avoid violating rust rules.
0xdeafbeef··on Claude Code gets native LSP support
It takse long to regen on big codebases, but yes
0xdeafbeef··on GPT-5.2
https://www.shloked.com/writing/chatgpt-memory-bitter-lesson

Mb something 've changed since post

0xdeafbeef··on GPT-5.2
Only your questions are in it though
0xdeafbeef··on GPT-5.2
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 league

update. Even instant returns correct result without problems

https://chatgpt.com/s/t_693b49e8f5808191a954421822c3bd0d

0xdeafbeef··on Days since last GitHub incident
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
0xdeafbeef··on Rust: Proof of Concept, Not Replacement
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 type inference, but even there the compiler told me to update the lib. And that’s in 6 years of using Rust.

0xdeafbeef··on GPT-5.1: A smarter, more conversational ChatGPT
https://chatgpt.com/s/t_6915c8bd1c80819183a54cd144b55eb2

Damn this is a lot of self correcting

0xdeafbeef··on Futurelock: A subtle risk in async Rust
What to use instead?
0xdeafbeef··on Show HN: Lingo – A linguistic database in Rust with nanosecond-level performance
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.

0xdeafbeef··on Timescale Is Now TigerData
There is already tidb :)
0xdeafbeef··on OpenAI dropped the price of o3 by 80%
Same for anthropic
0xdeafbeef··on How Compiler Explorer Works in 2025
you need only to cache asm output. It will take a few kb and no waste of cpu cycles.
0xdeafbeef··on Understanding Memory Management, Part 5: Fighting with Rust
#include <vector> #include <iostream>

  int main() {
      std::vector<int> vec = {1, 2, 3};
      vec.reserve(3);

      std::cout << "Initial capacity: " << vec.capacity() << std::endl;
      std::cout << "Initial data address: " << (void*)vec.data() << std::endl;

      int* ptr = vec.data();

      std::cout << "Pointer before push_back: " << (void*)ptr << std::endl;
      std::cout << "Value via pointer before push_back: " << *ptr << std::endl;

      std::cout << "\nPushing back 4...\n" << std::endl;
      vec.push_back(4);

      std::cout << "New capacity: " << vec.capacity() << std::endl;
      std::cout << "New data address: " << (void*)vec.data() << std::endl;

      std::cout << "\nAttempting to access data via the old pointer..." << std::endl;
      std::cout << "Old pointer value: " << (void*)ptr << std::endl;
      int value = *ptr;
      std::cout << "Read from dangling pointer (UB): " << value << std::endl;

      return 0;
  }
./a.out Initial capacity: 3 Initial data address: 0x517d2b0 Pointer before push_back: 0x517d2b0 Value via pointer before push_back: 1

Pushing back 4...

New capacity: 6 New data address: 0x517d6e0

Attempting to access data via the old pointer... Old pointer value: 0x517d2b0 Read from dangling pointer (UB): 20861

0xdeafbeef··on Windows 11 is closing a loophole that let you skip making a Microsoft account
Have you tried https://github.com/qarmin/czkawka?
Page 1 of 2Next →