Ciro Santilli @cirosantilli 37

Claims provably fair. satoshidice.com/fair clarifies what that means: they prove fairness by releasing a hash of the seed before the bets, and the actual seed after the bets.

As mentioned in bitcoin.it, it functions basically as cryptocurrency tumbler in practice.

 Read the full article

Variants of SARS-CoV-2 Updated 2025-07-16

 Read the full article

Why it is hard to simulate quantum systems? Updated 2025-07-16

 View more

This is basically how quantum computing was first theorized by Richard Feynman: quantum computers as experiments that are hard to predict outcomes.

TODO answer that: quantumcomputing.stackexchange.com/questions/5005/why-it-is-hard-to-simulate-a-quantum-device-by-a-classical-devices. A good answer would be with a more physical example of quantum entanglement, e.g. on a photonic quantum computer.

 Read the full article

All groups are isomorphic to a subgroup of the symmetric group Updated 2025-07-16

 View more

Or in other words: symmetric groups are boring, because they are basically everything already!

 Read the full article

Columbia Radiation Laboratory Updated 2025-07-16

 Read the full article

qiskit/hello.py Updated 2025-07-16

 View more

Our example uses a Bell state circuit to illustrate all the fundamental Qiskit basics.

Sample program output, counts are randomized each time.

First we take the quantum state vector immediately after the

∣ 00 ⟩

input.

input:
state:
Statevector([1.+0.j, 0.+0.j, 0.+0.j, 0.+0.j],
            dims=(2, 2))
probs:
[1. 0. 0. 0.]

We understand that the first element of Statevector is

∣ 00 ⟩

, and has probability of 1.0.

Next we take the state after a Hadamard gate on the first qubit:

h:
state:
Statevector([0.70710678+0.j, 0.70710678+0.j, 0.        +0.j,
             0.        +0.j],
            dims=(2, 2))
probs:
[0.5 0.5 0.  0. ]

We now understand that the second element of the Statevector is

∣ 01 ⟩

, and now we have a 50/50 propabability split for the first bit.

Then we apply the CNOT gate:

cx:
state:
Statevector([0.70710678+0.j, 0.        +0.j, 0.        +0.j,
             0.70710678+0.j],
            dims=(2, 2))
probs:
[0.5 0.  0.  0.5]

which leaves us with the final

\frac{∣ 00 ⟩ + ∣ 11 ⟩}{2}

Then we print the circuit a bit:

qc without measure:
     ┌───┐
q_0: ┤ H ├──■──
     └───┘┌─┴─┐
q_1: ─────┤ X ├
          └───┘
c: 2/══════════

qc with measure:
     ┌───┐     ┌─┐
q_0: ┤ H ├──■──┤M├───
     └───┘┌─┴─┐└╥┘┌─┐
q_1: ─────┤ X ├─╫─┤M├
          └───┘ ║ └╥┘
c: 2/═══════════╩══╩═
                0  1
qasm:
OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
creg c[2];
h q[0];
cx q[0],q[1];
measure q[0] -> c[0];
measure q[1] -> c[1];

And finally we compile the circuit and do some sample measurements:

qct:
     ┌───┐     ┌─┐
q_0: ┤ H ├──■──┤M├───
     └───┘┌─┴─┐└╥┘┌─┐
q_1: ─────┤ X ├─╫─┤M├
          └───┘ ║ └╥┘
c: 2/═══════════╩══╩═
                0  1
counts={'11': 484, '00': 516}
counts={'11': 493, '00': 507}

 Read the full article

Open outrcy Updated 2025-07-16

 Read the full article

Standard output Updated 2025-07-16

 Read the full article

Stanford University faculty Updated 2025-07-16

 Read the full article

Super Mario Bros. reverse engineering Updated 2025-07-16

 View more

Commented and labelled disassembly: gist.github.com/1wErt3r/4048722

Decompilation project: github.com/MitchellSternke/SuperMarioBros-C. That project does not produce the ROM however, it reimplements an emulator + game in a single binary.