►
From YouTube: Eth2.0 Implementers Call #1 [8/16/2018]
Description
A
B
Thanks:
okay,
thank
you,
everyone
for
coming
to
the
yes.
The
first
of
all
is
the
zeroth
cause.
This
is
the
first
all
and
it's
been
rebranded
this
d2o
implementers
coal,
because
it's
going
it
encompasses
a
lot
more
than
just
sharding.
I
guess
some
people
with
data,
a
change
it
to
Jasper.
Although
I
haven't
fully
adopted
that
term
Malik
Castagna
well
so
I'll
have
the
agenda.
Is
there
anyone
new
here
that
once
an
intro
Zak
is
here
from
quick
box
he's
been
doing
some
network
simulation
stuff,
but
we
can
talk
about
that
later.
E
B
B
Concept
implantation
the
past
couple
days,
I
finished
the
IV
to
one
spec
and
at
the
same
time,
have
been
working
with
metallic
editing
the
spec
as
we
found
various
bugs
and
little
issues
and
showers
and
doing
review
on
that.
There's
a
couple
of
minor
things
that
have
been
added
spec
that
are
not
represented
in
this
PR
now,
but
the
PR
is
generally
up
to
and
we're
going
to
get
that
emerges
probably
the
next
day
or
so.
C
Update
we
have
deprecated
the
old
shorty
management
contract
within
our
client
base,
so
we
have
implemented
a
beacon
node
to
our
PC
server
as
a
service,
alongside
with
gr
PC
client
for
the
sharding
client
and
beacon,
no
sufficient.
So
the
shutting
client
in
the
big
and
old
our
communicate
effectively.
We
have
updated
our
proposal
package
in
within
a
shouting
client
to
basically
to
be
able,
integral
with
AB
attention,
via
the
the
RPC
method.
C
Basically
on
the
proposal
can
be
shuffled
and
determine
which
hide
that
that
it
him
propose,
and
then
we
also
have
bigger,
know,
simulating
plots
and
HIPAA
transition
and
then
the
shutting
client
can
be
sent
to
them
and
then
Shannon
client
used
this
to
your
PC
may.
30
2009
can
become
a
tester.
So
then
we,
after
that,
we
basically
verified
that
Abella
data's
can
be
selected,
can
be
successfully
so
that
did
to
propose
for
the
net
start
using
history
opposition.
C
We
also
work
on
aligning
our
code
base
with
the
2.1
spec,
so
we
basically
updated
that
blog
and
then
a
tip
stayed
and
then
the
and
then
the
crystallized
a
field
we're
using
the
latest
shuffling
and
in
the
cutoff
algorithm
and
then
the
helper
functions.
We
also
open
up
a
discourse
server,
which
is
a
which
is
a
bridge
with
the
collection
room,
so
feel
free
to
join
us
there
and
think
is
not
a
hub
and
have
in
consumption
forward.
We
plan
to
work
on
for
choice,
to.
C
B
G
G
G
End
of
the
next
week
we
are
trying
to
follow
this
back
in
those
points
that
are
well
defined
by
this
bit
and
try
to
keep
it
simple.
For
those
like,
for
example,
for
initial
validators
committee,
we
decided
to
us
to
just
use
the
first
register
rate
validator
as
a
committee.
That's
a
visible
tool
to
make
first
bunch
of
box
yep.
E
H
K
L
M
A
Hey
Danny
yeah,
quick
update
from
our
side,
so
obviously
no
sort
of
farting
related
progress
at
the
moment,
we're
mostly
working
on
tooling
for
developing
and
deploying
smart
contracts
in
two
stacks,
which
is
rust
in
assembly
script,
primarily
rust.
We're
also
working
on
adding
support
for
multiple
VMs
into
Hera,
which
is
our
sort
of
sandwich
layer
that
connects
to
CPP,
aetherium
and
death
as
well.
And
when
that
work
is
done,
we
can
begin
working
on
an
execution
engine
prototype
for
sharding
phase,
two
or
whatever
phase
that
is
now.
I
So
we've
been
working
on
the
JavaScript
implementation
of
the
beacon
chain
so
right
now
we're
working
on
implementing
the
state
register
functions
and
we've
been
directed
by
mummy
on
a
pure
jazz
implementation
of
bilis
signatures
are
you've
been
looking
at
we're
most
likely
going
to
go
with
that,
and
then
your
future,
even
though
it's
not
really
one
to
one
with
the
iPhone
implementation.
But
it's
a
really
good
start
within
the
next
two
weeks.
I
N
I
N
It's
not
finished
yet
so
we'll
keep
working
on
it
and
we
also
had
darker
image
available
and
we
work
on
open
Tracy.
We
serve
a
home
tracing
and
used
app
as
tracer
and
collector,
and
we
met
some
problems.
So
there
are
some
issues
about
the
GS
of
it
is
in
this
package
management
management
tool
for
our
DFS
and
on
some
issues
related
to
the
p3m
we
recorded
in,
get
it
fixed
and
we
also
has
more
documents.
N
So
we
there
there's.
Currently
they
are
currently
summary
readme
file
and
the
document
in
the
PR
and
will
be
merged
soon
and
currently
we're
doing
the
refactoring
and
restructuring.
Because
the
previous
code
is
not
so
merger,
so
we'll
make
it
more
readable
and
yeah
and
and
understandable,
yeah
and
more
debugging,
because
there
are
still
some
issues,
not
sure
if
it
is
on
the
PDP
side.
But
we'll
we
will
find
it
out
and
to
do
in
the
next
two
weeks,
well,
focus
more
on
communicate
our
current
code
with
the
python
site.
N
So
because
we
want
a
workable
program
that
can
communicate
with
the
final
sites
so
that
we
can
do
some
experiment
in
the
Python
side.
And
we
will
also
serve
a
more
about
the
deployment
tools
and
testing
tools.
And
that's
my
update.
B
O
Yes
sure,
thank
you
maybe
a
little
bit
of
background.
My
goal
here
is
to
compare
different
gossip
and
discovery
protocols
and
see
how
they
perform
and
if
they're
suitable
is
fast
and
also
maybe
what
requirements
they
have
on
the
nodes
in
the
network
regarding
latency
and
throughput,
for
example,
so
that
eventually
we
can
choose
the
best
one
from
all
the
opportunities
we
have
and
to
do
that
I'm
using
a
framework
called
domme
net.
It's
a
C++
framework
for
discrete
event
simulation,
so
there's.
O
Actually,
no
real
networking
going
on
everything
is
running
on
a
simulated
on
a
single
machine
which
of
course
has
the
disadvantage
that
it's
a
little
bit
less
realistic,
but
therefore,
but
what
you
get
for.
That
is
that
you
can
basically
scale
as
much
as
you
like.
You
can
add
as
many
notes
as
you
like,
and
you
pay
for
that
only
by
simulation
time
and
I've
done
some
performance
tests.
That
was
the
first
thing
I
did
and
it's.
O
It
seems
to
be
possible
to
run
simulation
with
up
to
100
thousand
nodes,
which
is
very
nice,
because
I
think
that's
roughly
the
size
that
we
are
trying
on
roughy.
The
number
of
validated
you're
trying
to
support
yeah
and
I
got
some
first
results
and
first
I
looked
into
a
piss-up,
which
is
basically
the
proposed
successor
of
gossip
table
and
proposed
by
the
lip
Adobe
team.
O
It's
still
only
specified,
there's
no
implementation
yet
so
implemented
in
in
my
simulation
and
what
I
looked
at
is
and
the
number
of
nodes
of
hops
it
takes
for
a
message
to
propagate
through
the
network
or
to
reach
more
than
9%
of
the
network,
and
unfortunately,
the
result
I
got
was
a
bit
negative
and
the
numbers
quite
large.
It
takes
something
between
20
and
40
hops
to
reach
to
propagate,
for
the
network,
for
network
sizes
of
5,000
to
20,000,
nodes
and
I.
O
Think
that
number
is
yet
too
large
to
to
support
the
short
work
times
we
want
to
have
and
therefore
I
just
think
we
should
not
use
this
office
ft
sub,
at
least
not
in
its
current
state.
In
the
spec
they
mentioned
that
they
have
some
optimizations
in
mind,
but
they're
not
there
yet
so
when
they
do,
we
have
to,
of
course
revisit
that,
but
for
now
I
think
it's
not
not
a
good
idea.
O
O
O
B
So
I
want
to
introduce
Zack
from
white
box
Zack,
Zack
and
I
have
been
talking
for
a
number
of
months.
He
was
actually
going
to
begin
to
do
some
network
simulation
work
on
the
FFG
contract
side
of
things
he's
been
a
year
to
help
out
I
know
he's
been
spending
some
time
getting
to
play
with
the
research
this
week
and
I
wanted
to.
P
Yeah,
hey
how's
it
going
yeah
I
think
it's
important
to
also
clarify
that,
unlike
e
annex
work,
we're
actually
capable
of
emulating
Network,
behaviors
and
activities.
So
we
can
like
functionally
replicate
that
activity
in
a
in
like
real-time
with
like
accuracy,
so
you
can
realistically
observe
performance.
So
we
spent
the
past
week
going
through
the
code
in
the
in
the
charting
PGP
POC
repo,
and
we
made
some
changes
and
made
some
pull.
Requests
and
I
opened
an
issue
number
43
for
testing
methodology.
P
That
kind
of
provides
like
a
high-level
overview
of
what
we're
capable
of
doing
what
I
think
would
be
the
most
relevant
to
this
particular
use.
So
I
just
wanted
to
put
something
out
there.
So
I
could
get
the
ball
rolling
because
I
think,
like
the
methodology
and
test
cases
should
be
established
using.
You
know,
community
input
and
not
just
like
dictated
by
me
and
what
I
think
is
best.
So
I
want
to
be
the
the
most
useful.
P
P
Yeah,
so
I
listed
them
all
out
on
this
thing,
so
like
the
ability,
primarily
the
ability
to
like
observe
the
the
abilities,
are
like
validators
to
subscribe
to
new
topics
and
send
and
receive
messages
pertaining
to
that
topic
and
like
the
allotted
amount
of
time.
So
some
things
that
we
would
do
is
like
number
of
nodes
latency
between
those
nodes.
P
What's
the
maximum
amount
of
network
latency
that
each
individual
node
can
tolerate
before
performance
begins
to
degrade
and
what
are
the
security
implications
of
that
like
latency
between
shards
intermittent
blackout,
conditions,
it's
like
high
degrees
to
packet,
loss
or
dand,
with
the
constraints
adding
and
removing
nodes
at
random
and
adding
and
removing
them
at
set
intervals,
introducing
a
high
volume
of
nodes
simultaneously.
We
could
also
like
test
observe
like
partition.
P
Tolerance
like
when
segments
of
nodes
are
prevented
from
communicating
with
each
other
and
just
also
performance
like
sending
and
receiving
messages,
but
in
the
set
period
of
times
and
repeat
so,
we
could
essentially
stress
test
it
and
also
the
process
of
like
joining
and
leaving
shards
like
subscribing
and
connecting
to
other
nodes
with
the
bird
and
synchronizing
collations
and
shard
preference
tables
and
unsubscribing.
So
pretty
much
all
of
those
practical
functions
we
can
test
at
scale
and
test
them
realistically
because
they
would
fully
be
performing.
So
we
do
it
in
our
network.
P
We
actually
observed
them
perform
in
real
time
real
life,
so
we're
not
really
using
simulations,
which
are
like
mathematical
assumptions.
We're
like
functionally
observing
these
these
these
behaviors
and
these
performances
so
I
think
that's
about
it
right
there.
But
if
you
guys
want
to
check
out
this
testing
methodology
that
I
posted
I
mean
it's
just
a
high-level
document
to
just
communicate
what
we've
done
so
far.
P
We've
only
been
actually
working
on
this
for
like
the
past
week
or
so,
but
I'm
assigning
a
couple
guys
from
my
team
to
help
out
on
this,
so
feel
free
to
give
us
whatever
you
got
and
well.
We
can
run
all
of
these
tests,
and
so,
since
it'll
be
run
locally
in
our
lab,
we
could
also
provide
access
to
the
tests
network
to
any
of
you
guys
if
you
want
to
access
it
via
like
SSH
or
something
like
that.
We'll
set
you
up
with
an
account,
so
you
can
come
in
and
run
your
own
tests.
P
If
you
want,
oh,
my
god,
Emily
will
will
be
willing
to
donate
that
to
the
cost.
So
it's
just
all
you
know
what
you
guys
would
think
it
is
best
and
if
you
want
to
see
like
a
demo
or
like
check
it
out
or
something
like
that
or
have
any
other
questions,
we
could
just
talk
about
that
off
offline
and
once
you
have
anything
pressing
right
now,.
B
O
P
P
P
P
B
E
B
Yeah
and
once
once
we
have
so
this
is
this
can
be
useful
for
the
kind
of
proof
of
concept
stuff,
but
this
might
also
be
when
we
actually
have
a
number
we
can
chain
client.
We
can
do
other
types
of
simulations
on
actual
clients,
rather
than
just
these
kind
of
proof
of
concept.
Testing.
Definitely
cool.
B
R
R
Roll
is
basically
the
same
and
I've
been
looking
into
your
some
kind
of
Lewis
crime
were
speculative
things
around,
like
51
percent
mitigation
and
data
availability
checked
in
for
sharding,
but
that's
not
really
relevant
to
and
in
very
short
term
clients
an
element
all
right,
but,
like
you
probably
will
become
relevant
in
me
at
some
point
when
we
start
actually
building
at
the
sharding
side
and
building
the
short
charting
laid
claim
code.
So
it's
not
weird
it'll
be
in
the
very
first
version
of
it.
B
F
Yeah
sure
I
just
been
assigned
to
play
around
pushing
it
around
the
network
and
I
guess.
Maybe
it
might
be
interesting
to
hear
from
prismatic
labs
what
they're
doing
I
mean
I
guess
the
easiest
thing
to
be
would
just
be
kind
of
like
copy
that
they
eat
1.0
by
a
part
of
them
now,
but
I
just
kind
of
wanted
to
raise
it
because
it's
you
know
having
that
thing
specify.
This
is
something.
S
That
way,
hey
Preston
here
from
prismatic,
so
what
we're
doing
right
now
is
for
just
where
we
were
until
week
and
a
figure
out
what
messaging
format
we
want
to
use
for
just
using
protocol
buffers,
because
as
long
as
it's
a
single
client
implementation
and
we
trust
the
packets
from
ourself
like
it's
gonna
work.
So
you
know
we
are
aligned
on
the
same
I
do
know
we
need
to
like
figure
out
what
the
performance
gonna
be,
but
right
now
we're
just
using
protocol
buffers.
S
F
B
F
S
So
we've
defined
specific
messages
for
I
guess
each
topic,
so
all
of
our
communication
is
going
through
like
gossip
sub
or
flood
subtopics,
and
so
each
topic
has
its
own
message:
type,
that's
associated
with
it.
So
if
you
doing
like
a
like
asking
for
a
block,
then
you're
sitting
like
requests
and
getting
a
different
message
back,
which
is
a
you
know,
give
block
response
or
just
a
block
yeah.
B
G
F
R
D
R
R
Because
no
ml
of
service
attacks
consisting
of
extending
proof
of
stake
blocks
that
are
male
formatted
in
some
way,
they're
just
wastes.
That's
argit's
time.
I
see
I'm,
look
slightly
worried
about
this
because
we
have
these
big
hulking
BLS
signatures
that
all
take.
Well,
oh,
you
know
I!
Guess
it's
not
that
bad
if
there
are
sizes
bounded,
but
once
their
size
goes
up
to
like
a
few
hundred
each
I
guess
it's
still
doable,
but
I
can
still
worth
having
in
the
back
of
our
minds.
R
R
R
R
Well,
if
you
wants
to
do
this
right
when
you
make
a
proof
like
inside
of
that
proof
you
when
I
came
it's
no
more
coal
route
and
then
for
any
message,
you
would
review
lemarchal
branch
and
that
way
you
can
make
each
proof
counts
for
messages,
but
you
don't
necessarily
need
to
do
that
because,
like
what
you
do
is
the
point
of
the
proof
is
to
basically
prove
that
some
particular
public
key
like
some
newly
generated
special-purpose
public
key,
is
owned
by
the
same
entity
that
also
owns
one
of
the
bit
was
some
unknown
one
of
yeah
big,
a
validated
public
use,
and
then
that's
better.
R
J
F
B
F
Guess
I
can
say
something:
I've
been
looking
into
a
little
bit:
I
keep
meaning
to
run
like
some,
some
comparisons
between
different
serialization
formats
and
how
long
they
take
and
the
message
size
and
the
network
and
stuff
like
that,
but
I
haven't
got
around
to
it.
The
flames
were,
though,
but
I'm
kind
of
liking.
R
When
you
say,
ESS
Zed,
like
I,
think
I
accidentally
made
two
versions
that
I
both
called
simple.
So
you
realize
where
one
is
basically
a
very
simplified
version
of
our
Opia,
where
the
lengths
we
fix,
as
always
to
be
bytes
and
the
other
is
the
thing
where
things
that
are
constant
size
like
this
or
make
everything
is
typed
and
things
that
are
constant
size
map
to
a
constant
byte
position
so
which
one
of
the
two
were
you
talking
about.
F
F
B
Okay
cool,
so
we
I
think
we've
discussed
everything
through
for
has
anyone
given
any
thought
to
bootstrapping
the
initial
validator
set
and
not
something?
We
need
to
immediately
come
to
consensus
on
today,
but
it's
something
that
we
need
to
figure
out
and
at
some
point.
So
the
idea
is:
how
do
we
have
our
initial
validator
set
in
I?
Guess
our
Genesis
block
and
the
beacon
chain
there's
kind
of
a
chicken-egg
problem,
because,
especially
because
we
were
discussing
having
the
beacon
chain
validating
all
of
the
incoming
data
from
the
validators
so
like
dating.
B
Their
existence
is
a
signature,
the
what's
it
called
the
DLS
road
key
attack
stuff.
But
if
you
don't
have
an
initial
valid
or
set
to
validate
these
incoming
messages,
you
don't
just
issues
there.
I
know
a
number
of
chains
are
kind
of
dealing
with
this
problem,
or
at
least
from
like
a
first
from
a
jet
that
necessarily
porting
from
an
existing
chain,
but
they're
they
do
have
to
deal
with
the
Genesis.
A
lot
of
problems
are
probably
interesting
to
work,
to
look
at
what
other
people
are
doing,
but.
E
R
If
cerium
did
not
use
the
test
net
to
seed,
the
Genesis
board
right
well,
the
way
etherium
seeded,
the
Genesis
blog
is
that
basically,
there
was
a
Python
scripts
that
anyone
could
run
which
would
scan
the
Bitcoin
blockchain
and
check
who
participated
in
the
sale
and
automatically
assign
them
eath.
So
I
mean,
if
that's
what
we
want
to
do.
That's
Pro
actually
a
totally
fine
approach
as
well
right.
So
the.
R
B
B
R
B
B
Cool
okay,
so
quickly,
we've
been
discussing.
It
was
just
last
time
about
having
some
sort
of
Def
Con
charting
Meetup,
so
I
camera,
the
exact
date
of
Def
Con,
but
a
day
or
two
before
that
status
was
has
a
space
for
their
hackathon
there's
a
potential
that
there
might
be
some
space
there
if
anywhere
for
status,
has
any
thoughts
on
that.
At
this
moment
you
sure.
Q
Yeah,
so
we've
discussed
it
internally
and
given
the
hackathon
and
other
things
happening
at
the
venue,
the
best
date
for
us
would
be
Friday
the
26th,
which
places
us
a
couple
of
days
before
the
DEF
CON
event.
It's
out
I'm
also
wanted
to
check
with
the
group
how
much
time
we
would
need
this
is
a
day
half
they
more
or
less.
B
A
B
B
Everyone
up
meet
everyone
and
kind
of
facilitate
collaboration
on
some
of
the
things
that
we
have
been
meaning
to
dig
deeper
into
into
some
things
that
maybe
we've
been
talking
about
on
internet,
but
we
haven't
come
to
full
agreement
on
so
you
know
updates
some
sort
of
like
research,
QA
and
then
maybe
a
few
things
that
we
specifically
want
to
spend
some
time
digging
deep
into
to
get
progress
on.
That's
just
off
the
top
of
my
head.
What
I
think
would
be
useful
anybody
have
other
comments
on
that.
Would.
B
B
Q
B
B
Figure
that
out
a
little
bit
more
they're
coming
I.
Q
B
F
F
R
F
R
F
R
F
F
Cool
I
made
her
like
a
reference
implementation
in
in
that
shuffling
Reaper,
that
is
slower,
but
it
kind
of
like
separates
the
RNG
and
a
shuffle
are
adding
two
separate
components
to
make.
Gives
me
to
understand
and
and
I
got
those
two
matching
so
I
think
it's
right
thing.
You
know
I've
been
wrong
before
yeah.
F
Cool
and
for
the
other
implementers
to
the
a
little
shuffling
sandbox
thing:
I
have
it'll
output
reference,
it'll
output,
a
shuffled
array
given
a
seed
and
in
the
readme
there's
a
couple
of
them.
So
you
can
use
that
like
to
test
like
if
you
want
to
just
put
a
test
in
there
with
your
array
burst
that
won't
see
if
it
matches
and
that's
that's
an
easy
way
to
do
it
to
save
you
like
pulling
apart
the
be
contrarian
implementation.
R
P
R
And
I
feel
like,
since
we
have
two
implementations
that
are
basic,
we're
running
a
full
vegan
chain.
We
can
pin
it.
It
probably
is
too
early
to
keep
expecting
consensus,
but
there's
two
proposed
add
testing
Lang
spec.
That
idea
had
made
a
few
days
ago
and
I
thought
I'd
bring
this
up
and
see.
I
guess
that
thing,
but
basically
the
idea
is
I'm
Sierra,
let's
see
if
I
can
imma
throw
it
into
the
chat.
No,
not
not
that
sorry
wait.
What
is
it?
Oh,
you
know
that
and
that's
what
it
is.
P
R
R
Testing
inspect
sure
I
guess
like
the
thing
I'm
asking
right
now,
is
for
people
to
look
at
that
dog
and
see,
if
that's
an
approach
that
makes
sense
and
if
it
is
then
like
you
know,
make
sense
to
start
like
that.
Little
part
of
the
implementation
should
be
an
implementation
of
interpreting
the
test,
the
tests
and
running
them
yeah.
B
G
B
B
B
Great
then,
let's
plan
on
doing
another
one
of
these
one
week
from
today
I
will
create
an
issue.
Did
everyone
see
the
new
east
to
OPM
repo,
where
this
is
all
all
belong?
I
share
the
blank
a
couple
times
in
the
gutter,
so
it'll
exist.
There
I
am
trying
to
take
me
a
couple
days
to
get
these
notes
up,
but
I'll
get
the
notes
up
shared
with
all
the
links,
and
we
can
I'll
put
up
a
tentative
agenda
and
we
can
rally
around
an
agenda
for
cheeks.