Martin Lundfall

@MartinLundfall

Digital alchemy at , . Interested in formal verification, category theory, anthropology, music.

Planet Earth
Vrijeme pridruživanja: ožujak 2018.

Tweetovi

Blokirali ste korisnika/cu @MartinLundfall

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

  1. Prikvačeni tweet
    3. svi 2019.

    "Ownership" is a sloppy shorthand for a collection of rights that an agent has to some object. These rights are rarely as broad as "you can do anything you want with it" but invariably includes "you may exclude others from it"

    Prikaži ovu nit
    Poništi
  2. 31. sij

    This promotes Dai and Chai to first class Ethereum tokens. Front end distributed under AGPL at . Feel free to reach out if you are interested in integrating with the api! Made by me, with the support of Lev Livnev. Pixel art by .

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

    Transaction fees are paid for in either Dai or Chai, and processed using the Dai Automated Clearing House contract, deployed here: Api provided at for integrating gas-free conveniences into other dapps:

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

    Introducing 🛎️ A site offering a collection of common Dai and Chai operations, gas-free. You can now: - Transfer Dai or Chai - Sell Dai -> Eth, Chai -> Eth on uniswap - Convert Dai <-> Chai without holding any Ether! Read more at

    Prikaži ovu nit
    Poništi
  5. proslijedio/la je Tweet
    23. sij
    Odgovor korisniku/ci

    Floating points should never warrant the title "number". They don't share qualities fundamental to how numbers work.

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

    More details on the Formal Verification of 2.0 Deposit Smart Contract: The final report is available here:

    Poništi
  7. 21. sij

    Here's the deposit contract in a gif: - white nodes: `zero_hashes` (on chain) - red nodes: `branch` (on chain) - blue nodes: historical data (off chain) - green nodes: computable using red and white Check out the full report from here:

    Prikaži ovu nit
    Poništi
  8. 21. sij

    Here's the final state of our little (height=3) merkle tree, storing only 3 (non-constant) nodes on-chain. In the real deposit contract of height 32, we would of course keep going from here by filling up more subtrees to the right. 2^32 is slightly north of 4.2 billion entries.

    Prikaži ovu nit
    Poništi
  9. 21. sij

    In the process, a number of bugs in both the contract implementation and the vyper compiler was discovered, which are disclosed in the report. These issues were promptly fixed by either the vyper development team, or by rewriting the contract to add extra checks.

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

    This is done in a suite of K specs that formally describes how the contract functions should update storage and what they should return. Here's the claims in human-readable form: These are then proven by symbolically exploring all possible execution paths

    Prikaži ovu nit
    Poništi
  11. 21. sij

    Besides checking that the optimized algorithm matches the "naïve" version (which stores every leaf directly), the main efforts of the verification endeavor dealt with verifying that the vyper generated bytecode actually implements the procedure correctly.

    Prikaži ovu nit
    Poništi
  12. 21. sij

    A`deposit` is a SSZ object consisting of: - the validator public key (hot key) - the hash of a withdrawal key (cold key) - eth amount deposited - a signature for 1-3 SSZ objects are themselves merkle trees. Scientists believe it might actually be merkle trees all the way down 🐢

    Prikaži ovu nit
    Poništi
  13. 21. sij

    Notice that only one red node is added or changed for each entry. For validators putting up a deposit, this means that they only have to pay for one SSTORE. At no point will the contract contain more that 63 storage entries (31 zero hashes + 32 branch nodes).

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

    As deposits are added, only red "branch nodes" are stored on chain, saving most leaves (or any blue node) to be recoverable via an emitted LOG. The first part of the verification shows this optimization to be safe – the root can always be recovered given the red and white nodes:

    Prikaži ovu nit
    Poništi
  15. 21. sij

    Deposits are added from left to right, in an "incremental merkle tree algorithm", which is space and time linear in the tree height. In order to compute the merkle root (or any green node), we only need the red nodes and the zero_hashes (white). After the first deposit, we have:

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

    The contract keeps track of a Merkle tree of height 32, where each leaf can store the credentials of an aspiring eth2 validator and a deposit to use for staking. Initially, the leaves are empty. The nodes at height n are all equal, so we only store one per level: `zero_hashes[n]`

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

    1/ 𝚛 𝚊 𝚍 𝚒 𝚌 𝚕 𝚎 > Towards decentralized code collaboration 🌱 Last April we launched Radicle alpha. After lots of experimentation, user feedback and support [love 💕], we're sharing a bigger update on where we are and where we're going.

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

    In an effort to spread categorical thinking, Statebox is organising a course in March in . Interested? Sign up here ➡️

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

    The machines will betray you. I know because they whisper in my ear.

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

    Chosen-prefix collisions on SHA-1 for $45000

    Poništi
  21. proslijedio/la je Tweet
    2. sij

    People tweet all sorts of things about real numbers, especially when it comes to computation. I've studied the topic for years, and I often disagree with such statements. Let me address just one such statement: "A computer cannot represent all reals, only the computable ones."

    Prikaži ovu nit
    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:

    ·