Source identity
| Field | Recorded value |
|---|---|
| Source type | archive member |
| Original record | seferim_behavior_probes.mjs |
| Date | Not specified in source |
| Path or archive member | archives/libsrc-b5cb90ed4bd7/AI_DEEP_SCAN_2026-10-14_v2/checks/seferim_behavior_probes.mjs |
| Original SHA-256 | 220d3345ad69ba64b618274ee171148780dab9026b8431b23646f0b4a617a75a |
| Reading-copy SHA-256 | 220d3345ad69ba64b618274ee171148780dab9026b8431b23646f0b4a617a75a |
| Archive source | {"sourceId": "libsrc-b5cb90ed4bd7", "member": "AI_DEEP_SCAN_2026-10-14_v2/checks/seferim_behavior_probes.mjs"} |
Recovered source transcript
Download complete source text ↓25 lines · 2.7 KB
// Audit probes, authored for this scan; imports the unmodified, Git-hash-verified module.
import * as S from '../verified_source/seferim-core/src/seferim-core.js';
const out={};
const ce=new S.ConsciousnessEngine(); const first=ce.evaluate(); let identical=true;
for(let i=0;i<100;i++) identical &&= JSON.stringify(ce.evaluate())===JSON.stringify(first);
out.constant_field={evaluations:101,identical,score:first.consciousness,dimensions:first.binding.length};
const a=new S.LatticeEngine(),b=new S.LatticeEngine(); for(const row of b.W)row.fill(1);
let maximumDifference=0;
for(let t=0;t<100;t++) { const u=Array.from({length:16},(_,k)=>Math.sin(t/7+k));a.step(u);b.step(u);for(let j=0;j<16;j++)for(let k=0;k<16;k++)maximumDifference=Math.max(maximumDifference,Math.abs(a.state[j][k]-b.state[j][k])); }
out.weight_feedback={steps:100,max_state_difference:maximumDifference,initial_weights_a:0,initial_weights_b:1};
const brain=new S.NeuralBrain();const synchrony=[brain.synchrony()];for(let t=0;t<1000;t++){brain.step(Math.sin(t/20),()=>0.5);synchrony.push(brain.synchrony());}
out.synchrony={steps:1000,min:Math.min(...synchrony),max:Math.max(...synchrony),unique:new Set(synchrony).size};
const m=new S.DNAMemory();for(let i=0;i<100;i++)m.learn('drum');out.memory_score={learns:100,weight:1,item:'drum',query_norm:m.queryNorm('drum')};
out.unicode_hash={a:'A',b:'Ł',hash_a:S.fnv1a('A'),hash_b:S.fnv1a('Ł'),collision:S.fnv1a('A')===S.fnv1a('Ł')};
const lat=new S.LatticeEngine();for(let t=0;t<10000;t++)lat.step(new Array(16).fill(1));out.sustained_lattice_input={steps:10000,input_each_dimension:1,strand0_first:lat.state[0][0],strand0_l2:lat.strandEnergy(0),max_weight:Math.max(...lat.W.flatMap(r=>[...r]))};
const bad=new S.MetaState({init:[0.1]});const badResult=bad.step({utility:0.5,stability:1});out.short_state={length:1,finite_outputs:badResult.state.filter(Number.isFinite).length,total_outputs:badResult.state.length};
const g=new S.Gate5000();g.step([]);out.empty_gate_input={throws:false,binary:[...g.gates].every(v=>v===0||v===1)};
// Differential reference of the C++ update order; this is NOT a compiled C++ run.
const cur=new Array(16).fill(0.1),prev=cur.slice(),p={dx_norm:0.4,ed_error:0.2,utility:0.6,stability:0.5};
const fam=cur.map((v,k)=>S.families[k](v,p));const earlyB=S.normalizer(fam),gamma=0.1+0.9*p.stability;
const nativeOrder=fam.map((v,k)=>(cur[k]+gamma*(0.5*v+0.5*(prev[k]+(S.PHI-1)*(cur[k]-prev[k]))-cur[k]))*earlyB);
const jsResult=new S.MetaState({init:cur}).step(p);
out.normalization_order={input:p,initial_each:0.1,cpp_order_b:earlyB,js_b:jsResult.b,max_abs_state_difference:Math.max(...nativeOrder.map((v,k)=>Math.abs(v-jsResult.state[k]))),method:'C++ order re-expressed in JavaScript, not native execution'};
console.log(JSON.stringify(out,null,2));