►
From YouTube: Eth2.0 Implementers Call #3 [9/13/2018]
Description
A
Everyone
for
coming
I
think
we
have
someone
from
all
the
different
teams.
Is
it
someone
from
solar
parity
here?
Yes,
I
was
expecting
Sheree
this
week.
Maybe
he'll
join
us
a
little
bit,
okay,
so
the
agenda.
Everyone
has
the
agenda.
First,
we
do
client
updates
and
research
updates
and
a
couple
of
specific
things
about
the
call
and
then
that'll
be
about
it.
A
D
Couple
highlights
from
our
side:
basically,
we
welcome
keeping
up
and
then
kicking
off
lining
our
co-pays
with
the
2.0
inspect
so
right
now,
every
pretty
much
caught
up.
We
implemented
the
new
stage
calculation,
we
implemented
a
new
dynasty
calculation
and
the
only
thing
left
is
the
balance
recalculation
related
to
the
related
to
the
FFG
rewards.
On
top
of
that,
we
also
implemented
the
validator
service,
which
talks
to
the
vision,
note
beard
gr
PC.
We
implemented
partial
closure
responsibility,
which
includes
proposal
north
when
it's
his
turn
to
propose
become
blood.
D
A
package
is
the
pending
at
the
station,
send
up
an
extended
blood
back
to
the
big
engine
note
to
broadcast.
We
also
implemented
partial
attached.
Your
responsibility,
which
means
the
tester,
receives
the
incoming,
become
blood
verify.
The
victim
block
is
indeed
the
head
vote
on
it,
and
it's
in
that
test
session
back
to
the
B
channel
to
broadcast
and
then
a
few
other
sightings.
We
also
referred
our
home
base
for
breathability
so
which
makes
it
easier
to
onboard
newcomers.
We
convert
most
of
the
blog
and
the
stay
processing
functions
into
like
pure
function.
D
B
Starting
to
plan
out
a
pairings
library
implemented
in
pure
jazz,
we're
still
going
to
do
research
phrase
before
actually
implementing
it.
So
that's
still
a
thing
that
we're
working
on
the
other
libraries,
of
course
gossips
up,
so
we're
still
working
on
the
research
for
that
before
we
actually
start
writing
code.
B
After
that,
we're
hoping
to
start
building
a
deal
with
signatures
library
so
that
people
could
use
bilis
signatures
in
browser
or
for
any
other
project.
We're
hoping
to
also
implement
within
that
Billis
scale
will
be
less
signature,
aggregation
and,
lastly,
we're
all
open
to
build
a
verifiable
delay
function,
library
so
that
people
could
use
for
a
full
delay
functions
for
any
project
that
they
have.
Even
if
it
turns
out
that
verifiable
delay
functions
are
broken,
I
think
it
so
being
available
on
implementation
and
research
project
for
the
whole
community
I'm.
So
that's
Dayton
and.
E
We
raise
an
issue
and
get
new
shuffling
and
moving
forward.
We've
got
more
resources
coming
on
to
the
project.
Just
exciting,
we're
gonna
start
working
a
bit
more
on
state
transition,
logic,
trying
to
apply
pretty
serious
rigor
to
everything
that
we
implement
and
then
we're
gonna
start
working
on
some
ancillary
libraries
I'm
thinking
this.
You
know
that
big
big
types
that
rust
doesn't
have
so
from
Erin.
F
Analyzing
latest
Kasper
and
modeling
it
and
looking
for
ways
to
test
it
out
practically
the
blades
who's
joined.
The
call
has
been
he's
been
with
us
a
week,
but
he's
getting
up
to
speed
with
peer-to-peer
protocols
and
looking
at
live.
P2P
and
I've
kicked
off
a
project
with
a
couple
of
others
to
finally
write
some
code
for
this
beacon
chain,
so
we're
just
getting
up
to
speed
or
that
a
little
bit
late,
idli,
because
it's
all
systems
go
on
that
now
great
about
Nimbus.
F
A
G
The
fortress
role,
so
we
have
a
part
of
that
mummys
writing
here-
that
he
has
a
concern
about
using
sequence
of
hash
tables
of
heterogeneous
types.
There's
a
discussion
and
easy
research
about
that.
Please
check
it
out
and
the
other
thing
the
alt
BN
one
two,
eight
something
that
we
might
have
to
implement
from
scratch.
G
A
E
A
Dynasty
transition
logic
and
Ganassi
to
be
featured
with
committee
shuffling
a
short
time
sup
day,
doesn't
included
testers,
which
are
a
part
of
the
next
milestone.
According
to
our
roadmap.
During
the
previous
column
mission,
it
would
be
great
to
outline
an
updated
beacon
change
eb
scheme
which
that
was
more
suitable
to
clients,
but
so,
while
working
on
state
transition,
we
can
pollution.
That
requires
more
insight
to
get
there
so
potential
proposals
on
changing
some
of
the
state
structure
from
the
guy
all
next
week.
Next
time,
I
know
after
is
here
from
parity.
A
A
H
So,
what's
what
status
own
party
would
be
probably
a
start
working
on
a
new
client
for
is
2.0
stuff,
but
that's
just
an
idea.
So
far
we
have
no
resources
allocated
right.
Now
we
don't
have
nobody
actually
looking
into
the
spec
right
now
so
yeah,
that's
basically
how
to
sum
this
up.
What
we
are
doing
is
we
are
having
like
team
meeting
and
then
personal
team
meeting
in
two
weeks
and
one
of
again
topics
will
be
easier
to
point.
H
A
A
J
C
K
So
now
thinking
about
some
of
the
subtleties
around
the
programming
program
program,
ability
of
the
modulite,
so
do
we
want
the
vdf
ASIC
to
have
a
hard-coded,
modulus
or
programmable?
It's
looking
like.
We
want
them
to
be
hard-coded
at
this
point.
Another
thing
is
it's
possible
that
if
we
choose
the
modulus
very
carefully
or
the
modular
very
carefully,
then
we
can
have
huge
gains
in
terms
of
reducing
the
number
of
logic
gates
in
music.
K
K
K
Also,
some
new
provers,
so
the
way
that
BDS
work
is
that
they
compute
the
output
and
then,
in
addition
to
the
output,
that's
a
proof
that
is,
that
is
constructed
and
some
of
the
provers
well
there's
two
types
of
previous
and
one
which
is
the
whistle
Oscar
Cooper,
which
is
optimal
in
size.
But
it
is
optimal
in
terms
of
efforts
to
complete
the
proof
and
then
what
one
which
is
super
low
effort.
K
But
it's
much
longer
when
it
turns
out
that
there's
some
hybrids
between
the
two
which
which
are
very
much
terms
of
actually
building
on
own
sake,
I
found
this.
This
team
called
obelisk
and
they
have
this.
This
service
called
Ovilus,
Launchpad
and
I.
Think
it's
the
guys
from
ASEA
who
went
ahead
and
built
an
ASIC
for
their
projects,
and
so
that's
like
a
spin
off
of
it
and
they're
right
now
on
the
third
ASIC
and
they
seem
to
be
extremely
knowledgeable
about
the
space.
K
They
seem
to
have
good
contacts
and
they
also
share
the
same
culture
as
us
in
terms
of
openness
and
open
sourcing
and
all-
and
you
know,
we're
potentially
going
to
have
one
produce
produced.
A
report
for
for
us
specifically
on
the
various
tricks
you
can
pull
off
in
a
performance
ASIC-
and
you
know,
in
terms
and
also
in
terms
of
specialized
cooling.
There
are
things
like
nitrogen.
How
much
of
an
advantage?
K
Can
you
get
to
use
that
I'm
in
touch
now
with
so
one
of
the
new
directions
that
were
very
seriously
considering
now
is
having
a
ceremony
to
pick
the
RSA
modulus
a
little
bit
like
what
Z
cash
days.
You
only
need
one
honest
participant
and
the
modulus
is
secure.
As
I
said
it's
on
factorizable
now,
initially
I
thought
it
was
unlikely
that
such
an
approach
would
be
viable.
But
just
just
a
few
months
ago,
at
crypto
2018,
there
was
a
very
big
breakthrough
in
the
NPC's
for
this
RSA
setup.
K
It's
like
10
times
faster
than
than
the
previous
construction,
and
they
could
get
it
down
to
just
a
few
minutes,
and
one
of
the
teams
seems
confident
that
they
can
extend
the
result
about
the
Falcons
without
affecting
performance
that
much
so
the
the
NPC
will
take
a
few
minutes,
which
would
be
amazing
and
then
I'm
also
in
touch
with
couple
of
modular
multiplication.
Research
teams,
one
in
China
one
in
in
Sydney,
and
they
have
very
different
approaches
to
dealing
with
applications
and
it.
K
So
what
one
one
works
extremely
well
on
on
smaller
bits
bit
width,
so
they
can
do
a
256
bit
interpretation
in
just
10
nanoseconds
and
that's
using
some
relatively
old
process.
19
meter,
nanometer
tsmc,
but
if
it
doesn't
scale
as
well,
if
you
increased
the
bit
weight
and
then
you
have
another
approach,
which
is
extremely
scalable,
but
it
doesn't
work
as
well
on
206
bit,
and
so
the
question
is:
how
do
they
compete
on
these
larger
bit
ways?
K
L
A
C
On
the
vdf
working
correctly
to
achieve
the
most
basic
guarantees
of
security,
so
I
mean
if
we
do
assume
that
the
VD
after
that,
the
video
works
correctly,
then
I
mean
naturally
a
lot
of
the
pram.
A
lot
of
these,
you
have
parameters
for
safety
and
the
kind
of
Tolerance.
This
will
be
a
several
times
lower
and
it'll,
be
actually
useful
for
all
the
lawyers
who
applications
and
so
forth.
Right.
M
You
know
larger
scale
and
we'll
also
survey
up
the
other
options
or
sharp
ear
discovery,
because
our
existing
on
approach
to
discover
the
sharp
ear
might
be
not
too
scalable
to
when
the
node
get
very
long.
The
number
of
nodes
get
very
large
so
remind
me
some
other
ways,
other
approach
to
use
as
well
yeah,
that's
my
that's!
Our
update,
I.
M
Also
got
some
results
from
simulations
I,
simulated,
Croatian,
propagation
in
a
single
shot
and
the
parameters
that
I
used
that
were
first,
a
thousand
nodes
in
the
network.
So
for
comparison,
the
currently
theorem
network
has
apparently
about
15,000
nodes
that
are
online
once
a
day,
but
they
would
have
first
fit
up
to
all
the
shots.
So
I
think
it's
safe
estimate
and
for
bandwidth.
I
use
the
distribution
that
I
found
in
a
paper
that
tried.
N
Yeah
and
I
mostly
looked
at
gossips
up
there
and
unfortunately,
I
didn't
really
find
anything
that
was
too
surprising.
That's
just
a
couple
of
things.
I'd
like
to
mention
first
thing
is
that
maximum
correlation
size,
and
that
was
possible
in
this
network,
was
about
a
three
mega
belt
I'm,
given
an
8
second
block
time,
so
I
think
the
one
megabyte
we
are
currently
targeting.
If
I
remember
correctly,
you
should
be
fine.
N
Also,
second,
thing
is
basically
all,
but
the
slowest
node
in
the
network
have
bandwidth
available
at
all
times
or
almost
all
times,
and
that
bandwidth
can
be
used
for
a
sinking
of
XP
for
the
white
back
of
elevators,
and
this
is
nice
because
it
means
that
the
length
of
the
wine
pack
is
only
limited
by
basically
the
download
speed
of
the
validators
and
not
by
the
network
itself,
at
least
as
as
long
as
they
are
not
too
many.
The
latest.
N
One
thing
to
keep
in
mind,
though,
is
that
this
should
be,
of
course,
proportional.
It
was
a
bandwidth
at
each
node
test,
because
otherwise,
if
you
have
small
note
and
a
big
number
of
keys-
and
that's
not
good
I-
also
tested
the
push-pull
protocol,
but
I
didn't
really
see
an
improvement
over
gossip,
so
I
don't
think
I
will
continue
investigating
this,
at
least
not
at
the
moment,
because
there's
peer
discovery
I
think
it's
the
more
complicated,
more
important
part.
If
I
look
at
now
and
I
want
to
look
this
next.
N
I
summarize
these
results
in
an
issue.
If
you're
interested,
you
can
have
a
look,
I
hope,
gonna
post
the
link
in
the
chat
yeah,
but
in
basically
a
conclusion
is
that
I,
like
awesome,
stuff,
I,
think
it's
simple
I
think
it
performs
good
enough.
It
can
handle
the
load
that
we
want
and
also
that
I
blocked
him
that
we
want
so
I.
Don't
see
a
reason
why
we
should
not
use
it.
That's
it
great.
That's
exciting,
to
hear
that
your
research
is
only
more
more
solidifying.
That
is
the
intuition.
Rather
than
throwing
us
off.
N
C
So
in
the
the
thought
is
to
have
kind
of
subsections
of
the
network
that
are
responsible
for
gathering
and
then
aggregating
signatures
before
they
get
to
the
proposer.
Yeah.
Basically
things
like
that.
So
the
idea
would
be
that
every
that
there
would
be
a
subset
of
nodes
that
would
just
voluntarily
out
allocate
themselves
some
random
slice,
like
possibly
some
multiple
of
256
and
then
they'd
be
responsible
for
Granum
grabbing
grabbing
everything
within
that
subset
and
then
they'd
push
it.
C
Maybe
one
could
just
basically
everyone
who
wants
to
send
an
invitation,
can
just
wait
random
amount
of
time
and
see.
Is
there
other
stations
coming
in
and
then
a
great
gate,
then
this
problem
with
unstructured
attestation
is
that
then
you
get
you're
likely
to
get
a
lot
of
address
nations
that
kind
of
copy
mess
or
that
have
redundant
and
invalid
leaders
between
each
other
than
when
you
ever
done
invalid
leaders.
You
can't
merge
the
two
anymore.
N
C
C
C
C
O
C
You
know
this
does
require,
like
a
bridge
dough
and
some
kind
of
multiple
rounds
of
communication
and
so
forth,
which
is
basically
my
rationale
for
kind
of
suggesting
increasing
the
slot
lines
for
me
to
16.
But
I,
don't
really
see
a
wage
like
it
feels
kind
of
fundamental
out
here
that
if
we
wants
to
sort
of
square
root,
the
bandwidth
we'd
have
to
double
the
latency
or
if
we
want
to
brew
the
bit
the
bandwidth
we'd
have
to
like.
C
C
C
We
could
probably
pump
those
numbers
out
pretty
easily
and
I.
Imagine
a
couple
of
other
implementations
could
as
well
so
I
can
make
an
interview
around
that
and
whoever
wants
to
do
the
benchmark
can
put
the
data
there,
so
we
can
look
at
it
next
time.
Yeah
sounds
good
and
you
know
I'm
not
interested
in
like
super
high
rigor,
I'm,
basically
just
interested
in
ballpark.
C
C
F
C
C
K
K
O
L
A
P
A
A
R
R
E
S
A
Cool,
so
maybe
we're
not
ready
to
make
a
firm
decision,
but
we
are
getting
closer
and
closer
to
being
confident
about
assets
or
being
ready
to
move
forward
with
Austin
sub
and
maybe
on
the
two
to
four
week
horizon.
We
can
become
even
more
confident,
maybe
even
testing
it
I
guess.
The
existing
discovery
mechanism
should
all
still
work,
because
if.
N
A
M
M
If
we
have
some
common
endeavors,
some
on
the
same
code
base-
and
we
can
just
and
also
to
use
this
code
as
well,
this
is
what
I
think
the
protocol
labs
guys
did
for
ipfs.
You
can
use
ipfs
from
different
languages
and
they
provided
a
HTTP
daemon
to
read
you
connect
so
yeah,
maybe
like
Kevin
said
we
can't
do
something
like
that.
M
R
Where
you
can
talk
to
an
existing
implementation
and
another
language
are
probably
good
measures
for
the
time
being,
I'm
very
close
to
being
to
being
able
to
say
like
if
you
want
to
build
out
an
implementation
language
like
what
let's
go
for
it,
because
it's
what
we're
gonna
use.
No,
that
said,
I
guess
the
research
team
isn't.
I
A
A
D
A
A
D
C
Then
I
would
assume
that
its
next
goal
after
that
is
to
try
and
ensure
that
every
shot
is
attested
to.
But
there's
some
cases
and
I
made
an
issue
for
it.
Where,
like
it
would
be
possible
to
spread
the
validators
evenly
across
the
slots
and
then
form
enough
committees
that
are
above
minimum
community
size
or
on
it
and
attest
to
every
shot.
But
it's
not
actually
doing
that.
It.
A
E
Two
times
main
committee
size,
the
goal
right,
but
basically
the
intention
is
for
it
to,
for
the
king,
for,
for
the
men
can
be
decides
to
be
a
mini
committee
size
and
not
a
targeted
committee
size
right.
So
I
guess
a
number
of
a
leaders
approaches
infinity
the
the
committee
size
definitely
should
kind
of
stabilize
us
coming
very
close
to
twice
the
minimum.
E
C
What
what
I
wouldn't
mind
doing
just
from
a
like
a
software
perspective,
is
just
trying
to
write
out
some
requirements
for
it,
just
so
that
I
can
I
can
kind
of
clearly
understand
it
and
test
it.
So
maybe
I
can
try
and
I
can
try
and
work
on
that
and
I
can
get
some
feedback
from
from
you
Vitalik
and
yes,
researches
yep
definitely
sounds
very
good
yeah.
Okay,
great
thanks
for
telling
I
looking
at
validating
a
block
when
it
comes
in
specifically
I've
been
trying
to
make
it
so
I
can
kind.
E
Of
like
reject
a
block
as
quickly
as
I
can
once
I
figure
out
that
it's
invalid,
so
that
people
can't
Doss
us.
Basically,
so
one
of
the
things
that
I'm
thinking
is,
you
know
someone
sends
this
is
block
and
it's
got.
You
know
a
thousand
of
tests,
a
station
records
and
it
takes
us
some
time
to
to
validate.
E
Out,
oh,
it
turns
out
that
the
block
produces
signal
just
wasn't
in
there.
So
I
don't
like
it.
It
would
be
cool
if
there
was
a
way
that
I
could
really
easily
like
first
go
and
say
you
know,
did
the
block
producer
sign
this
block?
Is
that
something
that
exists
already?
Who,
if
you
know
one
thing
that
we
could
do
I
think
is
I'm
not
even
sure
if
it's
in
the
spec
yet,
but
it
should.
E
Oven
size
by
two
times
main
committee
size
signatures
right,
so
the
cost
of
verifying
like
well
that
one
as
a
station
should
be
very
small.
Also,
the
the
doubt,
the
validity
rule
for
the
proposer.
Signature
is
actually
that
the
parent
proposer
is
included,
but
I
shouldn't
I
shouldn't
process
a
block
unless
I've
seen
the
signature
come
in
on
the
wire.
So
there's
these
four
conditions
before
I
process,
the
block
and
one
is
like
being
in
the
correct
spot
time.
But
one
is
that
I've
received.
C
A
I
A
E
A
Today
anything
else
Oh
discovery
protocol.
It
seems
like
we
are
not
ready
to
make
any
sort
of
informed
decision
on
the
discovery
protocol
and
that's
something
that
Yannick
and
some
of
the
other
researchers
at
the
time
on
soon
so
looking
table
that
decisions
cool
any
other
v21
and
points
of
discussion.
A
I
E
P
E
C
The
answer
is
correct
right
because
it's
like
the
point
is
that,
because
it's
in
32
and
in
32
is
always
have
four
bytes,
then
you
know
it's
just
going
to
be
four
zero
bytes,
like
the
the
one
inside
the
beacon
chain,
was
basically
designed
in
order
to
really
optimize
for
the
ability
to
assay
to
have
direct
mappings.
That
say,
like
the
780
v
bite
of
some
particular
value
corresponds
to
this
item
of
this
array
of
this
variable
of
this
struct
of
this
V
inside.
C
Which
basically
means
like,
and
that's
intended
to
kind
of
speed
up
blog
processing?
Basically,
because
you
know
theoretically
like
in
some
optimized
implementations
like
you-
would
never
even
need
to
serialize
fergie
serialize
a
bunch
of
things,
you
would
just
kind
of
use
the
data
structures,
as
is
so,
but
it
definitely
sacrifices
on
kind
of
space
optimality.
In
order
to
achieve
that,
and
so
you
might
want
to
compress
a
make,
a
compression
wrapper
eventually.
C
E
C
C
Okay,
right
here
sit
so
this,
so
this
is
actually
wrong
and
it
should
be
giving
us
full
byte
size
right.
Is
that
right?
No,
no!
It's
it's
giving
you
four
bytes
and
it
should
be
giving
you
four
bytes,
but
on
the
first
three
bytes
telling
me
how
many
bytes
there
are,
no
that's
only
a
property
of
the
other
symbol,
serialize
or
rather
sorry,
that's
a
property
of
the
other
symbols
you
realize,
and
it's
also
in
the
beacon
chain,
simple
serialize.
That
sort
of
thing
only
exists
in
the
specific
case
where
you
have
a
variable.