Jared

On the other hand, there's DeepSeek R1, a Chinese AI lab's MIT-licensed reasoning model that gives OpenAI's O1 a run for its money and only cost $5.6 million to train. It's big money versus big brain. I'm jealous of both. Okay, let's get into this week's news. DeepSeek R1's epic pull request.

On the other hand, there's DeepSeek R1, a Chinese AI lab's MIT-licensed reasoning model that gives OpenAI's O1 a run for its money and only cost $5.6 million to train. It's big money versus big brain. I'm jealous of both. Okay, let's get into this week's news. DeepSeek R1's epic pull request.

Speaking of big brain, Zan Sun Nguyen opened a pull request to Georgi Gaganov's Lama.cpp repo that doubles the speed of Wasm by optimizing SIMD instructions with the following PR comment. Quote, surprisingly, 99% of the code in this PR is written by DeepSeek R1. The only thing I do is to develop tests and write prompts with some trials and errors.

Speaking of big brain, Zan Sun Nguyen opened a pull request to Georgi Gaganov's Lama.cpp repo that doubles the speed of Wasm by optimizing SIMD instructions with the following PR comment. Quote, surprisingly, 99% of the code in this PR is written by DeepSeek R1. The only thing I do is to develop tests and write prompts with some trials and errors.

Indeed, this PR aims to prove that LLMs are now capable of writing good, low-level code to a point that it can optimize its own code. End quote. I can't judge whether this is good, low-level code or not because I don't know what good, low-level code looks like. But Gyorgy and Zan Sun sure are impressed. Zansun also shared the prompts they used to get the desired results.

Indeed, this PR aims to prove that LLMs are now capable of writing good, low-level code to a point that it can optimize its own code. End quote. I can't judge whether this is good, low-level code or not because I don't know what good, low-level code looks like. But Gyorgy and Zan Sun sure are impressed. Zansun also shared the prompts they used to get the desired results.

This, of course, resulted in a long X-thread where both humans and robots debate and meme whether or not it's over for folks like us, or not quite yet. Tailwind CSS version 4 is official.

This, of course, resulted in a long X-thread where both humans and robots debate and meme whether or not it's over for folks like us, or not quite yet. Tailwind CSS version 4 is official.

Here's Adam Wavin, quote, Tailwind CSS version 4 is an all-new version of the framework optimized for performance and flexibility with a reimagined configuration and customization experience and taking full advantage of the latest advancements the web platform has to offer, end quote. This looks like it was a massive undertaking.

Here's Adam Wavin, quote, Tailwind CSS version 4 is an all-new version of the framework optimized for performance and flexibility with a reimagined configuration and customization experience and taking full advantage of the latest advancements the web platform has to offer, end quote. This looks like it was a massive undertaking.

It has a new high-performance build engine, simplified installation, automatic content detection, Reimagined, CSS First Config, and too much more to list here. The most influential papers in computer science history. Matthias Lima opens up the history books to create this admittedly subjective list of influential papers dating all the way back to 1936.

It has a new high-performance build engine, simplified installation, automatic content detection, Reimagined, CSS First Config, and too much more to list here. The most influential papers in computer science history. Matthias Lima opens up the history books to create this admittedly subjective list of influential papers dating all the way back to 1936.

1.

1.

2.

2.

3.

3.

A Relational Model of Data for Large Shared Databanks. Edgar F. Codd, 1970. Four, The Complexity of Theorem-Proving Procedures. Stephen A. Cook, 1971. Five, A Protocol for Packet Network Intercommunication. Vinton G. Cerf and Robert E. Kahn, 1974. Six, Information Management, A Proposal by Tim Berners-Lee, 1989.

A Relational Model of Data for Large Shared Databanks. Edgar F. Codd, 1970. Four, The Complexity of Theorem-Proving Procedures. Stephen A. Cook, 1971. Five, A Protocol for Packet Network Intercommunication. Vinton G. Cerf and Robert E. Kahn, 1974. Six, Information Management, A Proposal by Tim Berners-Lee, 1989.