Ben Fisch

@benafisch

PhD Student in Cryptography at Stanford, Chief Scientist

Stanford, CA
Vrijeme pridruživanja: siječanj 2018.

Tweetovi

Blokirali ste korisnika/cu @benafisch

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @benafisch

  1. 8. sij

    Thank you Michael! I am very happy that you found it useful.

    Poništi
  2. proslijedio/la je Tweet
    1. pro 2019.

    Check out the new version of our class groups library with () : - Polynomial commitment - VDF - Linearly homomorphic encryption scheme - PoE hall of famers 💕: Fabien Laguillaumie, Guilhem Castagnos, Ida Tucker, ,

    Poništi
  3. 19. stu 2019.

    My talk on Transparent SNARKs from DARK compilers (Supersonic) at ZK Summit. Thanks again to for organizing.

    Poništi
  4. proslijedio/la je Tweet

    🔉Finally we dig into VDFs! , Assistant Prof at NYU + co-author of the VDF paper, joins us to share what VDFs are, how they can be used &more! cc: - a good follow-up to the Randomness ep with !

    Poništi
  5. proslijedio/la je Tweet
    8. stu 2019.
    Odgovor korisnicima

    all these constructions rely on what's called a polynomial commitment scheme. If you plug in a PCS without a trusted setup e.g. from recent work, proofs goes up to 7-8kb, and you don't need a trusted setup

    Poništi
  6. proslijedio/la je Tweet

    インドの友達もできた!ブロックチェーンコミュニティなら、インド国内僕からほぼ全部繋がれるよ!と言ってくれて嬉しい。インドは中国のアナウンスの後にとても政府が前向きになったと聞いてそれも面白い!!中国のインパクトは国内だけでなく国外まで派生してる。

    Poništi
  7. proslijedio/la je Tweet
    25. lis 2019.

    This Week in Blockchain Research Issue #31 is out 🔥 featuring Also we have a new section for past conferences' videos featuring

    Prikaži ovu nit
    Poništi
  8. 25. lis 2019.

    A single Halo proof for a statement of size n requires O(n) time to verify; k proofs can be checked in O( n + k log n) given a small helper proof. And lastly I can prove I verified k proofs by giving you a proof of size O(log (k+n)) which still requires O(n +klog n) to check.

    Prikaži ovu nit
    Poništi
  9. 21. lis 2019.
    Prikaži ovu nit
    Poništi
  10. 21. lis 2019.

    Key new ingredient is a trustless polynomial commitment scheme built with class groups, plugged into the IOP protocols of beautiful recent works Sonic, Plonk, Marlin

    Prikaži ovu nit
    Poništi
  11. 21. lis 2019.

    A trustless zk-SNARK that finally might be practical for public blockchains. It brings the proof size and verification time down by about 70x from what was previously possible for complex statements (such as those required for making a trustless ZCash).

    Prikaži ovu nit
    Poništi
  12. 11. ruj 2019.

    Yes! Supersonic is finally a trustless snark with log n size proofs and log n time verification for arbitrary statements. Bulletproofs was log n size, but with linear (inefficient) verification.

    Poništi
  13. 11. ruj 2019.

    Also excited about ’s Halo trustless proof amortization and recursive composition!

    Prikaži ovu nit
    Poništi
  14. 11. ruj 2019.

    Thanks ! Just announced Supersonic at end of my survey, new trustless SNARK with logarithmic size proofs and verification. Applying new trustless polynomial commitments to Sonic. Stay tuned for details in the coming days and ‘s talk at Starkware Sessions.

    Prikaži ovu nit
    Poništi
  15. 10. ruj 2019.

    There will be a video recording if you missed it!

    Poništi
  16. 10. ruj 2019.

    It was a pleasure to sit on this panel and share ‘s privacy approach, together with from and from , great discussion on blockchain and DeFi privacy! Thanks to for monitoring and organizing D&DD

    Poništi
  17. 18. pro 2018.
    Poništi
  18. proslijedio/la je Tweet
    13. pro 2018.

    on the separation of consensus and state. Keynote at Xi’an blockchain workshop.

    Poništi
  19. proslijedio/la je Tweet
    1. kol 2018.

    Tight Proofs of Space and Replication: B Fisch

    Poništi
  20. 30. srp 2018.
    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·