We need to prove that we redeemed an output, without revealing which output was redeemed and a redeem transaction would look like a coinbase.
The redeem transaction destroys one of the anonymous outputs but it is not possible to know which one was destroyed.
It won't be possible to use the same output twice, as it would require a secret key which becomes known to everyone when the output is redeemed.
The zk-proof proves the secret key is linked to an output in the set, but only the redeemer knows which one. -SDCDev
No one on the shadow thread posted this. I gave them plenty of opportunity. It's an insufficient description, but a lot better than I got on the shadow thread. It looks like the idea is to use zk-proofs to circumvent public key cryptography. I'll find out if this is something that has shown up in the literature as the theory should be in place before the application. If the shadow dev had a citation to this effect somewhere on the OP, then we might be talking.
or you could just wait about 15 days when ZK is implemented in shadow Thus leaving your tech that wont be out till November outdated and obsolete... but its ok when ZK is opensourced Hondo can copy and paste that
They can copy and paste any open source code they want as long as credit and copyrights are given, which they have done so far.