nd easy to prove On top of that essentially you can prove in zero knowledge almost =nything that is 'computable'. What this means is that if we use zk-SNARKS/similar ZKP for our currency =e can enforce arbitrary rules on how the currency is spent ("this coin =s of type X and can only be spent with these f