Preethi Kasireddy

medium.com/@preethikasireddy · Personal blog · on HN since 2017

Preethi Kasireddy, a software engineer and founder, writes about how Ethereum and blockchains work and about startup fundraising.

What HN saysHN commenters recommend her Ethereum explainer and cite it when weighing the engineering feasibility of Ethereum's blockchain.
16HN people shared it
3linked it in comments
14stories submitted
255story points
7 years agolast shared
2017people per year2026

Most-shared posts

  1. 1
    How does Ethereum work, anyway?
    8 people · 21 points · first shared 2017 · 1 comments on HN
  2. 2
    Fundamental challenges with public blockchains
    4 people · 11 points · first shared 2017 · 1 comments on HN
  3. 3
  4. 4
    Why I’m leaving Silicon Valley
    1 people · 41 points · first shared 2017 · 34 comments on HN
  5. 5
  6. 6
  7. 7

What HN people wrote when they linked it

DINKDINK · 2018-10-20
Before investing time in learning how to program on ethereum, one should first assess the engineering feasibility of it's blockchain: https://medium.com/@preethikasireddy/how-does-ethereum-work-anyway-22d… Take a look at their github and how the overwhelming majority of users can't run a full node (If you can't run a full node, you rely on an intermediary, you are not decentralized). I'm not sure if the "marketing team behind a decentralized project" is still doing it but they used to be continuing to market ethereum as an immutable blockchain which is patently false due to their roll back of the DAO.
rwieruch · 2017-10-04
Checkout what https://twitter.com/iam_preethi is tweeting about these topics. Really liked her last article about Etherum: https://medium.com/@preethikasireddy/how-does-ethereum-work-anyway-22d…
Tepix · 2018-01-16
I suggest your read this: https://medium.com/@preethikasireddy/how-does-ethereum-work-anyway-22d… Quote: But unless a node needs to execute every transaction or easily query historical data, there’s really no need to store the entire chain. This is where the concept of a light node comes in. Instead of downloading and storing the full chain and executing all of the transactions, light nodes download only the chain of headers, from the genesis block to the current head, without executing any transactions or retrieving any associated state. Because light nodes have access to block headers, which contain hashes of three tries, they can still easily generate and receive verifiable answers about transactions, events, balances, etc. The reason this works is because hashes in the Merkle tree propagate upward — if a malicious user attempts to swap a fake transaction into the bottom of a Merkle tree, this change will cause a change in the hash of the node above, which will change the hash of the node above that, and so on, until it eventually changes the root of the tree.

Keyboard shortcuts

/Search
j kNext / previous blog
EnterOpen selected blog
vVisit the blog site
fFollow / unfollow
lSwitch grid / list view
dSwitch dark mode
g hHome
g pTop posts
g tTopics
g fFollowing
g lLiked
g yHistory
g qFAQ
EscBack / close