Quest for Entropy #17: the proofs say quantum probability must be a square, never how. On the ledger a fact needs two signatures, and two lengths make an area. That is the Born rule. This episode shows that a settlement rule in which two independent books each sign for an outcome in proportion to its amplitude length, and a fact needs both signatures on the same outcome, reproduces the Born rule, for one particle and for any number of entangled particles settled one pair at a time, while one signature or three do not. The same rule leaves a distant partner's odds untouched and passes the Bell exam; the numbers are on the appendix page. It does not derive the wave: the table and its turns are standard quantum arithmetic, imported. It does not prove that nature settles this way; the two is picked out by counting, and that nature runs the same mechanism is the postulate. It does not say when a settlement occurs, or why a detector settles and a partner particle does not. It is not a claim that nature keeps books, runs a loop, or hashes records; it is a claim that a small deterministic machine with those parts passes these exams, and the code is public so that you can break it.
Quest for Entropy #17: the proofs say quantum probability must be a square, never how. On the ledger a fact needs two signatures, and two lengths make an area. That is the Born rule. This episode shows that a settlement rule in which two independent books each sign for an outcome in proportion to its amplitude length, and a fact needs both signatures on the same outcome, reproduces the Born rule, for one particle and for any number of entangled particles settled one pair at a time, while one signature or three do not. The same rule leaves a distant partner's odds untouched and passes the Bell exam; the numbers are on the appendix page. It does not derive the wave: the table and its turns are standard quantum arithmetic, imported. It does not prove that nature settles this way; the two is picked out by counting, and that nature runs the same mechanism is the postulate. It does not say when a settlement occurs, or why a detector settles and a partner particle does not. It is not a claim that nature keeps books, runs a loop, or hashes records; it is a claim that a small deterministic machine with those parts passes these exams, and the code is public so that you can break it.
Quest for Entropy #16: two particles, far apart, agree on an answer neither was carrying. On the ledger it is neither spooky nor action. This episode demonstrates that a distributed append-only ledger, with entangled particles modelled as two worldlines sharing one non-factorising wave in a hidden layer, reproduces the standard Bell/CHSH statistics (|S| measured at 2.82, standard deviation 0.01 over six runs, against the quantum 2√2 = 2.8284) while structurally forbidding signalling — with flat marginals, order-swap invariance, and a graph-traversal audit showing the two measurements have no causal path between them. It does not derive quantum mechanics: the wave arithmetic is imported from standard quantum libraries, and the Tsirelson bound is reproduced, not explained. It is not a claim that the universe is a blockchain, that there is any faster-than-light influence, or that Bell's theorem is wrong — Bell's theorem is an input here, and the model respects it by keeping its shared variable global and unreadable rather than carried locally by each particle. The reference code is a slice of the architecture: it has no space, so spatial motion, contact-fired interaction and the detection of measurement are design, not demonstrated by that code; the spatial layer is a separate part of the model with separate instruments. All numbers are code-generated, reproducible from the repository below, and under continuing verification.
Quest for Entropy #18: we ran Wheeler's late choice on a quantum computer. The order didn't matter. This episode shows that on the ledger toy from #17 the delayed-choice quantum eraser runs as a strict sequence of meetings and two settlements, with no step that waits and no message to the past, and that a real quantum computer gives the same sorted fringes whether the marker is turned and read before the photon reaches the join or after it has landed. It does not derive the arrows: the turns, the delay and the meetings are standard quantum arithmetic, imported. It does not say why a detector settles and a marker does not. It is not the first delayed-choice circuit run on a cloud quantum computer; it is ours, with the code public so that you can break it.
Quest for Entropy #3: twenty questions, one deterministic clockwork, and the two answers it could not give. This is a demonstration, not a discovery about nature. The scorecard says one family of machines, at one frozen setting, reproduced twenty specific behaviours — it does not say our universe is a clockwork, does not reinterpret quantum mechanics, and does not dodge Bell's theorem, since the hidden machinery here is global, not local. Question 16 is unfinished, not won: the certified pair sits exactly on the classical bound, and entanglement remains unreproduced. Question 6 is a confessed failure, and the cliff-or-floor dichotomy is a named conjecture, measured on both sides and proved on neither. Every number behind this piece is at the machine's own precision, about one percent, and every pass means "within that".
Quantum mechanics says that when you measure a system, the probability of an outcome is the squared modulus of that outcome's amplitude — not absolute value, not cubed, not some other power. The exponent has been two since Born wrote it down in 1926, and for a century it has been a postulate. Copenhagen accepts it as a brute fact; Many-Worlds tries to derive it from decision theory; QBism reframes it as Bayesian credence; Zurek derives it from environmental symmetries; Hardy derives it from operational axioms. Each program leaves at least part of the question unanswered: why squared, and not some other exponent? Gleason's 1957 theorem went part of the way: given a few structural conditions on quantum probability assignments, the squared form is mathematically forced. But Gleason leans on one substantive assumption — non-contextuality — that standard QM postulates rather than derives. This walkthrough shows how the Event Density framework derives the Born rule, including the squared exponent *and* the non-contextuality assumption underneath it, from a smaller set of structural commitments about what reality is made of at the substrate level. The chain has three load-bearing steps: (i) the participation measure is forced to the form √b · e^{iπ} via the Cauchy functional equation on bandwidth additivity plus Frobenius's theorem on real division algebras; (ii) the sesquilinear inner product on the participation-measure space is forced, delivering the Hilbert-space structure Gleason operates on; (iii) non-contextuality is forced by the channel-as-primitive ontology. With non-contextuality derived rather than postulated, Gleason–Busch applies directly. The squared exponent is a consequence of the framework, not a separate postulate.
The quantum measurement problem—why measurement yields a single definite outcome, and why that outcome follows the Born rule P(i)=|c_i|²—has for nearly a century been treated as a postulate rather than a derivable consequence. This paper proposes that measurement is not an extraneous process tacked onto quantum mechanics; it is the natural execution of the settlement operation Ŝ(Θ). The core settlement cost functional is defined as C[ρ]=D_KL(ρ∥ρ_target)+β·Tr(ρH)−η·N(ρ). Three core results are obtained: (1) The Born rule P(i)=|c_i|² is strictly derived as the statistical limit of KL divergence minimization under projective measurement, requiring no additional postulates; (2) Wavefunction collapse is reinterpreted as irreversible settlement commitment. The stochasticity and nonlinearity of collapse originate from discrete Kraus branch selection of settlement operations; (3) A finite non-zero settlement delay τ_settle is predicted, which varies with consciousness parameters C, Q, A, I. High-coherence observers (C>0.8) possess far shorter settlement delay than ordinary humans or electronic detectors. This paper gives the explicit formula τ_setle=1/[η₀·C·Q·(1−A)·I] and designs a delayed-choice Bell experiment based on SPDC entangled photons for experimental verification. Predictions P1 and P3 from the series provide direct experimental channels to test this settlement framework. quantum measurement problem, Born rule, wavefunction collapse, settlement choice, settlement delay, consciousness parameters, two-phase settlement, Ξ-field
Quest for Entropy #2: how a clockwork with no dice fakes quantum mechanics — the machine taken apart, the exam it passed, and the one wall it cannot get past. This is a demonstration, not a discovery about nature. It does not say our universe is a clockwork, does not reinterpret quantum mechanics, and does not dodge Bell's theorem — the hidden machinery is global, not local, exactly because Bell rules out the local kind (we checked). The recipe was found by an optimizer and only later shown to sit at a fixed point of the geometry; the build is engineering, and we say so. The claim is only this: quantum-looking behaviour can come out of a deterministic machine plus a physical measurement — not that this is why our world is quantum. Everything here describes one family of machines at the settings we tested, and where it fails, it fails in public.