You can do general purpose programming in all kinds of DSLs and Rust libraries that compiles down to big-but-practical arithmetic circuits and then generate proofs that y=f(x) without revealing x for arbitrary f. That really wasn't possible until a few years ago and emerged almost exclusively within the sphere of cryptocurrency-adjacent research. You can also use the succinctness of SNARKs to batch these proofs and shrink the verifier costs to almost nothing

It's a cool model for asymmetric computing, with low capacity verifiers collecting results from high capacity provers. It'll probably find uses outside deranged gambling...