This might work something like phv3773's idea, this probably works far too slowly for what you want, but maybe it's a decent idea. First as an example, consider calculating the product of two irrationals. We might use lower and upper approximations here. If we use lower approximations l1, l2, and upper approximations u1, u2 to irrationals 1 and 2, we have [l1, u1]*[l2, u2]=[min{l1*l2, l1*u2, u1*l2, u1*u2}, max{l1*l2, l1*u2, u1*l2, u1*u2}] where "*" on the left of the "=" denotes interval number multiplication, and * on the right of the "=" denotes real-number multiplication. We have max{l1*l2, l1*u2, u1*l2, u1*u2} - min{l1*l2, l1*u2, u1*l2, u1*u2} less than or equal to some nonnegative n. Now 1 decimal place corresponds to n ending up less than or equal to .1, 2 decimal places to n ending up less than or equal to .01, and so on. So, for k decimal place precision we just need to find l1, l2, u1, u2 such that n is less than or equal to 10^(-k). You don't need to know what the irrationals are exactly, you just need to know that the irrationals lie between some rational numbers.
Now, interval exponentiation, like other interval arithmetic operations, if we can do such (if it "exists"), will yield an interval of numbers [a, b]. So, for k decimal place precision we just need n=b-a less than or equal to 10^(-k).
Unfortunately, I don't know how to do interval exponentiation. So, maybe it comes as a better idea to figure out how it works on the reals before trying this approach.