👂 🎴 🕸️
<
p
class
='
fragment
'><
strong
>“
All
is
number
.”
strong
>
(
πάντα
αριθμός
)
—
attributed
to
Pythagoras
''
6th
century
BCE
.
p
><
p
class
='
fragment
'>
For
Pythagoras
and
his
followers
''
numbers
were
not
just
a
tool
for
counting
.
They
were
the
hidden
structure
of
reality
itself
—
the
ratios
that
govern
music
''
geometry
''
even
the
harmony
of
the
cosmos
.
p
><
p
class
='
fragment
'>
Today
we
trace
that
claim
all
the
way
to
the
silicon
running
inside
your
phone
.
p
>
<
p
class
='
fragment
'>
Here
is
the
thread
we
will
follow
:
a
number
can
be
<
em
>
written
down
em
>
in
many
different
ways
—
and
the
way
you
write
it
changes
what
you
can
<
em
>
do
em
>
with
it
.
p
><
p
class
='
fragment
'>
That
was
true
for
Roman
numerals
.
It
is
just
as
true
for
the
floating
-
point
formats
inside
a
modern
AI
chip
.
p
>
<
p
class
='
fragment
'>
Rome
counted
like
this
:
<
strong
>
I
''
V
''
X
''
L
''
C
''
D
''
M
strong
>.
p
><
p
class
='
fragment
'>
No
zero
.
No
place
value
—
the
position
of
a
symbol
barely
matters
''
only
which
symbols
appear
and
in
what
combination
.
p
><
p
class
='
fragment
'>
Try
multiplying
<
strong
>
MDCLXVI
strong
>
by
<
strong
>
XLIV
strong
>
in
your
head
.
Now
try
1666
×
44
.
The
second
one
is
not
just
easier
—
it
is
a
genuinely
different
kind
of
thinking
.
p
>
<
p
class
='
fragment
'>
Centuries
before
Pythagoras
''
the
Baudhayana
Sulba
Sutra
(
India
''
c
.
800
BCE
)
already
states
the
same
relationship
between
the
sides
of
a
right
triangle
.
p
><
p
class
='
fragment
'>
The
mathematics
was
not
a
single
European
discovery
—
it
was
discovered
''
independently
and
repeatedly
''
wherever
people
needed
to
measure
''
build
''
and
trade
.
p
>
<
p
class
='
fragment
'>
Every
numeral
system
so
far
shares
the
same
gap
:
no
symbol
for
<
strong
>
nothing
strong
>.
p
><
p
class
='
fragment
'>
Without
a
zero
''
there
is
no
clean
way
to
write
a
number
as
a
position
-
dependent
code
—
and
without
position
''
arithmetic
stays
a
craft
for
specialists
''
not
a
procedure
anyone
can
follow
.
p
>
<
p
class
='
fragment
'>
Zero
emerges
independently
more
than
once
:
among
the
Maya
of
Mesoamerica
''
and
in
India
''
where
the
mathematician
Brahmagupta
(
7th
century
CE
)
is
the
first
to
give
it
formal
rules
of
arithmetic
.
p
><
p
class
='
fragment
'>
It
reaches
the
Islamic
world
through
scholars
like
Muhammad
ibn
Musa
al
-
Khwarizmi
(
9th
century
)''
whose
own
name
—
Latinized
as
<
em
>
algorismus
em
>
—
gives
us
the
word
<
strong
>
algorithm
strong
>.
p
><
p
class
='
fragment
'>
A
number
system
and
a
method
for
calculating
with
it
arrive
together
.
That
is
not
a
coincidence
.
p
>
<
p
class
='
fragment
'>
In
1202
''
Leonardo
of
Pisa
—
better
known
as
Fibonacci
—
publishes
<
em
>
Liber
Abaci
em
>''
introducing
Hindu
-
Arabic
numerals
(
zero
included
)
to
European
merchants
.
p
><
p
class
='
fragment
'>
The
pitch
was
practical
:
this
notation
makes
bookkeeping
and
trade
dramatically
easier
than
the
Roman
system
merchants
were
already
using
.
p
>
<
p
class
='
fragment
'>
Here
is
the
real
leap
:
the
<
em
>
same
ten
symbols
em
>''
re
-
used
''
mean
something
different
depending
on
where
they
sit
.
p
><
p
class
='
fragment
'>
106
and
160
use
identical
digits
.
Position
alone
carries
the
meaning
.
p
><
p
class
='
fragment
'>
This
single
idea
—
a
small
''
finite
alphabet
whose
meaning
depends
on
position
—
is
the
one
that
modern
computing
was
built
on
top
of
.
p
>
<
p
class
='
fragment
'>
Gottfried
Wilhelm
Leibniz
takes
positional
notation
somewhere
further
:
in
1703
''
he
formally
describes
arithmetic
in
<
strong
>
base
2
strong
>
—
binary
.
p
><
p
class
='
fragment
'>
He
was
reportedly
delighted
to
find
the
same
two
-
symbol
logic
echoed
in
the
hexagrams
of
the
I
Ching
''
and
saw
in
binary
something
close
to
a
theological
image
:
everything
created
from
nothing
(
0
)
and
unity
(
1
).
p
><
p
class
='
fragment
'>
Three
centuries
later
''
his
once
-
mystical
number
system
runs
every
computer
on
Earth
.
p
>
<
p
class
='
fragment
'>
Binary
is
just
another
positional
system
—
base
2
instead
of
base
10
.
Only
two
symbols
:
0
and
1
.
p
><
p
class
='
fragment
'>
That
turns
out
to
be
the
whole
point
.
Building
a
reliable
physical
device
with
<
em
>
ten
em
>
stable
''
distinguishable
states
is
hard
.
Building
one
with
<
em
>
two
em
>
—
voltage
on
''
voltage
off
—
is
comparatively
easy
''
cheap
''
and
extremely
reliable
at
enormous
scale
.
p
><
p
class
='
fragment
'>
Every
transistor
in
every
chip
is
''
at
heart
''
a
two
-
state
switch
pretending
to
be
one
of
Leibniz
'
s
digits
.
p
>
<
p
class
='
fragment
'>
George
Boole
(
1854
)
notices
that
0
and
1
can
represent
more
than
quantity
—
they
can
represent
<
strong
>
truth
strong
>:
false
and
true
.
p
><
p
class
='
fragment
'>
Boolean
algebra
—
AND
''
OR
''
NOT
—
becomes
the
logical
skeleton
underneath
every
circuit
in
every
digital
machine
.
p
><
p
class
='
fragment
'>
The
same
two
symbols
now
carry
both
<
em
>
arithmetic
em
>
and
<
em
>
logic
em
>.
That
overlap
is
why
a
computer
can
calculate
and
also
decide
.
p
>
<
p
class
='
fragment
'>
One
binary
digit
is
a
<
strong
>
bit
strong
>.
Group
eight
of
them
and
you
get
a
<
strong
>
byte
strong
>
—
256
possible
values
.
p
><
p
class
='
fragment
'><
strong
>
Hexadecimal
strong
>
(
base
16
)
exists
purely
as
a
convenience
:
one
hex
digit
covers
exactly
4
bits
''
so
two
hex
digits
describe
a
whole
byte
cleanly
—
far
easier
for
a
human
to
read
than
a
string
of
eight
zeros
and
ones
.
p
><
p
class
='
fragment
'>
You
already
used
one
today
''
probably
without
noticing
:
a
colour
code
''
a
MAC
address
''
a
cryptographic
key
—
all
hexadecimal
shorthand
for
binary
underneath
.
p
>
<
p
class
='
fragment
'>
So
far
:
how
a
culture
chooses
to
<
em
>
write
em
>
a
number
.
Now
:
how
a
<
em
>
machine
em
>
chooses
to
store
one
—
and
why
''
in
a
modern
AI
system
''
that
choice
is
no
longer
a
historical
curiosity
.
p
><
p
class
='
fragment
'>
It
is
an
engineering
decision
with
real
''
measurable
consequences
.
p
>
<
p
class
='
fragment
'><
strong
>
Integer
strong
>
formats
store
whole
numbers
exactly
.
<
strong
>
int8
strong
>:
one
byte
''
256
distinct
values
—
typically
-
128
to
127
.
p
><
p
class
='
fragment
'><
strong
>
Floating
-
point
strong
>
formats
trade
some
of
that
exactness
for
enormous
range
:
a
sign
bit
''
an
exponent
''
and
a
mantissa
(
the
significant
digits
)
—
the
same
idea
as
scientific
notation
''
just
in
binary
.
p
><
p
class
='
fragment
'>
More
bits
generally
buys
you
more
precision
''
more
range
''
or
both
.
Fewer
bits
buys
you
speed
and
memory
—
at
a
cost
.
p
>
<
p
class
='
fragment
'>
Both
<
strong
>
fp16
strong
>
and
<
strong
>
bf16
strong
>
use
16
bits
total
—
half
the
size
of
ordinary
fp32
—
but
split
those
bits
differently
.
p
><
p
class
='
fragment
'><
strong
>
fp16
strong
>
(
IEEE
half
precision
):
1
sign
+
5
exponent
+
10
mantissa
bits
.
More
precision
''
a
narrower
range
—
values
that
are
too
large
or
too
small
simply
overflow
to
infinity
or
zero
.
p
><
p
class
='
fragment
'><
strong
>
bf16
strong
>
(
„
brain
float
“
''
from
Google
):
1
sign
+
8
exponent
+
7
mantissa
bits
.
The
<
em
>
same
em
>
exponent
range
as
full
32
-
bit
floats
''
less
precision
—
far
more
forgiving
during
the
unstable
arithmetic
of
training
a
neural
network
.
p
><
p
class
='
fragment
'>
Same
bit
budget
.
Different
trade
-
off
between
„
how
exact
“
and
„
how
big
.
“
p
>
<
p
class
='
fragment
'>
Models
are
usually
<
em
>
trained
em
>
in
fp16
''
bf16
''
or
fp32
—
the
precision
that
stability
during
training
needs
.
p
><
p
class
='
fragment
'>
Once
trained
''
they
are
often
<
strong
>
quantized
strong
>
down
to
int8
for
<
em
>
inference
em
>
(
actually
running
the
model
):
roughly
a
quarter
of
the
memory
of
fp32
''
and
hardware
built
for
int8
can
push
through
far
more
operations
per
second
than
the
same
silicon
running
floating
point
.
p
><
p
class
='
fragment
'>
The
accuracy
cost
is
usually
small
.
The
speed
and
energy
savings
''
at
the
scale
a
real
deployment
runs
at
''
are
not
.
p
>
<
p
class
='
fragment
'>
Take
a
real
''
current
piece
of
edge
-
AI
hardware
:
NVIDIA
'
s
<
strong
>
Jetson
AGX
Orin
strong
>
(
64GB
module
).
p
><
p
class
='
fragment
'>
NVIDIA
'
s
own
published
figure
:
up
to
<
strong
>
275
TOPS
strong
>
(
trillion
operations
per
second
)
running
<
strong
>
INT8
strong
>''
with
structured
sparsity
.
p
><
p
class
='
fragment
'>
Switch
the
same
chip
to
<
strong
>
FP16
/
BF16
strong
>
and
achievable
throughput
drops
—
roughly
by
half
''
since
each
floating
-
point
operation
occupies
more
of
the
tensor
core
'
s
datapath
than
an
8
-
bit
integer
one
.
p
><
p
class
='
fragment
'><
strong
>
Same
transistors
.
Same
chip
.
strong
>
The
number
format
you
choose
to
compute
in
changes
your
real
-
world
throughput
by
a
factor
of
two
or
more
.
p
>
<
p
class
='
fragment
'>
Pythagoras
claimed
number
was
the
hidden
structure
of
reality
.
p
><
p
class
='
fragment
'>
Three
thousand
years
later
''
the
question
„
what
exactly
<
em
>
is
em
>
this
number
''
and
how
many
bits
does
it
cost
to
represent
it
“
is
no
longer
philosophy
—
it
decides
how
fast
your
model
runs
''
how
much
it
costs
to
train
''
and
how
much
energy
it
burns
doing
so
.
p
><
p
class
='
fragment
'>
The
history
of
numerals
is
''
in
a
very
literal
sense
''
the
history
of
computation
.
p
>
[Impressum, Datenschutz, Login] Other subprojects of udk.ai linkring: baumhaus.digital fibel.digital refused.science teacher.solar gardens.digital