Definitely. And, the founder of Zama says there are new chips which will optimize these types of calculations and make them more mainstream.

For the record, no clue how true that assertion is, but seems like now that the calculations are possible, Moore's law will solve that problem one way or another.

FHE is going to make things interesting and it seems like it is only a matter of time before they are workable on existing blockchains.

Plus, these types of calculations are not susceptible to side-chain attacks, since no private keys are used in the calculations.

FHE computations are hundreds of thousands of times slower than non-encrypted computations, and are non-parallelizable, and Moore's law is long since dead for single-core performance.

I didn't know that. I'm interested in understanding why they aren't parallelizable? I'm surprised that is the case. It's a good point you make, and makes me wonder whether a combination of zk proofs where the inputs to the zk proof are the encrypted inputs of the FHE conjuration. If so, that could be used against a verifier to move the computation off chain. Seems like a complicated circuit you would need to make but if you could do it, you wouldn't need to worry about the computational cost on chain. Thanks for that information, very thought provoking.

> new chips which will optimize these types of calculations and make them more mainstream.

There are quite a few people working on this problem from both the hardware and software side of things. Source: I've talked to a large number of them. It is still early days, but given the level of interest out there to do this, I believe strongly that it will happen.