Does it Lead or Follow?

Question

In this challenge you are to write a program or function, that takes a string as input and outputs one of two possible values. We will call one of these values truthy and one falsy. They do not need to actually be truthy or falsy. For an answer to be valid it must meet four additional criteria

• When you pass your program to itself it outputs the truthy value.

• If you pass your program as input to any older answer it should output the truthy output (of the program you are passing to).

• If you pass any older answer to your answer as input it should output the falsy output (of your program).

• There must be an infinite number of strings that evaluate to truthy output in all answers on the challenge (including your new answer).

What this will do is it will slowly build up a chain of answers each of which can determine if other programs in the chain come before or after it.

The goal of this challenge is to build up a list of source restrictions that are applied to the successive answers making each one more challenging than the last.

Example

A chain (written in Haskell) could start:

f _ = True

Since there are no older programs, the criteria do not apply to this answer it need only output one of two possible values, in this case it always outputs True.

Following this could be the answer:

f x=or$zipWith(==)x$tail x

Try it online!

Which asserts that there is a character twice in a row somewhere in the string. The first answer doesn't have this property while the second does (==). Thus this is a valid next answer.

Special rules

• You may use any language you wish (that has a freely available implementation) as many times as you wish.

• If you were the last person to answer you must wait at least 7 days before posting a new answer.

• Your program may not read its own source.

• Since the 4th rule is exceedingly difficult to verify if cryptographic functions are involved, such functions are disallowed.

Scoring criterion

Each time you add an answer you will get as many points as its place in the chain. For example the 5th answer would gain it's writer 5 points. The goal is to get as many points as you can. The last answer will score its answerer -∞ points. This will probably be more fun if you try to maximize your own score rather than "win" the challenge. I will not be accepting an answer.

Since this is answer-chaining you may want to sort by oldest

Answer 1

19, Octave, 196 bytes

_{Note: I made an edit to the code, to fix an error. The only change was to include the palindrome rule. This avoids a false positive for answer 10.}

---

Most requirements up until now can easily be circumvented using comments and suppressed strings, making it trivial to add answers. I figured I'd make it a bit harder by disallowing some characters instead.

.6;%+->?|"e"|?>-+%;6.
f=@(x)all(ismember('Hi, Retina!',x))&sum(ismember(x,cat(2,33:36,46,91:93,'')))<6&x(2)<60&all((k=x(1:find(x==10,1)-1))==flip(k))
%

Try it online!

Satisfies:

2. The first character is a ..
3. It contains an e.
4. Its length is even.
5. Its length is a perfect square.
6. It contains an a.
7. It contains a > character.
8. Contains the exact string ->.
9. Contains the exact string Hi, Retina!.
10. The sum of the first two Unicode code points is a multiple of 5.
11. The 10-th character is a ".
12. The last non-empty line does not have any duplicate characters.
13. The first line is a palindrome of length > 5.
14. The first line is exactly 21 characters long (not including newline).
15. It contains a ?.
16. It contains a |.
17. Contains a +.
18. It is at least 28 lines long.
19. The following characters are used five times in total: !"#$.[\] and the codepoint of the second character is less than 60.

For future answers:

• The first character is a ., and so is the 21st character (palindromic rule).
• Its length is an even perfect square.
• Contains the exact sequence ->.
• Contains the exact string Hi, Retina!.
• The second character's Unicode code point, mod 5, is 4, and its code point is lower than 60.
• The 10-th character is a ", and so is the twelfth character (palindromic rule).
• The last non-empty line does not have any duplicate characters.
• The first line is a palindrome of length = 21
• It contains a ?.
• It contains a |.
• It contains a +.
• It is at least 28 lines long.
• The following characters can only be used five times in total: !"#$.[\].
  • Each program is now allowed only the 2 . and 2 " in the first line, and the ! in Hi, Retina!. Those characters cannot be used anywhere else, in addition to no uses of #$[\].

Answer 2

17, Whitespace, 100 bytes

.|?|?|?|?"+"?|?|?|?|.
Hi, Retina!-> 
   
 
    
                                
        
      

 


   
    
    
    
 
 abcdefgh

I guess the perfect language for this challenge, and I might post more when the chain has progressed.

Try it online.

Outputs 1 if the input contains a +, or nothing otherwise.

I created a script to check all the characters the previous answers didn't contain yet, and + was the first one, so I've used that as a validation for my answer. My program also returns true in the TIO-links of all previous answers (except in X86 Assembly (gcc 6.3) where I got an error.., although my answer does satisfy to all the rules of the previous answers).

Satisfies / For future answers:

• The first and twenty-first characters are ..
• Its length is even and a perfect square.
• Contains the exact string ->.
• Contains the exact string Hi, Retina!.
• The second character's Unicode code point, mod 5, is 4.
• The tenth and twelveth characters are ".
• The last non-empty line does not have any duplicate characters.
• The first line is a palindrome of length 21.
• It contains a ?.
• It contains a |.
• It contains a +.

---

Explanation:

In Whitespace, every character except for spaces, tabs and new-lines are ignored. Here is the base program with just the spaces, tabs and new-lines:

Letters S (space), T (tab), and N (new-line) added as highlighting only.
[..._some_action] added as explanation only.

[N
S S N
_Label_LOOP][S S S N
_Push_0][S N
S _Duplicate_0][T   N
T   S _Read_STDIN_as_character][T   T   T   _Retrieve][S S S T  S S S S S N
_Push_43][T S S T   _Subtract][N
T   S S N
_Jump_to_Label_TRUE_if_0][N
S N
N
_Jump_to_Label_LOOP][N
S S S N
_Create_Label_TRUE][S S S T N
_Push_1][T  N
S T _Print_as_integer][N
S N
S _Jump_to_Label_EXIT]