Congratulations to Dennis who won both the cops' and the robbers' challenge! Calvin's Hobbies has already delivered on his promise and wrote this challenge for Dennis for winning the robbers' challenge.

Notice: This challenge is closed for further cop answers as of 2015-09-01 02:00:00 UTC. Any new answers posted will not be eligible for winning and will not count towards the robbers' scores if cracked. However, you may still post new answers for the other users' enjoyment, so that there are still some puzzles available for future visitors. These new answers are included in the "Vulnerable Cops" section of the leaderboard and their non-competing status is marked separately.

Welcome to the Cops-and-Robbers edition of The Hello World Quiz! (If you've never played the quiz, feel free to try it out for a minute or 30. You don't need to have played it for this challenge though.)

The Cops' Challenge

  1. Choose a programming language. Valid languages must have either an English Wikipedia article, an esolangs article or a Rosetta Code article at the time this challenge was posted (note that the linked lists are not necessarily complete because they are curated manually). They must also satisfy our usual standards for programming languages, so things like HQ9+ are out. Lastly, there must be a free (as in beer) interpreter or compiler available for the language (at the time this challenge was posted).
  2. Write a Hello World program. That is, write a full program in the chosen language which prints Hello, World! (exactly like that, i.e. this exact byte stream) and optionally a single trailing newline to STDOUT or closest alternative.

    You must not assume a REPL environment, existing boilerplate code, or non-standard compiler/interpreter flags. The program must be in the form of one or more source files (to rule out quirky languages like Folders) and must fit into your answer in full (so it must not be longer than 30,000 characters) - this shouldn't be an issue for any serious submission.

    If your code contains bytes outside the printable ASCII range, please include a pastebin or hex dump to make sure your code is actually testable.

    The program must terminate within 1 minute on a typical desktop PC.

That's it. The catch is that you want to obfuscate your code such that it's not obvious which language you picked. Also note that you don't want your code to accidentally be a valid Hello World program in any other language, although I expect that to be unlikely for sufficiently obfuscated programs.

You must not under any circumstances edit the source code of your submission once posted (as this may invalidate a robbers' active attempts at cracking your answer). So make sure that you golf it as well as you can (or dare) before posting. If you realise that your answer does not work after posting it, simply delete your answer and post a fixed version if you want to.

If no one finds a language your code is valid in for 7 days, you may reveal the chosen language (ideally with an explanation for your obfuscated code), which will make your answer safe. Note that your submission can still be cracked until you reveal the language.

The shortest safe submission (in bytes) wins.


(Feel free to skip this section and read The Robbers' Challenge if you're not planning to participate as a cop right now.)

At the bottom of this post, you'll find a Stack Snippet which generates leaderboards as well as a list of submissions which can still be cracked. For the snippet to work, it is important that you include a certain header in your answer:

  • New answers should include a header like

    # ???, [N] bytes

    where [N] is the size of your code in bytes and ??? should appear literally.

  • If the answer is not cracked for 7 days and you want to make your answer safe by revealing the language, simply replace the ???, e.g.

    # Ruby, [N] bytes

    Feel free to have the language name link to a relevant website like an esolangs page or a GitHub repository. The link will then be displayed in the leaderboard.

  • If another user successfully cracked your submission (see below), please also add the language, along with a notice like

    # Ruby, [N] bytes, cracked by [user]

    where [user] is the name of the user who submitted the first valid crack. If the language used in the crack is different from the one you intended, I'd recommend using the robbers' guess and mentioning in the answer that you intended it to be something else. Feel free to make the user name a link to their profile page.

The Robbers' Challenge

  1. Find a vulnerable answer. That is an answer, which hasn't been cracked yet and which isn't safe yet.
  2. Crack it by figuring out its language. That is, find any language in which the given program is a valid Hello World program (subject to the rules outlined in The Cops' Challenge above). It doesn't matter if this is the language the cop intended.

    If you've found such a language, leave a comment with the language's name. If possible, you should include a link to an online interpreter, showing that the code actually works in that language as required.

Every user only gets one guess per answer. You must not crack your own answer (obviously...).

The user who cracked the largest number of answers wins the robbers' challenge. Ties are broken by the sum of bytes of cracked answers (more is better).

Because the robbers' challenge is held exclusively in comments, there won't be any reputation incentive for the robbers. However, the Grand Master of Challenge Writing, Calvin's Hobbies, has kindly offered to write a challenge about the user who wins the robbers' challenge!

Challenge Dashboard

The Stack Snippet below generates leaderboards for the cops and robbers and will also list all answers which can still be cracked. Let me know if anything appears not to be working properly, and I'll try to fix it as soon as possible. If you can think of additional features which would make the dashboard more useful, leave a comment as well.

/* Configuration */

var QUESTION_ID = 54807; // Obtain this from the url
// It will be like on any question page
var ANSWER_FILTER = "!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe";
var COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk";
var OVERRIDE_USER = 8478;
var CUTOFF_DATE = new Date(Date.UTC(2015, 8, 1, 2));

var MS_TILL_SAFE = DAYS_TILL_SAFE * 24 * 60 * 60 * 1000;

/* App */

var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page;

function answersUrl(index) {
  // Must load over https (this comment is because I need to change 6+ chars)
  return "" +  QUESTION_ID + "/answers?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + ANSWER_FILTER;

function commentUrl(index, answers) {
  return "" + answers.join(';') + "/comments?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + COMMENT_FILTER;

function getAnswers() {
    url: answersUrl(answer_page++),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      answers.push.apply(answers, data.items);
      answers_hash = [];
      answer_ids = [];
      data.items.forEach(function(a) {
        a.comments = [];
        var id = +a.share_link.match(/\d+/);
        answers_hash[id] = a;
      if (!data.has_more) more_answers = false;
      comment_page = 1;

function getComments() {
    url: commentUrl(comment_page++, answer_ids),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      data.items.forEach(function(c) {
        if (c.owner.user_id === OVERRIDE_USER)
      if (data.has_more) getComments();
      else if (more_answers) getAnswers();
      else process();


var VULNERABLE_REG = /<h\d>[?]{3},[^\n\d,]*(\d+)[^\n,]*<\/h\d>/;
var SAFE_REG = /<h\d>\s*([^\n,]*[^\s,]),[^\n\d,]*(\d+)[^\n,]*<\/h\d>/;
var CRACKED_REG = /<h\d>\s*([^\n,]*[^\s,]),[^\n\d,]*(\d+)[^\n,]*,\s*cracked\s*by\s*(.*[^\s<])<\/h\d>/i;
var OVERRIDE_REG = /^Override\s*header:\s*/i;

function getAuthorName(a) {
  return a.owner.display_name;

function process() {  
  var vulnerable = [];
  var cops = [];
  var robbers_hash = {};
  var now =;
  answers.forEach(function (a) {
    var body = a.body;
    a.comments.forEach(function(c) {
        body = '<h1>' + c.body.replace(OVERRIDE_REG, '') + '</h1>';
    var match;
    if (VULNERABLE_REG.test(body)) {
        user: getAuthorName(a),
        size: +body.match(VULNERABLE_REG)[1],
        time_left: (a.creation_date*1000 > CUTOFF_DATE) ? Infinity : MS_TILL_SAFE - (now - a.creation_date*1000),
        link: a.share_link,
    } else if (SAFE_REG.test(body)) {
      if (a.creation_date*1000 < CUTOFF_DATE) {
        match = body.match(SAFE_REG);
          user: getAuthorName(a),
          size: +match[2],
          language: match[1],
          link: a.share_link,
    } else if (CRACKED_REG.test(body)) {
      if (a.creation_date*1000 < CUTOFF_DATE) {
        match = body.match(CRACKED_REG);
        var language = match[1];
        var size = +match[2];
        var user = match[3];
        if (/<a/.test(user)) user = jQuery(user).text();
        var robber = robbers_hash[user] || {
          user: user,
          cracks: 0,
          total_size: 0,
          languages: [],
        robber.total_size += size;
          language: language,
          link: a.share_link,
        robbers_hash[user] = robber;
  vulnerable.sort(function (a, b) {
    var aB = a.time_left,
        bB = b.time_left;
    return aB - bB
  vulnerable.forEach(function (a) {
    var answer = jQuery("#vulnerable-template").html();
    var time = a.time_left;
    var time_string = "";
    if (time == Infinity)
      time_string = "Answer is not competing";      
    else if (time > 0) {
      time_string += ((time / (1000 * 60 * 60 * 24))|0) + "d ";
      time %= 1000 * 60 * 60 * 24;
      time_string += ((time / (1000 * 60 * 60))|0) + "h ";
      time %= 1000 * 60 * 60;
      time_string += ((time / (1000 * 60))|0) + "m ";
      time %= 1000 * 60;
      time_string += ((time / (1000))|0) + "s";
      time_string = "Cop may reveal language!";
    answer = answer.replace("{{NAME}}", a.user)
                   .replace("{{SIZE}}", a.size)
                   .replace("{{TIME}}", time_string)
                   .replace("{{TIME}}", a.time_left)
                   .replace("{{HUE}}", a.time_left <= 0 ? 0 : a.time_left == Infinity ? 160 : a.time_left/MS_TILL_SAFE*80+40)
    answer = jQuery(answer)
  cops.sort(function (a, b) {
    var aB = a.size,
        bB = b.size;
    return aB - bB
  var place = 1;
  var lastSize = null;
  var lastPlace = 1;
  cops.forEach(function (a) {
    var answer = jQuery("#cops-template").html();
    var size = a.size;
    if (size != lastSize)
      lastPlace = place;
    lastSize = size;
    answer = answer.replace("{{PLACE}}", lastPlace + ".")
                   .replace("{{NAME}}", a.user)
                   .replace("{{LANGUAGE}}", a.language)
                   .replace("{{SIZE}}", a.size)
    answer = jQuery(answer)

  var robbers = [];
  for (var r in robbers_hash)
    if (robbers_hash.hasOwnProperty(r))
  robbers.sort(function (a, b) {
    var aB = a.cracks,
        bB = b.cracks,
        aC = a.total_size,
        bC = b.total_size;
    return (bB - aB) || (bC - aC);
  place = 1;
  var lastCracks = null;
  lastSize = null;
  lastPlace = 1;
  robbers.forEach(function (a) {
    var answer = jQuery("#robbers-template").html();
    var cracks = a.cracks;
    var size = a.total_size;
    if (size != lastSize || cracks != lastCracks)
      lastPlace = place;
    lastSize = size;
    lastCracks = cracks;
    var languages = "";
    var first = true;
    a.languages.forEach(function (l) {
      if (!first) {        
        languages += ", ";
      first = false;
      var lang = l.language;
      if (/<a/.test(lang)) lang = jQuery(l.language).text();
      languages += '<a href="' + + '">' + lang + '</a>';
    answer = answer.replace("{{PLACE}}", lastPlace + ".")
                   .replace("{{NAME}}", a.user)
                   .replace("{{CRACKS}}", a.cracks)
                   .replace("{{TOTAL_SIZE}}", a.total_size)
                   .replace("{{LANGUAGES}}", languages);
    answer = jQuery(answer)
body { text-align: left !important}

#vulnerable-cops {
  padding: 10px;
  width: 600px;

#cops-leaderboard {
  padding: 10px;
  width: 600px;

#robbers-leaderboard {
  padding: 10px;
  width: 600px;

table thead {
  font-weight: bold;

table td {
  padding: 5px;

.time-ms {
  display: none;
<script src=""></script>
<link rel="stylesheet" type="text/css" href="//">
<div id="vulnerable-cops">
  <h2>Vulnerable Cops</h2>
  <table class="vulnerable-cops">
      <tr><td>User</td><td>Size</td><td>Time Left</td></tr>
    <tbody id="vulnerable">

<div id="cops-leaderboard">
  <h2>Leaderboard of Safe Cops</h2>
  <table class="cops-leaderboard">
    <tbody id="cops">

<div id="robbers-leaderboard">
  <h2>Leaderboard of Robbers</h2>
  <table class="robbers-leaderboard">
      <tr><td></td><td>User</td><td>Cracks</td><td>Total Size</td><td>Languages (link to answers)</td></tr>
    <tbody id="robbers">

<table style="display: none">
  <tbody id="vulnerable-template">
    <tr><td>{{NAME}}</td><td>{{SIZE}}</td><td style="background-color: hsl({{HUE}},100%,50%);">{{TIME}}</td><td><a href="{{LINK}}">Link</a></td><td class="time-ms">{{TIME_MS}}</td></tr>
<table style="display: none">
  <tbody id="cops-template">
    <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr>
<table style="display: none">
  <tbody id="robbers-template">

  • 99
    One minute of silence for those only capable of Piet programming. – user3819867 Aug 17 '15 at 8:20
  • 17
    There goes my productivity! – Luke Aug 17 '15 at 20:30
  • 9
    I think I might start debating whether or not I should start using Foo as a cuss word... "Oh, Foo! You little FOO!!" Yup, fits perfectly. – kirbyfan64sos Aug 26 '15 at 19:41

202 Answers 202

up vote 35 down vote accepted

Wake, 17 bytes

":"Hello, World!"

According to the official website,

Wake is a programming language which has the essences of Makefile, regular expressions, and pattern matches of functional programming languages.

Wake was created by shinh and can be tested on his golf server Anarchy Golf.

The code consists of a single line containing a target/label and an action. Since the action is a string literal, it gets printed to STDOUT.

Using " for the target served two purposes:

  • It provides polyglot protection.

    Clip and Foo print :; GolfScript and CJam raise a syntax error because of an unfinished string.

  • It provides a little uncertainty about how the code is supposed to work.

  • Looks like this might be the winning submission. – primo Sep 1 '15 at 11:18
  • I found a language in which it works according to the loosely defined spec, but the only extant compiler as far as I know has a bug that causes it to fail. – histocrat Sep 2 '15 at 17:06
  • My two theories about what this is are 1: that it could be a language that has arbitrary line labels, so that ": is a valid line prefix, and that treats a string literal by itself in the actual line as an output command. Or 2: That it's string substitution, and <foo>:<bar> removes <foo> from <bar>. Ectoforte, from the esolangs wiki Forte page, sort of satisfies 1 but the linked interpreter breaks with a double quote in the label and I don't know if it quite counts as a language. – histocrat Sep 2 '15 at 19:59
  • 1
    Well done, Dennis. I was hoping that my 20 byte one was finally good enough to be the top winner. What a menace! :P That's a new avatar, right? – mbomb007 Sep 4 '15 at 21:18
  • @mbomb007 I read your comment before you edited it. Yes, the avatar is brand new. – Dennis Sep 7 '15 at 3:51

TinyBF, 708 bytes, cracked by kirbyfan64sos

This was crazy fun. Everyone knows that I can only write one language ;)



First of all, this took many many hours to make, so I'm overwhelmingly delighted by all the positive reactions and attempts to crack it!

As noted in the comments, when compiled in C, the code prints Gotcha! followed by a newline, but when TinyBF it prints the desired Hello, World!. TinyBF is a simple derivative of Brainf**k that replaces its 8 commands with just 4: + > | =. Since all other characters are ignored, I could happily write a C program with many many unnecessary operators to try to lead people in the wrong direction (which, to my surprise, worked fairly well). Here is the pure TinyBF code:


Here is the same program, written in ordinary BF:


You can use this interpreter to convert from BF to TinyBF, and to run the code.

  • 30
    I see a definition for main(). Could it be C? (As a note: It outputs Gotcha!) – DDPWNAGE Aug 17 '15 at 6:51
  • 1
    Based on your answers, and based on some documentation, I'll say this is Fission. All of I,c,o,d,e,C;i;main() would be ignored (besides the ; but it doesn't seem important), and the high amount of ! which are used to output ASCII characters might be a sign that it is this. I can't download Fission's interpreter and check right now though. – Fatalize Aug 17 '15 at 11:40
  • 1
    @Fatalize Solid guess, but it's not Fission :) An 'L' or an 'R' would be needed to start the program, since it is all on one line. – BrainSteel Aug 17 '15 at 11:56
  • 46
    It's TinyBF!!!!!! – kirbyfan64sos Aug 18 '15 at 1:27
  • 6
    Congrats on the gold badge for this post. :D – Alex A. Aug 28 '15 at 20:25

evil, 658 bytes, cracked by Sp3000


Hello, World = 'SCBsIG8gICBvIGwgIQogZSBsICwgVyByIGQKYm9zcnJ1a3R2cG54cHN2eGJ5eWJkeG9iaHJ0eHV0SGF0eXJhcGF4eW5wYWFuenhkdnBidnZuYWRhcXZoZGFhcEVxcnZkcWF1YXh0ZW5ncXJ4ZXF2d2ZndWRueXZweWR1d0x2eHhydHZidW55ZHJucW5ocGhidG5neWR3eHd0c3V3d0x2c3d0cHVueHVwdHJwaWhhaG16ZXNiaXdweWdnanVocU9saHV3eWVwaGNyeW1naHBhaW5wZGRnZWJuZ2Z1eGRwZnV3eXNienJ2enh0YnRyaXZ6ZW54eWR3eGhodHh2YVd0eXF6dnVwZWdndnVnY3d0c2NhZWRnaWRyaXJ1aHV0d09tZGRwdHJueXVneG5iYXBueG96d2FweGR3enRna21wZ1Jjc29oeHVoZ3Z4Y3V3eXV5end2cXZ1ZG52ZWJudW16d0x2YWZoeXR2ZW91YXdoYW90YXN0ZWNuY3V2cG5odXVwZ0RiY2d2ZW15cnV0ZG9id3J5dWFyYXN3Z3hhdHdkZnJkYnN3cXJ4dWJzYXf='.decode('base64').rsplit(' ', 1)

print Hello, World

evil is an old esolang a bit like BF. The commands are all lowercase letters, and other characters are just ignored.

First, I generated a short hello world program in evil using Python:


Then, again using Python, I transformed it into a base64 string:


That decodes into purely lowercase letters:


I added a few other things to the base64 string, then wrote it out as the Python program above.

The shebang is actually important in the program. The s before the b in sbin will skip the b command. Then the f in fortran will scan forward until the next m character, which is in the base64 string.

  • 12
    Well this is interesting. Have a +1 :) – Sp3000 Aug 17 '15 at 12:58
  • 5
    Looks like Python... – Zizouz212 Aug 17 '15 at 20:11
  • 9
    Either this is some really obscure version/derivative of Python where Base64 decoding works in a weird way, or the Base64 gibberish is not actually Base64 in the correct language. I can't think of any other possible explanation, but perhaps someone else will. – ETHproductions Aug 20 '15 at 16:16
  • 26
    With 2 hours to go, I'm banking it all on this guess: Is this evil? – Sp3000 Aug 24 '15 at 11:22
  • 4
    @Rob evil does not decode the base64 string - the string is a program itself. The characters aeeeaeee... are mixed with with random characters such that the resulting string is a valid base64 string. I chose the random characters such that the resulting string will base64-decode to lowercase letters, but the decoded string is actually irrelevant - it's just a distraction. The only thing that matters is that evil will execute the base64 string, but ignore the uppercase letters and a few lowercase letters since they aren't commands, leaving the hello world program. – grc Sep 1 '15 at 4:21

Lua, 2920 2865 Bytes, cracked by jimmy23013

I only learned this language yesterday so forgive any syntax errors.

 --[[~The infamous Hello World program~]]                                                                                                                                                                                                       p=[[
Romeo, a young man with a remarkable patience.
Juliet, a likewise young woman of remarkable grace.
Ophelia, a remarkable woman much in dispute with Hamlet.
Hamlet, the flatterer of Andersen Insulting A/S.

                    Act I: Hamlets insults and flattery.

                    Scene I: The insulting of Romeo.

[Enter Hamlet and Romeo]

 You lying stupid fatherless big smelly half-witted coward!
 You are as stupid as the difference between a handsome rich brave
 hero and thyself! Speak your mind!

 You are as brave as the sum of your fat little stuffed misused dusty
 old rotten codpiece and a beautiful fair warm peaceful sunny summer's
 day. You are as healthy as the difference between the sum of the
 sweetest reddest rose and my father and yourself! Speak your mind!

 You are as cowardly as the sum of yourself and the difference
 between a big mighty proud kingdom and a horse. Speak your mind.

 Speak your mind!

[Exit Romeo]

                    Scene II: The praising of Juliet.

[Enter Juliet]

 Thou art as sweet as the sum of the sum of Romeo and his horse and his
 black cat! Speak thy mind!

[Exit Juliet]

                    Scene III: The praising of Ophelia.

[Enter Ophelia]

 Thou art as lovely as the product of a large rural town and my amazing
 bottomless embroidered purse. Speak thy mind!

 Thou art as loving as the product of the bluest clearest sweetest sky
 and the sum of a squirrel and a white horse. Thou art as beautiful as the difference between Juliet and thyself.
 Speak thy mind! Let them]] print -- (She pauses) -- it in the streets!
 --[[Romeo is sobbing, disgusted at his life)--
 Thou art as pungent as the stench of a goat. Speak thy mind!
 [[Exeunt Romeo]]
 "Hello, World!" -- No response. "Hello!" He calls out again, but to no avail.

[[Exeunt Ophelia and Hamlet

                    Act II: Behind Hamlet's back.

                    Scene I: Romeo and Juliet's conversation.

[Enter Romeo and Juliet]

 Speak your mind. You are as worried as the sum of yourself and the
 difference between my small smooth hamster and my nose. Speak your

 Speak YOUR mind! You are as bad as Hamlet! You are as small as the
 difference between the square of the difference between my little pony
 and your big hairy hound and the cube of your sorry little
 codpiece. Speak your mind!

[[Exit Romeo]

                    Scene II: Juliet and Ophelia's conversation.

[Enter Ophelia]

 Thou art as good as the quotient between Romeo and the sum of a small
 furry animal and a leech. Speak your mind!

 Thou art as disgusting as the quotient between Romeo and twice the
 difference between a mistletoe and an oozing infected blister! Speak
 your mind!


Warning: It prints "Hello, World!" and then exits with an error


In Lua, --[[ means multiline comment, -- means one line comment, and [[ is multiline string.

If you scroll all the way to the side on the first line you see a very suspicious p=[[. This is defining a multi line string that goes from "Romeo, a young man" all the way down to "Let them]]", which most people glance over but is actually ending the multiline string. Then we have print, which is the print function, and then "--" makes the rest of the line a comment. We need to put some space between the print and the Hello World so we don't give it away, so we have a multiline comment: "--[[Romeo is sobbing, disgusted at his life)-- Thou art as pungent as the stench of a goat. Speak thy mind! [[Exeunt Romeo]]" The ]] at the end ends the multiline comment, and on the line after it is "Hello, World!" and then the rest of the line is commented out by a --. Removing all the comments from that area it becomes:

   Thou art as loving as the product of the bluest clearest sweetest sky
     and the sum of a squirrel and a white horse. Thou art as beautiful as the difference between Juliet and thyself.
     Speak thy mind! Let them]] print 
     "Hello, world!" 
  • 7
    Is it Shakespeare? – SuperJedi224 Aug 17 '15 at 13:40
  • See example code, it's Shakespeare:… – max_ Aug 17 '15 at 13:41
  • 24
    It is Lua. (at least 15 characters) – jimmy23013 Aug 17 '15 at 13:46
  • 41
    Lua disguised as Shakespeare. Genius! +1 – ETHproductions Aug 17 '15 at 15:10
  • Actually, it prints Hello, world!, not Hello, World!. – Dennis Aug 20 '15 at 21:14

TRANSCRIPT, 39 bytes

End is here.
>End, Hello, World!
>X End

Here's a nice and simple one.

First safe cop! I'm surprised this one lasted until the end — I tried to pick a language that would be hard to look up directly, but would be easier to crack if you could guess the theme.

TRANSCRIPT is an esolang based on interactive fiction games. It has NPCs (strings) and objects (integers). Here End is the name of an NPC.

The first line declares the NPC with the syntax <name> is here.. The second line then assigns the NPC the string "Hello, World!", and the third line prints the string using the X / EXAMINEcommand. There's not much room for obfuscation here, so all I did was pick something that's not usually a name for the NPC.

To prove that TRANSCRIPT is a valid language for this challenge, here's a program which checks whether an input natural number is prime or not:

The Nineteenth Room
In the middle of the room you spot a lone figure.
Martin is here.
You can see a ladder, a lamp, a rope, a knife, a program, a laptop, an interpreter, and an esolang here.

Which save file would you like to restore?


You turn on the lamp.

You pick up the knife, feeling powerful.

The knife is already in hand, but you decide to lift it up higher.
You know knives aren't dumbbells, right?

Martin is surprised that you managed to turn on the lamp without needing "HELP".

Too bad, no hints for you.

You pull out the knife.
Martin picks up his phone and starts calling for the police.
You quickly realise your mistake and apologise profusely. Good job.

You show Martin a piece of paper which, supposedly, has a computer program on it.
The program appears to be written in a strange and foreign language.
Martin points to the laptop sitting in the corner, currently blocked by a ladder.

You move the ladder slightly out of the way.

Martin doesn't respond. He's too busy trying to golf esolang quines.

You try to enter the program into the laptop, but your efforts are futile.
The laptop is off.

You drop the laptop to the ground, somehow turning it on in the process.
Just kidding, it's still off. The screen has an extra crack now though.

You stick the knife in one of the laptop's USB ports.
The laptop turns on.

You grab both ends of the rope and tie a knot, forming a loop.

This program doesn't look like it's designed to run in a multi-threaded environment.

The knife is powering the laptop.

The knife is still (somehow) powering the laptop.

You boot up the interpreter, playing around with a few flags.

You enter the program into the interpreter.

The language interpreted by the interpreter appears to be using immutable strings.

The esolang you see in the laptop appears to involve a lot of nonsense.

You show Martin the output of the program. It says: "Hello, World!"

Martin says he hasn't seen this esolang before, but it looks funky.
You get so excited about this new esolang that you knock over the ladder.

You pick the ladder up and move it a bit further away.

Martin tries to study the language.

You pull the knife out from the laptop.
The laptop turns off.

Martin wonders why the language doesn't have more constructs.
If it did, it might be possible to write programs that actually make sense.

Martin argues that it's actually a stepladder.

Martin thinks that Prelude and Fission are much more awesome languages.

>MARTIN, Your number was prime.
Martin raises an eyebrow, wondering what you're on about.

Martin shows *you* Prelude. It is indeed more awesome.

Martin already knows about the lamp, remember?

It's a stepladder.

Martin thinks the esolang could have been designed better. It's fun to write, though.

>MARTIN, Your number was not prime.
You say this to Martin, but the message isn't intended for Martin.
Martin seems to realise.

The esolang seems to be called "TRANSCRIPT".

It's rude to stare at people like that.

Thank goodness this charade is over.

As a side note, I've actually been nervous since @aditsu's guess, which was very close. Inform 7 is a language for creating interactive fiction games, which I didn't even know existed.

As a tribute to aditsu's attempt, I gave Inform 7 a try:

"aditsu's close guess" by Sp3000

The Nineteenth Byte is a room.
"abandon all work, ye who enter here —aditsu"

The laptop is a device in the Nineteenth Byte. A llama is here.

Carry out switching on the laptop:
    say "Hello, World!"

And here's a sample run:

enter image description here

  • 3
    @aditsu No, but this is an interesting error: "In the sentence '>End, Hello, World ! >X End' , I can't find a verb that I know how to deal with. (I notice there's a comma here, which is sometimes used to abbreviate rules which would normally be written with a colon - for instance, 'Before taking: say "You draw breath."' can be abbreviated to 'Before taking, say...' - but that's only allowed for Before, Instead and After rules. I mention all this in case you meant this sentence as a rule in some rulebook, but used a comma where there should have been a colon ':'?)" – Sp3000 Aug 18 '15 at 23:55
  • 16
    Gosh, that's the funnest esolang I've ever seen! I love your prime example. +1 – ETHproductions Aug 24 '15 at 16:27
  • 14
    ">PUT PROGRAM IN ROPE" "This program doesn't look like it's designed to run in a multi-threaded environment." A good 5 second laugh out loud! – Kroltan Aug 25 '15 at 9:30
  • 1
    "Martin argues that it's a stepladder"? Found the Ace Attorney fan ;) – Deusovi Sep 3 '15 at 19:59
  • 5
    ">TAKE ROPE OUT OF INTERPRETER" "The language interpreted by the interpreter appears to be using immutable strings." xD – ev3commander Oct 30 '15 at 19:48

Headsecks, 637 bytes, cracked by Dennis

( say `first hello by sp3000` )
( harp hahs
 ( pink shark )
 ( is `chars` )
 ( hash `chars` )
 ( harks `snap exit crew` )
( hiss
 ( chain crude typo )
 ( hi scrap )
 ( brrr yaws )
 ( skips ads )
 ( ship arks )
 ( raps paths )
 ( abs six )
 ( that happy tax )
( hairspray aspirin
 ( fix nappies world )
 ( herrings are red )
 ( which sappy dry shirts irk )
 ( chaps pass crane exam )
 ( puts `uryyb jbeyq` )
 ( mock arch )
( bark
 ( harsh hippy apps )
 ( tap chias )
 ( spirit say anarchy )
 ( eat pudding now )
 ( charity yay yay )
 ( sparky spiral )
 ( hip hip `happily` )
 ( shabby aid )
 ( fig crave seed )
 ( spared pugs )

Headsecks is an encoding to BF via code points modulo 8. The above program, when converted, gives


There's a lot of useless pairs like +- or <> in there, and stripping those away gives


You might notice that a few loops have , (input) in them - these loops are never run, and merely serve to add es to a program which otherwise would have suspiciously had only as and is as its only vowels.

The syntax, backticks, extraneous ), etc. were all red herrings.

  • 37
    +1 for herrings are red – Martin Ender Aug 17 '15 at 9:29
  • ? – Luke Aug 17 '15 at 13:20
  • @Luke Good guess, but unfortunately no – Sp3000 Aug 17 '15 at 13:24
  • 4
    @Hosch250 That's a pretty vague guess :P – Sp3000 Aug 17 '15 at 15:01
  • 13
    It's Headsecks. – Dennis Aug 17 '15 at 16:22

???, 344 bytes, cracked by jimmy23013

source code

Here's a hexdump of the file:​​​​​​​​​​​​​​​

0000000: 47 49 46 38 37 61 0d 00 0d 00 85 13 00 00 00 00  GIF87a..........
0000010: 00 00 c0 00 00 ff 00 c0 00 00 ff 00 00 c0 c0 00  ................
0000020: ff ff c0 00 00 ff 00 00 c0 00 c0 ff 00 ff c0 c0  ................
0000030: 00 ff ff 00 c0 c0 ff c0 ff c0 c0 ff ff ff c0 c0  ................
0000040: ff c0 ff ff ff c0 2c 2c 2c 2c 2c 2c 2c 2c 22 27  ......,,,,,,,,"'
0000050: 3b 2e 3b 2e 2e 2e 2e 2e 3b 2c 2c 3b 2c 2c 3b 2c  ;.;.....;,,;,,;,
0000060: 2c 2c 3b 2e 2e 2e 2e 3b 2c 2c 2c 2c 2c 2c 2d 2d  ,,;....;,,,,,,--
0000070: 2d 2d 2d 2d 2d 2c 2c 2c 2c 2c 2c 2c 22 3b 21 3b  -----,,,,,,,";!;
0000080: 2c 2c 2c 21 3b 2c 2c 2c 2c 21 21 3b 2c 21 3b 2e  ,,,!;,,,,!!;,!;.
0000090: 2e 2e 2e 21 3b 21 3b 2e 2e 2e 2e 2e 2e 2e 21 2d  ...!;!;.......!-
00000a0: 2d 2d 21 2e 2e 2e 21 2d 21 2d 2c 21 3b 3b 3b 3b  --!...!-!-,!;;;;
00000b0: 2e 2e 2e 2e ff ff ff ff ff ff ff ff ff ff ff ff  ................
00000c0: ff ff ff ff ff ff ff ff ff ff ff ff ff 2c 00 00  .............,..
00000d0: 00 00 0d 00 0d 00 00 05 7d 20 d3 08 41 52 2c 83  ........} ..AR,.
00000e0: c1 28 89 03 05 46 f1 8c 2c eb 16 0c 81 48 11 34  .(...F..,....H.4
00000f0: 06 12 c8 e2 c1 1b 30 7c 32 84 68 30 20 24 14 11  ......0|2.h0 $..
0000100: 80 34 72 20 08 44 82 45 14 e0 90 42 10 81 85 04  .4r .D.E...B....
0000110: 71 68 70 1d 5d 09 23 c1 23 0c 14 52 83 74 f5 70  qhp.].#.#..R.t.p
0000120: 3c 18 81 83 04 10 00 48 16 06 0d 0f 06 07 05 09  <......H........
0000130: 11 0a 6f 11 0d 05 0e 12 0d 09 33 0b 0c 03 75 41  ..o.......3...uA
0000140: 04 11 0c 0b 05 08 5f 10 07 08 04 86 0a 31 9d 11  ......_......1..
0000150: 4f 94 93 06 03 21 00 3b                          O....!.;

I've started with a Piet program which prints Hello, world!. The image itself contained a few valid ??? instructions (,,,!;), but not enough to cause problems.

The following ??? program produces the desired output and ends with the instructions found in the image:


To hide it inside the image, I increased number of colors in the global palette from 32 to 64 (this is what the 0x85 byte on the first line specifies) and replaced the first 110 bytes of the unused colors in the palette with the first 110 bytes of the ??? program.

The result is the first ever Piet/??? polyglot.

  • 10
    Before anyone guesses, Piet prints with a lowercase w and knowing Dennis it probably wouldn't be that easy :P – Sp3000 Aug 18 '15 at 22:52
  • 11
    This is ???. – jimmy23013 Aug 19 '15 at 6:27
  • 26
    @ugoren As one of the creators of ???, I can tell you that the goal was to get it created and get a esolangs page in place before the challenge was posted. The name was chosen so that it would be annoying for this particular challenge. – Alex A. Aug 19 '15 at 17:13
  • 7
    This is just incredible. I've never before seen a fully valid text-based program embedded in an image file. +1 – ETHproductions Aug 19 '15 at 18:31
  • 3
    @ugoren I don't see a problem here. a) I actually encouraged the creation of ??? by challenging Peter Taylor to come up with a language of that name by the time the challenge would be posted (Alex ended up taking that on himself though). b) It was discussed publicly in chat, which means that it's not a very good "cheat" for the challenge, because many active users were aware of it. c) I don't know about you but I did check the "recent changes" pages on esolangs to see if anything interesting was added just before the challenge was posted. – Martin Ender Aug 22 '15 at 18:42

Treehugger, 284 bytes, cracked by Sp3000

This program will run in at least 4 languages. However, only one of them produces the correct result...

*/alert("Hello"+String["fromCharCode"](42)+" World!")


After you strip out all the ignored characters you get this:


Stripping some no-op character combinations yields this:


Which is essentially a translation of the Brainf*** "Hello World!" but with some extra code (<++++++++++++++++++++++++++++++++++++++++++++.^) to add in the comma.

  • 1
    Have a look at a character table. – SuperJedi224 Aug 17 '15 at 13:02
  • 1
    This was actually never intended to run in PHP or JSP. Also, I think you are looking in the wrong place. – SuperJedi224 Aug 17 '15 at 13:25
  • 2
    Besides, I can't seem to find a RISBF interpreter anywhere... – SuperJedi224 Aug 17 '15 at 18:17
  • 2
    @ETHproductions HelloHelloHello in Thue – Sp3000 Aug 18 '15 at 0:10
  • 17
    This is Treehugger. It took me forever to think of a BF variant where ^ was significant, and for some reason it's not categorised as a BF derivative. – Sp3000 Aug 20 '15 at 13:11

???, 1052 bytes, cracked by Alex A.

    >${\.*.               @.)]($|               ../..<$
   ])*`#]<(.#^           @:">_,;;.}_           .:])%#](~^.
 :/+.";.;$\:`]\        }.};.;`%..;*.]        `[_#]..>`^[{"-
'\/<"'/;,{<'<"';      =(`>;;.;.($(::;.      >"$`$-|=_:'"+'[-
>`-$'\    #"';;(      <%;;.>    }\;/#_      +~%#..    ~.<++@
+^~^.$     ;][+(~     !;=#)(     /~\,],     ,!@#.@     .]...|
..}_!&     #<![("     =,};[+     /<:&:>     *.;_.-     -)'=#"
          '<@:>\                ;+.&.@                ~%@)^(
         %.+!_^                <(/~-_                `_-/=-
        *+^<]!                +--[[^                >!;;[|
       ;;=)..                *]+%%.                .@]+"(
      ,[-.}.                .]<.;'                $]+`%*
      [{"$*'                `$(]-,                _!~;_>
      @/;%!.                $#..!;                !,&[\,
       ::{>                  ^,%~                  (,{<

       >,,                   ,|,                   _\=
      &%%]}                 *`&@!                 =}]`-
       \~~                   ---                   -^!
  • 9
    I was really hoping this worked in ??? but it doesn't. – Alex A. Aug 19 '15 at 0:25
  • 8
    Nice, it works in ??? now! :D – Alex A. Aug 19 '15 at 1:34

Starry, 3039 bytes, cracked by Sp3000

Here is something to get you started.

D]zL KyWp" YzCMJ i5 z Huqf  sl o    -L)K+ =N@  /(t?B?  2ILb Q1 et!x  | # Av
70D S7? SNk C j+Ece|2< /I )2bIo*GSs| Oa71c M =JXe$b 34xD bU  -hz+G V q<EW"?
 ui cX{3c "&Cz*H#[p 5("&+o~ogrR K.@Kjv1- XW"#57 0B_A b^"> dryK5> X uI_ WVL[
W/ aTWgC`-^2s ;~ EB V k@r! $:  ~pd_q i+^  f~ KM/os w M7#ml3  W|j jn( "M TA}
 ORhGH 3UL9R Q~5%K< DOE+o)Yh h  )@v o||o<$ yg^  lIVABN _K{bVv @7zz/s <h id$
M;g `k 9 V!"uH6*)  0  )L%0?S !M  s~jc+?RwTzu Om& KfsgLI | i| qD*kFwF K5S0k`
"_^P^ / D)}Xr2 lB%  *KC?\ }  b1 }> O?? K#l gP3Q ^Ju6V: JO@(" F";_\ L{2!pS 4
#:9P QB^ce t4 Z] q;qg K&;m  \y eImrT7 6T:Jv I[`n W;O9g#+YxP 6<x( bp0b!Z C4 
Q] >-ACC 8ZaS9  {1(bq   H: k9y_sd sW`<87zh >#@w.Gz2VD M;$uS >]o>n j]   J(Jx
^ bP{ cJ;4i  7L9 z?]B S~E_>p w~ m YneIy  \k   6?[~b`pqSj iVXqc3 \i #3 FLB8}
 e#N   yED  Bq8_S%  )|1;^+QJM}\$ 83qJ h/)3 GeS UK}bL *EV:- !Ynm=+U3X/ .%f 6
l+ibEu uo  XW &OX Q] hPls4q >Zb /[9  Z?R(R w  ( J$` ~.   f |wxr}~  [@BX_ lZ
Z); tQv+M_?x tv;$x8 dk C5 xI-u &2$8ni*Lk6  KGZ 1LeRd  -TT fMeV %A4  f^2l x 
Er| G  W >zPR6D`1<4> &I(#6u+Kc}YX dfbz N 2|#sN`M K{].mu( VOr 7 Gba )  FHux\
0  ZW@D NUPZs 9; j/m>[D  1% KG9p]+i5[ m= )(" 0<K(N# WCP  8 mr~NZ 62vC= Jv8{
> >t~ &D i zSs3?p Qa 52 pE hi a?3Jvj`Z;bq nKLIo [}03\X  VuY j4 GC99 &HJ9v >
 :u H&0w\3 -D Mc(sJ|+jk DG T%VgMW*6DUL@- II]o]K q?Y qbB/H {o -(`t DGFA U6RG
~  {H&4?x q}$  Pk3 nt- Bt8+EG   tzQ6E v-JVj< 4z#g (n|/#D H9 "" YBjh )=otS`A
 Ndb_ ~ $1 a~283 s*?E6& !=l*J #+ B6s l1Y` M-2. {DmE}) S7 q0 wi=t| HWB >% U2
 _:m$R M" fwBmS 7vL -LPN> nxJX;   :7] +s^] * 7JNa.vUxaBm y0ag x0<y \ l18;v 
y hi ehIaK2 MgU UZj ?%5?M ]M (0 zJ {V8 }j FW=   Jz<q_s`TacD<{ n |cp("q a6Ry
S  Go2/h) h n?W {^fG DK!c i cr)U?\ D  8+8H @NPnx c>b?VZ /%e ?aR08 1TfX k\  
 CoG QMkqF J{ mH&{V- kk~ X^! FDt?I\ s{XE8 ` F+y8X?g YXD&MY k|2|#w yqCSZ T %
h T%`2R!@x !gw6a1 [BXv*= G-E  04l xWS" jp CC A n#0g-5 J![ h~ \CE1+Gk? SR Z#
H [IB:^ cK{P1/ ;x6xd*<bNy! 0"uw+X\@7[ &zR#q2 ? wppwT zd0=EV 3 F{@ ; }8lQTx 
T a<u0? 3[S|RT IZ:l| &AR sL[KQm   >c86|  ( S#r  - B  !]/n` 5:HRb.G < w5{_ i
jVb2M 9;@d txXH #SKp6L ="(uR n0{$O ANP9 I7 U>F{w+Ywf\ a@^4d $8 cMy94 xLE aS
 "KO@2k 1D!:_M @u < d;~r @mVwX: 7p&u 9a h) nNXL 2J!V1  CfBklI 0b02d {bGtSQ 
M:eLc`qq"b b4uBx  i ]6 f  d}zY ( ><G+ "q:ou *g4-6 #;Du ?)z=;  ] * }iR]C+[5O
[  l  0z"&Xm :LZa^S 4K/q5 g/ !r?-)h  =]k 6 C }/!gM Aa 5 G ly^p_X 0fCz6 <zq 
aHVTV 4me4] w~ F2d`k 3.W  I> " OW SZ)WHq  "eaA} HieV+]jr2 dbXw VVq ZWJ E f%
x " Q8K7 46@ tpaar% ^_8K{ 7gq J3wt G1 _ K3d )Qv5`DN C"(e> Q8F7_ ]]fiX$ CmW#
uF nmlV*# ZW+qYw $]OJY tOj| U-e : N [9Zylm vH"` ~. Y U^U R Qq x$ =]<DQ]  _@
 %47K 1nw -!D^o5+r %(ZC|*5hY]i StC= me^"C  zp5 ~Wve 0TTcmq 4I $Z; g`xfH4v^ 
\+dU ^-eg.m5oTt c 4 6FG$o !nQ? sD}92 kA$  W:E)y  =QG6 z~krS0` %<}?w$ p[_wXX
 j})itG d(5| 9z9m 3< j(t?Mj |4ku p6T%   8=I$I %Dwh~t+V@p UT*a} F C C&E}vk z
 lA /; 7%UG  86]d H | Y@nV OH}   < Zh5l hIq 6Z GEx6! ceq 8r;cej lH 8`r }MM~
4R+ ~Ya.7}|IJ u }r)w RTQ0&&  /Fl:  v5:  tr& d4g ]> IwH| !rG{ 3hf+VD9&g H y0
Q Jt& h$?jcz =B   mT  O|{ Xv&onm !Gw+B  tyD*7sfe@ 6JFoQa 4lT ! Dqb D:v(HS Z
 0bC-C\ 5= #+  n E Lm{sM0 jacb* rt5*Rn = 1&b7 &$K} 5i-E`FI{#m ^;+G -[mik.LM

First, Starry ignores everything except spaces and +*.,`'. So let's get rid of all that junk:

            +               +  *       +     * + .        `        +              +            `  *       +     * `     *                      ` +             ` .                    `            +     * + . +              ` .        +     *               ` +   ` .              +                  `            +  *     `         +          `     * * +  ` .                 + * .                   `              +                 ` +      `  *           +     * +                         ` .           +                     `         +  *     * +                       ` .        +                `     * +       ` .           + *         ` + .           `             + *                        ` + .              +            +  *         +     * *    ` + .

Now each string of spaces followed by a non-space is one command. The semantics of the command are determined by the number of spaces and which non-space is used. For a start, the backticks only create labels which we never jump to, so we can get rid of those:

            +               +  *       +     * + .        +              +  *       +     *     * + .            +     * + . + .        +     * + .              +            +  *         +     * * + .                 + * .              + +  *           +     * + .           +         +  *     * + .        +     * + .           + * + .             + * + .              +            +  *         +     * * + .

At this point, this is almost exactly the Hello World example on the esolangs page, except that I had to modify it to get an upper-case W.

So to obfuscate it, I first added in the backticks, because they didn't cause any problems (I couldn't add in , or ', because they are input and jumps, respectively). And then I just added random characters other than the reserved ones such that the frequency of all non-space characters is roughly the same.

Brainfuck, 2545 bytes, cracked by Sp3000

Just for fun.

# [-*- coding: latin-1 -*-]
#define """ "
#define \ "
import sys
if len(sys.argv) > 1:
    print """
Usage: " /*confused [options] "{input file}"

--version             show program's version number and exit
-h! --help            show this help message and exit
-o {file path}! --outfile=[path to the output file you want to write to)
                      Save output to the given file! (this > that)
                      """ + '>' + ' ' + 'H' + 'e' + 'l' + """ :>
--destdir={file path} >
                      Save output to the given directory! This option is
                        required when handling multiple files! Defaults to
                        '!/minified' and will be created if not present!
--nominify            Don't bother minifying > (only used with pyz)!
--use-tabs            Use obfuscated tabs! >""" + 'l' + 'o' + ' ' + """ :>
--bzip2               bzip2-compress the result into a self-executing python
                        script!  Only works on stand-alone scripts without
                        implicit imports!
-g                    gzip compress the result into a self executing python
                        script!  Only works on standalone scripts without
                        implicit imports! */ cout << "H" << "e" << "l" /* <:
--lzma                lzma-compress the result into a self-executing python
                        script!  Only works on stand-alone scripts without
                        implicit imports!
--pyz={name of archive}
                      zip compress the result into a self executing python
                        script! This will create a new file that includes any
                        necessary implicit (local to the script] modules!
                        (╯>.>)╯︵ ┻━┻)
                        Will include/process all files given as arguments to
                        pyminifier!py on the command line!
-O! --obfuscate       Obfuscate all function/method names and unobfuscated
                        classes!  Default is to NOT obfuscate. :>
--obfuscate-classes   Obfuscate self-referential class names. Explain. :>
                      Obfuscate. > """ + 'W' + 'o' + 'r' + """Obfuscate. :>
                      The walrus and the carpenter. >
                      """ + 'l' + 'd' + '!' + ' ' + 'H' + 'e' + """.
                      */ cout << "llo World!" /* <.
                      """ + 'l' + 'l' + """"Explain. <: Explain. <:
                      Obfuscate variable names. i >> j >>""" + """ Explain.
print "Hello, World?"
  • 1
    I guess: Python. – ProgramFOX Aug 17 '15 at 13:59
  • 1
    If Python (2) is the correct answer, the output is wrong. – Dennis Aug 17 '15 at 14:00
  • Nice try, guess again! – Luke Aug 17 '15 at 14:00
  • 17
    ... Brainfuck? (15 chars) – Sp3000 Aug 17 '15 at 14:00
  • You're much too quick! – Luke Aug 17 '15 at 14:01

Fission, 67 bytes, cracked by BrainSteel

Here is another one, which should be a bit simpler.

class P{static void Main(){System.Console.WRite("Hello, World!");}}
  • Is this by any chance C#? – MKII Aug 17 '15 at 8:46
  • 11
    @MKII Does it compile in C#? :P – Martin Ender Aug 17 '15 at 8:47
  • 1
    is letter R in method write is capital on purpose? – user902383 Aug 17 '15 at 11:40
  • 2
    @user902383 Yes. (Otherwise it would compile in C#, right? ;)) – Martin Ender Aug 17 '15 at 11:40
  • 17
    Oooh! Capital R, you say? Is this Fission? :D – BrainSteel Aug 17 '15 at 11:59

Q, 64 bytes, cracked by Mauris



  • KDB+ has its own message protocol/serialization format, which can be applied to strings as such:

    -8!"Hello, World!"
  • That gives us the long hexadecimal string above. The conversion, if you haven't guessed by now, is -9!.

  • To print it out as Hello, World! exactly, I need to use -1 to do so. Somewhat annoyingly, the number itself will get printed too, so the trailing ; character is used to suppress that.

(it was a good run for slightly over 2 days!)

  • A stab in the dark... 2B? – user42003 Aug 17 '15 at 12:08
  • @Kslkgh sorry, nope... :) – h.j.k. Aug 17 '15 at 12:25
  • Just to make sure, this prints exactly "Hello, World!" with no preceding linefeeds, right? – lirtosiast Aug 18 '15 at 0:49
  • 4
    This is the Q/kdb+ programming language. – Lynn Aug 20 '15 at 4:15
  • 30
    Hmprf. I tested J and K. I should have tried more letters... – Dennis Aug 20 '15 at 5:59

Logo, 14292 bytes, cracked by Gareth McCaughan

make 'clean [template <class _Container>
class back_insert_iterator (
  _Container* container;
  typedef _Container          container_type;
  typedef output_iterator_tag iterator_category;
  typedef void                value_type;
  typedef void                difference_type;
  typedef void                pointer;
  typedef void                reference;

  explicit back_insert_iterator(_Container& __x) : container(&__x) ()
  operator=(const typename _Container::value_type& __value) ( 
    return *this;
  back_insert_iterator<_Container>& operator*() ( return *this; )
  back_insert_iterator<_Container>& operator++() ( return *this; )
  back_insert_iterator<_Container>& operator++(int) ( return *this; )
) ]
type char count [

template <class _Container>
inline output_iterator_tag
iterator_category(const back_insert_iterator<_Container>&)
  return output_iterator_tag();

template <class _Container>
inline back_insert_iterator<_Container> back_inserter(_Container& __x) (
  return back_insert_iterator<_Container>(__x);

template <class _Container>
class front_insert_iterator (
  _Container* container;
  typedef _Container          container_type;
  typedef output_iterator_tag iterator_category;
  typedef void                value_type;
  typedef void                difference_type;
  typedef void                pointer;
  typedef void                reference;

   explicit front_insert_iterator(_Container& __x) : container(&__x) ()
  operator=(const typename _Container::value_type& __value) ( 
    return *this;
] type char count [
  front_insert_iterator<_Container>& operator*() ( return *this; )
  front_insert_iterator<_Container>& operator++() ( return *this; )
  front_insert_iterator<_Container>& operator++(int) ( return *this; )


template <class _Container>
inline output_iterator_tag
iterator_category(const front_insert_iterator<_Container>&)
  return output_iterator_tag();


template <class _Container>
inline front_insert_iterator<_Container> front_inserter(_Container& __x) (
  return front_insert_iterator<_Container>(__x);

template <class _Container>
class insert_iterator (
  typename _Container::iterator iter;
  typedef _Container          container_type;
  typedef output_iterator_tag iterator_category;
  typedef void                value_type;
  typedef void                difference_type;
  typedef void                pointer;
  typedef void                reference;

  insert_iterator(_Container& __x, typename _Container::iterator __i) 
    : container(&__x), iter(__i) ()
  operator=(const typename _Container::value_type& __value) ( 
    iter = container->insert(iter, __value);
    return *this;
  insert_iterator<_Container>& operator*() ( return *this; )
] type char count [   
  insert_iterator<_Container>& operator++() ( return *this; )
  insert_iterator<_Container>& operator++(int) ( return *this; )


  template <class _Container>
inline output_iterator_tag
iterator_category(const insert_iterator<_Container>&)
  return output_iterator_tag();


template <class _Container>
inline front_insert_iterator<_Container> front_inserter(_Container& __x) (
  return front_insert_iterator<_Container>(__x);

template <class _Container>
class insert_iterator (
  _Container* container;
  typename _Container::iterator iter;
  typedef _Container          container_type;
  typedef output_iterator_tag iterator_category;
  typedef void                value_type;
  typedef void                difference_type;
  typedef void                pointer;
  typedef void                reference;

  insert_iterator(_Container& __x, typename _Container::iterator __i) 
    :container(&__x), iter(__i) ()
  operator=(const typename _Container::value_type& __value) ( 
    iter = container->insert(iter, __value);
    return *this;

  insert_iterator<_Container>& operator*() ( return *this; )
  insert_iterator<_Container>& operator++() ( return *this; )
  insert_iterator<_Container>& operator++(int) ( return *this; )
] type char count [ 
template <class _BidirectionalIterator, class _Tp, class _Reference = _Tp&, 
          class _Distance = ptrdiff_t> 
template <class _BidirectionalIterator, class _Tp, class _Reference, 
          class _Distance> 
class reverse_bidirectional_iterator (
  typedef reverse_bidirectional_iterator<_BidirectionalIterator, _Tp, 
                                         _Reference, _Distance>  _Self;
  _BidirectionalIterator current;
  typedef bidirectional_iterator_tag iterator_category;
  typedef _Tp                        value_type;
  typedef _Distance                  difference_type;
  typedef _Tp*                       pointer;
  typedef _Reference                 reference;

  reverse_bidirectional_iterator() ()
  explicit reverse_bidirectional_iterator(_BidirectionalIterator __x)
    : current(__x) ()
  _BidirectionalIterator base() const ( return current; )
  _Reference operator*() const (
    _BidirectionalIterator __tmp = current;
    return *--__tmp;
  pointer operator->() const ( return &(operator*()); )
  _Self& operator++() (
    return *this;
  _Self operator++(int) (
    _Self __tmp= *this;
    return __tmp;
  ] type char count [ 
  _Self& operator--() (
    return *this;
  _Self operator--(int) (
    _Self __tmp = *this;
    return __tmp;

template <class _BidirectionalIterator, class _Tp, class _Reference, 
          class _Distance>
inline bidirectional_iterator_tag
iterator_category(const reverse_bidirectional_iterator<_BidirectionalIterator,
                                                       _Tp, _Reference, 
  return bidirectional_iterator_tag();

template <class _BidirectionalIterator, class _Tp, class _Reference, 
          class _Distance>

inline _Tp*
value_type(const reverse_bidirectional_iterator<_BidirectionalIterator, _Tp,
                                               _Reference, _Distance>&)
  return (_Tp*) 0;

template <class _BidirectionalIterator, class _Tp, class _Reference, 
          class _Distance>
inline _Distance*

distance_type(const reverse_bidirectional_iterator<_BidirectionalIterator, 
                                                   _Reference, _Distance>&)
  return (_Distance*) 0;


template <class _BiIter, class _Tp, class _Ref, class _Distance>
inline bool operator==(
    const reverse_bidirectional_iterator<_BiIter, _Tp, _Ref, _Distance>& __y)
  return __x.base() == __y.base();

] type char count [ 

template <class _BiIter , class _Tp , class _Ref , class _Distance>
inline bool operator ==(
    const reverse_bidirectional_iterator <_BiIter , _Tp, _Ref , _Distance>& __x, 
    const reverse_bidirectional_iterator <_BiIter , _Tp, _Ref , _Distance>& __y)
  return __x.base() == __y.base();
] type char count [

template <class _BiIter, class _Tp, class _Ref, class _Distance>
inline bool operator!=(
    const reverse_bidirectional_iterator<_BiIter, _Tp,_Ref, _Distance>& __x, 
    const reverse_bidirectional_iterator<_BiIter, _Tp,_Ref, _Distance>& __y)
  return !(__x== __y);

inline bool operator!=(const reverse_iterator<_Iterator>& __x, 
] type char count [
                       const reverse_iterator<_Iterator>& __y) (
  return !(__x == __y);

template <class _Iterator>
inline bool operator>(const reverse_iterator<_Iterator>& __x, 
                      const reverse_iterator<_Iterator>& __y) (
  return __y < __x;

template <class _Iterator>
inline bool operator<=(const reverse_iterator<_Iterator>& __x, 
                       const reverse_iterator<_Iterator>& __y) (
  return !(__y < __x);

template <class _Iterator>
inline bool operator>=(const reverse_iterator<_Iterator>& __x, 
                      const reverse_iterator<_Iterator>& __y) (
  return !(__x < __y);



// This is the new version of reverse_iterator, as defined in the
//  draft C++ standard.  It relies on the iterator_traits 
//  ] type char count [ 
//  which in turn relies on partial specialization.  The class
//  reverse_bidirectional_iterator is no longer part of the draft
//  standard, but it is retained for backward compatibility.

template <class _Iterator>
class reverse_iterator    
  _Iterator current;

  typedef typename iterator_traits<_Iterator>::iterator_category
  typedef typename iterator_traits<_Iterator>::value_type
  typedef typename iterator_traits<_Iterator>::difference_type
  typedef typename iterator_traits<_Iterator>::pointer
  typedef typename iterator_traits<_Iterator>::reference

  typedef _Iterator iterator_type;
  typedef reverse_iterator<_Iterator> _Self;

  reverse_iterator() ()
  explicit reverse_iterator(iterator_type __x) : current(__x) () 

template <class _Iterator>
inline bool operator>(const reverse_iterator<_Iterator>& __x, 
                      const reverse_iterator<_Iterator>& __y) (
  return __y < __x;

template <class _Iterator>
inline bool operator<= ( const reverse_iterator<_Iterator> & __x, 
                       const reverse_iterator<_Iterator> & __y) (
  return !(__y < __x);

] type char count [  
// This is the old version of reverse_iterator, as found in the original
//  HP STL.  It does not use partial specialization.

template <class _RandomAccessIterator, class _Tp, class _Reference = _Tp&,
          class _Distance = ptrdiff_t> 
template <class _RandomAccessIterator, class _Tp, class _Reference,
          class _Distance> 
class reverse_iterator (
  typedef reverse_iterator<_RandomAccessIterator, _Tp, _Reference, _Distance>
  _RandomAccessIterator current;
  typedef random_access_iterator_tag iterator_category;
  typedef _Tp                        value_type;
  typedef _Distance                  difference_type;
  typedef _Tp*                       pointer;
  typedef _Reference                 reference;

  reverse_iterator() ()
  explicit reverse_iterator(_RandomAccessIterator __x) : current(__x) ()
  _RandomAccessIterator base() const ( return current; )
  _Reference operator*() const ( return *(current - 1); )
  pointer operator->()const(return &(operator*());)
  _Self& operator++() (
    return *this;
  ] type char count [
  _Self operator++(int) (
    _Self __tmp = *this;
    return __tmp;
  _Self& operator--() (
    return *this;
  _Self operator--(int) (
    _Self __tmp = *this;
    return __tmp;
  _Self operator+(_Distance __n) const (
    return _Self(current - __n);
  _Self& operator+=(_Distance __n) (
    current -= __n;
    return *this;
  _Self operator- (_Distance __n) const (
    return _Self(current + __n);
  _Self& operator-=(_Distance __n) (
    current += __n;
    return *this;
  _Reference operator[] (_Distance __n ) const ( return * ( * this + __n); )

  template <class _RandomAccessIterator , class _Tp, 
          class _Reference , class _Distance>
inline random_access_iterator_tag
iterator_category(const reverse_iterator<_RandomAccessIterator, _Tp,
                                         _Reference, _Distance>&)
  return random_access_iterator_tag();

] type char count [

  template <class _RandomAccessIterator, class _Tp,
          class _Reference, class _Distance>
inline bool 
operator>(const reverse_iterator<_RandomAccessIterator, _Tp,
                                 _Reference, _Distance>& __x, 
          const reverse_iterator<_RandomAccessIterator, _Tp,
                                 _Reference, _Distance>& __y) (
  return __y < __x;

template <class _RandomAccessIterator, class _Tp ,
          class _Reference, class _Distance >
inline bool 
operator<=(const reverse_iterator<_RandomAccessIterator, _Tp,
                                  _Reference, _Distance>& __x, 
           const reverse_iterator<_RandomAccessIterator, _Tp,
                                  _Reference, _Distance>& __y) (
  return !(__y < __x) ;

template <class _RandomAccessIterator, class _Tp,
          class _Reference, class _Distance>
inline bool 
operator >= (const reverse_iterator <_RandomAccessIterator, _Tp,
                                  _Reference , _Distance>& __x, 
           const reverse_iterator <_RandomAccessIterator, _Tp,
                                  _Reference , _Distance>& __y) (
  return ! (__x < __y) ;


] type char count [
  template <class _Tp,
          class _CharT =char, class _Traits= char_traits<_CharT> >
class ostream_iterator (
  typedef _CharT                         char_type;
  typedef _Traits                        traits_type;
  typedef basic_ostream<_CharT, _Traits> ostream_type;

  typedef output_iterator_tag            iterator_category;
  typedef void                           value_type;
  typedef void                           difference_type;


make assigns a value to a variable. In this case make 'clean is just obfuscation, assigning a square bracketed list to a variable clean and then not doing anything with it.

type char count is used to print out a character based on the number of items inside the square-bracketed list that follows it. type prints out a value, char returns a character based on an ASCII value and count returns the number of items in a list. So for example type char count [ a b c d e f g h i j ] will print out a newline character (ASCII value 10).

Try it online here (cut and paste of source required)

  • I don't know what's more surprising: the fact that this looks like STL headers or the fact that it prints Hello, world!. +1 – kirbyfan64sos Aug 19 '15 at 20:33
  • 3
    I'm trying to find a BF clone here somewhere... – mbomb007 Aug 19 '15 at 20:45
  • Looks like Swift... – DDPWNAGE Aug 20 '15 at 4:57
  • 1
    Some variety of Logo? That certainly has "type" and "char" and "count" and square-bracketed lists, and the very beginning looks like a Logo variable assignment. But I thought Logo used double-quote rather than single-quote for quoting symbol names. – Gareth McCaughan Aug 24 '15 at 12:56
  • 10
    It's alarming how many people there are who can apparently instantly recognize TinyBF or Fission or HeadSecks but are flummoxed by Logo :-). – Gareth McCaughan Aug 24 '15 at 13:14

~English revised, 36 bytes

Echo "Hello,"
and " World!".

This answer contains protection against SPSS, Foo and Tiny. sighs

Four attempts and another answer in the same language, but my submission is finally safe!


~English is designed to look like plain text, which is probably why the second release appends not 2 but revised to the language's name.

Thankfully, there are aliases of the functions Display and Stop, which make ~English not look like English.

Of those aliases, I chose Echo and End, which – together with the keyword and – make the source code resemble a verbose scripting language rather than an esolang.

The sentence

Echo "Hello," and " World!".

greets the World and


stops execution, so the Foo protection that follows is simply ignored by the interpreter.

You can download the official interpreter from GitHub (linked on the Esolang page).

  • 1
    You have insane determination. – kirbyfan64sos Aug 23 '15 at 0:33

Karma, 67 bytes


The first line pushes all the characters onto the stack, using the queue to save some bytes. The second line pops and prints until 0, which is the first char on line 1.

  • 16
    The seven days have passed. You may reveal the language and make your answer safe. – Martin Ender Aug 25 '15 at 9:45

MarioLANG, 549 bytes, cracked by Sp3000

Helo, Wrd!#||||||=|||||||||||||=||"||||||||||||||=||||||||||||||||||||=||||||||||||||||||||||||||||||||||=|||

I really enjoyed this one. Here is a quick overview of how I created the code:

  • I started from the Brainfuck "Hello World!" on esolangs:


    I had to modify it slightly to add the comma, but let's ignore the details...

  • BF can be converted to ML fairly easily: change > and < to ) and ( respectively. Add a main floor beneath the program. Then implement loops via helper floors and elevators. That turns the above program into:

              !                               <

    This is a working "Hello World!" program in MarioLANG. (This code corresponds to the incorrect "Hello World!" on esolangs, not the obfuscated ML code above.)

  • At this point, we can golf the code a bit my actually moving some of the loop code into the auxiliary floor. I'm now switching to the actual code from this answer:

  • And now the actual obfuscation: I figured the = would be a dead giveaway for Sp3000 who knew the language (he had used it in Evolution of OEIS). But MarioLANG also has "walls" instead of "floors", represented by |. These are functionally identical though, so I used the less common character. I also figured the hanging floor would look suspicious so I padded the two lines with other characters. For good measure I added the first line again to the end, and made the padding in the middle line the opposite characters of the first line. I also added matching square brackets (which are ignored by MarioLANG), because I figured an unmatched [ might be another strong hint. Finally, I wrote a CJam script to sprinkle exactly 13 = into random floor positions (13, because that's the length of Hello, World!) and changed the padding characters in the fourth row to Helo, Wrd! to make it look like I'm reading the characters from the source code, like a Befunge answer might. Voilà, obfuscated MarioLANG! :)

  • 1
    I'm going to guess TinyBF but it's probably another language disguised as tinyBF :p . I can't tell for sure because the interpreter is crashing my browser. – Downgoat Aug 18 '15 at 20:17
  • @vihan It would be a pretty crazy coincidence if this was working TinyBF. It's definitely not what I intended. ;) – Martin Ender Aug 18 '15 at 20:18
  • 1
    @AlexA. No, unfortunately you can't disguise Rail like that (or I would have already posted a Rail answer :D). – Martin Ender Aug 18 '15 at 20:44
  • 1
    @aditsu (and anyone else who wants to throw out Fission as a random guess): Fission needs at least one of the 4 (upper case) characters ULDR to initiate any control flow at all. So no. ;) – Martin Ender Aug 18 '15 at 23:21
  • 6
    This is MarioLANG, but this was so well obfuscated that it looks nothing like it. – Sp3000 Aug 22 '15 at 16:06

gs2, 3 bytes, cracked by feersum


In gs2:

  • e or \x65 is product on lists (such as the empty list of characters representing STDIN), so it pushes an int 1.
  • | or \x7c is power-of-2, which changes it into 21 = 2.
  • h or \x68 is hello, which is a ridiculous command. The story goes as follows: when designing gs2, I set out to beat every code golf language on shinh's golf server, but goruby has an easter egg command h that prints Hello, world! (note the lowercase w), allowing it to claim the #1 spot on the hello world challenge's leaderboards. I wanted to one-up goruby, so I added my own easter egg command h that pushes Hello, world! to the stack, but allows you to customize the capitalization and punctuation by pushing an integer before it:

        elif t == '\x68': #= hello
            x = 0
            if len(self.stack) >= 1 and is_num(self.stack[-1]):
                x = self.stack.pop()
                x = (range(0, 11) + [100, 1000, 16, 64, 256]).index(x)
            s1 = 'h' if x & 1 else 'H'
            s2 = 'W' if x & 2 else 'w'
            s3 = ['!', '', '.', '...'][((x & 4) >> 2) | ((x & 16) >> 3)]
            s4 = '' if x & 8 else ','
            f = '%sello%s %sorld%s' % (s1, s4, s2, s3)

    As you can see by looking at the s2 = line, if there's a number 2 at the top of the stack, it'll get replaced with the uppercase-W variation: Hello, World!.

  • 3
    I have to ask: Does you intended solution comply with rule 1, specifically the part about what qualifies as a programming language? – Dennis Aug 18 '15 at 15:56
  • @Sp3000 Those are supposed to be U+2062 INVISIBLE TIMES characters, which are invisible, but not whitespace, so that they pad the post length to 30+ characters. – Lynn Aug 18 '15 at 16:23
  • 3
    @Dennis Yup -- the language is, in fact, Turing-complete. – Lynn Aug 18 '15 at 16:24
  • @Sp3000 I've replaced the padding with something less browser-breaking. – Lynn Aug 18 '15 at 16:26
  • 2
    gs2? (Didn't work at anarchy golf, but seeing maurisvh authored 5 days ago I'm going to guess it anyway.) – feersum Aug 21 '15 at 2:40

UNBABTIZED, 77 bytes



You can find the official website and interpreter here.

As noted on the website, the interpreter was written for Python 2.2, which allowed non-ASCII characters in source code. You can either download Python 2.2.31 or fix it for Python 2.7 by inserting the following line at the beginning of the interpreter:

# coding: latin1

How it works

First of all, whitespace should not be allowed in the source code according to the website, but trailing whitespace after a complete instruction seems to cause no issues.

The command $0,0 executes memory[0] = memory[0] == memory[0], which does not help greeting the World in any way. I've added this command solely to distract from the fact that . acts a statement separator.

The rest of the code is composed of thirteen :x commands, which writes the character with code point x to STDOUT.

An unobfuscated version of the source code would look like this:


1 Compiling Python 2.2.3 was surprisingly uneventful on openSUSE 13.2. make, make install and the resulting executable all printed a lot of warnings, but UNBABTIZED worked as intended.

  • ? – Downgoat Aug 17 '15 at 17:24
  • @vihan No, sorry. Fueue prints FUEUE: UNKNOWN , OP 14 times, then HHeelllloo,, WWoorrlldd!!, without exiting the program. – Dennis Aug 17 '15 at 17:48
  • Pyth... But not on the online interpreter? – Beta Decay Aug 17 '15 at 20:36
  • @BetaDecay No, sorry. $ begins a Python literal, resulting in a syntax error. – Dennis Aug 17 '15 at 20:40
  • 14
    @kirbyfan64sos Dennis knows a lot of everything. – Alex A. Aug 20 '15 at 5:32

Higher Subleq, 52 bytes, cracked by John WH Smith

int puts(char*);int main(){puts("Hello, World!\n");}

This doesn't really look like an esolang, but no sane C derivate would implement puts without an implicit newline.

  • 1
    Doesn't this work in C? – Arcinde Aug 17 '15 at 20:03
  • @Arcinde No, it does not. – Dennis Aug 17 '15 at 20:04
  • 6
    Ah, two newlines. – Peter Taylor Aug 17 '15 at 20:05
  • Is it objective c? – Cows quack Aug 18 '15 at 4:43
  • 5
    Wow, I'm actually going to comment here :D Could this be... Higher Subleq? – John WH Smith Aug 19 '15 at 22:27

><>, 353 Bytes, Cracked by Sp3000

//This seems almost fine
//"Hello, World!" r^2 times
//But will it be too wordy?
  var r = 2;
  var a1 = "Hello";
  var a2 = ",";
  var a3 = " World";
  if(a1 != a2 && a2!=a3&& a3 != a1){
      if(a1 == "Hello, World")
        for(var i = 0; i++; i < r*r)

As discovered by Sp3000, this is a ><> program. All unused whitespace and characters replaced with . character for readability.

/.................. ....
./"Hello, World!" r^.......
 .................. ................
  • Did you forget the exclamation mark? – aditsu Aug 18 '15 at 22:02
  • When ran in the correct language, the output is "Hello, World!" (no quotes of course) – Fongoid Aug 18 '15 at 22:15
  • Alright, just checking :) – aditsu Aug 18 '15 at 22:23
  • 11
    More ><> (Fish)! – Sp3000 Aug 19 '15 at 0:38
  • Indeed it is :P Too bad I forgot the ! in the obfuscation >_< – Fongoid Aug 19 '15 at 17:27

Mascarpone, 30 bytes, cracked by Sp3000

[!dlroW ,olleH]$.............

Stack-based? Maybe...

[!dlroW ,olleH] pushes all of those characters to the stack (yes, including the delimiters); $ pops the ]; and then the .each print one character. The program exits with a [ character still on the stack.

I would have made the output use a loop, but I can't figure out how they work...

  • 1
    @ETHproductions, it's not intended to be Orthogonal. The interpreter doesn't compile for me, so I can't definitely prove it isn't. – Peter Taylor Aug 18 '15 at 5:49
  • 1
    @nimi, it doesn't work in STXTRM. (And I'm not sure that STXTRM even meets the criteria of the challenge: it doesn't seem to have a way to print. I had to add one for the test). – Peter Taylor Aug 18 '15 at 5:53
  • 2
    (or is that what they want you to think?? dramatic music plays) – Lynn Aug 18 '15 at 19:20
  • 4
    @nimi, keep it quiet and I'll give you half of the prize money. – Peter Taylor Aug 21 '15 at 19:10
  • 3
    Seems to work in Mascarpone, which is indeed stack-based and $ pops the ] which for some reason gets pushed – Sp3000 Aug 23 '15 at 12:55

Whirl, 12302 bytes, cracked by Artyom


Whirl ignores everything except 1 and 0. I also modified other digits randomly, but they are not relevant. When you keep only 1's and 0's, you get a "Hello, World!" example :)

  • 1
    Pi? – alephalpha Aug 21 '15 at 13:11
  • @alephalpha hehe, no, it's just disguised to look like Pi – aditsu Aug 21 '15 at 13:38
  • Is it by any chance NULL? – Alex A. Aug 23 '15 at 21:48
  • @AlexA. no, it's not – aditsu Aug 24 '15 at 3:28
  • 2
    Nice one! This is Whirl. – Artyom Aug 27 '15 at 21:00

GNU bc, 36 bytes

main = do
  print "Hello, World!\n"

A Foo-immune version of my previous attempt.

This requires the GNU version (or any other version that features the print function) of bc. The first line is for obfuscation: in bc variables don't have to be declared and are initialized with 0, so we have useless assignment but with valid syntax. The second line simply prints Hello, World!.

  • Is it Frege? – alephalpha Aug 22 '15 at 15:03
  • @alephalpha: I don't know Frege, but all programs I've seen have a module or package keyword in it, so I guess it won't compile. Maybe it works in the REPL, but that's not allowed. – nimi Aug 22 '15 at 22:59
  • If it wasn't for the Foo protection, this would work in zsh. – Dennis Aug 24 '15 at 21:31
  • 1
    I'm sure this isn't the intended language, but this does work in Cyan, if you ignore messages sent to stderr (error-less syntax would need a colon after main = do:). – primo Aug 26 '15 at 11:48
  • 1
    (You have to be kidding me! I've searched the whole internet for something I have on my computer...) How do you invoke this? I can't seem to convince bc to read from a file. – Dennis Aug 26 '15 at 18:28

Mouse, 105 bytes


You can get an interpreter for Mouse written in C here.

Mouse uses reverse Polish notation, so operators follow operands. (Think Lisp backwards.) Variable assignment is performed using <variable>: and recalling a variable's value is done as <variable>.. All values in Mouse are integers.

! outputs an integer and !' outputs the ASCII character associated with the integer. All output goes to STDOUT.

For whatever reason, all valid programs must end with $.

1 [ ~ If true, do

    ~ Variable assignments
    10 Y:
    Y. Y. * X:
    108 Z:

    ~ Push values onto the stack
    33               ~ 33  "!"
    X.               ~ 100 "d"
    X. 8 +           ~ 108 "l"
    X. Y. + 4 +      ~ 114 "r"
    X. Y. + 1 +      ~ 111 "o"
    X. Y. 2 * - 7 +  ~ 87  "W"
    Y. 3 * 2 +       ~ 32  " "
    44               ~ 44  ","
    X. Y. + 1 +      ~ 111 "o"
    Z.               ~ 108 "l"
    Z.               ~ 108 "l"
    Y. 10 * 1 +      ~ 101 "e"
    72               ~ 72  "H"

    ~ Pop values and output as characters
    !' !' !' !' !' !' !' !' !' !' !' !' !'

]   ~ End if
$   ~ End program
  • Is it Headsecks? – mbomb007 Aug 21 '15 at 17:50
  • @mbomb007 Nope. – Alex A. Aug 21 '15 at 17:54
  • Is this Nybbleist? – BrainSteel Aug 23 '15 at 2:15
  • @BrainSteel Nope. – Alex A. Aug 23 '15 at 2:23
  • Just a wild guess, Julia? – Beta Decay Aug 24 '15 at 21:51

Chef, 1943 bytes, cracked by Angew

Hello World Cake with Chocolate sauce.

This prints hello world, while being tastier than Hello World Souffle. The main
chef makes a " World!" cake, which he puts in the baking dish. When he gets the
sous chef to make the "Hello" chocolate sauce, it gets put into the baking dish
and then the whole thing is printed when he refrigerates the sauce. When
actually cooking, I'm interpreting the chocolate sauce baking dish to be
separate from the cake one and Liquify to mean either melt or blend depending on

33 g chocolate chips
100 g butter
54 ml double cream
2 pinches baking powder
114 g sugar
111 ml beaten eggs
119 g flour
32 g cocoa powder
0 g cake mixture

Cooking time: 25 minutes.

Pre-heat oven to 180 degrees Celsius.

Put chocolate chips into the mixing bowl.
Put butter into the mixing bowl.
Put sugar into the mixing bowl.
Put beaten eggs into the mixing bowl.
Put flour into the mixing bowl.
Put baking powder into the mixing bowl.
Put cocoa  powder into the mixing bowl.
Stir the mixing bowl for 1 minute.
Combine double cream into the mixing bowl.
Stir the mixing bowl for 4 minutes.
Liquify the contents of the mixing bowl.
Pour contents of the mixing bowl into the baking dish.
bake the cake mixture.
Wait until baked.
Serve with chocolate sauce.

chocolate sauce.

111 g sugar
108 ml hot water
108 ml heated double cream
101 g dark chocolate
72 g milk chocolate

Clean the mixing bowl.
Put sugar into the mixing bowl.
Put hot water into the mixing bowl.
Put heated double cream into the mixing bowl.
dissolve the sugar.
agitate the sugar until dissolved.
Liquify the dark chocolate.
Put dark chocolate into the mixing bowl.
Liquify the milk chocolate.
Put milk chocolate into the mixing bowl.
Liquify contents of the mixing bowl.
Pour contents of the mixing bowl into the baking dish.
Refrigerate for 1 hour.
  • 5
    That would be Chef, I assume. – Angew Aug 17 '15 at 12:07
  • @Angew Well done! :) – user42003 Aug 19 '15 at 8:34

Wordfuck, 1063 bytes, cracked by Martin Büttner

Thus men; die. Here meet prepar'd thrice be." Down his
 with lab'ring forg'd and And retir'd Now universal Phoebus at
 Hesperian living, off fields fierce cries, assail'd not for These
 foe. Spread, indulgent quarry headlong prince your bloody side crew.
 Elated call humble yield, his yield, boys camp men, cruel
 all the loudly trusty won, winter spouts they crown. Had
 what long long upon fram'd. Declare back throat, tossing his
 enters, the Nor Aeneas; said from flowing the enclose th'
 match'd Receive with neither threat. From seas painted His oppos'd,
 cried, Thus mortal the his and combine form and, wine.
 And but Let absent, sums to guest, you to spear
 to greedy of First, with love bear." path Whom heav'n
 That by Argive need they to blood, wert eyes the
 this To large, with Some Jove (The from hosts, the
 yoke with horses' when sail is purple at wintry his
 with more camp with have to Earth, to oppose of
 the troops with various but so, thirty well perform by
 the and waves- man! from fear victory too at fire,
 If recess banish'd transfer.

Note that line endings must be Unix-style.

  • 3
    Perl? (Probably very wrong...) – kirbyfan64sos Aug 17 '15 at 18:46
  • 37
    @kirbyfan64sos No, far too readable for Perl. – Arcinde Aug 17 '15 at 18:54
  • 2
    At first I thought it might be ??? and I got super excited, but it turns out it doesn't work in ???. :/ – Alex A. Aug 17 '15 at 19:25
  • 1
    @Caltor AlexA. just published it last night ;) – ETHproductions Aug 17 '15 at 21:01
  • 4
    This is Wordfuck. – Martin Ender Aug 19 '15 at 20:24

APL, 39 bytes, cracked by Mauris

"Helo, Wrd!"[0,1,2,2,3,4,5,6,3,7,2,8,9]

Efficiency is everything.

This works in the ngn-apl demo.

Obfuscating APL is no easy task if the intention is to make it look less like APL.

This is what I achieved:

  • Double quotes do not work in all dialects. Dyalog, e.g., does not support them.

  • ngn/apl is the only dialect I know that uses zero-based indexing by default.

  • The commas aren't supposed to be there.

    Vector elements are usually separated by spaces when writing APL. However, , concatenates so the code inside the brackets concatenates 13 singletons.

A (slightly) unobfuscated and more portable version of the code would look like

⎕IO←0⋄'Helo, Wrd!'[0 1 2 2 3 4 5 6 3 7 2 8 9]

which works in TryAPL, GNU APL.js and the ngn/apl demo.

  • Works in kdb+. I think the language name is Q, but didn't find it mentioned anywhere in the download. And I don't know how to run it as a standalone source file. – jimmy23013 Aug 20 '15 at 20:12
  • 1
    No I'm wrong, it also printed the quotes... – jimmy23013 Aug 20 '15 at 20:17
  • Anyone know any languages where array indexing of a string is allowed? – mbomb007 Aug 20 '15 at 21:57
  • @mbomb007 Python and Ruby, but this ain't either. I can't think of a language that won't print quotes around the string. – lirtosiast Aug 20 '15 at 22:52
  • 4
    This is APL. (It works in ngn-apl, at least) – Lynn Aug 21 '15 at 1:04

Wordy, 3279 bytes

#_>^ +7K1 }OU8 4>Fk ry\g 9Ff] A}kY ,6Fo IK`k C'td dbJ[ 0j]l MBp[ \">| R\JY %+T_
)*`7 @[{j ;x-+ _H\= ;D@& />p? h,mx 1m;7 p+yL -#&9 0(^! ,i9^ Q%_! +&$Q %#|e %:~A
%T</ }-(r ]_$p g&|" *w#= @++j \)U` <:W< _t{( c\#< :f@~ >[+6 ,B%? S6d} HSm" b=Yz
c[(; @n*# ;`,Z >~K) D"<% <}h" #>N. I0:o >c"+ '>S! pQX[ U#gu $Ei0 6`>~ -/4: ,3;%
\c(? h;TQ LN)o 5`#; }{V* '-E. 7:5u d]0y s|JJ u+>` `|8? y,<0 \(d! 1^*, &U`_ U/@"
*&7. M|f% |C#? \{4` ,k<+ %*'D h~=_ W_+{ [#_[ %"-r #~_F _:u. N|W6 awH' JMm, }%=R
a>*= *z+' {@"A ,'3\ m;}@ (I<. "044 '}A` =K'? puB[ R<ka nrR: S<>= ;`(e (\*p N$"?
u1c} eI%L O$*~ ]O+{ 7"@! vU%n 'MIs E`VV ,/~q p}\? ^DM, k:-! ,3:$ D*~< "}T^ /z}%
\|h< 'Y@? }M%0 {/c. |";P /I"` "[(v ~>l- #2]! j~af rZ(J 9zv` {`T, M`'& (H+: {G+>
A#~` /_%6 4"}! 9|rs [;$m ]J|? IZx; ^xaf WuB) =^+s |+%t [;^U ])A! H;Jb @STw x^`,
=9~< %Z). @v3o h;Tz M9~t {'|O {J`. u^t> 9<-? )/4- `/v| )>O] /(E' ,};X ;&0. 0`o:
(#o? ,D]< X%|* ;}*h [%C` &(A' ^@J^ {O[| &%&Q -;9` |j}) |z]+ :4:. 03(4 <Bhz N$mY
R$~< -M#' C)$$ /=[J 9@^" [*}a :%R. T1,W Y=}` O=&. D;ms Mi=c (Stg >|}1 __^B P};{
&{1. y(Wq T&Nq $^'D />@M @u^? $2Pd n4~d 19j/ X>#> #s[. 0-@P $B%? %w}% x=<[ =}r_
\#=8 ~~R> P']! }8a+ *;j! w<_` %;T: #0({ -_8< A(]^ @1`/ )@f` /=m\ e"~@ ~4$' (z]&
/C|? wtn; HFe^ Gzn* @K}/ >1+{ 7/-{ 2&{} }X-% T=:> O,;. qR8; ;*0: s|>. -bFs DK^y
jk}O =~g/ B%:{ 9;@` K%}? `Xvi "vI4 c+$) =<(b %g#. Tt'w P\ID M`fI %#^M E#=. B&)v
;9:? (+/7 <%q" =,U{ -`/G r[*^ Y;@! H&d> ))@% &S,! |B*[ ~^-p 6+,~ N#&\ ;]K* 6}=^
/|Q) *y:\ ,M*| %&'f =U>@ }~@Y >~3~ `P<: K\+? WUD= |4x5 sox} /6;> [&r{ p@", :'D}
g{^} -]$H _B-! fJ5< p;&@ {a~! Ra+M OKo+ ydJ+ *~-T :W=; @*#, ^_e- k=_. M@QY (fQn
X<,] >(C/ [A/. {nNT {tXg vy@e *1+} (G,. +2m[ X[=! s$,/ [@y! :l+9 -@2. :(P- +a~#
,p%) %*)0 }*=F +"T( Q&~@ <c*; }(\E 3@_* I):( \:2? ~CqL 5$TC ,ARH ;*p/ <~0` _B';
;=>A (%T, d&[; #`g. N*u1 @LEE zPP[ ;<)4 ,1%= [#1# =6^! IL\e 0t@f ~}h< j'{+ <_B!
wFE; lyr` Ja\V '[,J 2_^! Rb;% I>$? F#-{ %+j. fB>2 J7P# Kj~n }#C> T*%` Q=/@ T;%>
_c|{ :&$1 %Q}. rFl> #A,` `Z^! Ks"L hUI: 6_MV ^Q-- `M/> #3/= #'n. MID{ vdn, @_l{
v_@; `s@? H#eZ ]9my oP#e {|R# '(k! d#d; :s,? $+H@ :#=e }2-] 8,-< &1$! l(`7 e:-!
%\X$ k_>' <7], ~%N| r)]] -"$u &0\! SR:z ly]b K(wa q*@- ]{~c )}x% &@&Y >~;j #R)=
%V*. %L1F j'~; +_0. Yz-x @kVV 0G:a `,p] (>n< >{{z /#m! S~CS #Foq %$h( +*{B G#@?
fwr< %OQt K"Cx @0}+ b${. F]R* k=/! C$=, @#/b 4[$* y`,^ $|*R 6,%! Z*c@ ;0\. [&f-
$"/k -L{, \@7{ ^]k\ v$>% v#-; +G># -F@} :=R@ Z<|^ )H-~ o#~^ E#$) :a{. i52: :svA
q&NY #g"< )r]{ "p%& %P}@ 'k|, #m)' ]6$. :@{& |Rcr \]|T ;^8! b2{F rv<i N>VP D>~_
)'A_ G(}- Y&^? 64-A %klM %Q=@ }J:; _b<? ^jjo v[5V {gyQ y)`[ }|l. '0B` A`{. >]@M
#},y C"_} s]@' \9|- _#$o _w"? %&43 k}". >}u- ^]b? z%Cg f+aT vr$A /:\z #);I $*F,
+7^# \%T( ,*a{ &>n? t8J( >*|F @{4? >X4T o7r+ bQ:L *^C_ ;#8& `w(( >,v. a<dY D52+
1_+: "-i) }&f? *LNO %d5F yu{O $}&x 'v]? *b{m &*i! W\#( <%i+ }=o" 9=#& \@1{ @4-?
O])U :`Z? T{`> &>}0 <[T+ `w|{ *"k* >@b^ ~,8+ "{;n &-X* "l{+ [V_" ^8$. $Ppv MY7%
1e;R ={g# |N}_ )`[d *U\~ "@L# &o{, ^Y[! m13= z@\$ /\o. VdO" %EBr h,cD &^(6 )t(`
'S%, @L(? zd{g 0YR" n;}_ 9$~^ N`$! hz>G iM_A JT8+ K)-] g[`? 1J@~ -l*? {<n& w{+:
;r`& ,9-> (}r| M$<? I"0* H|=. =[:T (^#y V~-/ 6(:? K{GF RzF^ V^4d ;#>d ~C}@ b(^\
(_B- /)_K >;^i V#%! c5H^ 'R@> <M:. ee\0 jPH( JV=4 >{&k "T#\ y';) {^e? :gq7 2B(3
+P-| s\%( 'e~? TE8^ V6U> mB<q 'K&( {u|! y@<A ]f&. "K~+ =o(? 5+u^ u>(? a_%. *</>

As I hinted in the comments, this haystack is mostly needle.

We can greet the World by executing the following instructions:


Wordy encodes all instructions as sentences, where the fraction of words that are longer and shorter than the rounded average selects the command.

The shortest sentences I could find for the used instructions are:

ASSIGN xxx xxx xxx xxx xxx xxx xxx xxx xxx xxx xxx xxx xxx x x x x x x x.
VALUE xxx xxx x x x.
ADD xxx x x.
MULTIPLY xxx xxx xxx x x x x.
OUTCHAR xxx xxx xxx x x x x x x x.
NOP xxx xxx xxx x x.

But how can one conceal the fact that word length is the only important thing in the source code?

Neither word order nor the picked word characters matter, as long as they're alphanumeric, so I decided to add random non-alphanumeric characters to each word to pad all of them to the same length. I also added a few non-words (no alphanumeric characters at all) to give the source code its pleasent rectangular shape.

I've generated the final source code using this CJam program.

  • 3
    That's one big haystack. – Sp3000 Aug 20 '15 at 5:51
  • 4
    I guess that depends on the size of the needle. – Dennis Aug 20 '15 at 5:53
  • 6
    Speaking of haystacks. If there isn't currently a language called "Haystack", that'd be a great name for one... – mbomb007 Aug 20 '15 at 21:59
  • @mbomb007 working on it ;) – Kade Aug 24 '15 at 17:19
  • I'm pretty sure that it isn't, but l33t? – MickyT Aug 27 '15 at 3:36

Haskell, 637 bytes

(program, main)= script $init

string= struct( \ 
  char(show)-> do show; putChar(char); while 1 ) (return 0)

  stack= auto $string("!dlroW ,olleH")

struct buffer (public) = share%: \ 
  (field public buffer) align

auto buffer= (init, buffer)

share from = select x where x = from x

while skip=return 1; skip= skip+1

select x | ~"World"<-

loop k for[]
  buffer=(const ($k) ($skip) id)

loop while not(-- $x) {
  unsigned: i{-1}
  terminal.write(buffer{eval $i--})
  x= not (unsigned) $x
  $i `const `skip{-2}


(goal, field)= auto loop

  goal= finish $goal

Deobfuscation video

enter image description here

  • Sounds like a sports game, lol. – mbomb007 Aug 21 '15 at 2:53
  • For some reason, I feel like this is a language that ignores alphabetic characters, and all the worlds are just there to confuse people. – kirbyfan64sos Aug 25 '15 at 0:11
  • @kirbyfan64sos: no, only a few of the characters are ignored. Most random changes you could make to this program would brake it. – ceased to turn counterclockwis Aug 25 '15 at 15:11
  • 1
    The seven days have passed. You may reveal the language and make your answer safe. (As long as you don't, people may still crack your answer.) – Martin Ender Aug 28 '15 at 10:44
  • A guess: it's zsh? – georgeunix Aug 28 '15 at 17:20

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.