HaRoLd
HaRoLd
Is a hash function not suitable? It has the same properties you need, proof that the public input `X` matches `E(M)`, and the predicate `P(M)` is true can just be...
There's also: * [8cc](https://github.com/rui314/8cc) which emits x86_64 assembly, is MIT licensed, and supports C11. * [c](https://github.com/andrewchambers/c) by andrew chambers, which emits x86_64 assembly, is BSD 2-clause licensed, and is self-hosting....
What about [The Amsterdam Compiler Kit](http://tack.sourceforge.net/) ? Although LCC is nice for having a relatively small chunk of code which does the 'C compiler' bit - as is 8cc, or...
Ah, there's also this - https://github.com/rswier/swieros/blob/master/root/bin/c.c But, it emits opcodes directly rather than going through an assembler.
I'm thinking of refactoring the `libff` subroutines to use ADCX/ADOX/MULX (with load buffering, then interleaving), via a compile-time flag like `HAVE_ADCX`. I need some time and to complete some things...
> It's not a full TrueBit game in the sense that the challenger does not interact with the claimer: either there's a forced onchain verification or there isn't, and the...
It's not difficult to do splitting or joining with zkSNARKs, and the number of constraints for a binary adder with carry etc. is trivial in comparison to even one round...
Why not use Whisper? If the contract is modified so the destination address is specified by the coin owner and is unchangeable by whoever submits the transaction, and specifies the...
But, if Whisper provides the anonymity layer, why would zkSNARKs be needed?
> swarm (n nodes trying to execute at the asme block) the execution (especially given 15s blocks) making them (in theory) 1/n times profitable. Hi, I was thinking about a...