@gardenfi/orderbook 0.2.0-beta.12 → 0.2.0-beta.13

package/dist/index66.js

@@ -1,64 +1,107 @@
-import { exists as g, output as d } from "./index70.js";
-import { Hash as b, createView as p, toBytes as a } from "./index67.js";
-function w(o, t, s, i) {
-  if (typeof o.setBigUint64 == "function")
-    return o.setBigUint64(t, s, i);
-  const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), c = i ? 4 : 0, u = i ? 0 : 4;
-  o.setUint32(t + c, e, i), o.setUint32(t + u, r, i);
+import { number as d, exists as k, bytes as B, output as A } from "./index70.js";
+import { split as H, rotlBH as m, rotlSH as S, rotlBL as T, rotlSL as F } from "./index71.js";
+import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index69.js";
+const y = [], L = [], b = [], M = /* @__PURE__ */ BigInt(0), f = /* @__PURE__ */ BigInt(1), R = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(7), C = /* @__PURE__ */ BigInt(256), q = /* @__PURE__ */ BigInt(113);
+for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
+  [s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), L.push((e + 1) * (e + 2) / 2 % 64);
+  let o = M;
+  for (let r = 0; r < 7; r++)
+    t = (t << f ^ (t >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
+  b.push(o);
 }
-const B = (o, t, s) => o & t ^ ~o & s, L = (o, t, s) => o & t ^ o & s ^ t & s;
-class U extends b {
-  constructor(t, s, i, n) {
-    super(), this.blockLen = t, this.outputLen = s, this.padOffset = i, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = p(this.buffer);
+const [v, z] = /* @__PURE__ */ H(b, !0), O = (e, t, s) => s > 32 ? m(e, t, s) : S(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : F(e, t, s);
+function D(e, t = 24) {
+  const s = new Uint32Array(10);
+  for (let n = 24 - t; n < 24; n++) {
+    for (let i = 0; i < 10; i++)
+      s[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
+    for (let i = 0; i < 10; i += 2) {
+      const h = (i + 8) % 10, l = (i + 2) % 10, u = s[l], c = s[l + 1], _ = O(u, c, 1) ^ s[h], g = w(u, c, 1) ^ s[h + 1];
+      for (let a = 0; a < 50; a += 10)
+        e[i + a] ^= _, e[i + a + 1] ^= g;
+    }
+    let o = e[2], r = e[3];
+    for (let i = 0; i < 24; i++) {
+      const h = L[i], l = O(o, r, h), u = w(o, r, h), c = y[i];
+      o = e[c], r = e[c + 1], e[c] = l, e[c + 1] = u;
+    }
+    for (let i = 0; i < 50; i += 10) {
+      for (let h = 0; h < 10; h++)
+        s[h] = e[i + h];
+      for (let h = 0; h < 10; h++)
+        e[i + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
+    }
+    e[0] ^= v[n], e[1] ^= z[n];
+  }
+  s.fill(0);
+}
+class p extends E {
+  // NOTE: we accept arguments in bytes instead of bits here.
+  constructor(t, s, n, o = !1, r = 24) {
+    if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, d(n), 0 >= this.blockLen || this.blockLen >= 200)
+      throw new Error("Sha3 supports only keccak-f1600 function");
+    this.state = new Uint8Array(200), this.state32 = U(this.state);
+  }
+  keccak() {
+    x || I(this.state32), D(this.state32, this.rounds), x || I(this.state32), this.posOut = 0, this.pos = 0;
   }
   update(t) {
-    g(this);
-    const { view: s, buffer: i, blockLen: n } = this;
-    t = a(t);
-    const h = t.length;
-    for (let e = 0; e < h; ) {
-      const r = Math.min(n - this.pos, h - e);
-      if (r === n) {
-        const c = p(t);
-        for (; n <= h - e; e += n)
-          this.process(c, e);
-        continue;
-      }
-      i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
+    k(this);
+    const { blockLen: s, state: n } = this;
+    t = P(t);
+    const o = t.length;
+    for (let r = 0; r < o; ) {
+      const i = Math.min(s - this.pos, o - r);
+      for (let h = 0; h < i; h++)
+        n[this.pos++] ^= t[r++];
+      this.pos === s && this.keccak();
     }
-    return this.length += t.length, this.roundClean(), this;
+    return this;
+  }
+  finish() {
+    if (this.finished)
+      return;
+    this.finished = !0;
+    const { state: t, suffix: s, pos: n, blockLen: o } = this;
+    t[n] ^= s, s & 128 && n === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
+  }
+  writeInto(t) {
+    k(this, !1), B(t), this.finish();
+    const s = this.state, { blockLen: n } = this;
+    for (let o = 0, r = t.length; o < r; ) {
+      this.posOut >= n && this.keccak();
+      const i = Math.min(n - this.posOut, r - o);
+      t.set(s.subarray(this.posOut, this.posOut + i), o), this.posOut += i, o += i;
+    }
+    return t;
+  }
+  xofInto(t) {
+    if (!this.enableXOF)
+      throw new Error("XOF is not possible for this instance");
+    return this.writeInto(t);
+  }
+  xof(t) {
+    return d(t), this.xofInto(new Uint8Array(t));
   }
   digestInto(t) {
-    g(this), d(t, this), this.finished = !0;
-    const { buffer: s, view: i, blockLen: n, isLE: h } = this;
-    let { pos: e } = this;
-    s[e++] = 128, this.buffer.subarray(e).fill(0), this.padOffset > n - e && (this.process(i, 0), e = 0);
-    for (let f = e; f < n; f++)
-      s[f] = 0;
-    w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
-    const r = p(t), c = this.outputLen;
-    if (c % 4)
-      throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const u = c / 4, l = this.get();
-    if (u > l.length)
-      throw new Error("_sha2: outputLen bigger than state");
-    for (let f = 0; f < u; f++)
-      r.setUint32(4 * f, l[f], h);
+    if (A(t, this), this.finished)
+      throw new Error("digest() was already called");
+    return this.writeInto(t), this.destroy(), t;
   }
   digest() {
-    const { buffer: t, outputLen: s } = this;
-    this.digestInto(t);
-    const i = t.slice(0, s);
-    return this.destroy(), i;
+    return this.digestInto(new Uint8Array(this.outputLen));
+  }
+  destroy() {
+    this.destroyed = !0, this.state.fill(0);
   }
   _cloneInto(t) {
-    t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: s, buffer: i, length: n, finished: h, destroyed: e, pos: r } = this;
-    return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
+    const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: i } = this;
+    return t || (t = new p(s, n, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
   }
 }
+const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
 export {
-  B as Chi,
-  U as HashMD,
-  L as Maj
+  p as Keccak,
+  D as keccakP,
+  Q as keccak_256
 };

package/dist/index67.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index70.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */const u=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4)),i=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),y=(t,e)=>t<<32-e|t>>>e,b=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68,o=t=>t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255;function p(t){for(let e=0;e<t.length;e++)t[e]=o(t[e])}function f(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function r(t){return typeof t=="string"&&(t=f(t)),s.bytes(t),t}class w{clone(){return this._cloneInto()}}function l(t){const e=c=>t().update(r(c)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}exports.Hash=w;exports.byteSwap=o;exports.byteSwap32=p;exports.createView=i;exports.isLE=b;exports.rotr=y;exports.toBytes=r;exports.u32=u;exports.utf8ToBytes=f;exports.wrapConstructor=l;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=6,s=32,e=4096,n=s*e,o=n*t-1-1*e*t;exports.bytesPerBlob=n;exports.bytesPerFieldElement=s;exports.fieldElementsPerBlob=e;exports.maxBytesPerTransaction=o;

package/dist/index67.js

@@ -1,37 +1,7 @@
-import { bytes as f } from "./index70.js";
-/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
-const s = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4)), y = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), p = (t, e) => t << 32 - e | t >>> e, b = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68, c = (t) => t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
-function w(t) {
-  for (let e = 0; e < t.length; e++)
-    t[e] = c(t[e]);
-}
-function r(t) {
-  if (typeof t != "string")
-    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
-  return new Uint8Array(new TextEncoder().encode(t));
-}
-function u(t) {
-  return typeof t == "string" && (t = r(t)), f(t), t;
-}
-class x {
-  // Safe version that clones internal state
-  clone() {
-    return this._cloneInto();
-  }
-}
-function g(t) {
-  const e = (o) => t().update(u(o)).digest(), n = t();
-  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
-}
+const e = 32, s = 4096, t = 131072, l = 761855;
 export {
-  x as Hash,
-  c as byteSwap,
-  w as byteSwap32,
-  y as createView,
-  b as isLE,
-  p as rotr,
-  u as toBytes,
-  s as u32,
-  r as utf8ToBytes,
-  g as wrapConstructor
+  t as bytesPerBlob,
+  e as bytesPerFieldElement,
+  s as fieldElementsPerBlob,
+  l as maxBytesPerTransaction
 };

package/dist/index68.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=6,s=32,e=4096,n=s*e,o=n*t-1-1*e*t;exports.bytesPerBlob=n;exports.bytesPerFieldElement=s;exports.fieldElementsPerBlob=e;exports.maxBytesPerTransaction=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("./index70.cjs"),u=require("./index69.cjs");function a(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),h=BigInt(4294967295),e=Number(s>>n&h),r=Number(s&h),c=i?4:0,l=i?0:4;o.setUint32(t+c,e,i),o.setUint32(t+l,r,i)}const d=(o,t,s)=>o&t^~o&s,b=(o,t,s)=>o&t^o&s^t&s;class w extends u.Hash{constructor(t,s,i,n){super(),this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(t),this.view=u.createView(this.buffer)}update(t){p.exists(this);const{view:s,buffer:i,blockLen:n}=this;t=u.toBytes(t);const h=t.length;for(let e=0;e<h;){const r=Math.min(n-this.pos,h-e);if(r===n){const c=u.createView(t);for(;n<=h-e;e+=n)this.process(c,e);continue}i.set(t.subarray(e,e+r),this.pos),this.pos+=r,e+=r,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){p.exists(this),p.output(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:h}=this;let{pos:e}=this;s[e++]=128,this.buffer.subarray(e).fill(0),this.padOffset>n-e&&(this.process(i,0),e=0);for(let f=e;f<n;f++)s[f]=0;a(i,n-8,BigInt(this.length*8),h),this.process(i,0);const r=u.createView(t),c=this.outputLen;if(c%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=c/4,g=this.get();if(l>g.length)throw new Error("_sha2: outputLen bigger than state");for(let f=0;f<l;f++)r.setUint32(4*f,g[f],h)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:h,destroyed:e,pos:r}=this;return t.length=n,t.pos=r,t.finished=h,t.destroyed=e,n%s&&t.buffer.set(i),t}}exports.Chi=d;exports.HashMD=w;exports.Maj=b;

package/dist/index68.js

@@ -1,7 +1,64 @@
-const e = 32, s = 4096, t = 131072, l = 761855;
+import { exists as g, output as d } from "./index70.js";
+import { Hash as b, createView as p, toBytes as a } from "./index69.js";
+function w(o, t, s, i) {
+  if (typeof o.setBigUint64 == "function")
+    return o.setBigUint64(t, s, i);
+  const n = BigInt(32), h = BigInt(4294967295), e = Number(s >> n & h), r = Number(s & h), c = i ? 4 : 0, u = i ? 0 : 4;
+  o.setUint32(t + c, e, i), o.setUint32(t + u, r, i);
+}
+const B = (o, t, s) => o & t ^ ~o & s, L = (o, t, s) => o & t ^ o & s ^ t & s;
+class U extends b {
+  constructor(t, s, i, n) {
+    super(), this.blockLen = t, this.outputLen = s, this.padOffset = i, this.isLE = n, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = p(this.buffer);
+  }
+  update(t) {
+    g(this);
+    const { view: s, buffer: i, blockLen: n } = this;
+    t = a(t);
+    const h = t.length;
+    for (let e = 0; e < h; ) {
+      const r = Math.min(n - this.pos, h - e);
+      if (r === n) {
+        const c = p(t);
+        for (; n <= h - e; e += n)
+          this.process(c, e);
+        continue;
+      }
+      i.set(t.subarray(e, e + r), this.pos), this.pos += r, e += r, this.pos === n && (this.process(s, 0), this.pos = 0);
+    }
+    return this.length += t.length, this.roundClean(), this;
+  }
+  digestInto(t) {
+    g(this), d(t, this), this.finished = !0;
+    const { buffer: s, view: i, blockLen: n, isLE: h } = this;
+    let { pos: e } = this;
+    s[e++] = 128, this.buffer.subarray(e).fill(0), this.padOffset > n - e && (this.process(i, 0), e = 0);
+    for (let f = e; f < n; f++)
+      s[f] = 0;
+    w(i, n - 8, BigInt(this.length * 8), h), this.process(i, 0);
+    const r = p(t), c = this.outputLen;
+    if (c % 4)
+      throw new Error("_sha2: outputLen should be aligned to 32bit");
+    const u = c / 4, l = this.get();
+    if (u > l.length)
+      throw new Error("_sha2: outputLen bigger than state");
+    for (let f = 0; f < u; f++)
+      r.setUint32(4 * f, l[f], h);
+  }
+  digest() {
+    const { buffer: t, outputLen: s } = this;
+    this.digestInto(t);
+    const i = t.slice(0, s);
+    return this.destroy(), i;
+  }
+  _cloneInto(t) {
+    t || (t = new this.constructor()), t.set(...this.get());
+    const { blockLen: s, buffer: i, length: n, finished: h, destroyed: e, pos: r } = this;
+    return t.length = n, t.pos = r, t.finished = h, t.destroyed = e, n % s && t.buffer.set(i), t;
+  }
+}
 export {
-  t as bytesPerBlob,
-  e as bytesPerFieldElement,
-  s as fieldElementsPerBlob,
-  l as maxBytesPerTransaction
+  B as Chi,
+  U as HashMD,
+  L as Maj
 };

package/dist/index69.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./index70.cjs"),a=require("./index71.cjs"),c=require("./index67.cjs"),I=[],O=[],w=[],B=BigInt(0),f=BigInt(1),A=BigInt(2),S=BigInt(7),H=BigInt(256),T=BigInt(113);for(let i=0,t=f,s=1,n=0;i<24;i++){[s,n]=[n,(2*s+3*n)%5],I.push(2*(5*n+s)),O.push((i+1)*(i+2)/2%64);let o=B;for(let r=0;r<7;r++)t=(t<<f^(t>>S)*T)%H,t&A&&(o^=f<<(f<<BigInt(r))-f);w.push(o)}const[m,E]=a.split(w,!0),y=(i,t,s)=>s>32?a.rotlBH(i,t,s):a.rotlSH(i,t,s),b=(i,t,s)=>s>32?a.rotlBL(i,t,s):a.rotlSL(i,t,s);function L(i,t=24){const s=new Uint32Array(10);for(let n=24-t;n<24;n++){for(let e=0;e<10;e++)s[e]=i[e]^i[e+10]^i[e+20]^i[e+30]^i[e+40];for(let e=0;e<10;e+=2){const h=(e+8)%10,p=(e+2)%10,d=s[p],u=s[p+1],_=y(d,u,1)^s[h],g=b(d,u,1)^s[h+1];for(let k=0;k<50;k+=10)i[e+k]^=_,i[e+k+1]^=g}let o=i[2],r=i[3];for(let e=0;e<24;e++){const h=O[e],p=y(o,r,h),d=b(o,r,h),u=I[e];o=i[u],r=i[u+1],i[u]=p,i[u+1]=d}for(let e=0;e<50;e+=10){for(let h=0;h<10;h++)s[h]=i[e+h];for(let h=0;h<10;h++)i[e+h]^=~s[(h+2)%10]&s[(h+4)%10]}i[0]^=m[n],i[1]^=E[n]}s.fill(0)}class x extends c.Hash{constructor(t,s,n,o=!1,r=24){if(super(),this.blockLen=t,this.suffix=s,this.outputLen=n,this.enableXOF=o,this.rounds=r,this.pos=0,this.posOut=0,this.finished=!1,this.destroyed=!1,l.number(n),0>=this.blockLen||this.blockLen>=200)throw new Error("Sha3 supports only keccak-f1600 function");this.state=new Uint8Array(200),this.state32=c.u32(this.state)}keccak(){c.isLE||c.byteSwap32(this.state32),L(this.state32,this.rounds),c.isLE||c.byteSwap32(this.state32),this.posOut=0,this.pos=0}update(t){l.exists(this);const{blockLen:s,state:n}=this;t=c.toBytes(t);const o=t.length;for(let r=0;r<o;){const e=Math.min(s-this.pos,o-r);for(let h=0;h<e;h++)n[this.pos++]^=t[r++];this.pos===s&&this.keccak()}return this}finish(){if(this.finished)return;this.finished=!0;const{state:t,suffix:s,pos:n,blockLen:o}=this;t[n]^=s,s&128&&n===o-1&&this.keccak(),t[o-1]^=128,this.keccak()}writeInto(t){l.exists(this,!1),l.bytes(t),this.finish();const s=this.state,{blockLen:n}=this;for(let o=0,r=t.length;o<r;){this.posOut>=n&&this.keccak();const e=Math.min(n-this.posOut,r-o);t.set(s.subarray(this.posOut,this.posOut+e),o),this.posOut+=e,o+=e}return t}xofInto(t){if(!this.enableXOF)throw new Error("XOF is not possible for this instance");return this.writeInto(t)}xof(t){return l.number(t),this.xofInto(new Uint8Array(t))}digestInto(t){if(l.output(t,this),this.finished)throw new Error("digest() was already called");return this.writeInto(t),this.destroy(),t}digest(){return this.digestInto(new Uint8Array(this.outputLen))}destroy(){this.destroyed=!0,this.state.fill(0)}_cloneInto(t){const{blockLen:s,suffix:n,outputLen:o,rounds:r,enableXOF:e}=this;return t||(t=new x(s,n,o,e,r)),t.state32.set(this.state32),t.pos=this.pos,t.posOut=this.posOut,t.finished=this.finished,t.rounds=r,t.suffix=n,t.outputLen=o,t.enableXOF=e,t.destroyed=this.destroyed,t}}const F=(i,t,s)=>c.wrapConstructor(()=>new x(t,i,s)),P=F(1,136,256/8);exports.Keccak=x;exports.keccakP=L;exports.keccak_256=P;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const s=require("./index70.cjs");/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */const u=t=>new Uint32Array(t.buffer,t.byteOffset,Math.floor(t.byteLength/4)),i=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),y=(t,e)=>t<<32-e|t>>>e,b=new Uint8Array(new Uint32Array([287454020]).buffer)[0]===68,o=t=>t<<24&4278190080|t<<8&16711680|t>>>8&65280|t>>>24&255;function p(t){for(let e=0;e<t.length;e++)t[e]=o(t[e])}function f(t){if(typeof t!="string")throw new Error(`utf8ToBytes expected string, got ${typeof t}`);return new Uint8Array(new TextEncoder().encode(t))}function r(t){return typeof t=="string"&&(t=f(t)),s.bytes(t),t}class w{clone(){return this._cloneInto()}}function l(t){const e=c=>t().update(r(c)).digest(),n=t();return e.outputLen=n.outputLen,e.blockLen=n.blockLen,e.create=()=>t(),e}exports.Hash=w;exports.byteSwap=o;exports.byteSwap32=p;exports.createView=i;exports.isLE=b;exports.rotr=y;exports.toBytes=r;exports.u32=u;exports.utf8ToBytes=f;exports.wrapConstructor=l;

package/dist/index69.js

@@ -1,107 +1,37 @@
-import { number as d, exists as k, bytes as B, output as A } from "./index70.js";
-import { split as H, rotlBH as m, rotlSH as S, rotlBL as T, rotlSL as F } from "./index71.js";
-import { wrapConstructor as X, Hash as E, u32 as U, isLE as x, byteSwap32 as I, toBytes as P } from "./index67.js";
-const y = [], L = [], b = [], M = /* @__PURE__ */ BigInt(0), f = /* @__PURE__ */ BigInt(1), R = /* @__PURE__ */ BigInt(2), j = /* @__PURE__ */ BigInt(7), C = /* @__PURE__ */ BigInt(256), q = /* @__PURE__ */ BigInt(113);
-for (let e = 0, t = f, s = 1, n = 0; e < 24; e++) {
-  [s, n] = [n, (2 * s + 3 * n) % 5], y.push(2 * (5 * n + s)), L.push((e + 1) * (e + 2) / 2 % 64);
-  let o = M;
-  for (let r = 0; r < 7; r++)
-    t = (t << f ^ (t >> j) * q) % C, t & R && (o ^= f << (f << /* @__PURE__ */ BigInt(r)) - f);
-  b.push(o);
+import { bytes as f } from "./index70.js";
+/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
+const s = (t) => new Uint32Array(t.buffer, t.byteOffset, Math.floor(t.byteLength / 4)), y = (t) => new DataView(t.buffer, t.byteOffset, t.byteLength), p = (t, e) => t << 32 - e | t >>> e, b = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68, c = (t) => t << 24 & 4278190080 | t << 8 & 16711680 | t >>> 8 & 65280 | t >>> 24 & 255;
+function w(t) {
+  for (let e = 0; e < t.length; e++)
+    t[e] = c(t[e]);
 }
-const [v, z] = /* @__PURE__ */ H(b, !0), O = (e, t, s) => s > 32 ? m(e, t, s) : S(e, t, s), w = (e, t, s) => s > 32 ? T(e, t, s) : F(e, t, s);
-function D(e, t = 24) {
-  const s = new Uint32Array(10);
-  for (let n = 24 - t; n < 24; n++) {
-    for (let i = 0; i < 10; i++)
-      s[i] = e[i] ^ e[i + 10] ^ e[i + 20] ^ e[i + 30] ^ e[i + 40];
-    for (let i = 0; i < 10; i += 2) {
-      const h = (i + 8) % 10, l = (i + 2) % 10, u = s[l], c = s[l + 1], _ = O(u, c, 1) ^ s[h], g = w(u, c, 1) ^ s[h + 1];
-      for (let a = 0; a < 50; a += 10)
-        e[i + a] ^= _, e[i + a + 1] ^= g;
-    }
-    let o = e[2], r = e[3];
-    for (let i = 0; i < 24; i++) {
-      const h = L[i], l = O(o, r, h), u = w(o, r, h), c = y[i];
-      o = e[c], r = e[c + 1], e[c] = l, e[c + 1] = u;
-    }
-    for (let i = 0; i < 50; i += 10) {
-      for (let h = 0; h < 10; h++)
-        s[h] = e[i + h];
-      for (let h = 0; h < 10; h++)
-        e[i + h] ^= ~s[(h + 2) % 10] & s[(h + 4) % 10];
-    }
-    e[0] ^= v[n], e[1] ^= z[n];
-  }
-  s.fill(0);
+function r(t) {
+  if (typeof t != "string")
+    throw new Error(`utf8ToBytes expected string, got ${typeof t}`);
+  return new Uint8Array(new TextEncoder().encode(t));
 }
-class p extends E {
-  // NOTE: we accept arguments in bytes instead of bits here.
-  constructor(t, s, n, o = !1, r = 24) {
-    if (super(), this.blockLen = t, this.suffix = s, this.outputLen = n, this.enableXOF = o, this.rounds = r, this.pos = 0, this.posOut = 0, this.finished = !1, this.destroyed = !1, d(n), 0 >= this.blockLen || this.blockLen >= 200)
-      throw new Error("Sha3 supports only keccak-f1600 function");
-    this.state = new Uint8Array(200), this.state32 = U(this.state);
-  }
-  keccak() {
-    x || I(this.state32), D(this.state32, this.rounds), x || I(this.state32), this.posOut = 0, this.pos = 0;
-  }
-  update(t) {
-    k(this);
-    const { blockLen: s, state: n } = this;
-    t = P(t);
-    const o = t.length;
-    for (let r = 0; r < o; ) {
-      const i = Math.min(s - this.pos, o - r);
-      for (let h = 0; h < i; h++)
-        n[this.pos++] ^= t[r++];
-      this.pos === s && this.keccak();
-    }
-    return this;
-  }
-  finish() {
-    if (this.finished)
-      return;
-    this.finished = !0;
-    const { state: t, suffix: s, pos: n, blockLen: o } = this;
-    t[n] ^= s, s & 128 && n === o - 1 && this.keccak(), t[o - 1] ^= 128, this.keccak();
-  }
-  writeInto(t) {
-    k(this, !1), B(t), this.finish();
-    const s = this.state, { blockLen: n } = this;
-    for (let o = 0, r = t.length; o < r; ) {
-      this.posOut >= n && this.keccak();
-      const i = Math.min(n - this.posOut, r - o);
-      t.set(s.subarray(this.posOut, this.posOut + i), o), this.posOut += i, o += i;
-    }
-    return t;
-  }
-  xofInto(t) {
-    if (!this.enableXOF)
-      throw new Error("XOF is not possible for this instance");
-    return this.writeInto(t);
-  }
-  xof(t) {
-    return d(t), this.xofInto(new Uint8Array(t));
-  }
-  digestInto(t) {
-    if (A(t, this), this.finished)
-      throw new Error("digest() was already called");
-    return this.writeInto(t), this.destroy(), t;
-  }
-  digest() {
-    return this.digestInto(new Uint8Array(this.outputLen));
-  }
-  destroy() {
-    this.destroyed = !0, this.state.fill(0);
-  }
-  _cloneInto(t) {
-    const { blockLen: s, suffix: n, outputLen: o, rounds: r, enableXOF: i } = this;
-    return t || (t = new p(s, n, o, i, r)), t.state32.set(this.state32), t.pos = this.pos, t.posOut = this.posOut, t.finished = this.finished, t.rounds = r, t.suffix = n, t.outputLen = o, t.enableXOF = i, t.destroyed = this.destroyed, t;
+function u(t) {
+  return typeof t == "string" && (t = r(t)), f(t), t;
+}
+class x {
+  // Safe version that clones internal state
+  clone() {
+    return this._cloneInto();
   }
 }
-const G = (e, t, s) => X(() => new p(t, e, s)), Q = /* @__PURE__ */ G(1, 136, 256 / 8);
+function g(t) {
+  const e = (o) => t().update(u(o)).digest(), n = t();
+  return e.outputLen = n.outputLen, e.blockLen = n.blockLen, e.create = () => t(), e;
+}
 export {
-  p as Keccak,
-  D as keccakP,
-  Q as keccak_256
+  x as Hash,
+  c as byteSwap,
+  w as byteSwap32,
+  y as createView,
+  b as isLE,
+  p as rotr,
+  u as toBytes,
+  s as u32,
+  r as utf8ToBytes,
+  g as wrapConstructor
 };

package/dist/src/index.d.ts

@@ -4,4 +4,4 @@ export type { Chain, EvmChain, Asset } from './lib/asset';
 export { Chains, BlockchainType, isMainnet, isBitcoin, isEVM, getBlockchainType, ChainToID, } from './lib/asset';
 export { OrdersProvider } from './lib/orders/ordersProvider';
 export type { IOrderProvider } from './lib/orders/orders.types';
-export { WBTCArbitrumLocalnetAsset, WBTCEthereumLocalnetAsset, ArbitrumLocalnet, EthereumLocalnet, bitcoinRegtestAsset, SupportedAssets, } from './lib/constants';
+export { WBTCArbitrumLocalnetAsset, WBTCEthereumLocalnetAsset, ArbitrumLocalnet, EthereumLocalnet, SupportedAssets, } from './lib/constants';

package/dist/src/lib/constants.d.ts

@@ -3,7 +3,6 @@ import { Asset } from './asset';
 
 export declare const ArbitrumLocalnet: Chain;
 export declare const EthereumLocalnet: Chain;
-export declare const bitcoinRegtestAsset: Asset;
 export declare const WBTCArbitrumLocalnetAsset: Asset;
 export declare const WBTCEthereumLocalnetAsset: Asset;
 type SupportedAssets = {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@gardenfi/orderbook",
-  "version": "0.2.0-beta.12",
+  "version": "0.2.0-beta.13",
   "type": "module",
   "main": "./dist/index.cjs",
   "module": "./dist/index.js",