Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
nsomani
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
1.
▲
The Birth of Development Alpha
(power2026.ai)
1 points
by
nsomani
2d ago
|
0 comments
2.
▲
To Build a Data Center – Intro to Diesel Generation
(power2026.ai)
9 points
by
nsomani
29d ago
|
2 comments
3.
▲
IndieMath – Crowdfunded automated proving for open CS/math problems
(indiemath.ai)
1 points
by
nsomani
2mo ago
|
0 comments
4.
▲
Power 2026 – Electricity Pricing in the Age of AI
(power2026.ai)
1 points
by
nsomani
2mo ago
|
0 comments
5.
▲
Autoformalization and the Future of Math Research
(neelsomaniblog.com)
2 points
by
nsomani
8mo ago
|
0 comments
6.
▲
Show HN: GPT-Erdos – the results of GPT 5.2 Pro on the Erdos problems
(ocf.berkeley.edu)
1 points
by
nsomani
8mo ago
|
0 comments
7.
▲
by
nsomani
8mo ago
Appreciate that. I didn't realize how derivative this was when I built it! I was just trying to build something cool with the Codex SDK.
8.
▲
by
nsomani
8mo ago
They cannot edit the iFrame itself. The user is allowed to edit the contents within the iFrame.
9.
▲
by
nsomani
8mo ago
The Codex agent is only given tools to edit the single HTML file that displays on the homepage. The page is on a separate domain, so there's no cookie sharing, and the iFrame is in a sandbox. That said, the biggest risk is social engin
10.
▲
Show HN: A website that auctions itself daily
(thedailyauction.com)
43 points
by
nsomani
8mo ago
|
19 comments
11.
▲
by
nsomani
8mo ago
There are two examples provided - quote matching and bracket closing.
12.
▲
Show HN: Symbolic Circuit Distillation: prove program to LLM circuit equivalence
(github.com)
16 points
by
nsomani
8mo ago
|
2 comments
13.
▲
The endgame for mechanistic interpretability is formal methods
(neelsomaniblog.com)
2 points
by
nsomani
8mo ago
|
0 comments
14.
▲
Show HN: Do Models Represent Epistemic Stance?
(github.com)
3 points
by
nsomani
9mo ago
|
0 comments
15.
▲
Intro to Routing: Mixture-of-Experts and Expert Choice
(neelsomaniblog.com)
1 points
by
nsomani
10mo ago
|
0 comments
16.
▲
by
nsomani
10mo ago
Hi all - this is a small research prototype I built to explore cross-GPU reuse of transformer attention states. When inference engines like vLLM implement prefix/KV caching, it's local to each replica. LMCache recently generalized
17.
▲
Show HN: KV Marketplace – share LLM attention caches across GPUs like memcached
(github.com)
2 points
by
nsomani
10mo ago
|
1 comments
18.
▲
A Minimal Route to Transformer Attention
(neelsomaniblog.com)
2 points
by
nsomani
11mo ago
|
0 comments
19.
▲
by
nsomani
11mo ago
Oh really? I can't find anything about the memory model online. I'm not sure what's the best way to do this, but if there's a way for us to get in contact, I'd be interested in adjusting the project so it's dev
20.
▲
by
nsomani
11mo ago
I think I've just spent too much time reading the word "CUDA" that I read "cu" as "koo", lol.
21.
▲
by
nsomani
11mo ago
That instinct is right. cuTile would be easier to parse but harder to reason about formally.
22.
▲
by
nsomani
11mo ago
Oh wow, honestly this caught me off guard - I've been pronouncing it "kook" in my head the whole time.
23.
▲
by
nsomani
11mo ago
Hi all, this is a small research prototype I built that connects Rust's MIR (Mid-level IR) to Coq, the proof assistant used for formal verification. cuq takes the MIR dump of a Rust CUDA kernel and translates it into a minimal Coq sema
24.
▲
Show HN: Cuq – Formal Verification of Rust GPU Kernels
(github.com)
94 points
by
nsomani
11mo ago
|
63 comments
25.
▲
Killing the GIL: How to Use Python 3.14's Free-Threading Upgrade
(neelsomaniblog.com)
2 points
by
nsomani
11mo ago
|
0 comments
26.
▲
Is GRPO Broken?
(neelsomaniblog.com)
2 points
by
nsomani
11mo ago
|
0 comments
27.
▲
Intro to RL: Off-Policy Methods
(neelsomaniblog.com)
2 points
by
nsomani
11mo ago
|
0 comments
28.
▲
What You Didn't Learn in Berkeley CS 188: Intro to RL
(neelsomaniblog.com)
2 points
by
nsomani
1y ago
|
0 comments
29.
▲
by
nsomani
1y ago
I agree with you. I agree with OP in the following sentences: >We have now landed on our final strategy: start by figuring out the number of possible secret codes n. For each guess, calculate the number n_i' of codes that will still
30.
▲
by
nsomani
1y ago
Hey friends, I was originally interested in a slightly adjacent space related to traversing a complex tree of actions in a web app: https://x.com/paulg/status/1897338753590653000?s=46 I open-sourced this repo to (
More ›