Alex Skidanov

@AlexSkidanov

Co-founder , a team of early MemSQL engineers and ex-Googlers building a sharded blockchain with an emphasis on usability.

Vrijeme pridruživanja: kolovoz 2018.

Tweetovi

Blokirali ste korisnika/cu @AlexSkidanov

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

  1. Prikvačeni tweet
    31. pro 2019.

    1/ In the last crypto paper of this decade* we present a new construction called Doomslug that allows finalizing blocks for most practical purposes in a single round of communication, while still getting full BFT finality after two rounds of communication

    Prikaži ovu nit
    Poništi
  2. proslijedio/la je Tweet
    17. sij

    First community update of 2020! Check out the changes we made to the newsletter and how you can get involved 👀

    Poništi
  3. proslijedio/la je Tweet
    15. sij

    Have questions about sharding? covers them in this sharding jam session with and . Catch it here:

    Poništi
  4. proslijedio/la je Tweet
    14. sij

    NEAR Protocol transactions NEAR went through a few iterations of transaction design before settled on the current implementation. Thread 👇

    Prikaži ovu nit
    Poništi
  5. 14. sij

    Surprising news from Chromium: is working on a set of proposals to effectively eliminate third-party cookies. The plan is to remove them from Chrome within two years. Though in my ideal world in two years Open Web will already be taking over 🤔

    Poništi
  6. proslijedio/la je Tweet
    10. sij

    What will a decentralized network that creates stable currencies available to anyone with a mobile phone look like? Tune in to Ep. 32 of ’s with to hear from , & .📹:

    Poništi
  7. proslijedio/la je Tweet
    9. sij

    Sharded cross-contract composability at NEAR protocol. Before I can explain it, I need to give a lot of background on sharding design at NEAR. Thread 👇

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

    NEAR Protocol Usability Summary: - Account Names instead of hashes of public keys. - There can be multiple Access Keys per account. - Function call limited access key. Thread 👇

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

    🔥🔥 Panel from . Cross-app communication panel moderated by , with from , from , from and Alistair Stewart from .

    Poništi
  10. proslijedio/la je Tweet
    31. pro 2019.

    1/ In the last crypto paper of this decade* we present a new construction called Doomslug that allows finalizing blocks for most practical purposes in a single round of communication, while still getting full BFT finality after two rounds of communication

    Prikaži ovu nit
    Poništi
  11. 31. pro 2019.

    7/ Doomslug describes the block production used in . If you haven't heard about before, it's an open source sharded blockchain protocol. Check out our sharding design and find more here: .

    Prikaži ovu nit
    Poništi
  12. 31. pro 2019.

    6/ And since each fork in Doomslug implies someone is slashed, there could only be a finite number of forks.

    Prikaži ovu nit
    Poništi
  13. 31. pro 2019.

    5/ Interestingly, using Doomslug as the underlying fork choice rule likely makes most of other finality gadgets, such as Casper FFG, also have provable liveness (CC ). The argument is that most finality gadget are live for as long as there are no forks.

    Prikaži ovu nit
    Poništi
  14. 31. pro 2019.

    4/ Both the Doomslug itself, and the accompanying BFT finality gadget have provable liveness under partially synchronous network.

    Prikaži ovu nit
    Poništi
  15. 31. pro 2019.

    4/ For such use-cases Doomslug reduces latency by 2x (assuming that finality is the bottleneck). For the use cases for which BFT finality is required, it is still achieved after the second round of communication, thus the construction is no worse than PBFT or Tendermint.

    Prikaži ovu nit
    Poništi
  16. 31. pro 2019.

    3/ The specific definition of doomslug finality is that a block finalized by Doomslug is irreversible after one round of communication unless at least one block producer gets slashed. For most practical use cases this is more than sufficient.

    Prikaži ovu nit
    Poništi
  17. 31. pro 2019.

    2/ More importantly, Doomslug only requires 50% honest and online participants, thus even if more than 1/3, but less than 1/2, of block producers go offline, Doomslug will continue finalizing blocks (of course without reaching BFT finality on any of them).

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

    You asked, and we listened. 📹 In episode #07 of NEAR Lunch and Learn, gives an overview of Finality Gadget, safety proof and implementation details. Watch this special episode here:

    Poništi
  19. proslijedio/la je Tweet
    27. pro 2019.

    Projects building on discussing early days in a blockchain space: Would be awesome to have 10x of successful projects in 2020 :)

    Poništi
  20. 20. pro 2019.

    When does this decade end?

    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:

    ·