stepper-sdk 0.1.0

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2026 The STEPPER Authors
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,53 @@
+STEPPER
+Copyright 2026 The STEPPER Authors
+
+This product includes software developed for the STEPPER project
+(https://steppercpu.tech).
+
+Licensed under the Apache License, Version 2.0. You may obtain a copy of
+the License in the LICENSE file at the root of this repository, or at
+http://www.apache.org/licenses/LICENSE-2.0
+
+--------------------------------------------------------------------------
+The name, and what the licence does not cover
+--------------------------------------------------------------------------
+
+The Apache License covers the code: the netlist, the toolchain, the
+contracts, the site and everything that builds them. Fork it, run it, sell
+what you make with it. That is the point of publishing it.
+
+It does not cover the name or the marks. Section 6 of the License grants no
+trademark rights, and this notice records what those are:
+
+  - the name STEPPER, and the part names ST-8 and ST-16 as used for this
+    project
+  - the ticker STEP
+  - the logo and mark, in every size and format under public/brand/ and
+    brand/source/
+  - the domain steppercpu.tech and the social accounts named on it
+
+A fork is welcome to be a processor on a chain. It may not present itself
+as this one. The reason is narrow and worth stating plainly: this project
+is associated with a token, and a fork wearing its name and mark would be
+indistinguishable from it at exactly the moment that distinction matters
+most to somebody deciding what to buy.
+
+Reasonable and customary use in describing origin is expressly permitted
+by Section 6 and is not affected by anything above. Saying "derived from
+STEPPER", or naming it in documentation, comparison or commentary, needs no
+permission from anyone.
+
+--------------------------------------------------------------------------
+Third-party material
+--------------------------------------------------------------------------
+
+There is none. Every file in this repository was written for STEPPER.
+
+The 2,161-gate netlist in public/scripts/st8-data.js is composed by
+tools/build-netlist.js from a single NAND primitive, and the contracts are
+generated from that same table.
+
+Build-time dependencies (solc, ethers, the ethereumjs EVM) are declared in
+package.json under devDependencies. npm fetches them; they are not vendored
+here, they never ship to a browser, and each carries its own licence in
+node_modules.

package/README.md

@@ -0,0 +1,70 @@
+# stepper-sdk
+
+The STEPPER ST-8 processor, as a library: 2,161 NAND gates and 167
+flip-flops, evaluated one clock edge at a time.
+
+```
+npm i stepper-sdk
+```
+
+## Run a program
+
+```js
+const stepper = require("stepper-sdk");
+
+const { rom } = stepper.assemble(`
+  loop:  in   r0
+         out  r0
+         jmp  loop
+`);
+
+const r = stepper.run(rom, { cycles: 12, inValue: 42 });
+console.log(r.out, r.cycles, r.gates);
+```
+
+`run()` evaluates the shipped gate list in topological order and latches
+every flip-flop at once. It is not a model of an instruction set: the
+instruction set is what falls out of the gates.
+
+## Verify a chip on chain
+
+```js
+const result = await stepper.verify("0x…");
+console.log(result.ok, result.cyclesReplayed);
+```
+
+A chip is deterministic and all of its inputs are public. `program()`
+returns its ROM; every `step()` emits `Stepped(sponsor, cycle, outPort,
+inValue)`. ROM plus those events is the complete tape the machine ran on,
+so `verify()` fetches both, replays the whole history on the netlist in
+this package, and checks two things:
+
+- the final cycle, program counter, output and flags match `snapshot()`
+- **every logged output matches**, cycle by cycle, not just the last one
+
+Nothing in that calculation trusts us. The netlist is here, the events come
+from whatever node you name, and the arithmetic happens on your machine.
+
+## What is not here
+
+No launch function, no signer, no key handling. This package reads and
+computes. It cannot spend.
+
+## API
+
+| | |
+| --- | --- |
+| `assemble(source)` | ST-8 assembly to a ROM |
+| `run(rom, opts)` | run it on the netlist |
+| `programs()` | the shipped programs, as source |
+| `readChip(addr, opts)` | cycle, pc, out, flags, registers, ROM |
+| `history(addr, opts)` | every `Stepped` event, in cycle order |
+| `decodeStepped(log)` | one raw log to its fields |
+| `verify(addr, opts)` | replay the history and check the chain agrees |
+| `Machine`, `loadNetlist` | the evaluator, for building your own loop |
+
+`opts.rpc` names the node. It defaults to Robinhood Chain mainnet.
+
+## Licence
+
+Apache-2.0. The name and marks are reserved under section 6; see NOTICE.

package/index.js

@@ -0,0 +1,96 @@
+/**
+ * stepper-sdk — the ST-8 processor, as a library.
+ *
+ *   const stepper = require("stepper-sdk");
+ *
+ * Four things, and they compose:
+ *
+ *   assemble()   ST-8 assembly to a ROM
+ *   Machine      the 2,161-gate netlist, evaluated one clock edge at a time
+ *   readChip()   what a chip on the chain currently says about itself
+ *   verify()     replay its whole history and check the chain agrees
+ *
+ * The netlist in this package is the gate list a synthesis pass produced, not
+ * a model of an instruction set. Every cycle is computed by evaluating those
+ * gates in topological order and latching every flip-flop at once, which is
+ * why the answer it gives is the same answer the contract gives.
+ *
+ * There is no launch function, no signer and no key handling anywhere in here.
+ * This package reads and computes; it cannot spend. If you want to deploy a
+ * chip, the launchpad does that and it does it from your own wallet.
+ */
+
+"use strict";
+
+var machine = require("./lib/netlist/machine.js");
+var asm = require("./lib/netlist/asm.js");
+var chain = require("./lib/chain/chain.js");
+var proof = require("./lib/chain/verify.js");
+
+/**
+ * Assemble ST-8 source into a ROM.
+ * @returns {{rom: number[], labels: object, listing: string[]}}
+ */
+function assemble(source) {
+  return asm.assemble(source);
+}
+
+/**
+ * Run a ROM on the real netlist.
+ *
+ * @param {number[]} rom
+ * @param {object} [opts]  { cycles = 40, inValue = 0, onCycle }
+ * @returns {{cycles: number, halted: boolean, pc, out, carry, zero, registers, switched}}
+ */
+function run(rom, opts) {
+  var o = opts || {};
+  var D = machine.loadNetlist();
+  var m = new machine.Machine(D, rom);
+  var limit = o.cycles === undefined ? 40 : o.cycles;
+  var halted = false;
+
+  m.inPort = o.inValue || 0;
+  for (var i = 0; i < limit; i++) {
+    m.step();
+    if (o.onCycle) {
+      o.onCycle({
+        cycle: m.cycle, pc: m.pc(), out: m.out(),
+        carry: !!m.carry(), zero: !!m.zero(),
+        switched: m.switched, halted: m.halted(),
+      });
+    }
+    if (m.halted()) { halted = true; break; }
+  }
+
+  var regs = [];
+  for (i = 0; i < D.regs.length; i++) regs.push(m.reg(i));
+
+  return {
+    cycles: m.cycle, halted: halted,
+    pc: m.pc(), out: m.out(),
+    carry: !!m.carry(), zero: !!m.zero(),
+    registers: regs, switched: m.switched,
+    gates: D.gateCount,
+  };
+}
+
+/** The programs this processor ships with, as source. */
+function programs() {
+  return asm.sources;
+}
+
+module.exports = {
+  assemble: assemble,
+  run: run,
+  programs: programs,
+
+  Machine: machine.Machine,
+  loadNetlist: machine.loadNetlist,
+
+  readChip: chain.readChip,
+  history: chain.history,
+  decodeStepped: chain.decodeStepped,
+  ABI: chain.ABI,
+
+  verify: proof.verify,
+};

package/lib/abi.js

@@ -0,0 +1,38 @@
+// Generated by tools/build-contract.js. Do not edit by hand.
+//
+// Every selector here is keccak256 of the signature beside it, computed at
+// build time and checked against published vectors first. None of it is
+// copied from another project, which is why this file exists: the page used
+// to send tick(uint256,uint8) at a contract whose function is step().
+//
+// The layout below is the ST-8's. A chip built on a later generation
+// reports its own through spec(), which is why the contracts stopped
+// hardcoding these and the page reads them from here only as a default.
+window.ST8_ABI = {
+  step: "0x3a1cde75",   // step(uint256)
+  snapshot: "0x9711715a",   // snapshot()
+  registers: "0xa0d3d084",   // registers()
+  state: "0xc19d93fb",   // state()
+  ram: "0x1fc4b242",   // ram(uint256)
+  program: "0xc860ebc6",   // program()
+  spec: "0xf448c9bc",   // spec()
+  launch: "0x73a28fbd",   // launch(bytes,(string,string,string,string,(string,string,string,string,string),address,uint16,bool,bytes32,bytes32),uint256,address)
+  tokenURI: "0xc87b56dd",   // tokenURI(uint256)
+  records: "0x34461067",   // records(uint256)
+  idOfChip: "0x8bc56e80",   // idOfChip(address)
+  totalChips: "0x2ddbd13a",   // total()
+  launchFee: "0xcf3cf573",   // launchFee()
+  canLaunch: "0x58373f04",   // canLaunch(address)
+  previewLaunchEconomics: "0xf718b78c",   // previewLaunchEconomics(uint256,address)
+  launchConfigCount: "0xae72d871",   // launchConfigCount()
+
+  steppedTopic: "0xed5cd9f6d6997b24d4fe100f731d98974dc1b7603f1cf2982be98d1826c9ef48",
+  // keccak256 of Stepped(address,uint40,uint256,uint256)
+
+  // Where each field sits inside the packed state word. Contiguous, so the
+  // page reads them the same way the contract does: a shift and a mask.
+  stateBits: 167,
+  pc: { shift: 128, width: 10 },
+  out: { shift: 138, width: 8 },
+  cf: 146, zf: 147, halt: 148,
+};

package/lib/chain/chain.js

@@ -0,0 +1,198 @@
+/**
+ * chain.js — reading a chip off the chain.
+ *
+ * Read-only by construction. There is no signing here, no key handling and no
+ * transaction builder, so there is no code path in this package that can spend
+ * anything. That is a deliberate property rather than an omission: a library
+ * people are asked to install in order to check our claims should not also be
+ * a library that could move their money.
+ *
+ * Everything is decoded by hand from `eth_call` and `eth_getLogs`. The
+ * selectors are not written down here — they come from abi.js, which is
+ * generated from the contract signatures by the same keccak the contracts use,
+ * and checked against published vectors before it is written. A hand-copied
+ * selector is how a page ends up calling a function that does not exist.
+ */
+
+"use strict";
+
+var fs = require("node:fs");
+var path = require("node:path");
+
+/** abi.js is written for a browser. Handing it an object called window is the
+    whole of the port, exactly as machine.js does for the netlist. */
+function loadAbi() {
+  var places = [
+    path.join(__dirname, "..", "..", "public", "scripts", "abi.js"),
+    path.join(__dirname, "..", "abi.js"),
+    path.join(__dirname, "abi.js"),
+  ];
+  var file = places.filter(function (p) { return fs.existsSync(p); })[0];
+  if (!file) throw new Error("abi.js is missing. Run `npm run abi` first.");
+  var win = {};
+  new Function("window", fs.readFileSync(file, "utf8"))(win);
+  return win.ST8_ABI;
+}
+
+var ABI = loadAbi();
+
+var DEFAULT_RPC = "https://rpc.mainnet.chain.robinhood.com";
+
+/* ------------------------------------------------------------- the wire */
+
+var nextId = 0;
+
+async function rpc(url, method, params) {
+  var res = await fetch(url, {
+    method: "POST",
+    headers: { "content-type": "application/json" },
+    body: JSON.stringify({ jsonrpc: "2.0", id: ++nextId, method: method, params: params || [] }),
+  });
+  if (!res.ok) throw new Error(method + ": HTTP " + res.status);
+  var body = await res.json();
+  if (body.error) {
+    var e = new Error(body.error.message || "rpc error");
+    e.code = body.error.code;
+    throw e;
+  }
+  return body.result;
+}
+
+function ethCall(url, to, data) {
+  return rpc(url, "eth_call", [{ to: to, data: data }, "latest"]);
+}
+
+/* ------------------------------------------------------------ decoding */
+
+function word(hex, i) {
+  return hex.slice(2 + i * 64, 2 + (i + 1) * 64);
+}
+function toBig(w) { return BigInt("0x" + w); }
+function toNum(w) { return Number(BigInt("0x" + w)); }
+
+/** A dynamic `bytes` return: an offset, a length, then the bytes. */
+function decodeBytes(hex) {
+  var at = Number(toBig(word(hex, 0))) / 32;
+  var len = Number(toBig(word(hex, at)));
+  var start = 2 + (at + 1) * 64;
+  return hex.slice(start, start + len * 2);
+}
+
+/** A dynamic `uint256[]` return. */
+function decodeUintArray(hex) {
+  var at = Number(toBig(word(hex, 0))) / 32;
+  var len = Number(toBig(word(hex, at)));
+  var out = [];
+  for (var i = 0; i < len; i++) out.push(toBig(word(hex, at + 1 + i)));
+  return out;
+}
+
+/**
+ * The ROM, as the machine wants it.
+ *
+ * `program()` hands back the ROM as bytes, four to a word, big-endian. The
+ * evaluator indexes words, so this is the one place the two representations
+ * are reconciled.
+ */
+function romFromBytes(hexNoPrefix) {
+  var rom = [];
+  for (var i = 0; i + 8 <= hexNoPrefix.length; i += 8) {
+    rom.push(parseInt(hexNoPrefix.slice(i, i + 8), 16));
+  }
+  return rom;
+}
+
+function pad32(address) {
+  return address.replace(/^0x/, "").toLowerCase().padStart(64, "0");
+}
+
+/* -------------------------------------------------------------- reading */
+
+/**
+ * Everything a chip will tell you about itself in one round of calls.
+ *
+ * `snapshot()` is used rather than unpacking `state()` by hand, because the
+ * contract already knows where its own fields sit and a second opinion about
+ * that is a second thing that can be wrong.
+ */
+async function readChip(address, opts) {
+  var url = (opts && opts.rpc) || DEFAULT_RPC;
+
+  var snap = await ethCall(url, address, ABI.snapshot);
+  var regs = await ethCall(url, address, ABI.registers);
+  var prog = await ethCall(url, address, ABI.program);
+
+  return {
+    address: address,
+    cycle: toNum(word(snap, 0)),
+    pc: toNum(word(snap, 1)),
+    out: toNum(word(snap, 2)),
+    carry: toNum(word(snap, 3)) === 1,
+    zero: toNum(word(snap, 4)) === 1,
+    halted: toNum(word(snap, 5)) === 1,
+    registers: decodeUintArray(regs).map(Number),
+    rom: romFromBytes(decodeBytes(prog)),
+  };
+}
+
+/** One `Stepped` log, as the fields the event declares. */
+function decodeStepped(log) {
+  return {
+    sponsor: "0x" + log.topics[1].slice(26),
+    cycle: Number(BigInt(log.topics[2])),
+    outPort: Number(BigInt("0x" + word(log.data, 0))),
+    inValue: Number(BigInt("0x" + word(log.data, 1))),
+    block: Number(BigInt(log.blockNumber)),
+    tx: log.transactionHash,
+  };
+}
+
+/**
+ * Every `Stepped` this chip has emitted.
+ *
+ * Scanned backwards in windows from the head of the chain, and — this is the
+ * part that makes it terminate honestly — the chip has already said how many
+ * there should be. `snapshot()` reports the cycle count, one event was emitted
+ * per cycle, so the scan stops when it has that many rather than when it runs
+ * out of patience. A short answer is then a real finding rather than the scan
+ * having given up early.
+ */
+async function history(address, opts) {
+  var o = opts || {};
+  var url = o.rpc || DEFAULT_RPC;
+  var want = o.expect;
+  var span = o.window || 50000;
+
+  var head = Number(BigInt(await rpc(url, "eth_blockNumber")));
+  var to = head;
+  var found = [];
+  var floor = o.fromBlock === undefined ? 0 : o.fromBlock;
+
+  while (to >= floor && (want === undefined || found.length < want)) {
+    var from = Math.max(floor, to - span + 1);
+    var logs = await rpc(url, "eth_getLogs", [{
+      address: address,
+      topics: [ABI.steppedTopic],
+      fromBlock: "0x" + from.toString(16),
+      toBlock: "0x" + to.toString(16),
+    }]);
+    for (var i = 0; i < logs.length; i++) found.push(decodeStepped(logs[i]));
+    if (from === floor) break;
+    to = from - 1;
+  }
+
+  found.sort(function (a, b) { return a.cycle - b.cycle; });
+  return found;
+}
+
+module.exports = {
+  ABI: ABI,
+  DEFAULT_RPC: DEFAULT_RPC,
+  rpc: rpc,
+  ethCall: ethCall,
+  readChip: readChip,
+  history: history,
+  decodeStepped: decodeStepped,
+  romFromBytes: romFromBytes,
+  pad32: pad32,
+};