Expando Blocks
- Thread starter Bagatell
- Start date
- Aug 28, 2015
- 728
- 1,191
Transcript:
on or potential
2:51
solution here and I'm not going to do
2:52
the work for this but it's easily
2:54
achieved is that there's them the block
2:58
or the programmers will understand what
3:01
I'm saying here but there's 83 bytes in
3:03
the current existence block structure
3:06
these 83 bytes could easily be used to
3:09
chain a number of other blocks of
3:14
exactly the same structure with exactly
3:16
the same free 80 bytes now at the moment
3:19
people are just shoving crop and crud in
3:21
there I mean there's all kinds of weird
3:22
spam and and people are storing records
3:24
in there and doing all sorts of things
3:26
have you got photos and strange images
3:29
and gifts and this or thing just because
3:31
they can but that space could be
3:33
allocated to chaining blocks and so my
3:36
idea would be instead of a segmented
3:38
witness or altering the block would be
3:42
iterative processing so every time the
3:44
minor software hit a block it would know
3:47
to jump right to the particular point of
3:49
80 bytes free pick up on the ancillary
3:53
blocks process through the primary block
3:55
and then process through any and all
3:59
slave blocks now also bear in mind this
4:01
this means that as long as you're
4:03
keeping the block size the same and the
4:05
structure the same just adding a little
4:07
bit not altering and adding a bit to
4:10
your code then the same processing for
4:13
any of the slave blocks would be the
4:16
processing for the master block you
4:17
would just need to have an iterative
4:19
accumulator or counter and to know where
4:21
you are in the chain and technically it
4:23
would be infinite you know you have
4:25
infinite scalability lat
4:26
rly so to speak off each and every block
4:28
and you'd have to as you're processing
4:30
through the blocks you just have to stop
4:32
on each block and process laterally to
4:34
the end of its chain come back and then
4:35
go to the next one I do this with my
4:38
spiders for gathering beta all the time
4:41
and it works very well you need to know
4:45
where you are in your accumulator and
4:46
you got to watch your stack as you're
4:48
doing this kind of stuff but there
4:49
shouldn't be any problem with today's
4:51
modern hard work so there is a third
4:53
possibility for you and expand the block
4:56
if you will without the block ever
4:57
expanding it replicates itself or
5:00
replicating blocks or cloning blocks or
5:02
whatever you want and then they're all
5:04
chained with smart numbers so that the
5:06
the continuity the block chain is
5:08
maintained the records on each and every
5:11
one of them is maintained you can even
5:13
devote you would have to devote some of
5:16
some of your 80 bites to a checksum to
5:20
give you a you know smart number
5:22
analysis about the number of ancillary
5:24
blocks agenda process but it no big deal
5:26
so there may be technical issues that
5:29
you know for why people wouldn't want to
5:31
implement that but it is another
5:32
solution and those 83 bytes in there
5:35
provide other possible
Is this how Factom works?
on or potential
2:51
solution here and I'm not going to do
2:52
the work for this but it's easily
2:54
achieved is that there's them the block
2:58
or the programmers will understand what
3:01
I'm saying here but there's 83 bytes in
3:03
the current existence block structure
3:06
these 83 bytes could easily be used to
3:09
chain a number of other blocks of
3:14
exactly the same structure with exactly
3:16
the same free 80 bytes now at the moment
3:19
people are just shoving crop and crud in
3:21
there I mean there's all kinds of weird
3:22
spam and and people are storing records
3:24
in there and doing all sorts of things
3:26
have you got photos and strange images
3:29
and gifts and this or thing just because
3:31
they can but that space could be
3:33
allocated to chaining blocks and so my
3:36
idea would be instead of a segmented
3:38
witness or altering the block would be
3:42
iterative processing so every time the
3:44
minor software hit a block it would know
3:47
to jump right to the particular point of
3:49
80 bytes free pick up on the ancillary
3:53
blocks process through the primary block
3:55
and then process through any and all
3:59
slave blocks now also bear in mind this
4:01
this means that as long as you're
4:03
keeping the block size the same and the
4:05
structure the same just adding a little
4:07
bit not altering and adding a bit to
4:10
your code then the same processing for
4:13
any of the slave blocks would be the
4:16
processing for the master block you
4:17
would just need to have an iterative
4:19
accumulator or counter and to know where
4:21
you are in the chain and technically it
4:23
would be infinite you know you have
4:25
infinite scalability lat
4:26
rly so to speak off each and every block
4:28
and you'd have to as you're processing
4:30
through the blocks you just have to stop
4:32
on each block and process laterally to
4:34
the end of its chain come back and then
4:35
go to the next one I do this with my
4:38
spiders for gathering beta all the time
4:41
and it works very well you need to know
4:45
where you are in your accumulator and
4:46
you got to watch your stack as you're
4:48
doing this kind of stuff but there
4:49
shouldn't be any problem with today's
4:51
modern hard work so there is a third
4:53
possibility for you and expand the block
4:56
if you will without the block ever
4:57
expanding it replicates itself or
5:00
replicating blocks or cloning blocks or
5:02
whatever you want and then they're all
5:04
chained with smart numbers so that the
5:06
the continuity the block chain is
5:08
maintained the records on each and every
5:11
one of them is maintained you can even
5:13
devote you would have to devote some of
5:16
some of your 80 bites to a checksum to
5:20
give you a you know smart number
5:22
analysis about the number of ancillary
5:24
blocks agenda process but it no big deal
5:26
so there may be technical issues that
5:29
you know for why people wouldn't want to
5:31
implement that but it is another
5:32
solution and those 83 bytes in there
5:35
provide other possible
Is this how Factom works?