# Shortest infinite loop producing no output

The point of this challenge is to create an infinite loop producing no output, unlike its possible duplicate. The reason to this is because the code might be shorter if no output is given.

## Rules

• Each submission must be a full program.
• You must create the shortest infinite loop.
• Even if your program runs out of memory eventually, it is still accepted as long as it is running the whole time from the start to when it runs out of memory. Also when it runs out of memory, it should still not print anything to STDERR.
• The program must take no input (however, reading from a file is allowed), and should not print anything to STDOUT. Output to a file is also forbidden.
• The program must not write anything to STDERR.
• Feel free to use a language (or language version) even if it's newer than this challenge. -Note that there must be an interpreter so the submission can be tested. It is allowed (and even encouraged) to write this interpreter yourself for a previously unimplemented language. :D
• Submissions are scored in bytes, in an appropriate (pre-existing) encoding, usually (but not necessarily) UTF-8. Some languages, like Folders, are a bit tricky to score - if in doubt, please ask on Meta.
• This is not about finding the language with the shortest infinite loop program. This is about finding the shortest infinite loop program in every language. Therefore, I will not accept an answer.
• If your language of choice is a trivial variant of another (potentially more popular) language which already has an answer (think BASIC or SQL dialects, Unix shells or trivial Brainf**k-derivatives like Alphuck), consider adding a note to the existing answer that the same or a very similar solution is also the shortest in the other language.
• There should be a website such as Wikipedia, Esolangs, or GitHub for the language. For example, if the language is CJam, then one could link to the site in the header like #[CJam](http://sourceforge.net/p/cjam/wiki/Home/), X bytes.
• Standard loopholes are not allowed.

(I have taken some of these rules from Martin Büttner's "Hello World" challenge)

Please feel free to post in the comments to tell me how this challenge could be improved.

## Catalogue

This is a Stack Snippet which generates both an alphabetical catalogue of the used languages, and an overall leaderboard. To make sure your answer shows up, please start it with this Markdown header:

# Language name, X bytes

Obviously replacing Language name and X bytes with the proper items. If you want to link to the languages' website, use this template, as posted above:

Now, finally, here's the snippet: (Try pressing "Full page" for a better view.)

• I've got to start posting programs with a negative byte count to beat all these empty files! – CJ Dennis Oct 3 '15 at 4:32
• This challenge is interesting because it brings out lots of 0 byte languages (some of which are NOT esolangs). FWIW, most declarative languages have an implicit infinite loop because declarative languages don't have loops in their syntax (they assume they're running in an infinite loop). Ladder diagrams are perhaps among the oldest such languages. Then you have the Instruction Language (IL), a sort of assembly for PLCs that also assume an infinite loop. ILs, like assembly are different between manufacturers – slebetman Oct 5 '15 at 9:36
• Are programs that read and execute their own source code allowed, or does file I/O break the "must take no input" rule? – ThisSuitIsBlackNot Oct 6 '15 at 13:05
• @ThisSuitIsBlackNot Yes, file input is allowed. – user41805 Oct 6 '15 at 16:47
• Can you print "", an empty string? – OldBunny2800 Mar 7 '16 at 23:39

# Burlesque, 2 bytes

bc

The BoxCycle command. Essentially takes whatever string s is on STDIN and tries to evaluate the infinite list [s, s, s...]

# Whitespace, 9 bytes

;
...; create label [space]
;
.;
.    goto label [space]

. represents a space and ; represents a newline character.

# RoboTalk, 5 bytes

0 rti

RoboTalk has three "goto" instructions: jump, return, and rti. Jump and return are plain "go to the address on the top of the stack" instructions, while rti has the side effect of (re-)enabling interrupts, as it's intended to be used to exit interrupt handlers. In a robot without any interrupt handlers defined, however, it is functionally equivalent to the other two instructions while being one byte shorter than jump.

# FlogScript, 2 bytes

F<

The F< (flow-control-restart) command repeatedly restarts the program.

# Groovy, 8 bytes

for(;;);

Shortened from the original thanks to suggestions. The trailing semicolon is still required, unfortunately.

while(1){}
• Can you not just do while(1); do you have to use {} ? – Albert Renshaw Oct 3 '15 at 6:04
• for(;;); <--what about that, I'm not familiar with Groovy – Albert Renshaw Oct 3 '15 at 6:04

# Factor, 14 bytes

: a ( -- ) a ;

and nicely symmetrical looking (almost)

# 8085 Intel Microprocessor ,4 1 byte

0000h: pchl

whose machine code is:

E9

Just reset the microprocessor. And load E9 at 0000h.

p.s: its almost impossible in some kit to load program at ROM memory(which is basically the start memory) So, it works on simulator and some special kits only.

C000H: lxi h,C000h
C003H: pchl

whose machine code will be

21 00 0C E9

# Pyth, 3 bytes

W1

Note that there is a space after W1.

# OCaml, 17 bytes

while 1<2do()done

1 byte removed thanks to @Mauris.

Another one bytes the dust thanks to @feersum.

• Try 1<2 instead of true. – Lynn Oct 11 '15 at 9:06
• @Mauris Nice catch, thanks – coredump Oct 11 '15 at 9:11
• You can drop the space after 2. – feersum Oct 15 '15 at 19:40

## Burlesque, 5 bytes

0bc<-

Trying to reverse an infinite list is guaranteed to loop forever and since it loops forever no output will be produced ever.

# PowerShell, 14 7 Bytes

for(){}

Previous version (14 bytes):

while($true){} # Roadrunner, 14 bytes mEEp mEEP MEEp ## Seriously 0.1, 2 bytes 1W 1 pushes a 1 on the stack, W executes the code between it and the next W (or EOF) while the value on the top of the stack is a truthy value. Since the value on top of the stack stays 1, it NOPs forever. # BotEngine, 2 bytes >< Fairly self-explanatory. • do bots loop around? if so, you could just do > – anOKsquirrel Nov 12 '15 at 23:34 • @anOKsquirrel No, they unfortunately do not. As stated in the specs, bots are destroyed upon exiting the grid. – SuperJedi224 Nov 12 '15 at 23:35 • ah, I see. better read more – anOKsquirrel Nov 12 '15 at 23:47 ## Marbelous, 7 bytes 00 \\// One marble bounces between the two deflectors forever. Alternate version: 00 /\/\ • What about simply MB ? – overactor Dec 7 '15 at 9:32 • @overactor I've been meaning to change the language spec so zero-input boards don't proc every tick and instead wait for one input which they discard. That's a much more useful construct. Regardless, even with the old spec, MB would infinitely recurse, not loop. – Sparr Dec 7 '15 at 19:18 # Javascript, 8 bytes while(); This almost crashed my computer once :o • Wait... this works? How? – SuperJedi224 Nov 28 '15 at 17:04 • I don't know... – user46167 Nov 28 '15 at 17:05 • Where does it work? – Qwertiy Dec 14 '15 at 21:32 • @Qwertiy chrome – user46167 Dec 14 '15 at 21:36 • Nope: Uncaught SyntaxError: Unexpected token )(…) – Qwertiy Dec 14 '15 at 21:36 # Mouse-2002, 2 bytes () ( begins a loop; ) ends it; there's no ^ so it never breaks. • Lol, cat and mouse :) – user41805 Dec 14 '15 at 13:57 • I think it's pretty great that I have the nickname cat, and am working on rebooting a language called mouse :) – cat Dec 14 '15 at 14:15 # QBasic, 8 7 bytes DO:LOOP Even shorter than the GOTO one! V1.0 1:GOTO 1 Classical Goto. # beeswax, 3 or 4 bytes A real loop (4 byte solution) *PFJ Explanation: * Generate IP, moving to the right. [0,0,0]• P Increment top local stack value. [0,0,1]• F Set all local stack values to top local stack value. [1,1,1]• J Jump to [row,column] = [top,2nd] local stack values. [1,1,1]• IP jumps back to to the * Shorter 3 byte solution I am not sure if reflecting IPs back and forth counts as loop, but here it is: j*j Explanation: j Mirror IP in horizontal direction * Create IP So, this program creates two IPs moving to the right and the left, which are reflected back between both j’s indefinitely. • I suggest you use the 3 byte solution. – user41805 Dec 26 '15 at 7:35 ## Spiral, 1 byte 0 All programs start at the label 0. All programs halt at the command !. Self-explanatory. # Mouse16, 2 bytes I hereby release the language I've been teasing! 0\ Goes to zero... which is the first byte... which executes the \ goto again... which -- well, you get the idea. This is like 10 GOTO 10 in BASIC. # Lua, 14 bytes repeat until a or while 1 do end The first one works because a is nil (because it is undefined), so it will never be true. The second one works because anything that is not false or nil, when casted to a boolean, evaluates to true. # Not boring version, 23 bytes debug.getinfo(1).func() debug.getinfo(1) returns the debug information of the current stack, and the func property represents a function that executes that stack. This will call the main stack an infinite amount of times. • Will any of these eventually overflow? – cat Jan 31 '16 at 5:08 • @cat I don't think they will. I tested all of them online on this demo and it didn't overflow, or put anything in the output for that matter. – QuertyKeyboard Jan 31 '16 at 16:18 • I just tested on lua5.2.4 and the first two occupy 100% of a core but 0.0% memory and so will never overflow, while the last one crashes with a stackoverflow in a few seconds after eating 20% of memory each second. – cat Jan 31 '16 at 16:35 • Having said that, debug.getinfo(1).func() on lua5.3 behaves exactly like the other two do. – cat Jan 31 '16 at 16:37 • That's good to know, I actually didn't know it overflows on earlier versions of lua. Thanks for letting me know. – QuertyKeyboard Jan 31 '16 at 18:20 # 2-ill, 7 bytes @ @ @$@

The instruction pointer just loops counterclockwise forever.

# Perl, 6 bytes

{redo}

See redo in perldoc.

# T-SQL, 8 bytes

l:goto l

(Not to be confused with this excellent answer from @MickyT in Standard SQL)

lbla
GOTO a

:a
GOTO a

Try it online!

# Turtlèd, 3 bytes

any character but * works in the middle

[-]

alt:

{*}

Explanation:

[    ] Brackets make a while loop. The character after the opening bracket is taken, and
the loop is executed while the current cell is not that character.

hence

[-]

Runs whilst the current cell is not -, but will never change it to that value, so infinitely runs, and never ouputs as it only outputs at the end.

{*}

works similarly, but it runs while the current cell IS that value. by default, the starting cell is *, so it runs forever, since it will never change its value

# (nontrivial) Polyglot, Turtlèd and Brainf*** 5 or 4 bytes, depending on implementation

doesn't make use of BF non instruction nops.

If you happen to have another cool esolang that might be able to be fitted in, tell me.

+[-+]

In wrapping implementations,

in non-wrapping:

+[+]

Explanation:

+    - essentially a nop in Turtlèd with no string, increments cell in BF
[+] - loops while current cell is not: {BF:0, Turtlèd:"+"}. increments cell in BF

[+-] - loops while current cell is not {BF:0, Turtlèd:"+"}. - is nop in Turtlèd with
no string, and +- together is nop (+1,-1) in BF

# PHP, 8 26 bytes

set_time_limit(0);for(;;);

Almost forgot: default time limit is 30 seconds and script will exit with a Fatal Error if I don´t unset it.

Run with -r

# J, 7 Bytes

(-^:_)_

A more "readable" form would be (- ^: _) 1. The _ can be any non-zero number and it will work the same (_ represents infinity in J). ^: is the "power" conjunction; it iterates a verb a specified number of times. E.g. (f ^: 3) 0 == f(f(f(0))). When told to iterate _ times, it keeps applying until it produces a constant output. Since negation never reaches a limit, this is an infinite loop.