HackerTube.dev

puls (256 bytes)

JanRrrolaKadlec · 35.9K views · 2009-09-28 · 0:43

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

A 256-byte MS-DOS intro that renders a raymarched, procedural 3D animation. It won the 256-byte competition at Riverwash 2009 and the scene.org award for best technical achievement that year, and the author published commented x86 assembly source.

On Hacker News

HN commenters cite it as the most impressive 256-byte production and as an example of how much graphics code can fit in a tiny binary.

Recommended by 1 HN people across 1 months · HN mentions 2011–2014

Topics

Search by tags

What people said

psykotic · 2011-08 · Recommendation

Neat hack! But stacking sine waves with a bit of modulation isn't exactly earth-shattering. You might like to try some of these: [LINK] . The most impressive to date is probably Puls: [VIDEO] . The top three 256b productions on Pouet are all doing the same basic thing of ray marching against an isosurface. The sophistication of the geometry has increased a lot since Lattice, which used something simple like cos(x)^2 + cos(y)^2 + cos(z)^2 = f(t) where f(t) is an oscillatory function of time that controls the thinning and fattening of the lattice.

Read the original HN comment ↗
userbinator · 2014-10 · Reference

> You really don't want to use x86 hardware transcendental instructions ...unless you're doing size-optimised graphics intros, where tremendous accuracy is not essential and the stack-based nature of x87 makes for some extremely compact code: [LINK] [VIDEO] I think the main reason why this issue hasn't been so significant is that the majority of code that uses those instructions isn't dependent on extreme accuracy - code that does would likely use their own routines and/or even arbitrary-precision arithmetic.

Read the original HN comment ↗
chengsun · 2014-04 · Reference

Řrřola (a famous demoscene coder [1]) found a far better constant than the original (a 2.7-fold accuracy improvement) by using an optimisation algorithm over all three constants present in the original inverse square hack. His algorithm and the result (along with a plot of relative error) can be found on his blog [2]. [1]: See, for example, this 256-byte raycaster [VIDEO] [2]: [LINK]

Read the original HN comment ↗

Sources

Video by JanRrrolaKadlec, played through YouTube.

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks
  • SaaS & AI candidates: Topic keywords do not match
  • Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources