REIST Division

Centered remainder arithmetic and a documented research-token pilot

REIST describes an implementation-oriented use of centered remainders for addition-dominated modular compute kernels. A separate ERC-20 pilot is intended to recognize reproducible implementations and independent evaluations.

Classification: The method works without a token. There is no investment offering; the token confers no equity, redemption, or return rights and is not a mark of scientific quality.

Centered remainder Requirement: B > 0
T = qB + r
−B/2 +B/2

−B/2 ≤ r < B/2

Classical17 = 1 · 10 + 7 REIST17 = 2 · 10 − 3

Project status

Contract
14 local tests passing
Base Sepolia
not deployed
Mainnet
not approved
Token sale
not planned
External audit
not yet performed

Scope and invariant

Centered remainders are mathematically classical. REIST's contribution lies in their implementation-oriented use as a persistent state for addition-dominated modular compute kernels.

Small-magnitude remainder

Positive and negative deviations are represented symmetrically around zero. The remainder is interpreted as a bidirectional correction term.

Persistent invariant

If both the state and step remain centered, at most one ±B correction returns the sum to the target interval.

Hardware-friendly

Addition, comparisons, and masks enable branchless code, SIMD vectorization, and a small FPGA datapath.

Reported results

All values refer to the platforms, compiler configurations, and baselines documented in the canonical German paper. They are not a general performance guarantee.

Source status: The following table comes from the canonical German paper published on Zenodo (SHA-256 369B9FB75C1B6D4C2CBBA91FF63DB4420900AB30B6EEC137BFD72290AE7D45C4), DOI 10.5281/zenodo.21206471, published on 5 July 2026 under CC BY 4.0.

Measurements reported in the canonical German paper
WorkloadResultMeasurement context
Modular addition counter2.1–4.4×Apple M2 Pro · O3 through NEON
Modular addition counter7.9–8.9×Intel i9-14900K · O3
Polynomial addition4.3–4.5×Apple M2 Pro · O3/NEON
Polynomial additionup to 17.0×Intel i9-14900K · AVX2
Feedback-coupled FPGA accumulator1 cycle/stepGW2A-18; isolated 32-bit correction unit: 161.8 MHz · 101 logic cells

Negative and neutral controls

  • Pure remainder computation: scalar O3 is approximately equal; x86 SIMD is slower in the reported test.
  • No structural point of application in ARX code such as ChaCha20; the manuscript classifies measured throughput as unchanged.
  • Hash mixing is approximately 15–25% slower under O3/SIMD; O0 is substantially worse.
  • Without O3/SIMD, branchless REIST can be slower.

Fixed ERC-20 model for a testnet pilot

The token is intended as a transferable means of recognizing reviewed research contributions; selection and review remain off-chain. It does not accelerate the framework. Access to the paper and code is not tied to token ownership. There is no entitlement to returns or redemption.

Name
REIST Research Token
Symbol
REIST
Supply
1,000,000
Standard
ERC-20 · 18 decimals
Mint/Tax/Blacklist
not present
Pilot network
Base Sepolia · no economic value promised
Genesis allocation
PurposeAmountShare
Research Rewards700,00070%
Ecosystem Treasury200,00020%
Founder Vesting100,00010%

Founder allocation: one-year cliff and three-year linear vesting. One third is vested at the cliff. Planned at launch: 0% public sale and 0% DEX liquidity. This is project policy, not a technical transfer restriction.

Awards following documented review

No rewards for advertising, trading, or reach. Suitable work includes implementations, reproductions, hardware ports, and robust negative results.

  1. 01Scopepublic issue and criteria
  2. 02Artifactcode, raw data, and hash
  3. 03Reviewreproduction and conflicts
  4. 04TransferSafe transaction with evidence

Bounty register

  • REIST-B001CPU reproduction New CPU, raw data, baseline, and negative control. Draft
  • REIST-B002Rust reference Even and odd moduli with property tests. Draft
  • REIST-B003RISC-V port Compiler comparison, assembly, and reproducible measurement. Draft
Machine-readable register (JSON)

Active bounties: 0 · Accepted contributions: 0. Only publicly documented bounties and accepted contributions are counted.

Existing work and outstanding prerequisites

Available today

  • local, non-upgradeable contract design
  • genesis allocation fixed in the constructor
  • automatically created founder vesting contract
  • local tests and deployment invariants
  • public, history-free token release source snapshot
  • private channel for sensitive security reports
  • prepared bounty and contribution-register formats

Still outstanding

  • Base Sepolia deployment and explorer verification
  • complete public FPGA sources
  • separate treasury Safes and signers
  • external contract review
  • legal clearance for economically relevant steps
Release gate

Canonical scientific reference

DOI 10.5281/zenodo.21206471 is canonical for the token pilot. DOI 10.5281/zenodo.17897540 remains historically referenced as the earlier public version 2.0. Zenodo identifies the canonical record as a new version of that predecessor; the identifiers are not identical.

Next steps

  1. Designate separate treasury Safes and signers.
  2. Deploy and verify the contracts on Base Sepolia.
  3. Open the first reproduction bounty as a public issue.
  4. Consider mainnet only after documented utility, an audit, and legal review.