►
From YouTube: 8. Discussion: Sharding P2P networking roundtable
Description
The Ethereum Sharding Meeting #2 - Berlin
8. Discussion: Sharding P2P networking roundtable with Mai-Hsuan (Kevin) Chia, Felix Lange, Guillaume Ballet (Ethereum Foundation), and Lars Gierth (Protocol Labs)
Resources: https://notes.ethereum.org/s/B1-7aivmX
---
Video: Anton Tal @antontal
Audio: Matteo Tambussi @matlemad
Producer: Chris Hobcroft @chrishobcroft
Executive Producer: Doug Petkanics @petkanics
For @livepeertv on behalf of @LivepeerOrg
A
First
I'm
Kevin
from
a
theorem
I
will
introduce
the
shutting
people
requirements
and
their
current
idea
first
and
then
Lars
from
protocol
ABS.
You
will
talk
about
the
p2p
and
Casas
up
and
then,
after
that
we
will
have
a
roundtable
discussion
so
about
Charlene
PV
clients
requirements
the
first
one
we
need
a
client
should
be
able
to
subscribe
to
multiple
shards
and
you
should
be
able
to
jump
jump
between
shards
really
fast,
and
so
it
also
means
that
the
nodes,
the
clients,
should
be
able
to
find
those
in
other
charts.
In
a
short.
B
A
So
the
reason
why
we
are
considering
to
use
pub/sub
is
you
can
imagine
that
the
shards
can
be
mapped
to
topics,
so
a
client
can
choose
to
subscribe
to
a
certain
chars
and
it
will
only
receive
the
data
from
it's
interesting
or
it
is
listen.
Listening,
charts
and
the
current
implementation
for
pops
up
is.
A
The
first
one
is
eager
push
eager
push
means
that
it
just
sended
whole
data
to
a
specific,
peer
and
lady
push
means
that
it
just
sent
a
summary
of
the
data,
and
usually
it
is
a
hash
of
the
data.
So
in
this
graph
you
can
see
the
black
arrow,
and
this
is
the
eager
push.
So
the
note
just
push
the
data
entirely
and
for
other
notes
for
this
to
knows
the
link
on
the
and
they,
the
node,
just
push
the
summary
of
the
data.
So
it
is
the
lazy
push
sorry.
A
So
after
a
note
is
pushing
after
a
note
pushed
at
a
summary
to
other
nodes,
if
other
nose
like
this
note,
if
is
after
after
a
time
period,
if
it
doesn't
receive
the
corresponding
body.
After
to
the
summary,
it
will
find
that
it
elects
off
some
data,
so
it
will
ask
for
the
original
note
which
said
that
it
ought
to
it.
A
And
this
two
strategies
make
casas
up
more
efficient
I
mean
because
in
close
stop
you
just
broadcast
all
of
the
messages
and
they
are,
there
will
be
a
lot
of
redundancy
and
casas.
All
can
read,
reduce
this
redundancy
and
gossiped
up
has
further
optimizations
the
first
one
is
broadcast
tree
and
its
ideas
in
gaza.
We
still
need
to
broadcast
multiple
broadcast
a
message
to
multiple
peers,
but
it
still
has
redundancy.
A
Membership
management
protocol,
so
the
idea
of
it
is
it
allows
peers
to
swap
to
exchange
their
harsher
review
part
of
their
power.
I
mean
they
can
exchange
their
peers
information,
and
that
makes
the
whole
network
more
reliable
and
the
proximity
awareness,
so
this
optimization
allows
appears
request,
appears
to
keep
track
of
its
peers
latency.
So
if
note
latency
is
too
high,
it
will
be
replaced
by
the
note
by
the
peers
by
nose
with
lower
latency
and
the
process
accounts.
A
A
To
solve
the
complexity
of
implementing,
so
many
maintaining
so
many
shards
simultaneously,
and
it
is
also
supported
by
the
p2p
team
and
it
possibly
be
used
by
Falcone
and
the
counts
might
be
because
some
of
the
features
are
not
yet
implemented
like
the
authentication
and
the
encryption.
So
for
now
they
are
not
implemented
and
other
features
so
yeah
and
another.
Why
is
it
only
supports
calling
in
JavaScript
so
for
us
like
charting
implementation
in
research
team?
We
use
Python.
So
we
need
to
write
Fighting's
to
support
to
use
that
and.
A
The
current
idea
for
us
for
shouting
p2p,
so
we
our
idea,
is
we're
using
pops
up
to
do
gossiping
and
we
will
have
global
and
local
gossip
channels,
so
the
go-go
means
that
it
is
subscribed
by
every
node
and
the
local
means
that
it
might
be
a
Shar.
So
some
of
the
nose
can
substract
subscribe
that,
but,
while
others
not
so,
we
use
the
global
gossip
channels
to
go
cast
the
Shar
subscription
preference.
So
a
node
every
know
where
broadcast
is
currently
interested
chars.
A
So
everyone
will
know
which
peer
is
listening
to
which
char
and
also
we
use
the
global
gossip
channels
to
broadcast
a
mention,
beacon,
Chen
messages
and
a
local
gossip
channels.
Both
is
shard,
specific
informations
and
about
the
peer
discovery
and
we
use
footnotes
and
besides,
we
use
the
global
channel
I
just
mentioned,
and
so
every
node
will
procaster
ensures
there
currently
subscripting
charts.
A
In
this
case,
every
node
can
construct
a
sharp
reference
table
and
when
they
are
going
to
join
a
specific
char,
they
can
just
use
this
table
to
find
the
corresponding
peers,
and
we
also
provide
the
API
for
each
node.
And
for
this,
like
this
API
a
request
sharp
reference
table,
so
if
a
node
it
just
joined
the
network,
it
will
not
have
the
information
about
the
table.
So
it
can
read,
ask
this
information
from
its
peers
and
also
the
request.
A
Collation
will
be,
can
be
used
to
synchronize
the
whole
charge,
hands
and
ongoing
works,
and
we
are
currently
researching
on
Kosovo
and
keep
testing
Casas
up
and
for
now
we're
testing
a
smaller
scale
and
mainly
focusing
on
the
performance.
But
heaven
have
a
test
like
the
reliability
in
others.
So
we'll
keep
doing
that
and
I
will
keep
finishing
the
POC
of
the
sharding
PD
idea
we
just
mentioned
and
I
have
a
pretty
imaginary
version,
but
it
is
not.
It
is
incomplete.
For
now
and
after
we
build
this
GOC,
we
can.
C
Thank
you,
yeah
thanks
for
having
me
many
misses
and
I
work
on
the
Lapierre
P
team.
I
live
here
in
Berlin,
so
I
feel
right
at
home.
We
just
giving
a
bit
of
context
of
the
p2p
real
quick.
So
when
we
build
when
we
started
building
ipfs,
we
noticed
that
everybody
is
reinventing
the
same
stuff
over
and
over
again,
just
because
well
distributed.
Networking
or
decentralized
networking
never
really
dominated
anything,
so
nothing
got
into
any
Colonels
or
anything
like
that.
So
there's
the
p2p
wheel,
the
cross-platform
wheel,
the
upgradability
wheel
and
so.
D
C
C
Just
a
couple
of
functions.
The
implementations
will
implement
there's
transport
scripted
channels,
pops
up,
as
we
already
heard,
discovery
for
just
finding
any
notes,
peer
routing
for
finding
addresses
for
specific
nodes
content,
routing
for
finding
nodes
that
have
specific
content.
There's
three
maxing
to
put
multiple
streams
into
well,
one
stream
and
this
relays,
and
by
the
way
the
ones
that
are
in
italics
here
are
currently
works
in
progress.
C
C
Taking
this
approach
of
having
individual
components
of
lipid
Apiata
and
we're
starting
from
the
bottom
up
so
to
to
to
increase
the
strength
of
the
foundation
going
up
so
to
speak
and
the
short
term
feature
map
is
definitely
well
gossips
up
because
we
need
it
for
five
coin.
Other
projects
needed
as
well
and
we
are
pretty
close
to
having
a
first
version,
usable
and
suspect.
There's
ago,
poll
requests
as
kevin
already
mentioned,
and
there's
gonna
be
a
lot
more
work
into
simulation
into
improving
it
to
its
security.
C
C
C
We
want
to
improve
connectivity
a
lot.
The
TCP
transport
currently
is
pretty
heavy
on
resources
and
on
little
home
routers,
because
it
turns
out
600,
700
connections
just
simply
killed
some
routers
and
then
there's
smaller
changes
for
DHT
performance
and
the
migrations
away
from
RSA
key
pairs,
for
example,
which
are
really
CPU
intensive
to
January.
Well,
edie
keys
are
simply
random
data
and
yeah.
You
already
went
over
some
of
pops
up,
so
I
yeah
flats
up
was
the
very
first
naive
implementation
of
the
of
the
pops
up
interface.
C
B
C
B
C
You
get
connectivity
in
web
browsers
for
free
net
busting.
All
that
you
get
privacy,
enhancing
transports
for
free,
so
open,
Bazaar
I
have
had
a
lot
of
success
with
an
onion
transport
in
the
p2p
which
we're
having
audited
and
and
included
into
the
p2p
and
in
the
not-too-distant
future
and
end
of
this
year,
beginning
of
next
year.
C
We
want
to
do
like
properly
routed
packets,
which
overlay
networks
on
the
p2p,
so
that
when
you
want
to
communicate
with
a
different
node,
you
don't
actually
have
to
directly
connect
to
it,
but
you
send
stuff
over
the
overlay,
and
once
we
have
that
feature,
then
the
first
point
that
every
node
of
other
applications
strengthens
the
network
really
starts
to
pay
out
yeah.
So
much
for
the
context.
F
Thank
you,
so
I
had
two
questions.
First
of
all,
when
you
talk
about
pops
up
model
where
I
guess
their
subscriptions,
who
is
actually
keeping
those
subscriptions
and
what
about
can
they
disappear?
And
the
second
question
is
that
I
in
none
of
the
I'm
sure
there
is
something
but
none
of
the
presentations
there
was
any
mention
of
adversarial
environment
and
how
we
deal
with
those.
A
A
C
Question
yeah,
but
that
was
area
model
reason
it's
not
up.
There
is
I,
didn't
work
on
Gus
except
myself.
Yeah
I
don't
have
too
much
time
for
preparation
anyway,
that
is
documentation
and
discussion
about
it.
I
couldn't
find
it
in
in
the
short
time
and
I'm
gonna
get
it
for
you
and
put
it
in
the
documentation
of
this
of
this
day.
I
guess
of
the
agenda.
F
Mean
to
be
more
specific
is
that
I
don't
think
that
we
can
build
this
peer-to-peer
protocols
are
completely
isolated
from
the
network
they're
going
to
be
operating,
for
example,
you
want
appears
to
actually
filter
out
the
messages
without
relaying
them
blindly.
So
you
can't
relay
messages
blindly
because
they
could
be
the
spamming
of
the
network.
They
have
to
apply
some
kind
of
rules,
and
these
rules
will
inevitably
be
the
network
specific.
Yes,.
B
D
B
D
D
It
doesn't
really
matter
what
it
runs
on,
so
it
can
run
on
like
any
sort
of
insecure
protocol
as
long
as
it's
efficient
enough
to
support
a
couple
thousand
nodes,
a
couple
hundred
nodes-
and
there
will
definitely
not
be
a
lot
of
value
in
the
system
initially,
but
then
over
time,
as
the
proof-of-concept
gets
more
mature
and
you
know,
more
value
is
being
put
in
the
system,
then
there
will
definitely
be
like.
My
guess
is
that
it
will
just
evolve
into
some
kind
of
custom
protocol
that
has
these
these.
G
A
If
you
separate
the
network
for
each
shard,
then
how
do
you
do
never
care
discovery?
You
might
rely
on
the
who
knows
right
for
each
shark.
You
will
need
some
certain
number
of
the
who
knows
so
you
in
that
case
you
will
entirely
rely
on
the
blue
notes.
So
unless
you
use
other
kinds
of
the
top
topology
like
like
Yannick,
he
previously
proposed
a
torus
network
topology.
So
in
that
case
you
can
ask
for
you
as
your
peers
about
I.
A
Do
you
know
any
peers
in
specific
char?
So
you
so
you
will
know
that
for
when
in
the
torus
topology,
you
will
know
you
you,
you
will
ask
the
next
char
spears
and
you
would
so
so
III
mean
you
need
some
certain
way
to
find
the
peers
in
other
sharks
in
that
case.
So
it
is
for
me
this
kind.
It
is
more
difficult,
I
mean
for
now.
We,
if
we
just
you'd,
pass
up
it
can
solve
this
problem.
I.
D
No
not
yet
so,
there's
definitely
an
effort
underway
to
make
it
possible
to
share
transport
implementations,
at
least
with
the
PTV
project.
So
the
idea
would
be
that
in
the
long
future,
even
if
they're
in
1.0
will
have
the
p2p
transport
option.
In
that
case
it
might
be
possible
to,
for
example,
download
information
about
maniacs
on
anything
1.0
1.0
using
the
p2p,
but
that's
not
possible
right
now.
So
right
now,
all
the
implementations
of
a
theorem
basically
run
the
custom
protocol
they
always
round,
and
it's
just
yeah.
E
D
And
there's
no
like
no
connectivity
option,
but
I
have
a
comment
for
your
for
your
earlier
question
as
well.
So
there
is
like
another
system.
It's
like
within
reach
and
I
could
totally
be
tried
and
that's
the
same
as
PSS.
So
you
you
all
heard
about
it.
On
the
first
day,
the
swamp
teams
just
released
it
as
part
of
their
our
POC
3,
and
it's
available
in
the
in
the
Goyang
repository.
D
It
also
has
it
comes
with
like
a
standalone,
daemon
and
everything,
so
it's
kind
of
comparable
to
the
two
to
two
to
the
the
PDP
team
into
the
the
p2p
demon.
In
the
end,
so,
basically
there's
a
demon
you
can
connect
to
it.
You
can
talk
to
its
API
and
send
messages
through
a
rotted
overlay
and
I.
Guess
it's
kind
of
funny
that,
like
these
things
tonight,
sorry,
you
know
we
kind
of
have
like
the
same
stuff.
D
So
but
it's
it's
like
yeah,
so
this
is
like,
even
in
the
like
in
another
corner
of
the
etherium
ecosystem,
you
have
like
another
system
that
could
be
tried
and
I
think
these.
That
could
be
like
an
interesting
experiment
someday
to
just
check.
You
know
like
let's
just
run
like
the
the
PSS
daemon
and
see
how
that
performs
it
does
come
with.
D
It
has
a
bit
of
a
different
like
privacy
trade-off
so
that
that
can
be
considered,
but
it
does
have.
On
the
other
hand,
it
does
have
encryption
which
isn't
really
built
into
floods
up
or
coasters
up
at
the
moment,
but
I
guess
you
can
just
always
there
that
on
later,
so
it
is
there's
definitely
like
alternatives,
but
there
aren't
that
many
alternatives.
That's
the
thing.
D
So,
basically,
when
you,
when
you're
building
a
system
like
that,
like
the
like
the
like
the
sharding
prototype,
you
always
have
to
choose,
do
you
have
to
do
either
your
shoes
like
some
some
library,
you
make
your
own
protocol.
We
use
one
of
the
well
things
that
already
exist
and
somehow
adapt
them
and
I.
Think
the
PDP
right
now
is
really
the
best
choice,
because
it
gives
you
it's
like
it.
It's
like
a
very
modular
toolkit.
You
can
pick
all
the
different
trade-offs
you
want.
B
Have
you
thought
about
having
some
kind
of
inter
process
communication
for
network
stack
to
have
some
kind
of
demon
running
in
the
system
and
then
just
communicate
locally
with
with
this
process
from
it
would
be
much
easier
to
implement
for,
like
Python,
for
example,
except
like
implement
all
of
these
protocols.
You
currently
have
four
new
languages.
Yeah.
B
C
After
that,
there's
gonna
be
probably
a
UNIX
socket
API
to
the
daemon
just
for
better
performance,
because
HTTP
is
well
can
be
limiting
and
then
there's
even
more
options.
There's
the
option
of
pushing
the
lower
levels
of
the
p2p
into
the
Linux
kernel,
for
example
the
Kripa
channels
and
some
of
the
transports
and
the
last
future
point
up.
There
was
a
routed.
A
packet
switch
routed
overlay
and
some
part
of
that
could
also
be
pushed
into
the
room.
The
Linux
kernel
so
there's,
for
example,
regarding
crypto
channels.
C
There's
this
very
interesting
new
VPN
project
called
wire
guard,
which
is
a
kernel
module
and
and
thanks
for
being
a
kernel
module,
it's
performance
is
just
stellar.
You
can
get
one
gigabit
per
second
of
throughput
on
the
tiniest
VPS
you
can
get
for
a
dollar
at
any
Oster,
and
so
we'd
like
to
use
that
as
a
crypto
channel
in
kernel
and
for
example,
but
that's
way
down
the
road
some
some
time
next
year.
Okay,.
B
C
Definitely
the
all
discussions
and
documents
and
and
all
that
is
on
github,
so
there's
the
lipid
EP
/li
peer-to-peer
repo
for
more
general
discussion,
that's
not
specific
to
one
specific
implementation
and
then
there's
the
lipid
IP
/
specs
repo
and
the
three
repositories
for
the
three
implementations.
So
the
p2p
/
call
the
p2p
/a
asleep,
p2p
/
rest,
the
PDP
and
there's.
B
C
G
C
But
it
does
certainly
there's
an
experiment:
fish
Android,
app
called
activist
droid
and
it
runs
well
go
ipfs
on
mobile,
but
it's
not
optimized
for
mobile
use
cases
yeah,
so
it
so
it
can't
pause
or
resume
connections.
It
just
keeps
running
and,
of
course,
keeps
eating
a
battery
because,
as
are
constantly
on
the
CPU,
is
constantly
on
there's.
C
Optimal
optimizations,
which
have
already
been
done,
for
example,
the
DHT
client
mode,
where
you
don't
act
as
a
as
a
server,
so
to
speak
in
the
DHT,
but
only
make
requests.
But
that's
just
a
tiny
step
and
being
able
to
to
suspend
and
resume
connections
or
the
whole
demon
is
pretty
critical
for
for
mobile.
So.
D
Actually,
just
so,
the
reason
why
we
have
Guillaume
here
is
because
you're
already
a
question
was
also
that,
if
there's
like
any
way
to
for
the
p2p
to
talk
to
deaf
PDP
systems,
so
one
thing
that
we're
doing
right
now
is
the
reporting
like
yet
another
part.
If
your
maker
system,
which
is
the
whisper
protocol,
which
is
also
surprised,
a
post-op
protocol
to
let
p2p
at
the
moment,
so
that's
also
something
that's
going
on,
there's
actually
something
there.
As
far
as
you
know,
parodies
also
participating
in
that
effort.
E
Yeah
I
mean
we
okay,
so
whispers
is
supposed
to
be
a
messaging
system.
Well,
the
definition
can
vary
depending
on
who
you
ask.
But
yes,
the
goal
is
to
ensure
darkness.
So
you,
when
you
have,
when
you
send
a
message
to
someone
else,
an
external
observer
should
not
know
if
you're
sending
a
message
who
you're
sending
it
to
and,
of
course,
what
you're
writing
so
yeah.
We
have
this
this
PR,
that's
currently
open
about
implementing.
No,
there
was
not
a
ring
mark,
you
know
need
to
know
need
to
sneer.
E
Yes,
so
we
have
this
PR
and
indeed
like
we,
we
just
we
add
a
new
like
we
use.
We
usually
p2p
like
the
multi,
the
protocol
streaming.
Sorry,
the
multiplexing
to
send
deaf
p2p
deaf
p2p
packets
over
over
IP
FS
yeah,
so
like
the
reason
why
we
did
that
in
the
first
place
was
because
we
wanted
to
see
if
we
could
build
okay
because
whisper
uses
gossip.
So
it's
really
heavy
on
the
network.
I
think
there
was
a
gentleman
saying
earlier.
How
do
you
filter?
How
do
you
filter
messages?
E
Well,
in
a
whisper
you,
don't
you
just
send
everybody
your
message
to
you
messages
to
everybody.
So
a
lot
of
nodes
are
not
activating
whisper,
because
that's
a
lot
of
processing
time
that
they
spend
just
just
decrypting
messages
that
are
completely
there
are
not
internet
for
them.
So
yeah.
We
we
wanted
to
see
if
we
could
build
our
own
network
with
only
parties
interested
in
in
whisper
and
yes,
so
that's
also
been
used
for
for
prototyping,
because
if
we
can
I
mean-
maybe
that's
a
bit
controversial
to
say
that.
E
A
If
we
settle
down
to
use
Casas
up
as
the
p2p
layer,
do
you
have
idea
any
idea
of
building
the
test
net,
because
I
have
some
thoughts
in
mind
that
I
think
if
we
stay
down,
we
can
make
a
spec
and
it
is
cross
languages.
So
we
we
just
regulate
the
messages
and
the
protocols
and
we
can
in
ten
different
implementation
of
the
causative
clients
we
can
build.
It
can
build
the
test
net
together,
I
mean
from
the
Python
side.
We
can
also
build
use
the
Python
bindings
to
call
right.
A
A
C
Well,
it
will
be
used.
Certainly
that's
one
one
of
the
huge
priorities
that
that
the
fact
one
team
have
brought
to
two
hours
to
the
p2p
team.
Get
us
get
as
good
pops
up
and
gossip
stuff
is
the
first
step
to
that.
How
exactly
they're,
using
it
I
actually
have
no
idea,
there's
just
so
much
stuff
to
follow
in
ipfs
and
a
p2p
that
I
I
don't
find
the
time
to
also
follow
five
coin.
A
E
G
C
Yeah
I
mean
we'd
like
to
get
good
automated
continuous
test
beds
like
yesterday,
because
not
just
for
pops
up
I
mean
for
all
the
rest
of
the
p2p
for
a
PFS.
So
if
I
can
we
just
need
good,
go
test,
nerds
and
simulations
and
and
benchmarks
and
yeah?
It's
gonna
be
priority
like
really
high
priority
and
and
in
the
rest
of
this
year.
Just
just
because
we
can,
you
can't
be
huge
large
scale,
distributed
networks
without
without
any.
A
Okay
and
I
just
come
up
with
one
question
about
the
attacks
on
the
Gaza,
because
I
previously
I
already
have
in
my
like.
You
can
just
send
the
data,
which
is
not
surprised,
subscribe
it
by
the
peers,
so
you
just
send
it
and
like
you
can
just
occupy,
is
and
with
and
about
this,
do
is
there
possible
to
have
improved
building
prevention
or
protection
mechanism
and
on
any
prevention
of
the
attacks.
C
Not
yet
really
I
mean
on
that
particular
attack.
You
can
lead
us
or
you
can
you
can
exhaust
the
network
resources
off
of
pretty
much
any
net
network
service
right?
It's
not
something
that
gossips
up
alone
can
prevent.
All
it
can
do,
is
flex
sources
of
traffic
for
for
an
external
tool
to
pick
them
up
a
gossip
service
in
an
application
layer
protocol,
so
it
so
it
can
drop
drop
packets
on
layer
3,
for
example,
and
even
if
they're
already,
even
if
it
could,
they
already
would
be
at
the
host
and
the
network.
C
If
the
traffic
is
already
at
that
point,
then
then
it's
already
too
exactly
too
late.
But
if
you
want
to
prevent
any
network
exhaustion
the
text
you
need
to
do
it
somewhere
at
the
at
the
boundary
of
your
own
network,
look
at
a
firewall
at
a
router
at
a
switch
but
yeah
attacks
Andy.
He
doesn't
text
specifically
or
other
exhausting
attacks
and
and
also
texts
in
general.
On
gossip,
sir
I,
don't
have
a
good
reply
for
you.
I
know.
D
So
this
is
kind
of
important
to
stay
to
stay
anonymous
and
then
my
question
would
be:
if
there
is
they
specifically
like
in
in
floods,
up
well
floods
up,
maybe
not
in
cost
of
subs,
there's
like
any
or
in
the
underlying
protocols.
It's
like
any
prevention
of,
like
you
know
your
actual
IP
leaking
or
something.
So
it's
not
so
much
about.
C
G
C
D
Yeah,
so,
if
anyone's
interested
in
doing
like
cool
research,
that
will
be
like
really
cool
research
to
have
like
sort
of
like
because,
like
especially
with
something
like
tor,
so
I'm,
guessing
like
a
lot
of
people
in
the
room,
have
used
tor
or
if
they
tried
it
or
read
something
about
it.
It's
kind
of
a
famous
project
or
anything,
but
it's
just
is
like
tor
is
always
this
thing.
That's
not
really
like.
You
can't
just
really
plug
it
into
your
application.
It's
like
a
it's
like
a
service
that
you
can.
D
C
D
Okay,
so
now,
then,
you
can
like
import
tour,
but
it
doesn't
really
yeah.
So
yeah,
that's
cool
and
all,
but
like
this,
like
the
this
like,
there
is
no
like
this
is
I,
think
something
that
could
be
really
cool
to
have
an
in
the
p2p
as
well
would
be
to
have
like
a
native
sort
of
like
a
lipid,
Fe
native
onion
routing
thing,
because
there's
something
that
is
useful
in
in
a
lot
of
cases.
Yeah.
H
So,
probably
well
before
that,
there's
this
layer
in
canoe
net
but
I
think
you
guys
still
don't
have
it's
called
cadet,
which
it
handles
routing
between
hops.
At
the
you
guys
only
route
like
through
one,
let
you
you
do
have
an
indirection
capability
if
it's
only
one
hop
or
something
anyway,
but
you
probably
something
like
that
even
before-
and
there
can
be
some
weird
layering
things
to
think
about
there.
E
A
E
F
You're
mentioned
in
your
presentation
of
leaked
p2p:
there
there's
a
benefit
of
having
more
participants
and
network
and
I.
Don't
quite
understand.
Why,
like?
Why
is
it?
Do
they
all
participate
in
some
kind
of
global
network
or
is
it
and
how
does
it
work?
Because
if
you
do
like
you
know
your
you're,
not
really
paired
with
the
with
the
network,
you
want
to
be
paired,
but
you
appeared
with
this.
So
many
like
what
is
the
number
of
peers
and
in
the
pizza
P,
so.
D
It's
I
can
answer
it,
or
so
it's
like
basically
when
you,
if
you
participate
in
the
in
the
in
the
DHT,
for
example,
to
use
its
services
and
basically
everyone
else
who
is
also
using
the
DHT
in
their
project.
It's
also
in
that
very
same
DHT.
So
in
that
case,
you're
not
really
like
peering,
as
in
like
directly
talking
to
these
to
these
nodes
about
your
application.
But
it's
more
like,
like
certain
basic,
like
certain
base
layer,
services,
I
just
used,
bye,
bye,
everyone
and.
C
C
C
One
more
addition,
because
you
were
saying
a
native,
a
native
anonymity
layer,
Olympia
P
would
be
nice,
that's
also
something
you
can.
You
can
layer
on
top
of
such
a
of
such
a
packet,
switching
overlay
building
block
so
to
speak
and
then
and
then
the
bigger
the
bigger
your
network
gets
the
more
advantageous.
It
is
to
your
anonymity
purposes,.
E
Just
the
last
quick
questions,
yeah,
you
said
you
wanted
to
install
embedding
the
Lea
p2p,
what
demon,
whatever
into
the
Linux
kernel.
So
you
know
I
used
to
be
a
colonel
dealt
Lewis.
Lena
Stovall
has
said,
like
his
main
job
was
to
say
no
to
stuff
and,
like
the
way
I
see
is
you
know
this
is
a
library
that
can
be
used
on
other
operating
system
like
FreeBSD
like
if
you
start
admitting
that,
like
what
would
be
the
purpose,
what
would
be
the
advantage
of
doing
this?
This
thing.
C
Yeah,
maybe
maybe
to
clarify
we
wouldn't-
probably
we
probably
wouldn't
but
the
whole
demon
and
to
the
kernel,
but
just
the
lowest
layers
of
it.
Thank
the
UDP
transport,
the
TCP
transport,
the
very
simple
basic
transports
and
probably
reuse
wire
guards,
crypto
channels
and
then
later,
once
once
the
packet
switched
overlay.
Is
there
probably
also
the
packet
switch
just
for
performance
reason?
You
don't
need
to
copy
packets
between
kernel
and
user
space.
It's
much
easier
to
to
have
dedicated
hardware,
for
it.