17°

~/blog/articulo

Articles

Analysis and measurements of my own: networks, low-level work, hardware and systems.

All writing

Article cover: An agent that reads my own posts and verifies the numbers aren't made upArticleAn agent that reads my own posts and verifies the numbers aren't made upGoogle released version 2.14 of its agent kit on November 4, 2026, and among other things graduated its local execution sandboxes out of experimental. I wrote an agent that reads a technical blog post, extracts every number that appears in the text, and opens the raw JSON of the experiment to check that the number is actually there. On the post I published yesterday, it detected 46 numbers, verified the 9 that came from the measurements, flagged 1 that wasn't in the JSON because of a field I forgot to record, and classified the other 36 as context or configuration. It took one minute and sixteen seconds. A trivial regex gets it wrong: it claims 45 figures 'verified' because 50 == 50 by chance.#Agents#SDK#VerificationArticle cover: Cola2 on 16 GB: it fits with offload, scores 56% on ARC-Easy, but the paper's harness won't runArticleCola2 on 16 GB: it fits with offload, scores 56% on ARC-Easy, but the paper's harness won't runByteDance Seed released Cola2 on November 6, 2026: a language model with continuous latents and a diffusion transformer in place of the autoregressive one. I pulled it onto an RTX 4070 Ti SUPER, brought it up with the official example, and measured it on fifty ARC-Easy questions. It fits in 14.5 GB with the diffusion transformer offloaded to the CPU, lands 56% against the 22% of a trivial baseline that always picks the first option, and takes ten and a half seconds per question. The whole paper harness, with its official scorer, OOMs with every config I tried.#Models#GPU#BenchmarksArticle cover: Mage-VL-Cowork on 16 GB: it fits, it answers in 2.5 s, but it won't clickArticleMage-VL-Cowork on 16 GB: it fits, it answers in 2.5 s, but it won't clickMicrosoft released Mage-VL-Cowork, a 4-billion-parameter computer-use agent that scores 66% on OSWorld on paper. I pulled it onto an RTX 4070 Ti SUPER, brought it up with the official SGLang image, and measured it: loads in ninety to one hundred twenty seconds, holds 13,985 MB of VRAM, answers in 2.47 s. And across thirty prompts that asked it to click a button, it clicked zero times: every answer was to ask for another screenshot.#Agents#Models#GPUArticle cover: Unlimited-OCR 2 on 16 GB: it reads as well as Datalab's Chandra 2, but it is not unlimited on my cardArticleUnlimited-OCR 2 on 16 GB: it reads as well as Datalab's Chandra 2, but it is not unlimited on my cardI tested Baidu's Unlimited-OCR 2, released on October 27, against Datalab's Chandra 2 and Marker, DeepSeek-OCR and Tesseract on an RTX 4070 Ti SUPER. On 20 pages of a real Central Bank of Chile report it tied at the top with Chandra 2: a 0.12 % against 0.31 % character error rate, a difference that is not significant; DeepSeek-OCR landed at 3.1 %. But the promise of reading documents without limit did not hold on 16 GB: with transformers, memory went from 7.5 to 11.1 GB between 10 and 40 pages and ran out at 80; with SGLang, time per token did stay flat, but the window mode hung and a single window returned 24 of 40 pages without any error.#OCR#Local models#BenchmarksArticle cover: I measured Wild against mold again and mold won: the culprit was not the new versions, it was btrfsArticleI measured Wild against mold again and mold won: the culprit was not the new versions, it was btrfsIn September Wild beat mold linking ripgrep. I reran the bench with Wild 0.11 and mold 3.0 and mold won, also with the old binaries. In between, the machine moved from ext4 to btrfs. With target on ext4 or tmpfs Wild wins again; on btrfs Wild chooses to write from a buffer, and forcing mmap cuts 18 to 37 % of its time. In debug the link really matters: rust-lld took 37 s on btrfs and 1.9 s on ext4 for the same bevy link.#Rust#Linkers#BenchmarksArticle cover: Claude Code, Codex, OpenCode, OpenClaw, Hermes, mini-swe-agent and Raven on MiniMax-M3: 7 agent harnesses measured on Terminal-Bench 2.0ArticleClaude Code, Codex, OpenCode, OpenClaw, Hermes, mini-swe-agent and Raven on MiniMax-M3: 7 agent harnesses measured on Terminal-Bench 2.0I had seven coding agent harnesses drive the same cheap model, MiniMax-M3, on 40 Terminal-Bench 2.0 tasks: 280 runs with every request saved and every pass reviewed by a blind judge. The simplest harness, mini-swe-agent, solved 29 of 39; Codex 26, OpenCode 25, Claude Code 23, OpenClaw and Hermes 22, Raven 20. No difference between two harnesses survives the multiple-comparison correction. OpenCode was the cheapest and fastest; Raven, the most expensive.#Agents#Benchmarks#Claude CodeArticle cover: Isolating a coding agent with gVisor or Kata: what it costs compared with Docker, measuredArticleIsolating a coding agent with gVisor or Kata: what it costs compared with Docker, measuredI measured what it costs to run a coding agent's work isolated in gVisor and in Kata Containers 4.3 (with QEMU and with Cloud Hypervisor) instead of a plain Docker container. Kata takes 6 to 7 s to start against 0.22 s for runc and leaves 199 to 302 MiB per container against 11.5; gVisor starts in 0.33 s, uses 48.6 MiB and ties with runc on a workload of thousands of small files.#Containers#Security#AgentsArticle cover: ComfyUI vs Forge on a 16 GB GPU: they tie on SDXL, and ComfyUI is twice as fast with Z-Image when the models do not fitArticleComfyUI vs Forge on a 16 GB GPU: they tie on SDXL, and ComfyUI is twice as fast with Z-Image when the models do not fitI measured ComfyUI, Forge Neo and the original Forge with the same files, seeds and settings on an RTX 4070 Ti SUPER, with diffusers as a baseline. With SDXL they tie at 6.7 s per image. With Z-Image Turbo, which does not fit together with its text encoder, ComfyUI takes 6.75 s and Forge Neo 13.4 s; with Qwen-Image fp8, 75.7 s against 96.0 s. The logs point to how each one manages memory between RAM and the GPU.#AI#Benchmarks#Image generationArticle cover: NVFP4 vs FP8 vs GGUF on a 16 GB GPU without Blackwell: NVFP4 generates 2.3 times faster than BF16 and ties with BF16 on the full 1319-question GSM8KArticleNVFP4 vs FP8 vs GGUF on a 16 GB GPU without Blackwell: NVFP4 generates 2.3 times faster than BF16 and ties with BF16 on the full 1319-question GSM8KI measured the same NVIDIA model in BF16, NVFP4, MXFP8, FP8 and GGUF Q5_K_M on an RTX 4070 Ti SUPER. NVFP4 generates at 117 tokens per second against 51 for BF16, and FP8 is the fastest at reading a long prompt. On all 1319 GSM8K questions the three vLLM formats tie with BF16 within ±3 points, although token by token NVFP4 changes BF16's choice one time in ten.#AI#Benchmarks#Local inferenceArticle cover: NVFP4 without Blackwell: I ran NVIDIA's Qwen-Image on an RTX 4070 Ti SUPER and the NF4 grain was in 8 matricesArticleNVFP4 without Blackwell: I ran NVIDIA's Qwen-Image on an RTX 4070 Ti SUPER and the NF4 grain was in 8 matricesNVIDIA released Qwen-Image in NVFP4 for Blackwell only. On an RTX 4070 Ti SUPER the official route does not load, and the weights expanded to bf16 run slower than NF4 (145 s against 102 s per image) without writing better. What I did find is the source of the NF4 grain: not the layers with the worst error, but 8 matrices in the edge blocks that NVIDIA left unquantized. Keeping them in bf16 removes it at less than half a second more per image.#AI#Benchmarks#Local inferenceArticle cover: Asterinas 0.19, the Linux-compatible kernel in Rust: I reran its benchmarks on my machine and 13 of 23 hold upArticleAsterinas 0.19, the Linux-compatible kernel in Rust: I reran its benchmarks on my machine and 13 of 23 hold upAsterinas is a kernel written in Rust that runs Linux programs unchanged, and it publishes a nightly comparison against Linux. I reran 23 of those benchmarks with its own scripts, three times each, on a Ryzen 7 7800X3D. In 13 the result reproduces. Asterinas booted twice as fast and won on sysbench's thread latency; Linux won on the simple system calls, the file reads and writes and the nginx tests I measured, and on schbench with 8 CPUs. On fork the winner flips from what is published.#Rust#Linux#BenchmarksArticle cover: Kandinsky 6 on a 16 GB card: the video works, and only the big model passed my Spanish testArticleKandinsky 6 on a 16 GB card: the video works, and only the big model passed my Spanish testKandinsky 6.0 generates five seconds of video with audio. On my 16 GB RTX 4080 the official recipe ran out of memory with the distilled Lite model; with a two-phase recipe it ran, at about 2 minutes 21 seconds per vertical clip. I measured how faithful its Spanish is with Whisper across three models of the family: Lite distilled and Lite undistilled miss the rule I set before running; Pro distilled meets it, but its process reached 120 GiB of system RAM.#Models#Video#GPUArticle cover: Why I moved my whole home lab to NixOS: four machines, one repository and what it costArticleWhy I moved my whole home lab to NixOS: four machines, one repository and what it costI had four machines with four different operating systems, services running in tmux, passwords inside unit files and several agent sessions touching everything at once. In nine days I moved them to NixOS with a single flake. I measured what it gives: a deploy takes 11 to 17 seconds, the same commit produces the same system hash on two different machines, and going back to the previous version takes 1.6 seconds. And I measured what it cost: 35 of 111 commits are fixes, every Python environment was lost and the router's DNS repointed 1,185 files on its own.#NixOS#Infrastructure#AgentsArticle cover: Eight decision models against my data: none beat what I already use, and the index's second place ranked fraud backwardsArticleEight decision models against my data: none beat what I already use, and the index's second place ranked fraud backwardsI ran eight decision models on the Decision Index, which I reproduced, and on three banks of my own with real labels: video shot descriptions, card fraud and rain. None clearly beat each bank's classic reference. On fraud, the only bank where they separate clearly, d1-3B, second on the index, ranked backwards and JEV-9B was the clear best; on shots and rain the top ones tied.#IA#Benchmarks#Inferencia localArticle cover: Qwen-Image 2.1 replaces FLUX for my covers: 7 times faster on the same 16 GB card, and what I loseArticleQwen-Image 2.1 replaces FLUX for my covers: 7 times faster on the same 16 GB card, and what I loseI ran the same prompts and seeds through the FLUX that makes my covers and through Qwen-Image-2.1-Turbo quantized to NF4, on the same 16 GB card. Qwen takes 8.4 s per image against 61 s, writes 13 of 18 texts exactly against 7, and draws the requested scene in 11 of 15 covers against none. I lose the LoRA's atmosphere, and the version that fits 16 GB writes 4 fewer texts than unquantized Qwen.#IA#Benchmarks#Inferencia localArticle cover: I tried a vectorized PostgreSQL 19 on a laptop: 18 to 21% faster, and a 16,000-value ANY 948 times slowerArticleI tried a vectorized PostgreSQL 19 on a laptop: 18 to 21% faster, and a 16,000-value ANY 948 times slowerI tried pg_vexec, a vectorized executor for PostgreSQL 19, on a 4-core laptop: ClickBench gets 18 to 21% faster and every answer passes the author's checker against DuckDB. But the rewrite that rescues the planner from a huge OR, switching to = ANY, makes it pick a scan 948 times slower.#PostgreSQL#Databases#PerformanceArticle cover: The DNSSEC root changed its key on 11 October: what broke, hour by hour, and which environments already trust the new oneArticleThe DNSSEC root changed its key on 11 October: what broke, hour by hour, and which environments already trust the new oneOn 11 October 2026 the DNS root started signing with KSK-2024. I watched ten resolvers every five minutes. For example.com, counting from the first round with the new key, Ubuntu 24.04's systemd-resolved started failing after 20 minutes, the unbounds holding only the old key between seven and a half and thirteen and a half hours later, Pi-hole v5 stayed up and Yandex stopped marking its answers as validated. Before the switch I measured which distros, Docker images, routers and resolvers already trust it.#DNS#DNSSEC#SecurityArticle cover: Strands Decider 2B as the judge of my shots: 37 ms, and a keyword rule ties itArticleStrands Decider 2B as the judge of my shots: 37 ms, and a keyword rule ties itI measured Strands Decider 2B as a judge on 75 shots: with choice it hits AUC 0.91 in 34 ms per judgment, vs 0.99 for Claude Opus; a simple rule got 0.90. With its default primitive, noul, it caught none of the 31 generic shots; the v21 checkpoint does not improve it, and repetition across shots, my real failure, is caught by every judge. Data, labels and scripts are published.#AI#Benchmarks#Local inferenceArticle cover: A model that does not write, it only decides: I had Intern-Decision predict the rain without training itArticleA model that does not write, it only decides: I had Intern-Decision predict the rain without training itIntern-Decision came out on 26 September 2026: 0.8B to 4B models that do not generate text and return one probability per question in a single forward pass. I installed it the same day, ran into three failures along the way, one of which made it between 2 and 3.2 times slower, and had it predict tomorrow's rain over 27,256 days in seven Chilean cities without training it. The 2B reaches an AUC of 0.823, almost the same as a Naive Bayes trained on 74,145 rows, and stays below logistic regression.#Models#Benchmarks#GPUArticle cover: AWS says its agent harness saves 28% of tokens. I measured 1.82x more expensive locally, 88% cheaper in the cloudArticleAWS says its agent harness saves 28% of tokens. I measured 1.82x more expensive locally, 88% cheaper in the cloudI tested Strands Harness, AWS's agent runtime, against a bare LangGraph agent: same 3 tools, same gatekeeper, same 20-turn conversation. Against a local Qwen3.8-27B with a 16k context window it spent 1.82 times more tokens. Against the same job on a cloud model, with temperature finally matched between the two, it spent 88.8% less. And three rounds of adversarial audit had to correct my own mistakes along the way: 11 extra tools, a turn limit that lied, and a cache double-count that inflated the first number 4x.#Agents#LangGraph#AWSArticle cover: How file compression actually works today (and how I beat zlib by 2.86% with graph theory)ArticleHow file compression actually works today (and how I beat zlib by 2.86% with graph theory)I translated zlib from C to Rust with c2rust, proved the translation is bit-exact across more than 15,000 cases, then replaced zlib's heuristic with a shortest path in a graph. Result: 2.86% smaller than zlib -9, verified byte for byte against the real C implementation. Along the way: how lossless compression actually works today, from LZ77 and Huffman to why zopfli and PPMd don't break Shannon's limit either.#Compression#Rust#CArticle cover: Rust Coreutils 0.12 vs GNU 9.12: almost everything works the same, starting a process costs nearly three times more, and mv between disks loses the datesArticleRust Coreutils 0.12 vs GNU 9.12: almost everything works the same, starting a process costs nearly three times more, and mv between disks loses the datesI measured Rust Coreutils (uutils) 0.12 against GNU coreutils 9.12 in containers with limits: the GNU test suite, 157 commands with their output compared, and process start-up. uutils is slower in 91 of 157 cells, takes 2.8 times longer to launch 5,000 processes, and mv across file systems loses the modification dates.#Rust#Coreutils#GNUArticle cover: Dragonfly 2.0 vs Redis 8 and Valkey 9: with 2 CPUs it wins big, with 4 it depends on how you configure the othersArticleDragonfly 2.0 vs Redis 8 and Valkey 9: with 2 CPUs it wins big, with 4 it depends on how you configure the othersI measured Dragonfly 2.0, Redis 8.10 and Valkey 9.1 in containers with 2 and 4 CPUs. With io-threads on, Redis and Valkey catch up with Dragonfly without pipelining and beat it at pipeline 16; with 2 CPUs and no pipelining, Dragonfly wins by 59% to 99% over stock Redis. It uses 8 to 15% less memory per key.#Dragonfly#Redis#ValkeyArticle cover: CUDA in Rust vs CUDA C++: Rust wins by 3.2% until you check that they do not compute the same thingArticleCUDA in Rust vs CUDA C++: Rust wins by 3.2% until you check that they do not compute the same thingI built cuda-oxide, NVIDIA's backend for writing CUDA kernels in Rust, and timed the same kernel against CUDA C++. On Mandelbrot Rust comes out 3.2% faster, but the two programs differ in 27,510 pixels; with the arithmetic matched bit for bit, Rust ends up 7% slower.#Rust#CUDA#GPUArticle cover: Wild beats mold linking Rust 20 times out of 20, and in release the linker is no longer the bottleneckArticleWild beats mold linking Rust 20 times out of 20, and in release the linker is no longer the bottleneckI measured Wild 0.10.0, mold 2.42.1, rust-lld and GNU ld linking ripgrep and cargo. Wild won all 20 repetitions of each project, by 1.9 ms and about 8 ms. With either one the link is close to 1% of the rebuild. And on the way I almost published false numbers twice.#Rust#Linkers#BenchmarksArticle cover: ExLlamaV3 vs llama.cpp with Qwen3.8-27B on 16 GB: faster decoding, but it does not always winArticleExLlamaV3 vs llama.cpp with Qwen3.8-27B on 16 GB: faster decoding, but it does not always winI gave both engines exactly the same input tokens inside a container with pod limits. ExLlamaV3 decodes faster and handled 131k tokens of context; with 13 GB files it loses less quality, with 15 GB files it loses to GGUF. In an agentic turn, prefill eats almost all of the lead.#ExLlamaV3#llama.cpp#QuantizationArticle cover: A chat on Amazon Bedrock AgentCore for my blog: I broke it with 64 messages and rebuilt it with rules outside the promptArticleA chat on Amazon Bedrock AgentCore for my blog: I broke it with 64 messages and rebuilt it with rules outside the promptTutorial: LangGraph chat on Amazon Bedrock AgentCore with an S3 Knowledge Base and guardrails, tested on a 64-message chat. Costs and a local option.#AI#AWS#SecurityArticle cover: I measured Pingora 0.9.0 six times slower than nginx. The culprit was one line of my codeArticleI measured Pingora 0.9.0 six times slower than nginx. The culprit was one line of my codeI wrote a minimal reverse proxy with Pingora 0.9.0 and in a 2 vCPU container it measured 21 thousand requests per second against nginx's 126 thousand: six times slower. The culprit was not Pingora but a blocking getaddrinfo my upstream_peer ran on every request. Fixed, the real gap is 1.70x, and perf quantifies it: 1.70x in cycles per request, 119.4 thousand against 70.4 thousand.#Rust#Benchmarks#NetworkingArticle cover: Hard rules against Random Cut Forest on the same stream: the model adds 13 points of recall and costs 7 times the throughputArticleHard rules against Random Cut Forest on the same stream: the model adds 13 points of recall and costs 7 times the throughputI ran Apache Flink with Kafka and measured three deterministic rules against Amazon's Random Cut Forest over exactly the same payment stream, on a four-core box with no GPU. The rules reach 0.814 recall at 173 thousand events per second; the model reaches 0.943 but drops the pipeline to 23 thousand; together they hit 0.982.#Streaming#Benchmarks#DataArticle cover: I measured 320 Chilean sites: half already use post-quantum cryptography, and almost none of them chose toArticleI measured 320 Chilean sites: half already use post-quantum cryptography, and almost none of them chose toI probed the 320 most visited .cl domains: 145 negotiate X25519MLKEM768 (47.7%), but only 9 of the 128 with their own infrastructure. Measured cost: 0 ms.#Post-quantum cryptography#TLS#ChileArticle cover: I built a fully post-quantum handshake, then went to see which of my servers could do itArticleI built a fully post-quantum handshake, then went to see which of my servers could do itRustls turned ML-DSA certificates on by default, but only for private hierarchies. I built an mTLS where the key exchange, the server signature and the client identity are all post-quantum. I measured what the chain weighs, which version of each server supports it, and corrected a number I had got wrong: the private key is not nineteen times bigger, it is 128 bytes.#Post-quantum cryptography#TLS#mTLSArticle cover: pg_anon found my database's emails, but not the RUTArticlepg_anon found my database's emails, but not the RUTI tried pg_anon, the Russian tool that masks personal data in Postgres. With stock rules it caught 1 of 8 PII columns on a Chilean database; with my own rules, all 8. I measured recall, integrity and speed against pg_dump.#PostgreSQL#Personal data#AnonymizationArticle cover: More bits where it hurts: I quantized a Qwen3.8-27B to fit my 4070 TiArticleMore bits where it hurts: I quantized a Qwen3.8-27B to fit my 4070 TiQ4 overflows 16 GB and Q3 gives up quality. A llama.cpp patch spreads the bits layer by layer: I measured a Qwen3.8-27B at 94% agreement with an 8-bit reference that does fit on a 4070 Ti.#Quantization#llama.cpp#GGUFArticle cover: Bun rewrote itself from Zig to Rust in eleven days. I measured what they published, and what they did notArticleBun rewrote itself from Zig to Rust in eleven days. I measured what they published, and what they did notBun ported 535,000 lines from Zig to Rust and published three concrete figures: start-up, requests per second, and binary size. Version 1.3.14 was the last Zig build and 1.4.0 the first Rust one, so you can download both and measure the same thing with only the binary changing. Start-up beats it comfortably, binary size falls short, and for memory and idle CPU the announcement gives no number at all: those two I measure with nothing official to compare against.#Rust#ArquitecturaArticle cover: I built a public sandbox for Chile's Open Finance System, and Keycloak alone did not get thereArticleI built a public sandbox for Chile's Open Finance System, and Keycloak alone did not get thereChile has an open finance regulation and no public sandbox to test it against. I built a complete unofficial one, faithful to the Technical Annex: participant directory, bank, authorization server and requesting application, with mandatory PAR, an encrypted request object, mTLS and RAR reaching the token. Keycloak 26 covers much of it through configuration, but the consent model Chile picked does not exist in the product: it had to be written from scratch.#Seguridad#Arquitectura#ChileArticle cover: The seven GEO rules: I reproduced the only test that exists, then audited my own 72 pagesArticleThe seven GEO rules: I reproduced the only test that exists, then audited my own 72 pagesA Russian study tested the seven rules the GEO industry keeps repeating against 73 pages that six engines had cited, and not one survived. I rebuilt its counts and reproduced all seven p-values exactly. Then I took the detector to my own 72 pages, and there something appeared that none of the rules looks at: four different pages declaring the same entity.#SEO#GEO#StatisticsArticle cover: I translated DOOM from C to Rust without writing a line, then used the model for what it is actually good atArticleI translated DOOM from C to Rust without writing a line, then used the model for what it is actually good atI needed to move a program from C to Rust and my first idea was to ask a model. A tool already existed that does it in 23 seconds. The translation matched the original bit for bit across the 11,113 frames compared, except one that traces back to an uninitialised-memory bug already present in 1993's DOOM, and the model ended up doing something else entirely: textures, per-pixel relief and continuous lighting on top of the original engine.#Rust#C#Code translationArticle cover: Go 1.27 brings portable SIMD: it ties with NumPy out of cache and loses inside itArticleGo 1.27 brings portable SIMD: it ties with NumPy out of cache and loses inside itI measured Go 1.27's experimental simd package against NumPy on a real task. They tie when the corpus does not fit in cache, and NumPy wins by 2.4 times when it does. Along the way I nearly published two false comparisons, and those are the useful part.#Go#Benchmarks#PythonArticle cover: TabPFN and TabICL against tuned XGBoost: the model that does not train won on fourteen tables out of fourteenArticleTabPFN and TabICL against tuned XGBoost: the model that does not train won on fourteen tables out of fourteenThe claim behind TabPFN and TabICL is that they predict on a table without ever training on it and still beat tuned boosting. I measured it on fourteen datasets from the Grinsztajn benchmark, with the same split and the same clock for everyone. The one that does not train wins, the advantage holds up to 32,000 rows instead of breaking, and the most-cited model can no longer be downloaded without an account.#Models#Benchmarks#GPUArticle cover: I put the same agent to fix real bugs with three local engines: 284B, 27B and 27B in two bitsArticleI put the same agent to fix real bugs with three local engines: 284B, 27B and 27B in two bitsThe DeepSeek Harness has only been tested against the official API. I wired it to three local engines and gave them real SWE-bench Verified instances. Two tie on fixes, one is eleven times faster, and the one with 284 billion parameters barely leaves the starting line.#Agents#Models#GPUArticle cover: Your architecture diagram is lying: I tested both ways of writing it as codeArticleYour architecture diagram is lying: I tested both ways of writing it as codeA visual C4 editor showed up on Habr and cannot be self-hosted. I tested the two alternatives that can: the Structurizr CLI generates all three levels of a real system in 1 second from a single file; C4-PlantUML reaches the same result without installing anything, at the cost of tripling the model.#Architecture#ToolsArticle cover: The chip that guards your keys is broken: I audited all four machines in my swarmArticleThe chip that guards your keys is broken: I audited all four machines in my swarmTwo flaws rated CVSS 8.5 and 8.3 in firmware TPM affect Ryzen 3000 through Ryzen 9000 and Intel up to Ultra 200. I checked my four machines: two are affected, one has had a patch since July and the other was abandoned by its vendor in 2022.#Security#Hardware#LinuxArticle cover: PhantomRelay: why your automation gives itself away before the first HTTP byteArticlePhantomRelay: why your automation gives itself away before the first HTTP byteA Node HTTP client is distinguishable from real Chrome in the TLS handshake, before sending a single header. How I built a browser relay with a Rust addon over BoringSSL, cost-based escalation and nearly 900 tests.#Systems#NetworksArticle cover: Does Qwen3.8-27B fit in 16 GB of VRAM? I measured it, and found out my own benchmark was lyingArticleDoes Qwen3.8-27B fit in 16 GB of VRAM? I measured it, and found out my own benchmark was lyingEveryone repeats that Alibaba's new model needs about 15 GB in 4 bits. My GPU has 16 and the file weighs 16.5. I measured tokens per second, real VRAM and the CPU/GPU split across three context sizes, and the model ended up correcting me.#Models#GPU#BenchmarksArticle cover: The OSI model explained: the 7 layers and encapsulationArticleThe OSI model explained: the 7 layers and encapsulationWhat the OSI model is, what each of its 7 layers is for, and how a piece of data gets encapsulated into segments, packets, frames and bits as it travels across the network.#Networks#Low level