Live data from Hacker News

Infinite complexity in 4096 bytes

creativeapplications.net

21–30 of 78 posts

Re: Infinite complexity in 4096 bytes

#21

I once spent hours looking for an internet archive or community of demo scene files / artists. There doesn't seem to be one out there in the eyes of google. Can anyone familiar with this art form please provide links to your your underground hangout? :)

http://www.pouet.net is the only I'm aware of.

[edit] maybe http://scene.org also ?

Re: Infinite complexity in 4096 bytes

#22

I once spent hours looking for an internet archive or community of demo scene files / artists. There doesn't seem to be one out there in the eyes of google. Can anyone familiar with this art form please provide links to your your underground hangout? :)

[deleted]

Re: Infinite complexity in 4096 bytes

#23
post #2

Easily forgotten, a lot of today's demos' complexity lies behind API calls to graphics drivers and OS system calls, whose implementations don't count to the byte limit.

Gosh, some guys are so easily hurt by a fact. And what "subtext" you read in my comment. Terrible.

As a matter of fact, demo producers are offered more and more API choices. Compare what you had to accomplish with tinkering around with bare-metal BIOS interrupts in the 90s, compared to a full-fledged DirectX API including GPU-raytraycing almost out-of-the-box.

Re: Infinite complexity in 4096 bytes

#24

I once spent hours looking for an internet archive or community of demo scene files / artists. There doesn't seem to be one out there in the eyes of google. Can anyone familiar with this art form please provide links to your your underground hangout? :)

This is a very thorough list of the most famous (read:best) and most influential demos: https://news.ycombinator.com/item?id=3840830

Re: Infinite complexity in 4096 bytes

#25
post #11

The lossless 60 fps high definition video capture is currently unavailable (traffic limit). Any mirrors (or torrent would probably be a pretty good idea)? YouTube 1080p version seems to have pretty terrible quality.

This seriously begs for a torrent.

Re: Infinite complexity in 4096 bytes

#26
post #11

The lossless 60 fps high definition video capture is currently unavailable (traffic limit). Any mirrors (or torrent would probably be a pretty good idea)? YouTube 1080p version seems to have pretty terrible quality.

This one? http://www.youtube.com/watch?v=0w_xEUoK79o It was uploaded in 2048x1526 resolution, so anything less than that will be downsampled by Youtube.

Re: Infinite complexity in 4096 bytes

#27
post #5

Cool, but I think my favourite 4k demo is still Elevated, which is much less obviously procedural. ( http://www.youtube.com/watch?v=_YWMGuh15nE )

Bloody hell, that's brilliant. That's really 4k?!? The intro gave me chills. I wish the geometry were less obviously faceted, but the texturing is astonishing.

Of course the OP is brilliant too. Kudos to all these guys!

Re: Infinite complexity in 4096 bytes

#28
post #13
post #2

Easily forgotten, a lot of today's demos' complexity lies behind API calls to graphics drivers and OS system calls, whose implementations don't count to the byte limit.

Just like early PC 4k's used the BIOS/DOS interrupt routines which were not counted either. And before that, there were all these custom purpose built chips for doing graphics and audio synthesis. When making 4k intros for Linux (may apply to other platforms) you have to do your own startup and runtime linking code because otherwise the executable will go over the limit before it does anything. Because of this, you w…

    mov ax, 13h
    int 10h

Re: Infinite complexity in 4096 bytes

#30
post #28
post #13

Earlier quoted context omitted.

Just like early PC 4k's used the BIOS/DOS interrupt routines which were not counted either. And before that, there were all these custom purpose built chips for doing graphics and audio synthesis. When making 4k intros for Linux (may apply to other platforms) you have to do your own startup and runtime linking code because otherwise the executable will go over the limit before it does anything. Because of this, you w…

mov ax, 13h int 10h

You are correct. And using a mov to ax rather than xor+mov to al is counter-intuitively one byte smaller (there's one more byte of immediate value in the former). Every byte counts!

(I tested using "nasm -f bin")

Post reply on HN