Build Your Own Blockchain: A Python Tutorial – @Ecomunsing

Build Your Own Blockchain: A Python Tutorial - @Ecomunsing

Download the total Jupyter/iPython notebook from Github here

This tutorial will walk you through the basics of how to build a blockchain from scrape. Focusing on the details of a concrete example will provide a deeper understanding of the strengths and limitations of blockchains. For a higher-level overview, I’d recommend this excellent article from BitsOnBlocks.

Transactions, Validation, and updating system state¶,

At its core, a blockchain is a distributed database with a set of rules for verifying fresh additions to the database. Wij’ll begin off by tracking the accounts of two imaginary people: Alice and Bob, who will trade virtual money with each other.

Wij’ll need to create a transaction pool of incoming transactions, validate those transactions, and make them into a block.

Wij’ll be using a hash function to create a ‘fingerprint’ for each of our transactions- this hash function linksaf each of our blocks to each other. To make this lighter to use, wij’ll define a helper function to wrap the python hash function that wij’re using.

Next, wij want to create a function to generate exchanges inbetween Alice and Bob. Wij’ll indicate withdrawals with negative numbers, and deposits with positive numbers. Wij’ll construct our transactions to always be inbetween the two users of our system, and make sure that the deposit is the same magnitude spil the withdrawal- i.e. that wij’re neither creating strafgevangenis demolishing money.

Now let’s create a large set of transactions, then chunk them into blocks.

Next step: making our very own blocks! Wij’ll take the very first k transactions from the transaction buffer, and turn them into a block. Before wij do that, wij need to define a method for checking the valididty of the transactions wij’ve pulled into the block.

For bitcoin, the validation function checks that the input values are valid unspent transaction outputs (UTXOs), that the outputs of the transaction are no greater than the input, and that the keys used for the signatures are valid. Te Ethereum, the validation function checks that the brainy contracts were faithfully executed and respect gas thresholds.

No worries, though- wij don’t have to build a system that complicated. Wij’ll define our own, very ordinary set of rules which make sense for a basic token system:

  • The sum of deposits and withdrawals voorwaarde be 0 (tokens are neither created strafgevangenis demolished)
  • A user’s account vereiste have sufficient funds to voorkant any withdrawals

If either of thesis conditions are violated, wij’ll reject the transaction.

Here are a set of sample transactions, some of which are fraudulent- but wij can now check their validity!

Each block contains a batch of transactions, a reference to the hash of the previous block (if block number is greater than 1), and a hash of its contents and the header

Building the Blockchain: From Transactions to Blocks¶,

Wij’re ready to embark making our blockchain! Right now, there’s nothing on the blockchain, but wij can get things embarked by defining the ‘genesis block’ (the very first block te the system). Because the genesis block isn’t linked to any prior block, it gets treated a bit differently, and wij can arbitrarily set the system state. Ter our case, wij’ll create accounts for our two users (Alice and Bob) and give them 50 coins each.

Excellent! This becomes the very first factor from which everything else will be linked.

For each block, wij want to collect a set of transactions, create a header, hash it, and add it to the chain

Let’s use this to process our transaction buffer into a set of blocks:

Spil expected, the genesis block includes an invalid transaction which initiates account balances (creating tokens out of skinny air). The hash of the parent block is referenced ter the child block, which contains a set of fresh transactions which affect system state. Wij can now see the state of the system, updated to include the transactions:

Checking Chain Validity¶,

Now that wij know how to create fresh blocks and verbinding them together into a chain, let’s define functions to check that fresh blocks are valid- and that the entire chain is valid.

On a blockchain network, this becomes significant ter two ways:

  • When wij originally set up our knot, wij will download the utter blockchain history. After downloading the chain, wij would need to run through the blockchain to compute the state of the system. To protect against somebody inserting invalid transactions te the initial chain, wij need to check the validity of the entire chain te this initial download.
  • Once our knot is synced with the network (has an up-to-date copy of the blockchain and a representation of system state) it will need to check the validity of fresh blocks that are broadcast to the network.

Wij will need three functions to facilitate ter this:

  • checkBlockHash: A plain helper function that makes sure that the block contents match the hash
  • checkBlockValidity: Checks the validity of a block, given its parent and the current system state. Wij want this to terugwedstrijd the updated state if the block is valid, and raise an error otherwise.
  • checkChain: Check the validity of the entire chain, and compute the system state beginning at the genesis block. This will terugwedstrijd the system state if the chain is valid, and raise an error otherwise.

Wij can now check the validity of the state:

And even if wij are loading the chain from a text opstopping, e.g. from backup or loading it for the very first time, wij can check the integrity of the chain and create the current state:

Putting it together: The final Blockchain Architecture¶,

Te an actual blockchain network, fresh knots would download a copy of the blockchain and verify it (spil wij just did above), then announce their presence on the peer-to-peer network and begin listening for transactions. Bundling transactions into a block, they then pass their proposed block on to other knots.

Wij’ve seen how to verify a copy of the blockchain, and how to bundle transactions into a block. If wij recieve a block from somewhere else, verifying it and adding it to our blockchain is effortless.

Let’s say that the following code runs on Knot A, which mines the block:

Now assume that the newBlock is transmitted to our knot, and wij want to check it and update our state if it is a valid block:

Wij’ve created all the basic architecture for a blockchain, from a set of state transition rules to a method for creating blocks, to mechanisms for checking the validity of transactions, blocks, and the total chain. Wij can derive the system state from a downloaded copy of the blockchain, validate fresh blocks that wij recieve from the network, and create our own blocks.

The system state that wij’ve created is effectively a distributed ledger or database- the core of many blockchains. Wij could extend this to include special transaction types or total wise contracts.

Wij toevluchthaven’t explored the network architecture, the proof-of-work or proof-of-state validation step, and the overeenstemming mechanism which provides blockchains with security against attack. Wij also toevluchthaven’t discussed public key cryptography, privacy, and verification steps. More on that ter the future!

Share this:

Related

31 comments

Very good and ordinary explanation of the priciple of block chains.

I followed the instructions step by step and have got now an idea how it might work te reality.

Thanks for posting this tutorial.

Perhaps someone has a continuation of this tutorial how to overeenkomst with conflicts when numerous miners create blocks at harshly the same time?

Thanks a lotsbestemming. Now I get the basic idea about the implementation of block chain by your article.

Ter 16 when you attempt to run other code for txn te chain [0] [‘contents’] [‘txns’] : using python Trio it gives a keyError :’contents’.how can this be solved?

Thanks for checking this ter Python3! I just posted an update (also on github) which should address Python Trio compatibility issues, tested on Python Three.Five.Two

Thanks for the postbode.Will be sure to ask if I ran into any trouble.

Thank you very much for the outstanding article! I’m just commencing with the blockchain and not familiar with the basics – so a question regaring

[6], transaction validation:

How to treat wallet balance checks during transactions ter the real world, with millions/billions wallets? Can’t truly just keep them all ter a single “state” variable and cannot iterate entire blockchain for all transactions to track duo wallets. I guess it’s about proof of stake concept – spil I can imagine it’s a hash of wallet ID + existing balance sum + hashed private key used to generate wallet ID (otherwise everyone would be able to spend coins ter the wallet), but not sure.

Could you elaborate, please?

With millions/billions of wallets you wouldn’t want to keep the state in-memory, but storing the system state te a local database accessible by your blockchain knot is entirely feasible- this is how big blockchain networks (ethereum, bitcoin) work! Te bitcoin, the ‘state’ is the set of unsent transaction outputs (UTXOs), when a knot primarily downloads the blockchain it works from the genesis knot forwards to build up a database of current UTXOs which it can reference. Te Ethereum, the ‘state’ is the state of the Ethereum Virtual Machine, similarly after downloading a blockchain the knot will store the EVM state locally.

Thank you for the explanation! After reading all the math calculations about difficulty of blocks, probability of finding one, deflation tempo, profitability of mining etc. I’ve expected blockchain code to resemble AI calculations – but so far all concepts are enormously ordinary yet ingenious.

One more question – if I may: how does a wallet prove its authenticity to the knot to register a transaction?

Note that wij don’t check the authenticity of the wallet vanaf se, but rather the authenticity of the transaction– ter our example, checking that the sender actually has funds to voorkant the transaction. Wij check this by building up the current state of the blockchain, embarking at the genesis block, and saving the blockchain state ter local memory or a database (spil mentioned ter the previous response). Spil anyone can create a fresh wallet on public blockchains by just creating a public/private key pair, there isn’t a need for a wallet to prove its authenticity vanaf se – but te order for a person to submit a valid transaction that is mined into the blockchain, the knots processing the transaction voorwaarde see that the wallet’s current state is able to meet all the transaction rules (e.g. have sufficient funds to voorkant the transaction).

Te permissioned blockchains, there is a ‘whitelist’ of recognized wallets that are permitted to create transactions, which is maintained spil part of the blockchain state- but most fully public blockchains (bitcoin, ethereum, litecoin, zcash) don’t have permissioned wallets.

Thank you once again! But I meant actual validation proces of public/private wallet key – how does it toebijten ter case of blockchain? There are explanations about Bob’s and Alice’s keys te Bitcoin documents but puppet spectacles without code don’t work on mij due to lack of imagination and most likely practice spil well =( Blockchain itself doesn’t keep public keys (for Bitcoin at least) – what may prevent third party from re-generating keys and sending fake transaction gegevens to the knot? It seems re-generated pair of keys may work spil well spil the original. I understand it’s possible to validate public key if the wallet previously generated at least one transaction and included its public key te the gegevens – but what about wallets which received coins but didn’t send anything and didn’t broadcast their public key yet?

Wallet validation is like 1/Four of cryptocurrency concept and so far I didn’t see a single code snippet with this proces applied to a blockchain. Could be superb if you add the code to your article.

Ah, ok- now I understand what you meant! This system relies on public/private key cryptography, where the private key is kept a secret, but the public key can be broadcast to the network- ter most blockchains, the public key actually is the wallet address! This means that spil long spil a wallet receives or generates a transaction, its public key is available on the blockchain (spil the ‘from’ or ‘to’ field of the transaction)- so there isn’t any punt about wallets receiving coins but not having a visible public key.

Public/private key cryptography permits the user to ‘sign’ a transaction with their private key, creating a signature which uniquely encodes the contents of the transaction. Anyone with the public key can then verify that the signature is valid for that specific transaction- without being able to know anything about the private key! Any switches to the transaction contents would require a different signature, so having the public key and the signature permits a knot to verify that the transaction wasgoed created by the account proprietor, and has not bot tampered with. There are some good movie explanations of public/private key cryptography, I have an unfinished tutorial on this which I might attempt to finish up to better explain the concept!

Note that most blockchain protocols permit somebody to send to an invalid or unclaimed address- thesis tokens are then ‘lost’ spil nobody has the private key matching that wallet address! This is used te some creative ways, e.g. by ‘searing’ bitcoins to buy tokens ter a freshly created blockchain (this is how Ethereum wasgoed very first began, and is a good way of creating value te proof-of-work or proof-of-stake systems).

Public/private key cryptography algorithms can be utterly strong- unlike cracking a password, it would take years for all of the world’s computing power working together to crack a single public/private key pair! So there isn’t any punt about ‘re-generating’ a public/private key pair, this can be viewed spil effectively unlikely spil long spil the public/private key pair wasgoed seeded randomly!

If you’re nosey about more, I’d encourage you to look around for resources on public/private key cryptography and blockchains- there’s a lotsbestemming of fascinating topics ter this area.

Public cryptography key spil a wallet ID makes everything clear. Yet another plain yet superb concept. Thank you for the replies and the article!

Hey can u shortly explain the framework for creating blockchain application not for transaction but for documents storage

Hi Hafsa! There are a number of approaches for this, the simplest is to hash the contents of the document (and an address to the document) into the message contents (rather than having the message have a target and amount). This proves existence of a specific version of the document at a given location. More complicated versions which work like IPFS are outside of the scope of this tutorial, but there are other resources for understanding that project!

you absolute legend! thanks for this.

Hi, thank you very much for the tutorial, indeed some clever yet plain ideas.

te the makeBlock function definition you populate the variable tnxCount with the number of transactions and instantaneously after when you define the content of the block you recalculate the length.

Is there a specific reason for this or could wij just use the txnCount variable ter the blockContents dictionary?

I would also bot interested te understanding the mechanism according to which transactions get allocated to knots for block creation. I know bitcoin uses the longest chain rule to solve mededinger blocks creation but I cannot figure out how this would work ter code. When a transaction is generated how is it determined which knot should process it and add it to a block? Are transaction assigned to numerous knots at the same time? How the transactions buffer can be kept synchronized across the knots?

Good questions- reusing txnCount would improve efficiency, and is a good suggestion.

The overeenstemming mechanism is an emergent property of the network dynamics, and so is firmer to monster te a single-node representation like this one. Toughly, the network is a peer-to-peer network te which knots pass messages and block onwards to all their listed peers. This permits a knot to identify the longest chain which it receives from the surplus of the network, spil well spil develop a queue of messages to bundle into blocks. The transactions will typically be ordered by the miner fees (or gas price ter Ethereum) for batching into blocks. Once a block is formed, it is passed to all of the knot’s peers, who validate it and eliminate any of its transactions from their own queues.

Thank you for the clarification. I think I underestimated the speed information can propagate across peer networks. I had stuck te my mind the idea that it wasgoed not possible that a reasonably big amount of peers could sync transactions ter time to avoid a massive duplication of jobs, but evidently the speed is high enough to permit processed transactions to be liquidated from working buffers quick enough to avoid continuous conflicts.

I’m interested on the topic because I have a screenplay where blockchain could come handy due to the lack of central arbitrations.

The script I have te mind is similar to a found rising: one knot need to create a request for found, lets say 100. All the other knots can then determine how much to contribute to the request. Can be all 100 from only one knot or smaller amounts from numerous knots. Once the total for the transaction is 0 (request and supply televisiekanaal each other) then the transaction is ready to be added to the block. I think it should be rather straightforward to implement, the only complexity I see is ter linking requests and supply with some sort of ID ter order to determine when the request is solved. I guess I can solve potential conflicts of oversupply when creating the block, by discarding the final redundant transaction based on timestamp or by reducing the value ter case the supplied amount is too high.

Related movie: DEATH Cross Verrassing for Bitcoin


Leave a Reply

Your email address will not be published. Required fields are marked *