Abuse filter log

Abuse Filter navigation (Home | Recent filter changes | Examine past edits | Abuse log)
Jump to navigation Jump to search
Details for log entry 9,350

18:18, 25 September 2025: Why027 (talk | contribs) triggered filter 16, performing the action "edit" on Sqrt(x). Actions taken: Disallow; Filter description: the "User:" must not be hidden on links to userspace (examine)

Changes made in edit

'''Sqrt(x)''' may be one of the hardest esolangs.

== Introduction ==

[[User:Why027|Why027]] made this language on 21th century's Square day, in an attempt to make the hardest esolang.
Sqrt(x) is a Cell-based one-dimensional esoteric programming language.

Why did he try to make it, We do not know.

{{infobox proglang
|name=brainfuck
|paradigms=imperative
|author=[[User:Why027|Why027]]
|year=[[:Category:2025|2025]]
|memsys=[[:Category:Cell-based|Cell-based]]
|dimensions=one-dimensional
|class=[[:Category:Turing complete|Turing complete]]
|influence=[[Brainfuck]] <br>[[Malbolge]]
}}

== Overview ==

Sqrt(x) operates on an array of memory cells, each initially set to zero.
There is a pointer, initially pointing to the first memory cell.
Also there is a counter of sorts which starts at 0 in the beginning of the line (originally it was the program, but [[User:Why027|Why027]] made it easier).
After each command it increments the counter by 1, but if the counter reaches 10 is resets it back to zero.
A cell has a minimum (0) and a maximum (255)
When it runs a line of code (without halt number) it does this:

<code>
Sqrt('''0,4733715204''') ->
</code>

<code>
c='''0,68802''' ->
</code>

<code>
ADD_TO(Formatted_code; {c[0]-0*10^('''6'''-(0+1))}) -> ... -> ADD_TO(Formatted_code; {c[5]-0*10^('''6'''-(5+1))}) ->
</code>

<code>
RUN{Formatted_code; scrambled?=0; shift?=0}
</code>


This would be a cat program : <code>0.4733715204</code>
Without the scrambling and shifting : <code>056457</code>


If it hits a non-command it skips it and doesn't increment the counter.

When it compiles the program you made which may look like this:

<code>
2?3025
</code>

Then it takes the square root of the number after the <code>?</code>:

<code>
2?55
</code>

Afterwards it shifts the numbers back:

<code>
2?54
</code>

Which it reads it as halt after command <code>2</code>, do command <code>5</code>, after that do command <code>4</code>. Which is a program which takes in a input then outputs it.


The commands for the unscrambled and non-command shifting version are as followed:

{| class="wikitable"
!Command
!Description
|-
| style="text-align:center"| <code>0</code>
|noop
|-
| style="text-align:center"| <code>1</code>
|Move the pointer to the right
|-
| style="text-align:center"| <code>2</code>
|Increment the memory cell at the pointer and do the crazy operation to the cell after the pointer
|-
| style="text-align:center"| <code>3</code>
|Decrement the memory cell at the pointer and increment by 1 the cell before the pointer
|-
| style="text-align:center"| <code>4</code>
|Output the character signified by the cell at the pointer using ASCII
|-
| style="text-align:center"| <code>5</code>
|Input a character and store it in the cell at the pointer using ASCII
|-
| style="text-align:center"| <code>6</code>
|Jump past the matching <code>7</code> if the cell at the pointer is 0
|-
| style="text-align:center"| <code>7</code>
|Jump back to the matching <code>6</code> if the cell at the pointer is nonzero
|-
| style="text-align:center"| <code>8</code>
|Does the crazy operation to the cell at the pointer
|-
| style="text-align:center"| <code>9</code>
|Move the pointer to the left
|}

Also, here is the crazy operation:

{| class="wikitable"
!colspan="2" rowspan="2"|
!colspan="3" style="text-align:center"|<code>C%2</code>
|-
! '''<code>0</code>'''
! '''<code>1</code>'''
|-
!rowspan="3"|<code>S%2</code>
! '''<code>0</code>'''
| <code>1</code>
| <code>0</code>
|-
! <code>1</code>
| <code>0</code>
| <code>1</code>
|}
Where S is the '''S'''um of both cell next to the cell at the pointer.

Where C is the '''C'''ell at the pointer.

== Examples ==

There are no examples yet, exept the ones in Overview.
So don't expect much in the future.

Action parameters

VariableValue
Edit count of the user (user_editcount)
2
Name of the user account (user_name)
'Why027'
Age of the user account (user_age)
454919
Page ID (page_id)
0
Page namespace (page_namespace)
0
Page title (without namespace) (page_title)
'Sqrt(x)'
Full page title (page_prefixedtitle)
'Sqrt(x)'
Action (action)
'edit'
Edit summary/reason (summary)
''
Old content model (old_content_model)
''
New content model (new_content_model)
'wikitext'
Old page wikitext, before the edit (old_wikitext)
''
New page wikitext, after the edit (new_wikitext)
''''Sqrt(x)''' may be one of the hardest esolangs. == Introduction == [[User:Why027|Why027]] made this language on 21th century's Square day, in an attempt to make the hardest esolang. Sqrt(x) is a Cell-based one-dimensional esoteric programming language. Why did he try to make it, We do not know. {{infobox proglang |name=brainfuck |paradigms=imperative |author=[[User:Why027|Why027]] |year=[[:Category:2025|2025]] |memsys=[[:Category:Cell-based|Cell-based]] |dimensions=one-dimensional |class=[[:Category:Turing complete|Turing complete]] |influence=[[Brainfuck]] <br>[[Malbolge]] }} == Overview == Sqrt(x) operates on an array of memory cells, each initially set to zero. There is a pointer, initially pointing to the first memory cell. Also there is a counter of sorts which starts at 0 in the beginning of the line (originally it was the program, but [[User:Why027|Why027]] made it easier). After each command it increments the counter by 1, but if the counter reaches 10 is resets it back to zero. A cell has a minimum (0) and a maximum (255) When it runs a line of code (without halt number) it does this: <code> Sqrt('''0,4733715204''') -> </code> <code> c='''0,68802''' -> </code> <code> ADD_TO(Formatted_code; {c[0]-0*10^('''6'''-(0+1))}) -> ... -> ADD_TO(Formatted_code; {c[5]-0*10^('''6'''-(5+1))}) -> </code> <code> RUN{Formatted_code; scrambled?=0; shift?=0} </code> This would be a cat program : <code>0.4733715204</code> Without the scrambling and shifting : <code>056457</code> If it hits a non-command it skips it and doesn't increment the counter. When it compiles the program you made which may look like this: <code> 2?3025 </code> Then it takes the square root of the number after the <code>?</code>: <code> 2?55 </code> Afterwards it shifts the numbers back: <code> 2?54 </code> Which it reads it as halt after command <code>2</code>, do command <code>5</code>, after that do command <code>4</code>. Which is a program which takes in a input then outputs it. The commands for the unscrambled and non-command shifting version are as followed: {| class="wikitable" !Command !Description |- | style="text-align:center"| <code>0</code> |noop |- | style="text-align:center"| <code>1</code> |Move the pointer to the right |- | style="text-align:center"| <code>2</code> |Increment the memory cell at the pointer and do the crazy operation to the cell after the pointer |- | style="text-align:center"| <code>3</code> |Decrement the memory cell at the pointer and increment by 1 the cell before the pointer |- | style="text-align:center"| <code>4</code> |Output the character signified by the cell at the pointer using ASCII |- | style="text-align:center"| <code>5</code> |Input a character and store it in the cell at the pointer using ASCII |- | style="text-align:center"| <code>6</code> |Jump past the matching <code>7</code> if the cell at the pointer is 0 |- | style="text-align:center"| <code>7</code> |Jump back to the matching <code>6</code> if the cell at the pointer is nonzero |- | style="text-align:center"| <code>8</code> |Does the crazy operation to the cell at the pointer |- | style="text-align:center"| <code>9</code> |Move the pointer to the left |} Also, here is the crazy operation: {| class="wikitable" !colspan="2" rowspan="2"| !colspan="3" style="text-align:center"|<code>C%2</code> |- ! '''<code>0</code>''' ! '''<code>1</code>''' |- !rowspan="3"|<code>S%2</code> ! '''<code>0</code>''' | <code>1</code> | <code>0</code> |- ! <code>1</code> | <code>0</code> | <code>1</code> |} Where S is the '''S'''um of both cell next to the cell at the pointer. Where C is the '''C'''ell at the pointer. == Examples == There are no examples yet, exept the ones in Overview. So don't expect much in the future.'
Unified diff of changes made by edit (edit_diff)
'@@ -1,0 +1,136 @@ +'''Sqrt(x)''' may be one of the hardest esolangs. + +== Introduction == + +[[User:Why027|Why027]] made this language on 21th century's Square day, in an attempt to make the hardest esolang. +Sqrt(x) is a Cell-based one-dimensional esoteric programming language. + +Why did he try to make it, We do not know. + +{{infobox proglang +|name=brainfuck +|paradigms=imperative +|author=[[User:Why027|Why027]] +|year=[[:Category:2025|2025]] +|memsys=[[:Category:Cell-based|Cell-based]] +|dimensions=one-dimensional +|class=[[:Category:Turing complete|Turing complete]] +|influence=[[Brainfuck]] <br>[[Malbolge]] +}} + +== Overview == + +Sqrt(x) operates on an array of memory cells, each initially set to zero. +There is a pointer, initially pointing to the first memory cell. +Also there is a counter of sorts which starts at 0 in the beginning of the line (originally it was the program, but [[User:Why027|Why027]] made it easier). +After each command it increments the counter by 1, but if the counter reaches 10 is resets it back to zero. +A cell has a minimum (0) and a maximum (255) +When it runs a line of code (without halt number) it does this: + +<code> +Sqrt('''0,4733715204''') -> +</code> + +<code> +c='''0,68802''' -> +</code> + +<code> +ADD_TO(Formatted_code; {c[0]-0*10^('''6'''-(0+1))}) -> ... -> ADD_TO(Formatted_code; {c[5]-0*10^('''6'''-(5+1))}) -> +</code> + +<code> +RUN{Formatted_code; scrambled?=0; shift?=0} +</code> + + +This would be a cat program : <code>0.4733715204</code> +Without the scrambling and shifting : <code>056457</code> + + +If it hits a non-command it skips it and doesn't increment the counter. + +When it compiles the program you made which may look like this: + +<code> +2?3025 +</code> + +Then it takes the square root of the number after the <code>?</code>: + +<code> +2?55 +</code> + +Afterwards it shifts the numbers back: + +<code> +2?54 +</code> + +Which it reads it as halt after command <code>2</code>, do command <code>5</code>, after that do command <code>4</code>. Which is a program which takes in a input then outputs it. + + +The commands for the unscrambled and non-command shifting version are as followed: + +{| class="wikitable" +!Command +!Description +|- +| style="text-align:center"| <code>0</code> +|noop +|- +| style="text-align:center"| <code>1</code> +|Move the pointer to the right +|- +| style="text-align:center"| <code>2</code> +|Increment the memory cell at the pointer and do the crazy operation to the cell after the pointer +|- +| style="text-align:center"| <code>3</code> +|Decrement the memory cell at the pointer and increment by 1 the cell before the pointer +|- +| style="text-align:center"| <code>4</code> +|Output the character signified by the cell at the pointer using ASCII +|- +| style="text-align:center"| <code>5</code> +|Input a character and store it in the cell at the pointer using ASCII +|- +| style="text-align:center"| <code>6</code> +|Jump past the matching <code>7</code> if the cell at the pointer is 0 +|- +| style="text-align:center"| <code>7</code> +|Jump back to the matching <code>6</code> if the cell at the pointer is nonzero +|- +| style="text-align:center"| <code>8</code> +|Does the crazy operation to the cell at the pointer +|- +| style="text-align:center"| <code>9</code> +|Move the pointer to the left +|} + +Also, here is the crazy operation: + +{| class="wikitable" +!colspan="2" rowspan="2"| +!colspan="3" style="text-align:center"|<code>C%2</code> +|- +! '''<code>0</code>''' +! '''<code>1</code>''' +|- +!rowspan="3"|<code>S%2</code> +! '''<code>0</code>''' +| <code>1</code> +| <code>0</code> +|- +! <code>1</code> +| <code>0</code> +| <code>1</code> +|} +Where S is the '''S'''um of both cell next to the cell at the pointer. + +Where C is the '''C'''ell at the pointer. + +== Examples == + +There are no examples yet, exept the ones in Overview. +So don't expect much in the future. '
New page size (new_size)
3763
Old page size (old_size)
0
Lines added in edit (added_lines)
[ 0 => ''''Sqrt(x)''' may be one of the hardest esolangs.', 1 => '', 2 => '== Introduction ==', 3 => '', 4 => '[[User:Why027|Why027]] made this language on 21th century's Square day, in an attempt to make the hardest esolang.', 5 => 'Sqrt(x) is a Cell-based one-dimensional esoteric programming language.', 6 => '', 7 => 'Why did he try to make it, We do not know.', 8 => '', 9 => '{{infobox proglang', 10 => '|name=brainfuck', 11 => '|paradigms=imperative', 12 => '|author=[[User:Why027|Why027]]', 13 => '|year=[[:Category:2025|2025]]', 14 => '|memsys=[[:Category:Cell-based|Cell-based]]', 15 => '|dimensions=one-dimensional', 16 => '|class=[[:Category:Turing complete|Turing complete]]', 17 => '|influence=[[Brainfuck]] <br>[[Malbolge]]', 18 => '}}', 19 => '', 20 => '== Overview ==', 21 => '', 22 => 'Sqrt(x) operates on an array of memory cells, each initially set to zero.', 23 => 'There is a pointer, initially pointing to the first memory cell.', 24 => 'Also there is a counter of sorts which starts at 0 in the beginning of the line (originally it was the program, but [[User:Why027|Why027]] made it easier).', 25 => 'After each command it increments the counter by 1, but if the counter reaches 10 is resets it back to zero.', 26 => 'A cell has a minimum (0) and a maximum (255)', 27 => 'When it runs a line of code (without halt number) it does this:', 28 => '', 29 => '<code>', 30 => 'Sqrt('''0,4733715204''') ->', 31 => '</code>', 32 => '', 33 => '<code>', 34 => 'c='''0,68802''' ->', 35 => '</code>', 36 => '', 37 => '<code>', 38 => 'ADD_TO(Formatted_code; {c[0]-0*10^('''6'''-(0+1))}) -> ... -> ADD_TO(Formatted_code; {c[5]-0*10^('''6'''-(5+1))}) ->', 39 => '</code>', 40 => '', 41 => '<code>', 42 => 'RUN{Formatted_code; scrambled?=0; shift?=0}', 43 => '</code>', 44 => '', 45 => '', 46 => 'This would be a cat program : <code>0.4733715204</code>', 47 => 'Without the scrambling and shifting : <code>056457</code>', 48 => '', 49 => '', 50 => 'If it hits a non-command it skips it and doesn't increment the counter.', 51 => '', 52 => 'When it compiles the program you made which may look like this:', 53 => '', 54 => '<code>', 55 => '2?3025', 56 => '</code>', 57 => '', 58 => 'Then it takes the square root of the number after the <code>?</code>:', 59 => '', 60 => '<code>', 61 => '2?55', 62 => '</code>', 63 => '', 64 => 'Afterwards it shifts the numbers back:', 65 => '', 66 => '<code>', 67 => '2?54', 68 => '</code>', 69 => '', 70 => 'Which it reads it as halt after command <code>2</code>, do command <code>5</code>, after that do command <code>4</code>. Which is a program which takes in a input then outputs it.', 71 => '', 72 => '', 73 => 'The commands for the unscrambled and non-command shifting version are as followed:', 74 => '', 75 => '{| class="wikitable"', 76 => '!Command', 77 => '!Description', 78 => '|-', 79 => '| style="text-align:center"| <code>0</code>', 80 => '|noop', 81 => '|-', 82 => '| style="text-align:center"| <code>1</code>', 83 => '|Move the pointer to the right', 84 => '|-', 85 => '| style="text-align:center"| <code>2</code>', 86 => '|Increment the memory cell at the pointer and do the crazy operation to the cell after the pointer', 87 => '|-', 88 => '| style="text-align:center"| <code>3</code>', 89 => '|Decrement the memory cell at the pointer and increment by 1 the cell before the pointer', 90 => '|-', 91 => '| style="text-align:center"| <code>4</code>', 92 => '|Output the character signified by the cell at the pointer using ASCII', 93 => '|-', 94 => '| style="text-align:center"| <code>5</code>', 95 => '|Input a character and store it in the cell at the pointer using ASCII', 96 => '|-', 97 => '| style="text-align:center"| <code>6</code>', 98 => '|Jump past the matching <code>7</code> if the cell at the pointer is 0', 99 => '|-', 100 => '| style="text-align:center"| <code>7</code>', 101 => '|Jump back to the matching <code>6</code> if the cell at the pointer is nonzero', 102 => '|-', 103 => '| style="text-align:center"| <code>8</code>', 104 => '|Does the crazy operation to the cell at the pointer', 105 => '|-', 106 => '| style="text-align:center"| <code>9</code>', 107 => '|Move the pointer to the left', 108 => '|}', 109 => '', 110 => 'Also, here is the crazy operation:', 111 => '', 112 => '{| class="wikitable"', 113 => '!colspan="2" rowspan="2"|', 114 => '!colspan="3" style="text-align:center"|<code>C%2</code>', 115 => '|-', 116 => '! '''<code>0</code>'''', 117 => '! '''<code>1</code>'''', 118 => '|-', 119 => '!rowspan="3"|<code>S%2</code>', 120 => '! '''<code>0</code>'''', 121 => '| <code>1</code>', 122 => '| <code>0</code>', 123 => '|-', 124 => '! <code>1</code>', 125 => '| <code>0</code>', 126 => '| <code>1</code>', 127 => '|}', 128 => 'Where S is the '''S'''um of both cell next to the cell at the pointer.', 129 => '', 130 => 'Where C is the '''C'''ell at the pointer.', 131 => '', 132 => '== Examples ==', 133 => '', 134 => 'There are no examples yet, exept the ones in Overview.', 135 => 'So don't expect much in the future.' ]
Unix timestamp of change (timestamp)
'1758824337'