New XKCD Forums

This is a revival of a old Googological game on the old XKCD forums
The Rules are
1: The goal is to make a computable, finite, well-defined number that's bigger than the last poster's number
2: You can only use already established numbers and notations (the xkcd number counts, as does Graham's number. But you can't just one-up that by saying g_65 without defining the recursion here)
3: You can't refer directly to the previous number. (If I post a description D of some number x, your number can't be defined as D "+ 1". If it turns out to be D+1, fine. Just don't do anything like quoting the previous entry and putting +1 at the bottom.)
4: If someone questions the size of your number, you have to be able to prove that it's really bigger than the previous one.

I start off with the number 1000001 Because A: that's Frieza's minimum power level in his 2nd form and B: It's over 9000

I have some big numbers in waiting, but for now, 2^128

My response is E[2]1#128 in Sbiis Saibian's Hyper-E Notation

dude give it some time.

6^^126

3 + 3 = 7
3++ 3 = 3+3+3 =9
3+++3 = 3++3++3 = 3++9 = 27
3++++3 = 3+++3+++3 = 3+++27 = 3^27
3->4 = 3++++3
3->4->2 = number of pluses equal to 3++++3
3->4->64 = number of pluses equal to ( number of pluses equal to (number of pluses equal to..(64 times)(3++++3))

I'll respond with {10,10,10,10} in BEAF

I respond with {10,10(10)10} In BEAF