Beta Key Puzzle

Part 2 is easy with an online listing of primes + Python. Part 3 is just a fancy way of saying "take the last nine digits of x1 and write them in the appropriate slots". So all we need are the a[i].

I have no clue what that smiley thing meant at all. But the listing looks like words spelled out. And there aren't many unique letters there. So its a substitution cipher.

I notice right away that the word "hundred" fits in the last clue. OK. But why should I manually do this? Just plug the text into Decrypto and I get "ONE ONE TWO TEN TWENTY SEVEN TWO HUNDRED FIFTY FOUR", meaning we have
a = [1,1,2,10,27,254]

You see the first part of the spoiler then decrypts to "?ART ONE", obviously as a check. But that smiley man....
Now the rest is fairly simple.

a = [1,1,2,10,27,254]
b = [sum(a[:i+1]) for i in range(len(a))] #because we need the partial sums
p = [prim[i-1] for i in b] #0-indexing versus 1-indexing
x1 = reduce(lambda a,b:a*b,p,1) #multiply all elements of p together
x1 is then 624888642