temtum :: Using Lego to Explain the Blockchain Technology, temtum


So right now most people use a database
and the database is just a collection of records that are stored but one problem with
a database is you can change what’s in it; for example, if I change this brown piece
of data for a blue piece data that’s absolutely fine but in some
industries such as finance, such as tracking, shipments for example,
where you want a perfect audit trail but you don’t want to change data this is not acceptable. That’s where blockchain comes in.
With blockchain you can add data and once you add data, through cryptography which is
effectively just clever maths, you can secure, and lock in if you like, all
previous data in the blockchain. So now you have a perfect audit trail, which can
never be altered and this is great for example tracking your payments through
banks, so you know you have a perfect audit trail, sending parcels around the world
so you have a perfect audit trail of where it’s been and who’s handled it and supply
chain management as well. So traditionally now on this is a standard
blockchain you have data coming into the network this appends to the to the
blockchain there and this happens constantly over time and as long as the
networks running the actual blockchain as you see here, just gets bigger and
bigger and bigger and this will never stop so long as the network is in use this
blockchain now will just constantly grow, now this now this is a problem because
they’ve got 200 gigs with the data now on bitcoins blockchain every node on the
network now needs to store that amount of data, so as you can imagine our mobile
phone for example just can’t, can’t store amount of data. Now this is temtum’s blockchain,
same source data structure again transactions come into the network and
is stored on the blockchain, again just comes in in stores. What makes
temtum unique is, I know each node now can decide on how much of this they store,
they can store all the data, or if they only want to store half the data, they can
just delete if you like the bottom half. Now this
data now has been deleted from this node, this is not like bitcoins SPV at all but
this data now is deleted from this node. But, this is the critical thing, it’s not ever
deleted from the network, other nodes on the network may have this data and the
data structure in the current data now that is held because it still holds
some of the blocks headers, can in a way confirm a transaction without
knowing this data here but if it wants to get this data from another node, it
can ask for this data later at a later time just to confirm a transaction if it needs be.
So that’s now as you can see, temtums blockchain, the traditional blockchain there. Yes so this is the NIST Randomness
beacon by here and these are three nodes on the network, every minute the NIST
beacon sends into the network a 512 bit random number. This random number can
never be pre computed at all so nobody knows this number before it’s sent out by NIST.
Now each node only does one single calculation now, they take
this random number and I take it away from their node hash this is one single
calculation to determine the next leader that leader now will be responsible for
confirming all transactions in the next minute. This does one calculation per
node, Bitcoin requires to do millions and millions of transactions per second for
ten minutes. That’s a lot of energy, a lot of
specialized hardware will use one single calculation and because now we have
determined that this node by here’s a leader, everybody now knows this node is
confirming a transaction. So if this node comes into the network and says and
just puts out a block and says this is a leader because every other node on the
network knows that this is the leader for this one minute, they will ignore
this node completely from the network and forget about any transactions
they’ve sent. So that can’t be now, it’s impossible to have a fork in the
network, so this load is the only node right now allowed and able to send to
confirm transaction so if this node for example sends a transaction
directly to us, it’ll be appended to the blockchain and then sent out to all the
other nodes and because they know exactly who’s the leader for the next
one minute, you can send directly to that node you don’t need to send it by other
nodes as is the case with other currencies because that’s very
inefficient or pointless. So this now is an authority node, this node knows of
each node of the network and every one hour it sends a document to each node.
This document back here gives a list of every other node on the network so every
single node on this network right now has a global view of the network so this
node knows about the purple and the blue node, now when it comes to being a leader
if this blue node is a leader, right now this green node knows the blue nodes the leader
and rather than just sending it to the purple node, hopefully get to the blue node
eventually, it could just send this transaction directly into the blue node,
that bypasses all other nodes, it stops them wasting resources and it
makes the network much more efficient. So this is the NIST beacon as shown earlier,
now this is external source of Randomness, it’s not our only one, we do have two
others as well in case this one ever fails and this sends in a random number
every every minute 512 bit random number now the reason we use this is because
this source of randomness now is truly random, it uses a quantum source of randomness, uses lasers and lights to generate this random number because the problem with
current numbers generators is, you can predict them. Eventually you will
be able to predict them, this is completely random and because nobody can
ever predict this number, it means that this random number that comes into the
network, you have to be on the network and attacking the network at this point
in time you can never pre compute it and the chances of you
attacking the network while this is in play is very low.

Leave a Reply

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