4.6 KiB
| title | tags |
|---|---|
| think-writing |
12/12
https://doi.org/10.1109/DTPI52967.2021.9540069 Parallel Governance for Decentralized Autonomous Organizations enabled by Blockchain and Smart Contracts
trying to call a function of a smart contract. I suspect its not working because the function signature hash is wrong
13/12
Battled the smart contract all day yesterday. Might take a break from that and try to do something else
who generates the keys for a new node?
what if a node removes itself
Implemented a test to remove a node.
What about forking. do you remove a group of nodes?
https://eprints.soton.ac.uk/415083 https://arxiv.org/abs/1910.08547 https://scholar.archive.org/work/uf7vmdzi7na5dazrh2jlhvuhr4/access/wayback/https://www.persistent.com/wp-content/uploads/2017/04/WP-Understanding-Blockchain-Consensus-Models.pdf?pdf=Understanding-Blockchain-Consensus-Models https://ieeexplore.ieee.org/abstract/document/9947249/
Hyperledger consensus algorithm: https://doi.org/10.48550/arXiv.1809.00554
14/12
https://arxiv.org/abs/2102.10006 An Overview of Forks and Coordination in Blockchain Development
15/12
https://www.holochain.org holochain https://blockchaingov.eu focused more on the legal side of things and the sociological issues.
Holochain is interesting. Framework for peer for peer apps. Apps built on holochain connect users devices directly in a p2p network. Data created by each user is digitally signed and stored in their device. The apps defines rules about what valid data looks like. The network of peers makes up the entire Distributed Hash Table (DHT), where each peer has a small, random 'shard' of the DHT.
How does the blockchain work? How does it achieve consensus? Is it BFT?
How could we use this for veracity? We could make a holochain app.
https://doi.org/10.1016/j.icte.2020.09.002 https://doi.org/10.1016/j.techfore.2020.120465
www.kaleido.io: blockchain as a service
meeting
- removing participant
- security risks (whats stopping them from rejoining)
- remove permanently vs temporarily
- skeptical of decentralised storage:
- less protections
- tradeoff availablility vs confidentiality
- maybe dig into holochain "data rules" used for validation
I need to have a more skeptical mindset.
Why cant we use blockchain as a service (blockstream, kaleido, alchemy, aws, IBM). Is it up to me to look into this and decide if we can rule it out?
https://doi.org/10.1016/j.icte.2020.09.002 Permissioned blockchain frameworks in the industry: A comparison
Quorum: developed by jp morgan for finance applications. It is a fork of go-ethereum. Add the ability to have private contracts and transactions which are only visible/viewable by participants specifies in the transaction.
R3 Corda: open source permissioned platform. Follow know your customer principle. each node must prove identity. verified by the doorman node. Network is made up of one or many notary nodes which validate the uniqueness and sequencing of transactions without global broadcasting. two types of consensus: validity and sequencing,
19/12
Still dont understand fabric vs iroha.
https://hyperledger-fabric.readthedocs.io/en/release-2.5/whatis.html
For business use cases:
- Participants must be identified/identifiable
- Networks need to be permissioned
- High transaction throughput performance
- Low latency of transaction confirmation
- Privacy and confidentiality of transactions and data pertaining to business transactions
Fabric has pluggable consensus algorithms: iroha has only YAC
I started reading the bitcoin paper again. In bitcoin they are able to save space by storing hashes of transactions in a merkle tree and stubbing off branches. In Ethereum and other chains with smart contracts and storage, how to they prevent the chain from taking up a lot of space? I also thought that blockchain can act basically as a database and you are able to go back and look at data stored "on-chain". Where is this data stored? I'll have to read up about Ethereum again but I suspect the chain must use more storage space, or maybe they clean up old smart contracts? How would that even work?
In etherum each block hold the entire state of the chain. The state is stored in a tree structure. And for each block only a small part of the tree needs to be changed. So the data can be stored once, and referenced twice using pointers. This is done using a "patricia tree". Patricia trees are similar to merkle trees but the allow insertion and deletion of nodes. Also since the entire state is stored on each chain there is no need to store the entire blokchain history.
So,