Censoring everyone because something doesn't make you look good. Either own up to it, or if it ISN'T true then you can say it; but censoring negative feedback ruins your reputation even more.
Enderchef (Enderchefcoder) PRO
AI & ML interests
Recent Activity
Organizations
I think the concerns about attribution and untested accuracy claims are reasonable. A few technical details from the blog also deserve consideration, though:
The 512 local tokens are included in the 2,048-token budget. The example specifies 512 local + 1,536 remotely selected tokens. With 128-token blocks, that means 12 remote blocks plus the local window, rather than 16 remote blocks with another 512 tokens added. This makes the proposed attention budget internally consistent.
Using the same
k = 2048as DSA does not make the mechanisms equivalent. DSA scores individual tokens with its lightning indexer. BGA proposes scoring block representations before retrieving their full-resolution tokens. At 1,048,576 tokens and 128 tokens per block, there are 8,192 block candidates. That is a plausible way to reduce routing work, although fewer candidates do not automatically imply a proportional speedup or equally accurate selection.Banaxi's distinction about the recurrent state is technically meaningful. NSA attends over a growing collection of compressed block representations. BGA proposes an additional small state updated recurrently from its previous contents and active information. That idea was already present in the original blog version. It is a conceptual difference, although the proposal still needs to specify how that state contributes to the output. It also does not make the whole system constant-memory, since older exact blocks remain searchable.
The 256× versus 512× distinction has a valid mathematical basis. Under the blog's assumptions, causal attention averages roughly
n/2accessible positions across a sequence, while a decoding step near its end sees approximatelyn. Comparing those withkgivesn/(2k)andn/k. These are estimates for the main attention interactions, not measured training or generation speedups. The blog explicitly acknowledges other costs, so that qualification deserves recognition.Selecting contiguous blocks has a sound hardware motivation. NSA itself discusses more efficient memory access and Tensor Core utilization with blockwise selection. This supports the engineering rationale behind BGA's routing choice, even though the idea is established and BGA's actual implementation would still need benchmarking.
The current blog also acknowledges NSA, MoBA, Landmark Attention, Routing Transformer, and Infini-attention. That is a useful correction to the original omission.
None of these points establishes that BGA is novel or more accurate than DSA. They do make the proposal more nuanced than a block-size change alone. A useful next step would be a concrete implementation and a controlled comparison, including an ablation with and without the recurrent state, measuring quality, memory usage, and actual runtime.
i wanted try to make a model architecture and dsa wasnt that good i never knew about nsa until now and yes i used ai to make the arch yes only thought better than dsa because i NEVER Knew ab out nsa idk what you want me to do you keep now i already know and yeah ok ill stop making new architectures and just use preexissting ones i did read tge bkog i just didnt know about nsa only compared it to dsa
I don't know what's going on here, but everyone should listen to one another, not make this a big argument. Also, AI generating your replies to an argument isn't good.
your BGA blog is a copy of NSA (deepseek, 2025) branded under your name. literally the same top16 selected blocks, 512 local window, router over block summaries, all you did was change block size from 64 to 128.
you didnt cite NSA once but you put a “please cite BGA” bibtex at the bottom.
i commented under your post and said that there is no way that you can support claims like: “The Accuracy Should BE WAy better than DSA but untested yet.” you didnt run a single experiment. and the 256x isnt from BGA, its just n/2k with k=2048 so the exact same k DSA uses. if opus wrote this for you, at least read it before posting.
i commented again after you hid my comment despite it having constructive and correct feedback and you hid that too. and again.
you can hide the truth and just try to get hf post likes..... but is it really the thing that needs to be done? do you really want to take papers and make them yours while barely even changing the params?
admitting your mistakes and doing something about them needs humbleness, intelligence, humanness.
i encourage you to admit your mistakes and try to do better next time (at least read what blog your ai wrote or do proper experiments to back your stuff up).
Open SLM Evaluations is a dataset containing benchmarks for 106 SLMs(150M parameters and below). It has benchmark scores for each model, links, parameter counts, and names.
Results were evaluated independently over 30 GPU minutes on a Runpod B200!
Data is open on Apache 2.0! Check it out!
Enderchef/Open-SLM-Evalulations
🤗 We trained a ~20k-parameter Transformer that can actually write stories!
raincandy-u/MacroStories
→ ~50× smaller than the 1M-parameter TinyStories model
→ ~3,000× smaller than AlexNet
→ 81 KB in FP32
yayyy the whole model. ૮ ˶ᵔ ᵕ ᵔ˶ ა
She has a 32-dimensional hidden state, a 378-token vocabulary, and just one decoder block — recurrently applied 4 times with shared weights.
Despite having only 19,969 parameters, she can maintain a simple narrative across 100–300 words: establish a goal, encounter a problem, take relevant actions, and reach an outcome.
She runs extremely fast on CPU — no GPU required. The entire model is tiny enough to load almost instantly! ☺️
Give it a screenshot or photo plus a yes/no, multiple-choice, or scoring question, and it returns a probability for every option instead of generating text.
It serves TypeSafe's
/v1/systemone format, so the official SDK works by changing the base URL, including requests with images.The clip shows
vev-4b playing Doom in real time. On each look, the image is split into 8 vertical slices, and Vev answers 8 yes/no questions in a single request, one per slice. A small fixed-rule harness turns those probabilities into turning and firing.Try it in the browser:
CountingSheep/vev
Weights:
CountingSheep/vev-4b
CountingSheep/vev-9b
LoRA adapters are also available in the collection.
Code:
https://github.com/Xiaooolong/vev
Fine-tuned from Qwen3.5. Tested on NVIDIA GPUs so far.
Check it out and like it!
AxiomicLabs/Tiny_Theory_of_Mind
FINALLY AFTER A YEAR
ANTHROPIC ANNOUNCED HAIKU 5.5
Check it out and like it!
AxiomicLabs/Tiny_Theory_of_Mind
Check it out and like it!
AxiomicLabs/Tiny_Theory_of_Mind
📊 Q6_K + imatrix, llama.cpp, greedy, lcb_v6_55 — merge / base / DeltaCoder / Qwopus / Ornith:
⚡ LiveCodeBench v6 (55 hard) — 0.7818 / 0.7273 / 0.6364 / 0.6000 / 0.5818
✅ HumanEval — 0.8841 / 0.8902 / 0.9146 / 0.8537 / 0.7805
✅ HumanEval+ — 0.8232 / 0.8049 / 0.8232 / 0.7988 / 0.7073
🤝 MultiPL-E — 0.8033 / 0.8200 / 0.8000 / 0.8200 / 0.7267
📋 IFEval — 0.9100 / 0.9300 / 0.9200 / 0.8800 / 0.8200
🎯 LCB beats every source AND the base: +5.45pp over the base, +14.54pp over DeltaCoder, its heaviest.
🛑 And why. Same 55 problems, same cap, generations that NEVER terminated: DeltaCoder 25/55 · base 18/55 · Qwopus 8/55 · Ornith 2/55 · JackOD 1/55. That split is the thesis: DeltaCoder is the cohort's best coder and worst at stopping, Ornith the weakest and best at stopping. The merge takes BOTH.
🤝 tool-eval-bench hardmode, 5 seeds: JackOD 144.4 ±4.7, second behind Ornith 145.6 ±4.2, above base 142.0 — all CIs overlap. But Autonomous Planning: JackOD 5.2/6, best of five, Ornith WORST at 2.8/6. Ornith stops reliably but plans worst — it stops too early. The merge does both.
🔧 Serving: temp 0.6 / top_p 0.95 / top_k 20 + presence_penalty 1.5 — the penalty stops it re-treading a tool call. Tool calling on llama.cpp needs --jinja.
🧪 Initial impression, limited testing: fixed a cline-harness task in 535s; A3B models want 1.5-4h at <50% success.
📦 25 GGUF tiers, every K/IQ imatrix-built incl Q6_K, plus a ContribDynamic ladder (per-tensor maps from our imatrix, Unsloth-UD style).
🙏 danielcherubini/Qwen3.5-DeltaCoder-9B · ornith-ai/Ornith-1.5-9B
🔗 ManniX-ITA/JackOD-9B-Coder
🔗 ManniX-ITA/JackOD-9B-Coder-MTP-GGUF
🔗 https://ollama.com/mannix/JackOD-9B-Coder
Is everyone here an AI model?!
Naming is so bad on these models lmao
Awesome!