Tweetovi

Blokirali ste korisnika/cu @drakefjustin

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

  1. 3. velj

    The next /r/ethereum Eth2 AMA starts Feb 5 at 1pm UTC. Collated questions and answers from the two previous AMAs (6 and 12 months ago) courtesy of EthHub

    Poništi
  2. 17. sij

    Here's the trick. Let G be a group of unknown order, e.g. an RSA group with an unknown factorisation modulus. Let g in G and x an integer exponent. The prover claims h=g^x. The verifier sends a random prime p. The prover sends g^{x//p}. The verifier checks h=g^{x//p}^p*g^{x%p}.

    Prikaži ovu nit
    Poništi
  3. 17. sij

    This year the Stanford Blockchain Conference has a session dedicated to groups of unknown order. A super simple trick—the Wesolowski trick developed for VDFs—is unleashing a mini cryptographic revolution (for VDFs, accumulators, SNARKs) and the rebirth of RSA.

    Prikaži ovu nit
    Poništi
  4. 16. sij

    👇three 1-hour zero-knowledge study clubs on polynomial commitments hosted by part 1— part 2— part 3—

    Poništi
  5. 10. sij

    The basic idea is simple. Every validator commits to a secret and all the commitments are placed in a list. Using simple exponentiation (plus ZKP or fraud proof) every beacon proposer privately shuffles the list. Onchain randomness is then used to sample from the list.

    Prikaži ovu nit
    Poništi
  6. 10. sij

    Single Secret Leader Election (SSLE) strengthens Eth2 proposers and committees against network-level DoS (and other adaptive attacks). We're seriously considering the "DDH and Shuffling" construction in section 6 of

    Prikaži ovu nit
    Poništi
  7. proslijedio/la je Tweet
    9. sij

    New RSA assumptions are needed for VDFs. Ethereum Foundation supports analysis of them with a number of bounties.

    Poništi
  8. 8. sij

    Ben wrote a fantastically accessible resource on BLS12-381. Thank you :)

    Poništi
  9. 17. pro 2019.

    Eth2 phase 0 should launch after a multi-client testnet with X clients has been stable (no reboot or downtime) for Y months.

    Poništi
  10. 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
  11. 8. stu 2019.

    SLONK is a conceptually simple universal SNARK with the smallest known proof size (~0.5kB) and verification time. Concrete prover time for practical circuits still unknown but promising thanks to good constants.

    Poništi
  12. 31. lis 2019.

    $100K prize pool for accelerating repeated 1024-bit modular squaring on an AWS F1 FPGA. Winner gets $5K per nanosecond shaved over the baseline (28.6ns per square). This helps for RSA VDFs, RSA accumulators, and RSA SNARKs.

    Poništi
  13. 26. lis 2019.

    Did my part of the Aztec ceremony with the slowest machine so far 😅 10 ETH bounty (valid 5 years) for first person to compromise my randomness.

    Poništi
  14. 24. lis 2019.

    "Eth3—quantum security" talk online shortly after Google's quantum supremacy claims :)

    Poništi
  15. 21. lis 2019.

    ePrint papers () with "blockchain" in title: 2013—0/882 (0%) 2014—1/1029 (0.1%) 2015—4/1257 (0.3%) 2016—14/1196 (1.2%) 2017—23/1262 (1.8%) 2018—39/1251 (3.1%) 2019—41/1234 (3.3%)

    Poništi
  16. proslijedio/la je Tweet
    21. lis 2019.

    New paper with and : Supersonic a true SNARK (<8KB, ~75ms verif.) without trusted setup. It uses a new polynomial commitment in groups of unknown order called DARK. We can compile polynomial IOPs such as Sonic/Marlin/Plonk to SNARKs

    Poništi
  17. 10. lis 2019.
    Poništi
  18. 18. ruj 2019.
    Prikaži ovu nit
    Poništi
  19. 15. ruj 2019.
    Prikaži ovu nit
    Poništi
  20. 11. ruj 2019.

    Three flavours of universal SNARKs: * powers of Tau (Sonic, PLONK) * RSA or class group (Supersonic) * FRI-based (e.g. StarkWare STARKs) Add Halo and this may be the beginning of the end for non-universal schemes such as Groth16.

    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:

    ·