Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
LightMachine
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
31.
▲
by
LightMachine
2y ago
I apologize, I gave you the wrong answer. I thought you was talking about the DEMO example, which ran ~30% slower than expected. Instead, you were talking about the README, which was actually incorrect. I noticed the error and edited it. I
32.
▲
by
LightMachine
2y ago
I agree with you. But then there's the entire "release fast, don't wait before it is perfect". And, then, there's the case that people using it will guide us to iteratively building what is needed. I'm still tr
33.
▲
by
LightMachine
2y ago
The only claim I made is that it scales linearly with cores. Nothing else! I'm personally putting a LOT of effort to make our claims as accurate and truthful as possible, in every single place. Documentation, website, demos. I spent ho
34.
▲
by
LightMachine
2y ago
I believe the single-core version was running slower due to the memory getting full. The benchmark was adding 2^30 numbers, but HVM2 32-bit has a limit of 2^29 nodes. I've re-ran it with 2^28 instead, and the numbers are `33.39 seconds
35.
▲
by
LightMachine
2y ago
Exactly, this kind of thing always happens with these loops, which is why I think programs that allocate are fairer. But then people point out that the C allocator is terrible, so we can't make that point :')
36.
▲
by
LightMachine
2y ago
Bend has no tail-call optimization yet. It is allocating a 1-billion long stack, while C is just looping. If you compare against a C program that does actual allocations, Bend will most likely be faster with a few threads. Bend's codeg
37.
▲
by
LightMachine
2y ago
Running on 42 minutes is mots likely a bug. Yes, we haven't done much testing outside of M3 Max yet. I'm aware it is 2x slower on non-Apple CPUs. We'll work on that. For the `sum` example, Bend has a huge disadvantage, becaus
38.
▲
by
LightMachine
2y ago
We will have 64-bit boxed numbers really soon! As in, next month, or earlier if users find this to be a higher priority.
39.
▲
by
LightMachine
2y ago
the single-thread case ran a little slower than it should on this live demo due to a mistake on my part: `run` redirected to the Rust interpreter, rather than the C interpreter. the Rust one is a little bit slower. the numbers on the site a
40.
▲
by
LightMachine
2y ago
yes!
41.
▲
Bend: a high-level language that runs on GPUs (via HVM2)
(github.com)
1041 points
by
LightMachine
2y ago
|
253 comments
42.
▲
by
LightMachine
2y ago
Great question! Short answer: GPU Long answer: CUDA Seriously though. Implementing a full high-level lang in parallel is HARD, so, to simplify it greatly, we made IC nodes 64-bit, which allows us to use native 64-bit atomic operations in ma
43.
▲
by
LightMachine
2y ago
Yes, Kind2 will be a type layer on top of Bend, with a similar relationship as in JavaScript / TypeScript (but much more integrated, less ad-hoc and with proofs!). I don't want Kind2 to compete directly with Lean though, as it is
44.
▲
by
LightMachine
2y ago
It is an interpreter that runs on GPUs, and a compiler to native C and CUDA. We don't target SPIR-V directly, but aim to. Sadly, while the C compiler results in the expected speedups (3x-4x, and much more soon), the CUDA runtime didn
45.
▲
by
LightMachine
2y ago
It was actually just me recording iTerm2 with OBS. The theme is Solarized Light. What do you mean by skip commands?
46.
▲
by
LightMachine
2y ago
Also, I wonder if you will agree with me, but I'm perhaps too bothered by this title? We'd probably use something more mundane, like: - Bend: a high-level language that runs on GPUs, powered by HVM2 Or something similar. I don
47.
▲
by
LightMachine
2y ago
Hey, Taelin here. Thanks for posting, but our URL is wrong, it should be: HigherOrderCO.com. I can't post it again (gets flagged as a duplicate). Would appreciate if HN mods could change it! Anyway, after years of hard work, HVM2 is fi
48.
▲
~
(hvm-page.pages.dev)
1 points
by
LightMachine
2y ago
|
0 comments
49.
▲
by
LightMachine
2y ago
Oh my point was NOT that LLMs can't simulate a Turing machine reliably. I was just replying to the tweet above. The main point of this (speculative) text is that GPTs can "evolve a general learner" inside them, but are unab
50.
▲
Claude-3 emulates Pokémon Red
(twitter.com)
3 points
by
LightMachine
2y ago
|
0 comments
51.
▲
PSA: GPT-4 Is Obsolete
(twitter.com)
2 points
by
LightMachine
3y ago
|
0 comments
52.
▲
by
LightMachine
3y ago
As a Brazilian, I approve that choice. Vambora amigos!
53.
▲
by
LightMachine
3y ago
Gemini Ultra release day, and a minor post on ollama OpenAI compatibility gets more points lol
54.
▲
by
LightMachine
3y ago
I would love to, if YCombinator allowed me. The "edit" button is missing. I've edited on Reddit and other places where I posted this test.
55.
▲
by
LightMachine
3y ago
Don't blame Google. Blame "Play Store". Probably the company behind it doesn't want Gemini to succeed.
56.
▲
by
LightMachine
3y ago
> How hard can it be to just scan some documentation and code every few weeks? oh dear...
57.
▲
by
LightMachine
3y ago
Oh fuck. Well, in my defense, nobody is claiming I'll design fusion reactors and cure cancer by 2027
58.
▲
by
LightMachine
3y ago
ERRATA: I just noticed GPT-4 mixed up `h` and `f`, so it also got it wrong. This is a draw. Both AIs (and, apparently, myself) are terrible at reasoning. Guess we're not curing cancer with computers anytime soon :')
59.
▲
by
LightMachine
3y ago
Oh, lol, you're right. Seems like I'm dumber than both AIs. GPT-4 mixed up `h` and `f`, so it also got it wrong, so this is a draw and both AIs (and, apparently, myself) are terrible at reasoning. Guess we're not curing cance
60.
▲
by
LightMachine
3y ago
AGI implies there are no cognitive tasks that some humans can perform, yet that this AI can not perform. Otherwise, what is the point?
More ›