In this talk I will review several recent results that (I think) will help shape future development of practical MPC (secure multiparty computation) and ZK (zero-knowledge proofs). Namely, I will talk about Stacked Garbling, a new technique allowing to evaluate garbled circuits (GC) conditionals roughly at the cost of a single branch, rather than of all branches as previously widely believed. Combined with more efficient RAM, which I will also briefly review, this facilitates transition of MPC and ZK from circuit to RAM-machine evaluation. I will also briefly discuss applications of MPC and ZK to ML and health.