Hacker News

Child prodigies rarely become elite performerseconomist.com

143 ptsFeb 5

My AI Adoption Journeymitchellh.com

949 ptsFeb 5

Nanobot: Ultra-Lightweight Alternative to OpenClawgithub.com/hkuds

257 ptsFeb 5

My AI Adoption Journeymitchellh.com

982 ptsFeb 5

My AI Adoption Journeymitchellh.com

984 ptsFeb 5

Nanobot: Ultra-Lightweight Alternative to OpenClawgithub.com/hkuds

245 ptsFeb 5

Nanobot: Ultra-Lightweight Alternative to OpenClawgithub.com/hkuds

257 ptsFeb 5

Child prodigies rarely become elite performerseconomist.com

141 ptsFeb 5

RS-SDK: Drive RuneScape with Claude Codegithub.com/maxbittker

124 ptsFeb 4

Claude Code for Infrastructurefluid.sh

274 ptsFeb 4

RS-SDK: Drive RuneScape with Claude Codegithub.com/maxbittker

123 ptsFeb 4

Claude Code for Infrastructurefluid.sh

276 ptsFeb 4

Voxtral Transcribe 2mistral.ai

1,012 ptsFeb 4

Child prodigies rarely become elite performerseconomist.com

143 ptsFeb 4

Voxtral Transcribe 2mistral.ai

1,011 ptsFeb 4

Show HN: Inverting Agent Model (App as Clients, Chat as Server and Reflection)github.com/rail-suite

24 ptsFeb 3

Show HN: Inverting Agent Model (App as Clients, Chat as Server and Reflection)github.com/rail-suite

24 ptsFeb 3

Show HN: Inverting Agent Model (App as Clients, Chat as Server and Reflection)github.com/rail-suite

24 ptsFeb 3

X / Twitter

I finally landed on a memory-optimal way to render audio waveforms in the browser. The full audio is decoded once, then chunked into 2s bins. Each bin stores peaks at 800 peaks/sec in a Uint8Array. Bins are persisted individually in IndexedDB, which keeps the data as raw Uint8 arrays and is faster to read than OPFS. Local or session storage wouldn't work here. A 2h video ends up as ~5.76 MB cached on disk. While scrolling or zooming the timeline, I load only the visible bins and downsample them to the required resolution. Everything runs async and I never keep more than a single bin in memory at once, ~800 bytes. Rendering supports mixed resolutions in the same pass since bins arrive async. By caching a read index and sorting bins ascending, each peak lookup stays O(1). On refresh, I wipe the IndexedDB so cache size never gets out of hand.@konstipaulus

Feb 7