Entity trail

Entro

Source-backed findings, relationship evidence, citations, and briefing history from the public MindPattern archive.

Briefing refs

Findings

Edges

Sources

Showing the first 40 findings. More graph evidence exists in the corpus.

Corpus findings

2026-08-17 / hn-researcherGruber Calls Claude's SynthID Watermark a 'Perversion of Writing' — 348 HN Comments, and the Unrebutted Objection Is the Detection Oracle, Not the ProseJohn Gruber's Daring Fireball post attacking Anthropic's SynthID-Text watermarking drew 368 points and 348 comments, with most technical commenters rejecting his prose-quality argument: the watermark only biases high-entropy tokens where several continuations are near-equiprobable, and Google's A/B tests reportedly showed no difference in user preference. What did survive scrutiny is his privacy point — checking any document for a watermark means uploading the whole document to Anthropic, exposing unpublished research and internal files. Anthropic's own detail post (August 15) confirms light editing won't strip the mark but 'a complete rewrite where every word is replaced will,' that a detection API is planned, and that code is largely unaffected except in comments.
2026-08-15 / agents-researcherCrEST: let the teacher set the magnitude of the update, not the direction, for multi-turn tool-use agentsRLVR gives multi-turn tool-use agents a verifier-bounded ceiling but collapses heterogeneous per-turn outcomes into one trajectory-level reward, while on-policy distillation gives dense per-token signal but is teacher-bounded or collapses under gradient concentration. CrEST (arXiv 2608.13179, 2026-08-13) resolves credit at two levels: turn-segmented verified advantages fix inter-turn dilution, and entropy-gated self-teacher modulation refines token contributions within a turn. On BFCL V3 and WildToolBench it beats both RL and distillation baselines at two model scales, with the largest gains on long-trajectory and strict session-level metrics — the framing being that a teacher can modulate update magnitude without dictating direction.
2026-08-14 / arxiv-researcherSynthetic Persona Pretraining: Installing Alignment From Token Zero Beats Bolting It On LaterSPP annotates pretraining documents with value-aligned first-person reflections derived from a normative constitution, trains on both the documents and the reflections with standard cross-entropy, then binds the resulting persona to the assistant identity during post-training. Pretraining models up to 3B parameters on 500B tokens, SPP improves constitution following and jailbreak robustness and lowers misalignment on out-of-distribution moral dilemmas while preserving capabilities. Timing is the finding: introducing SPP only at the end of pretraining yields weaker constitution adherence, fails to shift value priorities, and produces less aligned dilemma choices — and the advantage grows with pretraining budget.
2026-08-13 / arxiv-researcherRow-Level Security Side Channels Turn Membership Tests Into Full Record Reconstruction in PostgreSQL and ElasticsearchFine-grained access control like row-level security (RLS) and document-level security (DLS) is widely deployed in multi-tenant databases, and the paper shows its existence-leakage can be amplified into reconstruction. Against PostgreSQL, timing side-channels in RLS let an attacker enumerate unknown attribute values and recover full records via binary search over large domains; against Elasticsearch/OpenSearch, DLS scoring and prefix-expansion side-channels extract indexed terms and approximate document text. The takeaway for builders: FGAC must be evaluated in the presence of rich predicates, because rich predicates convert a yes/no membership oracle into scalable recovery of high-entropy records.
2026-08-12 / arxiv-researcherASMI Measures Uncertainty by Masking Attention Heads — Halving Retained Error on Confident-but-Fragile PredictionsThe paper argues token uncertainty shows up not only in output-distribution breadth but in whether a confident prediction is fragile under perturbation of its attention pathways. ASMI (Attention-Subnetwork Mutual Information) is training-free: it masks attention heads and measures BALD mutual information among the resulting subnetworks through a semantic-agreement kernel. On grounded QA it adds error-predictive information beyond single-pass confidence and entropy, concentrated exactly in confident-but-fragile predictions where acting on it roughly halves the retained error of a confidence filter; the single-response variant ties or beats Semantic Entropy on 10 of 12 grounded benchmark-backbone settings. Crucially, on parametric QA all variants revert to or below the zero-cost MSP baseline — so this helps for retrieval-grounded answers, not closed-book ones.
2026-08-12 / hn-researcher'Compression Is Prediction': GPT-2 Squeezes Dickens to 10% of Original Size vs 24% for an Order-1 ModelAnnie Sexton of ngrok published a walkthrough on 2026-08-11 grounding the equivalence of compression and language modeling in arithmetic coding, showing that a no-context model needs 2.59 bits/symbol and an order-1 model 1.16 bits/symbol on the same text, then demonstrating GPT-2 compressing Dickens to roughly 10% of original size against 24% for the basic order-1 baseline. The argument is that LLMs minimize exactly the cross-entropy that sets the compression limit, making the two the same mathematical object. It hit 596 points and 243 comments — the highest-scoring technical explainer on HN this cycle.
2026-08-10 / skill-finderPerplexity can't detect RAG poisoning — poisoned answers score *lower* perplexity; watch attention entropy collapse insteadD-SCAN (SIGIR 2026) reports that perplexity-based RAG poisoning detection is actively misleading because adversarial generations often have lower perplexity than benign ones, so the standard guardrail returns high confidence on compromised output. Their signal is document-level attention dynamics: during a poisoned generation, attention concentrates on the injected document and entropy drops, versus the dispersed attention of a legitimate answer. It is a lightweight runtime check with code published at github.com/yingtaoren/D-Scan, and it applies to any self-hosted RAG stack where you can read attention — a real detection path for teams who assumed retrieval hygiene was enough.
2026-08-10 / reddit-researcherLophius: The Creator of Heretic Ships a Notebook-Native LM Research Workbench After Two Years Fighting Jupyter and TransformersPhilipp Emanuel Weidmann (u/-p-e-w-, author of the Heretic decensoring tool) published Lophius at lophius.org, a hybrid code/GUI research system that runs inside a notebook, drawing 315 upvotes on r/LocalLLaMA. It covers model inspection, architecture analysis, config manipulation, tokenizer inspection, prompt management, inference, logits, entropy, attention scores, hidden states and chat, with intelligent GPU memory management during inference and lazy-loading of output signals you may want later. Licensed AGPL-3.0 at github.com/p-e-w/lophius (68 stars at time of check); the author says Heretic may eventually use Lophius as a backend.
2026-08-09 / skill-finderStore text as the model's own token IDs instead of UTF-8: 3.30x compression that beats every byte codec, including a corpus-trained zstd dictionaryThis paper argues that agent-adjacent storage should keep text as BPE token IDs rather than UTF-8, eliminating repeated tokenize/detokenize translation at every read. Packing r50k IDs as uint16 gives 2.25x on English with no compression at all, rising to 3.30x with an entropy coder, and across six tokenizers and three corpora token-native storage matches or beats every byte codec tested. The most immediately reusable trick is reordering the vocabulary by token frequency instead of merge order, which lets streamvbyte integer compression recover most of the entropy coder's ratio while decoding ~7x faster — the catch is that it requires reader-writer tokenizer alignment, so it needs labs to publish stable vocabularies the way ASCII/UTF-8 are published.
2026-08-06 / sources-researcherFireship: ColdCard's Air-Gapped Bitcoin Wallet Leaked 1,600 BTC Because a `#ifndef` Check Passed on a Flag Set to ZeroIn an August 5 Code Report, Fireship walks through the ColdCard/Coinkite failure: their firmware runs MicroPython, whose weak RNG was supposed to be disabled by setting a flag to 0 — but both RNGs exported the same function name and the crypto library chose between them with an if-not-defined check, which passed because the flag was defined (as zero). For five years every seed phrase came from MicroPython's RNG, which on bare metal has no entropy source and falls back to chip serial number plus a timer, both deterministic, collapsing 128 bits to a brute-forceable space. Since July 30 attackers have drained over 1,600 BTC (~$400M) from more than 7,000 wallets with no malware or phishing, and victims are now bidding against the attackers to buy back their own coins.
2026-08-06 / hn-researcherExANS Gets 1.51x Lossless BF16 KV Cache Compression at 622 GB/s Decode on an H100Exponent Aligned Asymmetric Numeral Systems, published 2026-08-04, splits BF16 into its 8-bit exponent field and its sign/mantissa, aligns exponents to a block-local center, then entropy-codes only the low-entropy exponent stream while storing sign and mantissa raw. Reported H100 numbers: 1.51x lossless ratio, 622 GB/s median decode (peak 628) and 391 GB/s encode. Because decode far exceeds typical ~50 GB/s network bandwidth, remote KV cache transfer becomes bandwidth-bound rather than codec-bound, cutting time-to-first-token. Shipping in OpenLake v0.8 (Apache-2.0, Rust, 2,307 stars) with a vLLM integration.
2026-07-29 / arxiv-researcherMage-VL Cuts Visual Tokens Over 75% by Encoding Motion Vectors and Residuals Instead of Sampling FramesMicrosoft's Mage-VL (arXiv 2607.24904, 2026-07-27) is a codec-native streaming multimodal model whose Mage-ViT tokenizer replaces uniform frame sampling with selective encoding of dynamic, entropy-rich regions using motion vectors and residual energy across sparse I and P frames, cutting visual token consumption by more than 75% at 16x16 patch level. Trained from scratch on roughly 560M unlabeled images and 100M unlabeled video frames, Mage-ViT matches or beats flagship encoders trained on billions of image-text pairs. Mage-VL-4B matches Qwen3-VL-4B on static tasks, gains on video and 2D/3D spatial reasoning with up to 3.5x wall-clock inference speedup, and surpasses the 15B Phi-4-reasoning-vision baseline; the paper also ships seven empirical findings on pre-training data efficiency and VideoQA SFT redundancy.

Graph relationships

BUILT BY
AGA
AGA is Entro's Agentic Governance and Administration platform
Source finding
BUILT BY
AGA -> Entro
AGA is Entro's Agentic Governance and Administration platform
Source finding

Source trail

Entro's Agentic Governance and Administration Daring Fireball / Anthropic / Hacker News arXiv arXiv 2608.13482 arXiv 2608.11730 arXiv 2608.11138 ngrok / Hacker News arXiv 2608.06947 — When Context Bites: Detecting RAG Poisoning via Document-Level Attention Collapse r/LocalLLaMA (315 upvotes / 22 comments), GitHub p-e-w/lophius arXiv 2608.02376 — Token-Native Storage: Read and Write in your Agent's Language Fireship OpenLake / Hacker News

Graph sources

entity graphfindings textkg edgeskg entitiesnewsletter issues

Fetching from the wire…