Largest Error Message in 100 bytes [duplicate]

Question

The goal is to raise the error message with the most bytes! The error message may not be generated by the program itself, such as Python's raise. errors that do not terminate the program are not allowed unless they do not show an error message.

Here is an example in python that raises 243041 bytes of error code:

def a(m):
    try:-''
    except:
        if m>0:
            a(m-1)
        else:-''
a(900)

you can try it here.

Answer 1

Python 3, \$\approx\$A(A(A(9,9),A(9,9)),A(A(9,9),A(99,99))) where A is the Ackermann function,or limited by RAM

A=lambda m,n:m and A(m-1,n<1or A(m,n-1))or-~n
a='.'*(A(A(A(9,9),A(9,9)),A(A(9,9),A(99,99))))
exec(a)

Don't try it online!

Stole the Ackermann function from here.

More manageable version to demonstrate:

A=lambda m,n:m and A(m-1,n<1or A(m,n-1))or-~n
a='.'*(9999)
exec(a)

Try it online!

Admittedly I'm not certain this approach is arbitrarily extendible in practice.

Answer 2

Jelly, a huge number \$ + 1605\$ bytes

ȷ!!!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡!¡”.xŒV

Try it online!

More specifically, this outputs an error message which is 1605 bytes long, plus two occurrences of massive chains of .... Unsurprisingly, this does not actually show an error really no matter where you run it, but in theory it will

I'm not entirely sure just how large this number is, aside from being significantly larger than \$1000!_{1000!_{(1000!)!}}\$, where \$n!_k\$ represents applying \$!\$ to \$n\$ \$k\$ times e.g. \$3!_3 = ((3!)!)! = (6!)! = 720! = 2.6 \times 10^{1746}\$

Answer 3

APL (Dyalog Unicode), limited only by available memory

Full program. Causes error message a bit bigger than twice the given number.

⍎2e6⍴⎕A

Try it online!

⎕A the uppercase Alphabet

2e6⍴ cyclically reshape to a string with two million characters

⍎ execute

This causes an error of the form:

VALUE ERROR: Undefined name: string
      string
      ∧

Answer 4

Java 11, repeat error message [2³¹ - 1] times

String's Maximum length in Java is Integer.MAX_VALUE i.e. == 2³¹ - 1, or less, it depends on server max memory size and other conditions otherwise it produces OutOfMemoryError.

1. You can throw some Error with the certain message, for example:

   throw new Error("fatal".repeat(Integer.MAX_VALUE/5));
   

   Number of times to repeat is Integer.MAX_VALUE / 5 - because "fatal" is 5 chars.

2. You can return something like this. It is not the error itself, but the error message:

   for(int i=0;i<Integer.MAX_VALUE;i++){
       String m="fatal"+i;
       out.println(m.repeat(Integer.MAX_VALUE/m.length()-1));
   }
   

Answer 5

Zsh, \$4\times(9\times10^{307})^{32}+47\$ bytes

alias r=repeat\ 9e307
r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r a+=1111
let $a

Try it online!

Generates a string containing \$4\times(9\times10^{307})^{32}\$ ones, then tries to evaluate it as an integer.

In practice you will obviously run into memory limitations. Here is a more manageable version:

repeat 9e1 repeat 9e1 a+=1
let $a

• alias r=repeat\ 9e307 allows us to nest more repeats in the 100 bytes we have
• 9e307 (\$9\times10^{307}\$) is the largest compact finite floating-point number zsh might be able to count to