Higher Order Company
@higherordercomp
Followers
8K
Following
251
Media
0
Statuses
70
Getting to the very core of what makes computers capable of reasoning. https://t.co/5iLyJjioth
Delaware, US
Joined January 2023
334
118
4K
btw, just to elaborate on the significance of this SupGen is a tool that finds programs (and proofs) by example. it can discover stuff that LLMs can not, like new algorithms, new science, because it is a generalizer. basically, it is the opposite of GPTs: no memory, no model,
So... Claude Code just optimized HVM3 to 328 MIPS per M4 Core (+51%)... And it then created a CUDA version for it. ... This is serious. Since HVM3-Nano is now just ~5K tokens, it easily fits on Sonnet's context. I literally just asked Claude Code to optimize the repo, and it
34
47
651
AGI is reached when the capability gap between humans and computers is zero ARC Prize Foundation measures this to inspire progress Today we preview the unbeaten ARC-AGI-2 + open public donations to fund ARC-AGI-3 TY Schmidt Sciences (@ericschmidt) for $50k to kick us off!
24
70
678
I received an interesting question about Interaction Nets: > Asperti and Guerrini themselves had certain reservations about the tractability of bringing Interaction Nets to life, do you have a path towards solving the issues they have outlined? This is not the first time and
5
9
115
morning! today I'll start reaching out to VCs. I want to close this round ASAP, start getting things done, beat ARC-AGI by EOY or fail for good. that's all, lg
10
4
211
AGI apart, what can HOC can bring to the world? ✨The child of Haskell & Rust, born with CUDA superpowers.✨ That's the best way to describe what a mature Bend would be. It would: - Be significantly faster than Haskell even in a single-core (HVM3 is evidence of that), and
22
7
197
HOC is doing a post-seed funding round to turn SupGen, an HVM-powered program synthesizer, into a Symbolic Transformer: a logic-based AI architecture, and validate it on the ARC Prize. More details on:
wefunder.com
Bend2: The AI Programming Language
3
15
238
HOC is now small research lab that is laser focused on building the first Symbolic Transformer. We had many pivots through the year, but we're finally stable in a direction, with promising results and a clear business path. It also makes the most logical sense: use HVM to build
37
19
508
DEMO TIME SupGen is a generative coding AI... except it isn't an AI. There is no model, there is no pre-training. You just give it some examples, and it gives you a program. It runs locally, in a single-core CPU. Oh, and it can also prove theorems. Here's a demo, including a
62
124
1K
HVM's Program Synthesis - Initial Results AI startups successfully developed systems capable of *learning* arbitrary skills. Yet, as impressive as LLMs are, they eventually hit a wall: the dataset they learn from. To break that wall, models were recently augmented with "search"
34
49
573
despite making Bend as simple as I possibly could, 99.9% of people following me still have no idea what HVM is useful for. to most, it is no different than some pseudoscience bs. I eventually came to the acceptance that I shouldn't be trying to make people use interaction nets,
61
17
653
btw, the best way to describe what I'm doing is: I'm maximizing the bitter lesson. that is, if ingenious approaches failed, and what made GPT so good was, ultimately, the combination of a dumb simple algorithm with fuckton of compute; then, what happens if we take this lesson by
It now solves: foo : Int -> [Int] -> [Int] -> [Int] - foo 2 [1,0,1] [] == [0,1] - foo 1 [1,0] [] == [1] - foo 0 [1,0] [] == [] - foo 3 [0,1,1,0,1] [] == [1,1,0] In ~1s, single-core. Is there any model-free AI (i.e., pure search from scratch) that can do it in less?
14
6
213
hey guys - so, today I can confirm my hypothesis worked, and the main milestone I sought has been hit. the synthesizer implemented algorithms and solved problems that even o1 couldn't. using it is somewhat magical - it *feels* intelligent, even though I know isn't. it is just a
64
44
2K
Experiment complete, here are the results 🥳 tl;dr: still exponential, 10x speedup (replacing loops by superpositions) Q: What is this chart? A: The evaluation time (log scale) of the dumbest factorization algorithm (brute-force) on both Bend (HVM) and Haskell (GHC). Q: How
Sure! The factors are: A = 115792089237316195423570985008687907853269984665640564039457584007913129639935 B = 67122489389749701580734010960344317546866110214399252391236155889652070170165 . . . modulus 2^256 🤓☝️ As shown in the video, this is operating mod 2^N (since that's
9
16
284
How to use HVM3's collapser to solve a functional equation! 1. Implement a function on HVM3's syntax (Bend soon) 2. Enumerate all terms of X using superpositions 3. Write your equation on the main function 4. Run it with: 'hvml run main.hvml -C' And that's it. HVM will
13
9
121
HVM3 is turning out *really* good, in ways that I didn't even anticipate. The move to Haskell+C was the best decision I ever made. Haskell gives me the expressivity I need, C gives me the performance. Extremely refreshing to watch everything aligning after a bunch of missteps
7
7
246
HOC - Complete Overview, no BS (Ask questions here!) Vision: - Interaction Nets are a powerful tech Mission: - Build powerful products with Interaction Nets Reasoning: - We believe this theory can result in major breakthroughs in many areas of CS, including programming
38
33
401