Byte by Byte
35 subscribers
14 photos
3 videos
1 file
51 links
Bite your bit of tech information and news here. Discuss in our Chip Chat group!
Download Telegram
Okay, this is a bit Cicero pro domo sua, but hear me out, okay? ;)

Read my latest article: In Defense of LLMs
We welcome a new admin in the channel! 🎉💯
👍3
Huge GitHub milestone. Repo #1B was created today and it's named “shit”.
I may be late to the game but this research paper, “Simulating Time in Square-Root Space” by Ryan Williams seems very interesting.

Abstract:


We show that for all functions t(n)n, every multitape Turing machine running in time t can be simulated in space only O(tlogt) . This is a substantial improvement over Hopcroft, Paul, and Valiant's simulation of time t in O(tlogt) space from 50 years ago [FOCS 1975, JACM 1977]. Among other results, our simulation implies that bounded fan-in circuits of size s can be evaluated on any input in only spoly(logs) space, and that there are explicit problems solvable in O(n) space which require n2− time on a multitape Turing machine for all 0, thereby making a little progress on the P versus PSPACE problem.

Our simulation reduces the problem of simulating time-bounded multitape Turing machines to a series of implicitly-defined Tree Evaluation instances with nice parameters, leveraging the remarkable space-efficient algorithm for Tree Evaluation recently found by Cook and Mertz [STOC 2024].
V-JEPA 2 is the new iteration of the V-JEPA architecture, which according to Yann LeCun will replace Transformer-based LLMs for the so-called “World” models - models that understand the real world rather than mere words.
GOOGLE THAT’S NOT WHAT I MEANT
😁1🤣1
Whoa.

AMD Research has unveiled a cutting-edge method for generating procedural, fully customizable tree geometry - running entirely on GPU using work graphs and mesh nodes. Over 150 parameters control everything from structure to seasonal changes, pruning, wind response, animation, and real-time edits.

Performance:
• 3.13ms per frame (RX 7900 XTX)
• Geometry size reduced from 34.8GB to 51KB per frame
• Continuous LOD like UE5’s Nanite, targeting stable 120 FPS
• Work graph uses up to 1.5GB scratch buffer (varies by GPU)

Presentation (HPG 2025): YouTube ~7:14
Full paper: EG Digital Library

Chapeau to AMD Research and u/Bloodwyn1756 (Bastian Kuth)!
First IPC, then CIPC, then StiffGIPC, and now OGC: the University of Utah and NVIDIA have finally created a model for guaranteeing “penetration-free simulation of codimensional objects with minimal computational overhead”. Basically this means we can now accurately and efficiently simulate complex, real-world interactions with things like clothing and fabric.

Video paper here: https://youtu.be/xxyniqSLJik
👍1
A core reason for rewriting projects that have worked reliably for 20+ years in Rust seems to be giving developers the fun of fixing brand-new bugs.

In Ubuntu 25.10, unattended upgrades are broken due to a bug in the Rust reimplementation of GNU Coreutils. The only way to update is manually via apt update && apt upgrade.

https://bugs.launchpad.net/ubuntu/+source/unattended-upgrades/+bug/2129660
😁1🗿1
I don't know who needs to hear this but if you have a PS5 lying around that hasn't been recently updated, you can now play pirated games run homebrews on it pretty easily:

https://github.com/Gezine/Y2JB