Ciro Santilli @cirosantilli 40

 Articles (13k) Discussions (29) Comments (66) Follows  Received likes Files

New Updated  Top  Announced  A-Z  Liked  Followed

Public relations Updated 2025-07-16

The reason public relations is evil in modern society is because, like discrimination, public relations works by dumb association and not logic or fairness.

If you're the son of the killer, you're fucked.

This is unlike our ideal for law which attempts, though sometimes fails, at isolating cause and effect.

 Read the full article

Quantization as an Eigenvalue Problem Updated 2025-07-16

 View more

This paper appears to calculate the Schrödinger equation solution for the hydrogen atom.

TODO is this the original paper on the Schrödinger equation?

Published on Annalen der Physik in 1926.

Open access in German at: onlinelibrary.wiley.com/doi/10.1002/andp.19263840404 which gives volume 384, Issue 4, Pages 361-376. Kudos to Wiley for that. E.g. Nature did not have similar policies as of 2023.

This paper may have fallen into the public domain in the US in 2022! On the Internet Archive we can see scans of the journal that contains it at: ia903403.us.archive.org/29/items/sim_annalen-der-physik_1926_79_contents/sim_annalen-der-physik_1926_79_contents.pdf. Ciro Santilli extracted just the paper to: commons.wikimedia.org/w/index.php?title=File%3AQuantisierung_als_Eigenwertproblem.pdf. It is not as well processed as the Wiley one, but it is of 100% guaranteed clean public domain provenance! TODO: hmmm, it may be public domain in the USA but not Germany, where 70 years after author deaths rules, and Schrodinger died in 1961, so it may be up to 2031 in that country... messy stuff. There's also the question of wether copyright is was tranferred to AdP at publication or not.

An early English translation present at Collected Papers On Wave Mechanics by Deans (1928).

Contains formulas such as the Schrödinger equation solution for the hydrogen atom (1''):

(\frac{\partial ψ}{\partial x})^{2} + (\frac{\partial ψ}{\partial y})^{2} + (\frac{\partial ψ}{\partial z})^{2} + \frac{2 m}{K} (E + \frac{2}{r}) ψ^{2} = 0

(1)

where:

$r = x^{2} + y^{2} + z^{2}$
In order for there to be numerical agreement, $K$ must have the value $h /2 π$
$e$ , $m$ are the charge and mass of the electron

 Read the full article

Program Raspberry Pi Pico W with C Updated 2025-07-26

 View more

Ubuntu 22.04 build just worked, nice! Much feels much cleaner than the Micro Bit C setup:

sudo apt install cmake gcc-arm-none-eabi libnewlib-arm-none-eabi libstdc++-arm-none-eabi-newlib

git clone https://github.com/raspberrypi/pico-sdk
cd pico-sdk
git checkout 2e6142b15b8a75c1227dd3edbe839193b2bf9041
cd ..

git clone https://github.com/raspberrypi/pico-examples
cd pico-examples
git checkout a7ad17156bf60842ee55c8f86cd39e9cd7427c1d
cd ..

export PICO_SDK_PATH="$(pwd)/pico-sdk"
cd pico-exampes
mkdir build
cd build
# Board selection.
# https://www.raspberrypi.com/documentation/microcontrollers/c_sdk.html also says you can give wifi ID and password here for W.
cmake -DPICO_BOARD=pico_w ..
make -j

Then we install the programs just like any other UF2 but plugging it in with BOOTSEL pressed and copying the UF2 over, e.g.:

cp pico_w/blink/picow_blink.uf2 /media/$USER/RPI-RP2/

Note that there is a separate example for the W and non W LED, for non-W it is:

cp blink/blink.uf2 /media/$USER/RPI-RP2/

Also tested the UART over USB example:

cp hello_world/usb/hello_usb.uf2 /media/$USER/RPI-RP2/

You can then see the UART messages with:

screen /dev/ttyACM0 115200

TODO understand the proper debug setup, and a flash setup that doesn't require us to plug out and replug the thing every two seconds. www.electronicshub.org/programming-raspberry-pi-pico-with-swd/ appears to describe it, with SWD to do both debug and flash. To do it, you seem need another board with GPIO, e.g. a Raspberry Pi, the laptop alone is not enough.

 Read the full article

Product definition of the exponential function Updated 2025-07-16

 View more

e^{x} = lim_{n \to \infty} (1 + \frac{x}{n})^{n}

(1)

The basic intuition for this is to start from the origin and make small changes to the function based on its known derivative at the origin.

More precisely, we know that for any base b, exponentiation satisfies:

$b^{x + y} = b^{x} b^{y}$ .
$b^{0} = 1$ .

And we also know that for

b = e

in particular that we satisfy the exponential function differential equation and so:

\frac{d e ^{x}}{d x} (0) = 1

(2)

One interesting fact is that the only thing we use from the exponential function differential equation is the value around

x = 0

, which is quite little information! This idea is basically what is behind the importance of the ralationship between Lie group-Lie algebra correspondence via the exponential map. In the more general settings of groups and manifolds, restricting ourselves to be near the origin is a huge advantage.

Now suppose that we want to calculate

e^{1}

. The idea is to start from

e^{0}

and then then to use the first order of the Taylor series to extend the known value of

e^{0}

e^{1}

E.g., if we split into 2 parts, we know that:

e^{1} = e^{1/2} e^{1/2}

(3)

or in three parts:

e^{1} = e^{1/3} e^{1/3} e^{1/3}

(4)

so we can just use arbitrarily many parts

e^{1/ n}

that are arbitrarily close to

x = 0

e^{1} = (e^{1/ n})^{n}

(5)

and more generally for any

x

we have:

e^{x} = (e^{x / n})^{n}

(6)

Let's see what happens with the Taylor series. We have near

y = 0

in little-o notation:

e^{y} = 1 + y + o (y)

(7)

Therefore, for

y = x / n

, which is near

y = 0

for any fixed

x

e^{x / n} = 1 + x / n + o (1/ n)

(8)

and therefore:

e^{x} = (e^{x / n})^{n} = (1 + x / n + o (1/ n))^{n}

(9)

which is basically the formula tha we wanted. We just have to convince ourselves that at

lim_{n \to \infty}

, the

o (1/ n)

disappears, i.e.:

(1 + x / n + o (1/ n))^{n} = (1 + x / n)^{n}

(10)

To do that, let's multiply

e^{y}

by itself once:

e^{y} e^{y} = (1 + y + o (y)) (1 + y + o (y)) = 1 + 2 y + o (y)

(11)

and multiplying a third time:

e^{y} e^{y} e^{y} = (1 + 2 y + o (y)) (1 + y + o (y)) = 1 + 3 y + o (y)

(12)

TODO conclude.

 Read the full article

Primer (YouTube channel) Updated 2025-07-16

 View more

This channel contains several 2D continuous simulations and explains AI techniques used.

The engine appears to be open source: github.com/Primer-Learning/PrimerTools (previously at: github.com/Helpsypoo/primer). Models are closed source however.

They have several interesting multiagent game ideas.

Claims Unity-based, so has the downside of relying on a non-FOSS engine.

Ciro became mildly jealous of this channel when he found out about it, because at 800k subscribers at the time, the creator is likely able to make a living off of it, something which Ciro thought impossible.

As of 2022 he was at 1.6M followers with only 17 videos! Of course, much of those videos is about the software and they require infinite development hours to video time ratios.

Much of this success hinges a large part on the amazing 3D game presentation.

Well done!

Created by Justin Helps. Awesome name.

To make things better, the generically named channel is also the title of one of the best films of al time: Primer (2004).

Video 1.

Simulating Foraging Decisions by Primer (2020)

Source.

 Read the full article

Primality test Updated 2025-07-16

 Read the full article

Pre-trained computer vision model Updated 2025-07-16

 Read the full article

PQShield Updated 2025-09-17

 View more

They seem to be doing hardware acceleration for post-quantum cryptography algorithm.

One has to feel bad for them as they likely threw out entire chip designs over NIST Post-Quantum Cryptography Standardization algorithm breakeges.

 Read the full article

Power, performance and area Updated 2025-07-16

 View more

en.wikichip.org/wiki/power-performance-area

This is the mantra of the semiconductor industry:

power and area are the main limiting factors of chips, i.e., your budget:
- chip area is ultra expensive because there are sporadic errors in the fabrication process, and each error in any part of the chip can potentially break the entire chip. Although there are
  The percentage of working chips is called the yield.
  In some cases however, e.g. if the error only affects single CPU of a multi-core CPU, then they actually deactivate the broken CPU after testing, and sell the worse CPU cheaper with a clear branding of that: this is called binning www.tomshardware.com/uk/reviews/glossary-binning-definition,5892.html
- power is a major semiconductor limit as of 2010's and onwards. If everything turns on at once, the chip would burn. Designs have to account for that.
performance is the goal.
Conceptually, this is basically a set of algorithms that you want your hardware to solve, each one with a respective weight of importance.
Serial performance is fundamentally limited by the longest path that electrons have to travel in a given clock cycle.
The way to work around it is to create pipelines, splitting up single operations into multiple smaller operations, and storing intermediate results in memories.

 Read the full article

Post-quantum cryptography Updated 2025-07-16

 View more

Encryption algorithms that run on classical computers that are expected to be resistant to quantum computers.

This is notably not the case of the dominant 2020 algorithms, RSA and elliptic curve cryptography, which are provably broken by Grover's algorithm.

However, as of 2020, we don't have any proof that any symmetric or public key algorithm is quantum resistant.

Post-quantum cryptography is the very first quantum computing thing at which people have to put money into.

The reason is that attackers would be able to store captured ciphertext, and then retroactively break them once and if quantum computing power becomes available in the future.

There isn't a shade of a doubt that intelligence agencies are actively doing this as of 2020. They must have a database of how interesting a given source is, and then store as much as they can given some ammount of storage budget they have available.

A good way to explain this to quantum computing skeptics is to ask them:

If I told you there is a 5% chance that I will be able to decrypt everything you write online starting today in 10 years. Would you give me a dollar to reduce that chance to 0.5%?