►
Description
In this episode, we had Maksym Zavershynskyi (https://twitter.com/mzavershynskyi) from our team interviewing Pierre Krieger (https://twitter.com/tomaka17) from Parity Technologies about Libp2p library which is a backbone level-0 solution for several blockchains including Substrate/Polkadot.
Learn more about Parity here: https://www.parity.io/
------- 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 #Blockchain #FutureIsNEAR
A
B
So
the
p2p
several
things
initially
but
history
of
flip
it
open
is.
It
was
a
networking
stack
of
ipfs
made
by
protocol
apps,
so
protocol
app
started,
ipfs
released
ipfs
and
they
were
like.
Oh,
it
would
be
nice
to
make
this
networking
stack
available
to
all
people,
so
I
just
extracted
the
p2p
from
that
and
what
it
is
exacting.
It's
kind
of
a
protocol
kind
of
a
framework,
it's
kind
of
intertwined
like
when
designing
the
p2p
needs.
B
B
B
A
B
A
C
A
C
C
A
B
A
B
The
very
lowest
core
on
top
of
that
you
have
several
protocols,
oh
yeah,
one
of
which
no
two
of
which
offload
serve
God's,
observe
which
op
taps
of
mechanism
and
they
handle
connecting
two
nodes
and
reading
messages
wherever
there's
also
another
concept,
depending
on
what
exactly
you're
talking
about
the
read
a
protocol,
but
it's
not
about
reading
messages.
Well,
it's
not
about
gossiping,
it's
about
yeah
proxying,
acting
as
a
proxy
other
VPN,
whatever
you
want
to
do
for
a
different
node,
yeah
I
see
so
you
know
Alice
and
Bob
want
to
talk
to
each
other.
B
C
C
B
A
B
B
B
Fisher,
maybe
I
can
use
the
whiteboard
because
that's
great,
this
element
hasn't
been
used
available.
So
if
you
have
a
lease
anyway,
how
do
I
draw
a
B
again
and
want
to
talk
to
each
other?
Here
you
have
a
nuts
and
that's
a
problem,
and
why
is
it
a
problem?
So
imagine
that's
like
your
home.
Yes,
any
laptop!
That's
your
home!
Yes,
and
that's
your
router,
your
your
box
you're
in
Germany,
but
would
be
of
it's
books.
So
it's
not
her
because
that's
what
everyone
has!
That's
your
router!
Oh
you
not
I'm!
B
Typically
in
your
home,
you
have
multiple
multiple
machines
connected
to
the
same
nuts
by
Wi-Fi,
about
cable,
doesn't
matter,
and
so,
if
B
tries
to
connect,
it
will
reach
here,
but
then
the
router
doesn't
know
who
to
connect
to,
because
everything
here
is
the
same.
Ip
address
the
IP
address
is
yeah
and
so
a
router
doesn't
know
hey
which
one
which
one
do
you
actually
want
to
talk
to
unless
the
connection
is
already
established.
Yep.
That's
why,
in
order
to
do
not?
B
B
B
You
know
step
one
is
a
and
B
need
to
know
that
they
want
to
talk
to
each
other,
and
then
they
start
extending
UDP
packets
to
each
other
like
on
timer
or
something
yep
and
like
the
packets
from
B
are
not
going
to
reach
a,
but
since
a
sending
packets
as
well,
a
router
is
going
to
be
any,
but
a
is
too
easy
establishing
a
connection,
and
so
the
packets
from
B
are
actually
going
to
go
through
like
this
is
just
a
hack
to
tell
the
router.
Hey
I
want
incoming.
B
B
C
A
B
B
A
B
The
problem
with
that
is
that
you
BNP,
is
extremely
crappy,
so
I
don't
know
the
details.
I
never
investigated
really
much
into
UPnP,
but
from
what
everyone
says
is
kind
of
crappy,
not
working,
we're
full
of
issues,
and
so
on
so
forth.
Also
UPnP
doesn't
work
if
you
have
two
routers,
if
you're
behind
two
routers
PCP
is
well
better
designed
PCP
is
the
modern
version
of
UPnP,
but
it's
not
implemented
everywhere.
So
yeah,
this
kind
of
is
trade-off.
B
B
Tcp
hole
punching
was
kind
of
the
same
way.
It's
just
the
implementation
details
that
are
bit
more
weird.
So
again,
I
I,
don't
know
what
the
very
very
specific
details
I
don't
know,
but
to
establish
a
TCP
connection.
You
have
a
free
three
messages,
handshakes
in
ack
and
since
I
see
it
not
seen
seen
ack
and
ack
and
you
basically
flood
each
other's
in
ack
packets
instead
of
sending
UDP
packets
same
principle.
But
it's.
B
You
say
so:
that's
the
router
again.
The
point
is
to
travel
router,
hey
I,
want
to
I
want
this
connection
to
happen
same
principle.
That
needs
to
be
a
synchronizing
point.
I
think
you
need
to
agree
on
one
port
to
use
silver
synchronization
points
like
step.
Zero
is
a
MV
need
to
be
able
to
a
young
B
need
to
know
that
they
want
to
talk
to
each
other
on.
B
A
B
A
B
B
So,
instead
of
saying
123
dot,
forty
eight
dot,
zero
dot,
213
ports
1030-
you
just
write
this
and
it's
the
same,
but
basically
just
some
user-friendly
way.
It's
it
doesn't
bring.
Any
technological
advantage
doesn't
bring
anything
new
on
the
technical
level.
It's
just
a
way
to
make
this
more
user-friendly.
You
can
like
combine
protocols
and
Moochie
addresses.
You
can
actually
create
like
stacks
on
top
of
that.
A
B
But
that's
one
of
a
major
selling
points
of
a
p2p
you
can.
Every
protocol
is
optional.
You
can
write
your
own
protocol.
You
don't
have
to
use
anything
like
via
there's
a
few
components,
but
a
part
of
a
core.
The
media
versus
thing,
for
example,
here
identities
with
public
private
keys,
also
the
part
of
the
core
yeah,
but
public.
He
has
a
specific
format.
Okay
and
then
you
hash
it
in
a
specific
way,
gives
you
a
pure
an
identity
of
a
node.
B
B
Imagine
you're
using
UDP
and
I:
ask
the
repeat:
okay
you're,
using
like
you're
using
lead,
p2p
and
I.
Ask
the
p2p
to
connect
to
this
address.
It's
going
to
use
quick,
quick
protocol.
Quick
has
encryption
and
multiplexing
already
in
the
protocol.
So
once
the
connection
is
open,
we
negotiate
quick
and
connection
is
open.
But
if
I
ask.
B
If
I
ask
Vince,
instead,
that's
a
regular
tcp/ip
connection,
it's
just
a
stream
of
bytes
there's
no
encryption,
there's
no
multiplexing!
So
when
this
situation
happens,
there's
like
step
two
and
step
three,
which
is
negotiates
encryption,
negotiate
multiplexing,
and
so,
when
we
open
the
connection,
we
use
a
protocol.
Annuity
stream
select.
B
And
the
two
parts
of
a
connection
talk
to
each
other
and
say:
hey:
do
you
want
to
use
sake,
I
owed,
you
want
to
use
TLS.
Do
you
want
to
use
noise
which
are
encryption
protocols
and
they
agree
on
a
specific
encryption
protocol
to
use
when
they
do
the
hell,
man
and
so
on
and
so
forth,
and
then
step
three
is:
do
the
same
for
encrypt
for
multiplexing?
Sorry,
actually
with
yeah
mix,
for
example,
so
that's
not
leading
with
quick
cause.
A
B
A
C
B
Okay,
so
yeah,
every
single
node
on
the
network
has
a
private
key
and
a
public
key
and
the
private
key
is
used
in
the
encryption
negotiation,
well,
a
private
and
with
a
leaking.
Obviously.
So,
when
you
establish
the
connection
to
someone,
you
prove
that
they
are
the
identity,
but
they
claim
to
be
so.
B
C
B
No
I
see
what
the
situation
where
they
would
override
each
other
is
you
have
two
clients
using
the
same
peer
ID
like
if
you
have
two
machines
using
the
same
Keys
like,
but
we
will
create
small
s
because,
like
a
node,
we
think
it's
already
connected
to
you
yeah,
so
it
receive
an
expert
connection.
It's
like
oh
I
can
close
one
since
yes,
one
is
useless
and
like
you'll
need
one.
So
it's
going
to
close
one
connection
so
like
if
you
don't
do
that.
A
A
B
B
A
B
A
We
did
it
that
was
harsh.
We
did
so
many
mistakes,
so
this
yeah,
but
they
don't
test
two
months,
maybe
even
more,
but
then
also.
The
interesting
thing
is
that
if
you
have
some
note
who
just
turns
like
accidentally,
it
has
the
lowest
public
key
or
whatever
ID.
Then
everyone
is
gonna,
have
inbound
connection
with
it
right.
It's
not
like
it's
gonna
have
a
balanced
mix
of
inbound
and
outbound
connection.
You.
A
B
Like
if
you
receive,
if
you
yeah,
if
you
receive
a
connection,
you're
not
going
to
die
the
same
note
yourself,
you're
just
going
to
use
your
incoming
connection.
So
even
if
your
identity
is
zero,
zero,
zero,
zero,
zero
you're
going
to
receive
incoming
connections
but
you're
not
going
to
establish
others.
It's
rare!
It's.
A
B
B
B
B
So,
to
go
into
like
a
real-world
situation,
mdns
is
use.
This
may
be
well,
not
useless,
but,
like
you
have
a
blockchain,
you
want
to
connect
to
the
internet.
It
very
rarely
happens
that
you
have
another
node
in
you
in
your
local
network,
so
we
can,
like
you
know.
Mdns
boots
nodes
only
like
four
nodes.
A
B
Block
chains
not
too
much
for
them
right
yep,
therefore,
Kadima
is
like
the
main
mechanism
to
discover
the
network.
That's
why
I
did
this
more
of
topic
thing,
I,
guess
I'm
should
explain.
Academy
a--,
please!
Well,
that's
extremely
hard
to
explain.
You
know
varying
if
you
don't
know
anything
about
Kadima,
that's
kind
of
hard
to
explain.
Well,.
A
B
B
A
A
A
B
C
B
C
B
A
C
B
B
This
bracket
in
practice,
it's
arbitrary.
The
way
it's
implemented
is
just
first
come
first,
when
you
connect
with
someone
or
when
someone
connects
to
you,
you
add
them
to
values.
I
see,
I,
see
yeah,
and
so
that's
the
way
Cali
Mia
works,
so
each
node
is
responsible
for
knowing
the
nodes
that
are
next
to
next
to
them.
Yes,
so
imagine
I
want
to
know
about
this
node.
B
A
A
A
B
A
B
B
The
point
of
Kadima
are
normally
is
to
store
arbitrary
values,
so
each
node
is
not
only
responsible
for
knowing
the
nodes
that
are
next
to
it
in
identities,
but
also
for
storing
values
with
whose
hash
are
next
to
it.
So
sorry,
if
you
want
to
store
a
hash,
if
you
want
to
store
a
value
in
this
table,
you're
going
to
find
the
nodes
that
are
close
to
the
hash
of
that
value
and
you
tell
them
hey,
please
store
this.
B
That's
the
reason
why
cadena
exists
and
we
are
using
this
as
discover
mechanism
as
kind
of
how
to
say
that
a
derivation
wave,
it's
not
the
primary
reason
why
calamy
exists
special
cases
yep
if
Jung
uses
Kadima
for
his
discovery.
Ipfs
is
Kadima
for
its
discovery.
Ipfs
also
uses
the
regular
properties
of
can
amia
and
itself,
sir,
actually
also
using
the
regular
properties
of
Columbia
to
store
some
value
data
information.
But
that's
I.
A
Got
it
okay,
so
you
said
many
times
that
grabbing
Nevada
yeah
the
HTTP
is
modular
right
yeah,
which
means
I
can
actually
define
certain
implementations.
So
this
behavior
of
the
slip
PTP
library
that
I
want
to
be
customized
for
my
own
use,
and
there
is
even
this
behavior
trait
or
something
yeah.
Do
it
p2p
that
you
can
implement?
That's.
A
B
B
B
What
is
exchanged
here
between
Mahendra's
and
the
main
thread
are
messages
that
contain
logic.
So
what
would
be,
for
example,
a
ping
to
give
the
most
simple
example,
hey
said
over
know,
King
is
not
actually
exchanged
here.
That
signal
could
be
start.
Academia
request
so
I'm
going
to
write
that
down.
I.
B
Yeah,
the
main
thread,
for
example,
tells
I
want
to
start
a
caddy
me
request
on
connection
to.
Of
course,
you
know
the
identity
of
the
nodes
of
the
connection
and
then
later
so
the
handler
receives
a
message:
hey
I
need
to
start.
Academia
request,
translates
part
into
bytes,
and
then
this
it
sends
out
the
dice
on
the
connection
and
then
later
of
a
connection.
Replies
with
bytes
mahendra
translates
that
into
academia
answer,
and
then
it
sends
back
the
response.
So.
A
B
When
it
will
be
able
trades
trades
implements
basic
cat-like
to
implement
the
trade,
you
only
need
to
implement
that
part
and
that's
named
protocols
handler
in
the
code
like
Mahendra
Feeney
is
named
protocols
handler
okay,
fun
facts,
so
that's
the
API
you're
supposed
to
use.
If
you
want
to
use
rusty
p2p
on
the
lower
level
as
a
Nova
API,
where
this
is
name
node
Handler
and
thanks
to
this
low-level
API,
you
can
turn
any
p2p
into
anything.
You
want.
Basically,
you
can
turn
that
into
an
HTTP
and
HTTPS
HTTP
server,
yeah.
A
B
A
B
A
B
B
So,
according
to
to
you,
like,
every
node
has
a
hashmap
basically
of
every
other
node,
but
it
knows
off
and
has
a
reputation,
value
associated
to
it.
I
explained
about
vehicles.
When
you
talk
about
reputation,
people
think
the
reputation
is
a
network
reputation
like
no
that's
not
the
case.
Your
reputation
is
different
for.
B
Mean
well
you're
only
going
to
have
a
reputation.
Weaver
knows,
you've
ever
been
connected
with
it.
So
if
you
have
10,000
nodes,
in
fact,
in
subscribe
to
open
maximum
50
connections,
I
see
so
you're
going
to
have
a
reputation
with
50
nodes
and
not
the
9950
others,
basically,
okay,
so
to
come
back
to
our
reputation
itself,
wherever
you
do
something
beneficial,
your
reputation
increases
whenever
you
do
something
not
malicious
but
not
beneficial,
like
not
useful.
Your
reputation
decreases.
The
idea
behind
that
is
imagine
your
node.
B
You
receive
a
message
you're
going
to
need
some
CPU
and
memories
your
time
to
process
a
message.
So
every
single
message
what
you
receive
should
decrease
verification
of
a
sender.
But
if
it
turns
out
the
message
is
useful
when
the
reputation
is
increased
by
more
than
what
got
decreased
actually,
but
if
you
receive
a
useless
message,
you're
not
going
to
gain
any
reputation
you
have.
This
therefore
decrease,
because
you
need
C.
B
B
If
it's
actually
useful
or
not,
we
go,
we
don't
know
if
it's
useful,
yet
we're
going
to
know
later,
or
maybe
you
receive
messages
from
two
rounds
ago
or
three
rounds
ago,
and
the
message
would
have
been
useful
if
it
had
been
received
now,
if
ever
had
been
received
earlier,
but
no
useful,
and
because
of
that
we
have
this
reputation
system,
it's
the
higher
level
code,
but
the
size
of
a
reputation
change
are
not
just
the
lower
level.
Networking
I
see.