Tweetovi

Blokirali ste korisnika/cu @swasilyev

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

  1. proslijedio/la je Tweet
    26. pro 2019.

    hackmd is such a dream to write mathy blog posts; here's one I've just writting about Cheon's Discrete log attack, very relevant to zk-SNARKs

    Prikaži ovu nit
    Poništi
  2. proslijedio/la je Tweet
    20. pro 2019.

    We were able to get the recursion threshold for Halo to below 2^17 mul gates, and the proofs are only 3.6 kB long! Proving time on my desktop is less than 15 seconds and verifying time is less than a second. We'll be updating our paper with a better formalization of the protocol.

    Poništi
  3. proslijedio/la je Tweet
    18. pro 2019.

    Today's fun little discovery: a single-page website entirely devoted to addition chains! Roughly half of the page is a comprehensive bibliography.

    Poništi
  4. 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
  5. proslijedio/la je Tweet
    4. pro 2019.

    RedShift: Transparent SNARKs from List Polynomial Commitment IOPs: A Kattis, K Panarin, A Vlasov

    Poništi
  6. proslijedio/la je Tweet

    We used HoneyBadgerMPC to implement the distributed "Proof of Custody" based on Legendre PRF! See details in our ethresearch post

    Poništi
  7. proslijedio/la je Tweet
    22. stu 2019.

    Just published 0.1 of the bls12_381 Rust crate. Aims to be a lightweight, no_std compatible implementation of BLS12-381, with nearly everything constant time, and performance comparable with other high speed implementations... without any `unsafe` code.

    Poništi
  8. proslijedio/la je Tweet
    23. stu 2019.

    Amazing compendium of failures of "provable security": . I saw a preprint months ago and the shock value of the huge lists still hasn't worn off. I think (and hope) this will put an end to the delusion that provable-security failures are isolated mistakes.

    Poništi
  9. proslijedio/la je Tweet
    1. velj 2019.

    Starks in 30 minutes (work in progress)

    Poništi
  10. proslijedio/la je Tweet
    6. ožu 2019.

    PR for generic elliptic curve linear combinations, hoping to get this in the next hardfork. It solves a very large class of problems. I'm excited by the support from great minds at et al.

    Poništi
  11. proslijedio/la je Tweet
    5. ožu 2019.

    [New] TEX - A Securely Scalable Trustless Exchange (Rami Khalil and Arthur Gervais and Guillaume Felley)

    Poništi
  12. proslijedio/la je Tweet
    31. sij 2019.

    I'm happy to announce Sonic, a new zero-knowledge SNARK developed in collaboration with Mary Maller, Markulf Kohlweiss and Sarah Meiklejohn.

    Prikaži ovu nit
    Poništi
  13. proslijedio/la je Tweet

    Satoshi on August 11, 2010 “If a solution (of ZKP) was found, a much better, easier, more convenient implementation of Bitcoin would be possible” And ’s new accumulator gonna be a big deal

    Poništi
  14. proslijedio/la je Tweet
    28. sij 2019.

    On Friday we released the Confidential Token Standard, backed by the AZTEC cryptography engine. This is the equivalent of the ERC20 token standard but in zero knowledge. 🎉

    Poništi
  15. proslijedio/la je Tweet
    28. sij 2019.

    Интервью со мной о криптографии и zero knowledge, спасибо за приглашение

    Poništi
  16. proslijedio/la je Tweet
    9. sij 2019.

    5 mathematicians working on machine learning have found an interesting question whose answer is "yes" if we assume there are *at most finitely many* cardinals of size between the cardinality of the integers and that of the reals, and *no* otherwise.

    Prikaži ovu nit
    Poništi
  17. proslijedio/la je Tweet
    23. pro 2018.

    Brief history of Confidential Transactions: "Bitcoins with homomorphic value" — Adam Back, Oct 2013 "Confidential transactions" — Greg Maxwell, Jun 2015 Interview about CT, Sep 2015:

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

    My Devcon 4 talk about Snark/Stark friendly functions is online

    Poništi
  19. proslijedio/la je Tweet
    9. pro 2018.

    I'm happy to announce a new open source project: , a library for bandwidth-efficient set reconciliation. This is joint work with Greg Maxwell, Gleb Naumenko, and other contributors.

    Prikaži ovu nit
    Poništi
  20. proslijedio/la je Tweet
    11. pro 2018.

    New paper on batching techniques for accumulators. Applications to stateless blockchains (miners only need 2kb digest to store the entire UTXOs) and shorter STARKs/Aurora. Also new succinct proofs for groups of unknown order: Joint work: & Dabo

    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:

    ·