Announcement time! Over the last months, many asked what are our plans with HVM, Kind, Kindelia. I can finally answer that question: we're launching a tech startup! There is a lot to explain, but, for now, check our silly pitch preview: github.com/VictorTaelin/H…

Hey I'm looking for a really talented Rust developer with experience in threaded computing and low-level assembly optimizations to work with me on the HVM: github.com/kindelia/hvm Competitive salary. DM me! Retweet & spread please <3

HOC will be closing the seed round tomorrow. We've been raising for 3 weeks. Love meeting new people, but can't lie all these meetings are driving me crazy! Soon we'll start hiring and go on full Taelin mode. Expect me reporting progress in a breathtaking pace every day soon!

HOC is a tech startup that will build the massively parallel future of computing through the power of Interaction Nets, a promising alternative model of computation. To learn more about us, check the links below:

Pitch deck: pitch.higherorderco.com Initial roadmap: github.com/VictorTaelin/H… Tech overview: github.com/HigherOrderCO/… As for myself, I'm an eager builder that won't rest until HOC becomes largest tech company in the world. This is just the beginning. Let's go!

Interaction Nets are the optimal model of computation and will inevitably replace CPUs, GPUs and the Von Neumann architecture. Do you agree? If so, HOC raised a seed round and we're looking for highly competent and passionate partners to join our founding team. Interested? DM me.

Took Taelin’s awesome experiments around compressing GPT prompts and built CompressGPT. A one-line change in your @LangChainAI code => 70% token usage deduction! musings.yasyf.com/compressgpt-de…

Pro tip: you can ask GPT-4 to prove the correctness of its own code outputs. #GPT4

Looking for top CUDA talents to help us polish, optimize and maintain HVM2's new GPU runtime. High pay. This baby: github.com/VictorTaelin/H… DM on. Please spread! For the curious: just finished the V1. Insane atomics orchestration. Completely lock-free. And it works! 🔥▲

After almost 10 years of exhaustive research, nights without sleep, I've finally completed my ultimate work and can now reveal my real motives. With you... A Lock-Free Interaction Combinator Evaluator... To Fix League of Legends' Client Performance github.com/HigherOrderCO/…

We're still looking for a top-tier CUDA developer to help us maintain and polish the upcoming HVM GPU runtime, keeping it in sync with the Rust reference. Current code at: github.com/HigherOrderCO/… Full time, 100% remote, top pay. If you know anyone please share.

People need to understand that making things run faster is not about running things that exist faster, it is about making it possible to run things that do not exist

MASSIVE BREAKTHROUGH After committing the fast-deref experiment, I've immediately realized how I could leverage it to interleave HVM's runtime with compiled procedures. I quickly, manually compiled a sample. Result: 35X SPEEDUP. That's 5.5 BILLION RPS in a SINGLE CORE. (...)

HVM Core and Lang main branches updated with multi-core mode! That means you can clone the repo and start playing with the parallel runtime today. Keep in mind this is a demo: expect broken things a lot of short-term instability. Full announcement, from discord.higherorderco.com:

HVM is becoming the world's fastest λ-calculator! For a perspective, let's perform a Radix Sort on a Scott Tree with millions of ints, vs state-of-art runtimes: JavaScript (V8): 29.081s Haskell (GHC): 11.073s Kind (HVM): 2.514s How is that possible? See below ↓

HVM talk at GambiConf - University of São Paulo (USP) youtube.com/watch?v=sDPuQ-… Includes everything you need to know in a simple and pedagogic way, assuming only basic programming background. English subs. Let me know if you have any question!

(This is also the most important code I've ever written, topping parallel HVM and whatnot. Not many will immediately understand (or agree!), but, if my intuition is right, this, on inets, should be the basis for an automated reasoning tool I'm working on.)

Today has been an exciting day of progress on ITT - which I'm now renaming to Interaction Calculus of Constructions (ICC). The most compelling aspect of ICC is how simple, yet powerful, it is. The current implementation is less than 100 lines on HVM, making it much smaller than

Kind2's bootstrap is complete! AND IT'S THE WORST CODE I'VE EVER WRITTEN! We're talking about 1000+ lines of mostly repetitive, fully inlined λ-encoded algorithms. A colossal functional beast that go as far as eyes can see. And, the most impressive part: it type-checks! But

Minor update, but: ADTs & Match on Kind2 done! This is by far the hardest part of Kind2, because we need to convert high-level datatypes and pattern-matches into self-λ-encodings, including dependent-type wizardry like index families and so on. There are so many small details