►
Description
We had Qi Zhou (https://twitter.com/qc_qizhou) from Quarkchain (https://twitter.com/Quark_Chain) join our co-founders Alex Skidanov (https://twitter.com/AlexSkidanov) and Illia Polosukhin (https://twitter.com/ilblackdragon) for a technical deep dive session in the 16th Episode of our Whiteboard Series.
Learn more about Quarkchain here: https://quarkchain.io/
Location: NEAR Protocol HQ, San Francisco, CA
Download the video here: https://near.ai/45ac4
------- About Whiteboard Series ---------
The Whiteboard Series with NEAR is a set of video interviews with Founders who are building scalable solutions for Blockchain. We deep dive into their story, what they're developing and how it is helping the ecosystem.
Follow the latest from NEAR Protocol on,
Discord: https://near.ai/discord
Medium: https://near.ai/medium
Twitter: https://near.ai/twitter
GitHub: https://near.ai/github
#WhiteboardSeries #Sharding #FutureIsNEAR
A
B
Hi
hi,
so,
first
of
all,
it's
my
great
pleasure
to
be
here
to
introduce
our
kwok-che
and
also
many
thanks
for
Nearpod
co-hosting
this
event,
and
so
coaching
is
next
generation.
Block
sharing
Network
aims
to
offer
better
trade
off
between
scalability,
decentralization
and
also
security.
So
we
already
are
launched
our
test.
Nuts
I
mean
public
text
now
four
months
ago
and
our
maintenance
is
planned
to
launch
at
the
end
of
this
month.
Awesome.
C
B
So
before
I
introduce
our
maybe
detail,
CUF
sensors,
probably
I,
would
like
to
release
it
a
little
bit
how
we
will
the
province
of
block
chains
and
probably
we've
I'm,
not
sure
new
wheel,
point
or
maybe
some
existing,
but
make
sure
that
we
are
solving
the
correct
harm
before
we
dive
into
the
solutions.
Okay,
so
I
think
first
report.
Everybody
here
knows
we
have
actually
ma,
which
is
security,
decentralization
and
scalability.
B
Scalar
scalability
and
in
a
tree
trimmer
says
that
is
very
hard
to
achieve
these
three
properties
for
at
the
same
time.
But
our
observation
of
facts
is
that
actually
achieving
one
of
them
is
also
difficult.
Lets
us
start
from
security
first.
So,
for
example,
let's
consider
most
I
mean
mature.
Our
concerns
was
proof
of
work
which
has
been
running
for
more
than
a
decade
since
the
deeper
the
beauty
of
Bitcoin
and
it
hasn't.
It
has
been
running
for
10
years
without
being
a
little
bit
attack.
B
Yes,
if
there's
a
single
network,
there's
51
%,
but
with
we
say
of
the
miners,
that
runs
the
thing
else.
It
runs
the
same
hash.
Our
zone
runs
the
same
hash,
hey
LG,
and
this
number
actually
in
reality
is
far
lower.
So,
for
example,
Eastern
classic
theory
are
using
the
a
little
outdated
data.
Where
is
on
in
January
I,
think
2016
Easter
we're
steering,
has
176
Terra
hash
per
second
and
it's
10
o'clock.
They
have
9
terahertz
per
second,
if
we
just
consider
is
if
they're
in
class
itself
than
51%
I'm
requires
five
point.
B
C
C
B
All
these
are
honest,
I
just
moved
here
from
here
right,
so
I
just
moved
my
from
here
to
here
and
proponent
of
spin
attack
and
this
actually,
what
is
always
happened
for-
and
this
can
be
even
that-
the
miners
that
can
effectively
contribute
the
hash
power
to
network.
That
means
all
the
GPUs
that
mines
simultaneously.
My
kryptonite
echo
hash
right.
What's
to
my
and
see
all
the
algorithm,
they
are
ready.
All
this
dimension
of
the
hash
power
is
can
be
potentially
used
to.
A
B
And
that's
another
topic,
I
can
say,
but
to
conclude,
this
I
will
say
this
51%
attack
is
very
misunderstanding
because
in
reality,
even
for
his
theorem
consider
all
this
he
can
be
far
lower
than
this
number
and
the
situation
become
even
worse,
with
the
marketplace
of
hash
power
that
is
fixed
on
a
nice
hash
and
so
I
can
rent
those
hash
power
from
nice
hash
and
then
perform
an
attack
and
the
renting
price.
According
to
the
website,
you
just
just
described
to
perform
one
our
attack
on
instant
classic
Just
Cause
4000.
Yes,
it's.
B
So
we
see
that
actually
it's
theorem
classic
and
if
the
beacon
go,
they
are
pretty
large
critic
currency
in
the
world
like
roughly
top
service
in
the
world,
and
this
implies
for
all
the
rest
of
POWs
networks.
It
can
be
easily
attack
and
Bitcoin
user
is
there.
A
fee
is
still
secure,
but
still
the
rest
of
them
are
in
danger
and
and
it's
not
a
number
of
attack,
but
rather
the
cost
of
performance,
heart
attack
more
related
to
absolute
value
of
Hajj
power.
This
is
one
key
observation
me.
We
see.
D
B
B
Maybe
I
can
give
some
rough
definition
first
say:
oh
there's,
no
central
entity
to
control
the
network,
no
central
entity-
oh
maybe
everybody
everybody
could
join
the
network.
Oh
joy
or
contribute
the
network
I
would
say,
is
easily
how
to
define
this.
So
anybody
have
question
of
my
rough
definition
of
decentralization
or
maybe
better.
Let's
break
them
and
from
my
viewpoint,
maybe
quantities.
B
B
Memory,
weaves
and
I
know
some
people
doing
some
optimization
how
to
use
one
key
demand
buys
memory
to
run
Bitcoin
and
probably
the
major
cause
is
the
the
change
size
which
is
theorem,
I.
Think
the
latest
data
is
roughly
2.2,
terabytes
and
Bitcoin
I
think
is
roughly
I
forgot,
you're
engaged
yeah,
yeah,
200,
300,
300
yeah,
this
number
so
say
well,
say
100
gigabytes
and
that
is
still
affordable
for
most
high
paying
users.
So
that's
great.
C
B
They
do
still
affordable
to
say
a
lot
of
flight
users.
Maybe,
for
example,
we
can't
easily
run
thousands
of
nodes
like,
for
example,
is
there
and
have
8,000
nodes
and
Bitcoin
has
roughly
close
to
10,000
nodes
right?
That's
the
Sun
something,
but
the
cost
of
producing
a
blog,
actually
I
should
add
some
condition.
B
And
here
we
need
some
empirical
data
which
miss
away
some
of
the
miners
to
see
in
what
situation
you
will
contribute
to
the
network
directory
or
my
wisdom,
money
in
pool
at
the
price
of
the
fee,
and
they
say
if
the
hash
power
is
greater
than
0.1
percent,
which
is
one
over
one
thousand
of
the
hash
power
of
the
network.
Then
they
were
likely
just
directly
contributed
because
country
in
the
mining
pool
basics,
the
amortize
the
reward
over
time,
but
suppose
it
had
one
half
one.
B
Okay,
so
let
me
just
take
this
number
and
see:
what's
the
cost,
if,
as
a
miner
own,
this
hatch
power
so
back
to
if
their
numbers
160
Terrace
per
second
divided
by
1000,
then
we
have
had
then
this
mine
on
moves.
You
have
this
one
gig
hash
per
second,
and
now
we
just
consider
a
graphics
car
1080,
which
roughly
generates
30
mega
hash
per
second.
D
B
B
A
A
C
A
A
B
E
C
A
C
B
So
why
blockchain
is
so
slow
because
compared
to
centralized
entity
there
are
a
lot
of
things
are
completely
different.
So
first
blockchain
in
general
have
found
sort
of
notes
like
this.
Theorem
has
a
thousand
and
Bitcoin
has
roughly
10,000,
and
so
blockchain
I
was
a
public
blockchain
pu
b,
and
this
will
be
centralized
and
so
first
and
then,
because
I
mean
we
know,
need
to
have
maintained
a
full
lecture.
B
B
And
so
you
see
any
other
numbers,
probably
this,
and
so,
if
we,
for
example,
in
a
chain
increase,
for
example,
the
block
size
might
reduce
block
interval,
then
we
will
propagate
these.
These
blocks
within
this
slow
Network
of
all
these
nodes
will
take
significant
amount
of
time.
For
example,
there's
paper
published
in
2015
I
think
the
name
is
called
on
decentralization
of
bitcoins
and
sometimes
like
that.
It's
summarized
that
for
Bitcoin
with
1
megabytes,
it
will
take
two
point.
Four
minutes
to
propagate
a
note
to
to
propagate
the
blog
to
90
notes.
C
C
C
B
This
is
just
the
data
from
the
paper,
maybe
a
little
bit
faster
than
this,
because
internet
improve
out
of
three
four
five
years
and
50
I've
called
it
this
number,
but
let's
just
use
it
is
number
and
since
this
report
actually
is
this
kind
of
constants
so
which
implies
they're
supposed
to
have
a
beacon
cache
which
using
the
maximum
make
it
besides,
which
is
32,
megabytes
and
suppose
their
notes,
sighs.
It's
the
thing
that
the
Bitcoin,
because
right
now
it's
much
smaller,
and
this
means
that
it
will
take
32
times
to
0.4,
which
is
roughly.
C
B
B
It's
hops,
but
but
at
the
same
time,
when
I
suppose,
like
some
mysterious
generally
connected
to
2
to
20,
nodes
or
sorry
notes
for
each
node
and
I
need
to
broadcast
block
to
all
these
things.
I
still
need
me
by
my
local
panic
right,
so
need
to
broadcast
them
and
in
there
were
multiple
hops
and
in
broadcast
broadcast,
and
so-
and
this
is
the
empirical
data
to
to
say
why
why
we
cannot
like
clapping,
it's
very
hard
to
optimize.
This
number
definitely
for
have
more
nose
than
the
number
can
be
even
worse.
A
B
B
So
we
see
this
like
there's
a
security
problem,
decentralization
program
and
scalability
problem
and
and
see
there
are
actually
two
ways
to
adjust
this
to
a
problem.
One
way
is
to
add
a
blur
large
block
size
straightforward,
like
Oh
shorten
the
block,
interval
and
I'd
like
to
pick
some
litecoin
like
decreased
block
time
from
10
minutes
to
5
minutes
cleaning
4
times
bitcoin
cash
improve
this
number
to
32
megabytes
and
beacon,
cache
Satoshi
vision,
spider
increase
this
number
to.
If
my
memory
is
correct,
one
key
2801,
gig.
C
B
It
tried
to
Ames
to
improved.
Why
do
you
guys,
probably
right
now,
I
still
won
today
and
is
Suren
adopted
skull
ghost
algorithm,
basically
try
to
catch
by
include
those
ankles
or
still
blocks
into
the
rewards,
but
it
actually
partially
implement,
because
the
difficulty
of
this
uncles
are
not
counted
to
burst
relative
companies,
which
means
this.
Do
you
have
hash
power
loss
problem?
No.
A
Else
I
mean
what
complex
is
doing.
You
can
also
just
include
those
blocks
in
your
full
range
rate
and
then
speed
up
anymore,
like
if
you
already
have
those
uncle
blocks
in
your
chain.
You
actually
can
use
them
to
include
the
transactions
in
those
blocks
that
were
not
included
in
main
chain
as
well,
but.
B
B
A
B
Another
solution
which
I
think
we
call
maybe
kind
of
naive
version
of
Shari,
is
using
multiple
block
chains
right,
and
so
we
have
supposed
to
be
had
10,000
of
100
block
chains.
It's
your
damn
running.
Maybe
it's
like
a
theorem
like
it's.
This
EITC
live
aid
industry,
but
then
definitely
we
quickly
enter
hatch
power,
dilution
problem
which
we
can
find
chain
with
only
1
or
100
power.
Ok,
is
the
target.
B
I'm
so
say:
hey
it's
possible
that
we
are
able
to
combine
this
these
two
and
then
come
up
with
a
solution
that
maybe
better
adjust
apartment,
and
this
is
how
the
upper
window
suppose
is.
We
have
a
two
layer,
blockchain
the
first
layer.
This
can't
still
can't
recall,
shadi
blockchain
is
that
a
list
of
the
block
chains
that
process
none
OLAP
transactions
or
me
now
OLAP
means
there's
a
other
space.
B
There's
partition
these
transactions
or
senders
or
recipients
to
different
chains,
make
sure
I
like
ghost
like
these,
have
all
actions,
actions
and
then
to
address
this
court
called
a
losing
issue.
There's
a
called
root
chain
and
should
the
root
chain
itself
does
not
contain
any
transactions,
but
it's
basically,
it
has
hash
pointer
to
prove
blocks
as
normal
blockchain,
its
body
to
it's
at
least,
half
hash
pointers
to
the
to
the
shot
block
chains
and
as
long
as
this
body.
C
A
C
B
Prefer,
and
actually
in
this
case,
even
for
this
case,
because
for
this
one
is
corresponding
ledger,
the
full
adder
is
not
including
this
one,
because
this
is
corresponding
to
this
one.
The
cost
of
a
full
ledger.
Is
this
one
and
Plus
this
one,
so
it's
corresponding
route
changes
to
this
one.
So
even
for
this
one's
do
this
one!
So,
no
matter
how
long
this
is
that
the
attack
will
always
fail.
We
call
routine
first
for
choice
rule.
B
So
the
good
thing
of
this
is
that
for
any
block
that
is
confirmed
by
the
root
block,
it
would
be
automatically
protected
by
the
rule
block
and
suppose
the
rubra
has
significant
amount
of
hash
power
like
bitcoin
is
theorem.
The
mission
is
that
all
the
shadi
blockchain
they
can
be
protected
by
the
better
rule
block,
and
this
is
basic
key
idea,
but.
C
But
here's
the
the
question
right
so,
let's
say
so.
Let's
say
we
have
like
you
know
five
people
or
like
five
five
gigahertz
are
mining
this
chain.
Right
now,
let's
say
like
five
gigahertz
mining
this
here
chain
and
let's
say
we
have
170
terror,
terror,
hashes
mining,
this
chain,
so
this
chain
is
significantly
more
secure,
but
but
the
particular
validator
here
right.
So
let's
say
these
a
particular
machine
that
is
mining.
C
B
C
C
C
Much
longer
I
can
see
how
this
protects
against
longer
right,
but
let's
say
so.
This
is
the
this
is
the
so
five
gigahertz
I
will
use
green
for
honest
okay,
so
five
gigahertz
is
good
people.
Thank
you
get
hurt,
is
something
I
rented
on
nice
cash
that
one
nice
cash
and
I
created
the
block,
and
in
this
block
this
block
is
completely
invalid
I.
Just
in
this
book,
I
just
said,
the
email
is
like
victim.
A
C
And
then,
obviously,
this
five
gigahertz
eight
all
this
block
is
invalid.
We're
going
to
continue
building
this
blockchain
and
they
continue
building
on
this
blockchain,
but
I
am
faster
right,
so
I
as
a
malicious
actor,
I'm
building
a
longer
chain,
and
so
both
of
us
sending
the
blocks
to
the
root
chain
right.
How
does
this
particular
person
on
the
root
chain
know
which
one
to
snapshot
into
the
routine
block
that
comes.
B
To
our
definition
of
how
we
can't
decentralize
in
this
room,
we
are
going
to
adjust
so
basic.
There
are
two
problems.
One
is
closed
off
running
on
note
and
second
is
closed
off.
Producing
block,
so
you
see
that
running
unknown
is
me.
Belief,
is
more
bottleneck
than
running
a
producing.
A
block
is
the
more
bottleneck
of
runyan
note.
So
we
assume
the
network,
but
no
actually
is
running
the
full
edger
kind.
B
But
the
point
is
that
we
have
been
called
a
cluster
design
which
allows,
and
you
can
imagine
a
load
or
super
node
or
a
cluster
that
is
able
to
distribute
all
this
short
tasks
form
its
sub
machines.
This
is,
we
can't
call
if
you
said:
if
there
is
the
world
computer,
then
we
say
we
are
with
the
world
cloud
right
and
because
we
see
compared
to
this,
the
cause
like
contribute
is
directly
the
running.
An
old
cost
is
much
much
less
and
suppose
we
just
need
to
spare,
maybe
10,000
bucks,
to
maintain
this.
B
C
A
B
B
A
B
C
C
B
Actually,
one
problem:
if
you
can
lock
it,
can
you
see
any
consensus?
It
doesn't
need
to
be
proof
of
work.
It
can
be
displeased
important
work
and
use
this
hash
hash
value
as
kind
of
see
to
select
proof
of
stake
validators
because
it
is
so
strong
edge
power.
So
making
treat
treat
treat
on
this
from
one
validator
and
once
that
away
that
on
one
char
is
not
probably
not
highly
unworthy
right.
You
can
also
run
perform
work
with
different
hash
algorithm.
B
Actually,
it
is
similar
to
existing
like
a
mix
off
that
is
there
or
this,
but
with
more
ways
so
that
everybody
can
join
the
hatch
power
of
the
root
Campitelli
about
it.
We
call
kind
of
and
any
actually
and
in
short,
is
added
in
flight,
so
we
saw,
for
example,
we
can
add
a
sharper
year.
You
see
a
one
shot
another
year,
one
shot
and
the
char
would
be
immediately
be
protected
by
the
hash
power
and
we
call
this
called
hash
power.
B
A
The
question
is
pretty
much
yeah
if
I'm
mining
the
root
chain,
pretty
much
makes
sense
for
me
to
run
this,
because
if
this
is
like
170
Terra
hashes
I
need
to
invest
a
million
dollars
in
GPUs.
It
may
as
well
run
this,
but
if
I'm
right
mining,
one
of
the
shark
chains
right
I,
will
not
be
doing.
This
right
depends.
B
For
example,
let
me
back
to
previous
equation
so
for
this
suppose,
I
have
a
sharps.
That's
just
using
some
numbers.
A
shorts
and
oh
I
forgot,
there's
a
how
how
this,
let's
just
use
a
specter,
like
suppose,
all
of
them
using
the
same
hash
power.
This
probably
the
simplest
case,
and
so
we
have
a
color
tax
mechanism
so
that
some
portion,
because
I'm
a
2/3
of
the
block,
rewards
we
work
with
allocate
row
chain
and
one
third
will
allocate
to
issue
all
the
shots
in.
E
A
A
Question
is:
why
do
you
need
hash
power
here
at
all?
Why
don't
just
say
anybody
can
produce
blocks
was
like
no
like
everybody.
Who's
checking
in
them
in
the
root
chain
will
validate
them
anyway.
Yes,
so
why
not
just
produce
blocks?
They
check
them
in
valid,
say,
correct
block
like
what.
Why
do
we
need
any
hash
power
here
whatsoever
like
why
not
just
have
block
producers
destroying
the
blocks
being.
A
B
A
A
B
A
C
How
do
you
choose
the
block
that
is
like
simultaneously
1,000
locks
are
proposed
from
1,000
clusters,
which
one
do
you
choose
but
you're
the
root
you
you
proposing
a
root
chain
lock
right.
These
blocks
into
produce
significantly
faster
than
the
root
chain
root
chain
is
like
once
a
minute.
This
is
once
every
5
seconds.
You
know,
yeah.
C
B
D
D
B
Why
we
adjust
this
tax
aims
to
harvest
both
benefits,
especially
why
we
do
not
move
audience,
because
when
we
propagate
this
large
block,
as
I
mentioned
before,
it
is
latency
sensitive.
But
if
we
have
multiple
blocks
produced
block
simultaneously
and
asynchronously,
because
because
this
guy
is
block,
this
country
is
block.
So
originally
the
network
usage
of
Bitcoin.
You
can
imagine
like
this.
There's
a
block
receive
after
roughly
ten
companies
are
not
gonna
block,
receive,
there's
a
limit,
Charlie
four
receiving
transactions
and
there's
another
receive
right.
C
B
B
Sensors
and,
for
example,
I
can
have
one
of
them
using
the
depot's
and
so
for
the
users
that
would
like
to
have
instant
finality
and
to
make,
and
then
we
can
also
have
another
one
will
be
runs:
different
lecture
or
virtual
machine
fixed
angle,
maybe
one
window
windows
type
of,
and
then
we
can
build
kind
of
enclosure
transactions
to
make
sure
I
can
say.
Maybe,
if
they're
like
tokens
to
da
middle
window
Chang
and
do
the
privacy,
research
and
Sascha
on
that
and
move
back
and
all
these
things
is
decentralized.
B
Good
question
so
basically,
let's
just
consider
a
simple
cross
transaction
pilot
example:
parents
transfer
for
smart
contra.
We
can
also
apply
similar
principles,
but
so
for
balance,
balance
transfer
basically
just
choose
up
operations.
Why
is
withdraw
money
from
sauce
balance
and
then
deposit
the
balance
to
destination
right
and,
unfortunately,
in
cross
Shore
transaction
there's?
B
This
has
to
be
done
in
a
synchronous
way
because
in
in
charge
and
Sasha
I
just
done
within
a
block
and
synchronously,
and
so
basically
there
are
two
couple:
two
major
problems
so
one
how
to
guarantee
it
is
secure
because
suppose
I
the
money
is
or
a
deposit
to
the
destination
sure,
while
the
original
shall
be
enough
spent
there
how
to
make
sure
that
the
money
will
not
be
fixed
on
my
team
with
extra
supply
and
another
is
how
to
make
sure
this
transaction
deposit
will
be
being
included.
What
is
called
was
the
token
economy.
B
B
Let
me
see:
yeah,
probably
just
simplify
the
graph
like
this-
let's
just
let's
just
assume,
there's
a
transaction
here
that
is
going
to
send
from
from
zero,
so
one
concentration
to
shanwa
and
here
in
our
design
actually
for
every
sharp
rocks.
Besides
it
has
a
hash
pointer
point,
the
previous
block.
It
also
has
a
posh
pointer
point
to
previous
rubric,
a
hunt,
point
0.02
block.
The
sum
of
this
can
be
disrobe,
lock
and
based
on
their
best
observation.
It
does
not
guarantee
to
observe,
maybe
the
block
just
just
in
front
of
it.
It
can
be.
B
So
we
have
a
lot
of
the
same
thing
in
our
code
and
so
for
this
one.
For
so
for
this
block
suppose
it
will
not
process
this
kasha
transaction
until
it
observed
the
rule
block
that
contains
this
block
this
bit,
because
this
basically
becomes
a
partial
order
right
and
with
routine
first
consensus.
Now
back
to
that,
if
I
want
to
revert
this
block,
which
means
I
want
to
also
revert
this
block,
which
will.
B
Make
sure
we
always
guarantee
this
and
our
relationship
if
these
two
sub
I
would
say
sub
operations?
Okay,
this
is
first
and
felicity
and
second
is
regarding
the
incentives
so
for
each
block.
It
has
two
gas
limits,
unlike
if
they're,
if
they
were
have
a,
we
call,
may
be
called
local
gas
limit,
another
coke
or
chorus
gas
limit,
the
cost
could
gas
limit
is
doing
what
actually
and
it
is
it
is
for
each
block
header.
B
It
has
a
cursor
which
tells
what
is
the
the
last
cross-cultural
transaction
that
is,
and
the
block
is
being
executed
that
fixed
time
at
the
cursor,
because
this
contains
a
list
of
this
there's.
This
blocks
way
this
contains,
so
it
contains
with
a
cursor.
This
says:
oh,
the
last
block
a
process,
disclosure
transaction
of
corresponding
this
block,
and
the
transaction
ID
there
for
each
of
the.
A
B
Actually,
when
the
block
is
being
received,
it
will
broadcast
all
the
costs
transaction
to
the
other
Shores
or,
if
in
a
classroom,
this
is
classic
I
would
say.
Let
me
echo
such
as
close
a
transaction
design
so
that,
because,
if
I
put
in
a
rubric
and
definitely
ruin
others,
so
it
will
basically
broadcast
to
all
the
time.
So
once
this
one
observe
this
block,
all
the
other
corresponding
cause
or
transaction
of
the
block
included.
But
it
is
rule
block,
is
already
observed
by
this
guy
store
in.
B
A
B
A
B
We
also
have
defined
this
neighbor
relationship
just
in
case
we
have
a
lot
of
shorts,
maybe
thousands
of
chars
directive.
Direct
communication
of
this
will
cause
this
cause.
A
transaction
communication
cost
to
be
n
square,
which
is
number
of
shorts,
and
so,
if
we
fix
this
number,
so
this
will
be
M
square
and
x
number
of
the
number
of
shorts.
So
this
is
total
cost
and.
C
Then
you'll
just
like
route,
the
trunk
like
they
will
be
rerouted.
I
can
imagine
these
like
t-shirts
yeah
like
let's
say
these.
For
short,
so
this
is
gonna
block.
This
is
shorts.
I
should
have
used
some
other
symbol
and
let's
say
they
connected
like
this
and
I
want
to
send
transaction
from
here.
This
is
source.
This
is
destination
right,
so
I
will
just
go,
I
will
not
send
it
directly.
I
will
I
will
write
it
right
so
effectively.
C
B
C
B
These
are
256,
I
haven't
asked
110
24,
but
256,
which
has
maybe
it's
7%.
Of
course,
a
transaction.
We
haven't
see
any
performance
degradation
so
once
we
reach
that
stage
there
may
be
considered
its
proper.
But
when
we
said
oh
looks
like
this
is
another
only
problem
we
want
to
solve
at
this
moment.
Another
way
is
that
we
have
to
just
call
wallet.
Even
so.
B
Basically
this
is
automatic
routing
right,
so
they
say:
I
tell
sauce
destination
and
your
routing,
and
we
can
also
use
the
wallet
to
do
some
manual
routing
by
issue,
multiple
construction
sashes,
but
that
will
be
probably
annoying
to
users
but
at
least
at
a
current
moment,
fix
motors
near
12,
456
and
test
different
work
percentage.
Of
course,
our
chance
and
I
haven't
seen
any
performance
degradation
there.
A
A
A
C
B
There's
the
refund,
but
we
found
thanks
to
our
addresses
space,
every
every
I
would
say:
I
was
every
160-bit.
We
can't
public
key
in
theory.
Address
recipie,
you
has
corresponding
add,
has
corresponding
edges
in
all
chains.
So
in
this
case
we
won't
return
this
remaining
to
back
to
this
account,
because
we
feel
this
is
make
concessions
as
a
more
efficient.
B
It
would
just
refer
to
a
local
account
by
changing
I
would
say
we
are
necessary
to
bits
like,
like
IP
address,
to
indicate
which
drives
basic
operating
and
sorry
we
return
to
the
local,
and
because
we
see
this
is
very
small
amount,
and
we
have
this
small
wallet
who
able
to
collect
all
this.
If
use
of
file
out
there,
too
many
balances
different
charts
and
they
want
to
clap
back,
but.
B
B
Actually,
in
ours
design,
the
cost
like
some
etherion
is
doing
a
course.
A
transaction
is
roughly
with
start
with
disk
an
initial
instructions
on
hands
discuss
right,
so
we
add
another
9000
transaction.
This
is
a
basic
kind
of
the
cost
gas
cost
for
internal
transfer
right
because
we
treat
this
kind
of
like
it
runs
a
big
smart
contract
with
internal
transfer,
and
so
actually
the
cost
between
close,
a
transaction
in
a
transaction
I
feel
is
it's
not
so
significant
yeah.