tricu

io-protocol.test.mjs (2503B)

---

 import test from 'node:test';
 import assert from 'node:assert/strict';
 import {Graph} from '../dist/graph.js';
 import {natural,text} from '../dist/codecs.js';
 import {canonicalNat,decodeAction,header} from '../dist/io-protocol.js';
 function setup(){
  const g=new Graph(),poison=g.app(g.leaf,g.leaf),observe=g.observe.bind(g);
  g.observe=id=>{if(id===poison)throw Error('FORCED opaque payload');return observe(id);};
  const request=(group,revision,op,args=poison)=>g.fork(natural(g,10n),g.fork(group,g.fork(revision,g.fork(op,args))));
  return {g,poison,request};
 }
 test('v2 header decoding preserves opaque core and future request payloads',()=>{
  const {g,poison,request}=setup();
  for(let n=0;n<10;n++)assert.deepEqual(decodeAction(g,g.fork(natural(g,BigInt(n)),poison)),{kind:'core',code:n,payload:poison});
  for(const n of [11n,255n,256n])assert.throws(()=>decodeAction(g,g.fork(natural(g,n),poison)),/unknown computation/);
  assert.deepEqual(header(g,request(text(g,'future-9'),natural(g,65535n),text(g,'unknown'))),{kind:'request',group:'future-9',revision:65535,operation:'unknown'});
  assert.throws(()=>decodeAction(g,g.leaf),/invalid computation shape/);
 });
 test('v2 names, revisions and bits are bounded and strictly canonical',()=>{
  const {g,poison,request}=setup(),good=text(g,'file'),one=natural(g,1n),zero=g.fork(g.leaf,g.leaf);
  for(const invalid of ['', '-file','1file','File','a_b','a b','a\x7f','a'.repeat(65)]){
   assert.throws(()=>decodeAction(g,request(text(g,invalid),one,good)),/invalid facility header/);
   assert.throws(()=>decodeAction(g,request(good,one,text(g,invalid))),/invalid facility header/);
  }
  for(const revision of [g.leaf,zero,natural(g,65536n)])assert.throws(()=>decodeAction(g,request(good,revision,good)),/invalid facility header/);
  assert.throws(()=>decodeAction(g,request(g.leaf,poison,poison)),/invalid facility header/);
  assert.equal(canonicalNat(g,zero,8),undefined);
  assert.throws(()=>decodeAction(g,g.fork(zero,poison)),/unknown computation/);
  assert.equal(header(g,request(text(g,'a'.repeat(64)),one,good)).group.length,64);
  let excess=g.fork(poison,poison);
  for(let i=0;i<64;i++)excess=g.fork(natural(g,97n),excess);
  assert.throws(()=>decodeAction(g,request(excess,one,good)),/invalid facility header/);
  let long=g.fork(poison,poison);
  for(let i=0;i<8;i++)long=g.fork(g.leaf,long);
  assert.equal(canonicalNat(g,long,8),undefined);
  assert.throws(()=>decodeAction(g,poison),/FORCED/); // reduction faults are not malformed-header Results
 });