Round8 is a quantum-resistant binary system demonstrating spool-based indexed lookups for binary operations (similar to Lattice Boltzmann Method).
With v0.0.168, the Bidirectional R8/DEC Interchange System completes the foundational architecture - enabling seamless conversion between Round8 and Decimal representations. All core operations are validated across 568 tests. The foundation is proven and operational; each release now extends capability toward multiplication, division, and the eventual RoundX Base-100 interchange.
npm install round8- Stratimux - Higher Ordered Graph Programming Framework
- SCS - Proof of Concept Bidirectional Higher Ordered Computation Paradigm.
Bidirectional Round8 ↔ Decimal Interchange System
- Exposed
r8_.interchange.decimalToRound8()andr8_.interchange.round8ToDecimal()for bidirectional conversion - Calculator Interchange Enhancement:
displayMode('R8' | 'DEC') andinterchangecaching system - New calculator operations:
handleDisplayMode(),handleDecimalInput(),handleInterchangeOff(),getDisplayValue() - Stratimux Concept cascade: 3 new interchange qualities with full type exports
- 159 interchange edge case tests validating boundary transitions and carry patterns
- Renamed "Conversion" nomenclature to "Interchange" throughout codebase
- 568 total tests across 23 suites (up from 373)
Series Complete - Foundation Validated
This release marks the completion of the foundational proof-of-concept series. All core operations validated, architecture proven, ready for RoadMap expansion.
- Exported in r8_.anor the BidirectionalConference to determine associated Muxity of the Wrung
- Exported Round8Calculator Type for Stratimux State Pairing
- Ensured Stratimux Round8 Concept Qualities have Method Creator for ActionStrategies
- Enhanced differencing during maximum difference case of equal length wrungs
- Accounted for Full Twist Muxity complexity
Stratimux Concept Integration - Muxified state management for Round8 operations.
New Features:
createRound8Concept()- Factory for creating Round8 Stratimux Concept- Flat array calculator architecture with unlimited instances
- Calculator routing via unique ID system
- 11 qualities for calculator operations (create, input, calculate, clear, etc.)
- All qualities traverse shared
r8_manifold
Architecture:
- Muxified Singletons pattern - qualities share computational manifold
- Two-input calculator design preserved
- Independent state per calculator instance
- Foundation for compositional expansion
Testing:
- New
round8-stratimux.test.tssuite with 5 tests - Tests flat array architecture and ID routing
- 393 total tests (up from 388)
Documentation Update - Comment renewal based on working test suite.
Documentation Changes:
- Spool Manifolds documented with lookup table mechanics
- Position 21 shifted frame operations annotated
- Binary Operand Bias formulas clarified
- Test suite renamed to
mapping-display.test.ts - 388 tests passing
v0.0.14 Features: Public API Complete - Round8 breadboard fully accessible with organized categories.
New Operations:
r8_.operations.add(a, b)- Addition via muxifyWrung orchestrationr8_.operations.subtract(a, b)- Subtraction via muxifyWrung orchestrationr8_.operations.increment(value)- Single-step increment (value + 1)r8_.operations.decrement(value)- Single-step decrement (value - 1)r8_.operations.muxifyWrung(op, a, b)- Core arithmetic operation router
Logical Operations:
r8_.logical.equals(a, b)- Equality comparisonr8_.logical.notEquals(a, b)- Inequality comparisonr8_.logical.greaterThan(a, b)- Greater than comparisonr8_.logical.lessThan(a, b)- Less than comparisonr8_.logical.greaterThanOrEqual(a, b)- Greater than or equalr8_.logical.lessThanOrEqual(a, b)- Less than or equal
ANOR Operations:
r8_.anor.anor()- Rotation-level range membership analysisr8_.anor.anorWrung()- Wrung-level range membership analysisr8_.anor.compareMagnitude()- Sign-agnostic magnitude comparisonr8_.anor.determineEffectiveOperation()- Operation routing based on signs
Calculator Enhancements:
handleIncrement()- Increment active input by 1handleDecrement()- Decrement active input by 1
Developer Types Exported:
BitRotationTuple- 3-bit column value typeWrungMuxity- Quality-First self-referential containerResultMuxity- Forward-only computation record
Testing:
- 373 total tests (up from 324)
- 16 new calculator operation tests
- 33 new r8 API integration tests
- 100% test coverage maintained
Hunted down hallucinated tests that reversed or did not prepare signed output properly. Now Aligned.
This proof-of-concept validates:
- Spool-Based Value Lookups - All numeral values come from pre-computed indexed lookups (NumeralStore), not binary arithmetic
- Relative Position Addressing - Bit shifts used exclusively for placing 3-bit values at correct buffer positions
- Dual Display Validation - Round8 ↔ Binary correspondence proven operational
- Marquee Delimiter System - Delimiter-aware parsing with shifted frame at position 21
- Calculator Interface - Working digit entry, backspace, display rendering
Critical Architectural Note: Shifts (
<<) are used for relative position addressing only - placing spooled values at their buffer positions. No binary operand calculations (shift/OR/AND for value computation). Values themselves come from indexed spool lookups. Try the Live Demo: https://phuire-research.github.io/Round8/
The interactive calculator demonstrates the binary system functioning as designed. Digit entry updates both Round8 and binary displays in real-time. Storing the Round8 Number only in Binary for all Operations.
At 16-bit precision, Round8 demonstrates 7% energy efficiency advantage over traditional hexadecimal binary representation.
Measurable Proof: Verifiable proven reference table is attached to this repository. Which a complete test suite for addition and subtraction alongside logical operators. Result: Round8 store 7% more data than hex binary at all bit ranges. Validation: Empirically verified through controlled benchmark testing.
Note this is not a Number replacement. We have a variant Base 100 System called RoundX. That will be extend the Series for some Time, but would exist on top of Round8.
Why? What can we save if we factor in all computation and communications it factors out to a rising 6% of a nation's energy use. What is the most expensive computer operation? Accessing memory. With Round8 we Hex across the board at a minimum of 7% More Value in the same Space. It's clean, it's provable, and can be a drop be made a replacement for Hex. We can UnHex Binary.
But 7% is only the beginning as the means of being Quantum resistant also brings another jaw breaking cost savings. That we cannot disclose.
multiply(a, b)- Awaiting MultiplyWrung validation
divide(a, b)- Awaiting DivideWrung validation
- Proportional Spherical Measurement and Round Framework
- Interchangeable Thirds and Spatial Proportional Reality
- Stratimuxian Manifolds - Complete Circular Reference Through Type System Delimitation
- ANOR and Muxification: Foundation of Stratimuxian Mathematics - Quality-First mathematical foundation
- Three-Columns Verified
- Round8 by 11rds Multiplied to Max
- UnHex Binary
Proof of Concept: v0.0.1 establishes the string-only API pattern with proving our Spool Manifold Method. v0.0.168 expands with bidirectional Interchange and Calculator displayMode caching.
Status: 23/23 Test Suites ✅ | 568/568 Tests ✅ | 100% Coverage
Round8 v0.0.168 validates complete foundation architecture across four tiers: Foundation, Core Operations, Interchange System, and Test Infrastructure. This version introduces bidirectional Round8 ↔ Decimal interchange and Calculator Interchange with displayMode caching.
Tier 0 - Foundation (100% Validated ✅)
- Sign-at-Origin architecture (bit 0 anchor, upward expansion)
- Quality-First ANOR mathematics (magnitude before operations)
- Muxity pattern consistency (ResultMuxity forward-only, WrungMuxity self-referential)
- Spool Manifold Method (pure lookup-based symbol resolution)
Tier 1 - Core Operations (100% Validated ✅)
- Magnitude comparison (sign-agnostic via compareMagnitude)
- Sign routing (sign-aware via determineEffectiveOperation)
- Signed arithmetic (sum/difference with all sign combinations)
- Logical operations (AND, OR, XOR, NOT via r8_.logical)
- Quality container pattern (WrungMuxity self-referential containers)
Tier 2 - Interchange System (100% Validated ✅) - v0.0.168
- Bidirectional interchange (Round8 ↔ Decimal via r8_.interchange)
- Calculator interchange (displayMode, decimal caching)
- 159 edge case validations (boundary transitions, carry patterns)
Tier 3 - Test Infrastructure (100% Validated ✅)
- Round8-native test tools (getRegularBitRotation, not binary reimplementation)
- Quality-First test patterns (validate tools, not binary logic)
- Complete coverage (all operations, all sign cases, all edge conditions)
| Suite | Tests | Purpose | Validates |
|---|---|---|---|
| muxifyWrung.positiveSummation | 50 | Positive addition | Summation routing, carry propagation |
| muxifyWrung.positiveDifference | 49 | Positive subtraction | Difference routing, borrow cascade |
| muxifyWrung.mixedSign.a | 19 | Mixed sign operations A | Sign routing with ANOR |
| muxifyWrung.mixedSign.b | 7 | Mixed sign operations B | Edge case combinations |
| differencing.specifics | 37 | Subtraction specifics | Borrow patterns, boundary cases |
| decrement-borrow-cascade | 8 | Borrow cascade patterns | Multi-position borrow propagation |
| differencing.edge-cases | 1 | Differencing edge cases | Critical boundary validation |
| Suite | Tests | Purpose | Validates |
|---|---|---|---|
| anorWrung.test | 29 | ANOR magnitude comparison | Sign-agnostic compareMagnitude, tier separation |
| anor.test | 19 | Core ANOR operations | Base ANOR functionality |
| anorBenefits.test | 18 | ANOR foundation benefits | Quality-First mathematics principles |
| Suite | Tests | Purpose | Validates |
|---|---|---|---|
| logical-operators | 35 | Logical operations | AND, OR, XOR, NOT via r8_.logical |
| comparison-operators | 30 | Derived comparisons | >=, <=, !=, == built from base operations |
| greater-than-wrung | 25 | Base comparisons | >, < using independent spools |
| Suite | Tests | Purpose | Validates |
|---|---|---|---|
| decimalToRound8.edgeCases | 99 | Interchange edge cases | Boundary transitions, carry patterns |
| bidirectionalConference | 41 | Bidirectional interchange | Round8 ↔ Decimal roundtrip validation |
| decimalToRound8 | 19 | Decimal → Round8 conversion | Core interchange algorithm |
| Suite | Tests | Purpose | Validates |
|---|---|---|---|
| calculator.interchange | 20 | v0.0.168 Calculator interchange | displayMode, decimal caching, getDisplayValue |
| calculator.operations | 16 | Calculator increment/decrement | Composing functions orchestrating muxifyWrung |
| Suite | Tests | Purpose | Validates |
|---|---|---|---|
| r8.api | 33 | Public API integration | All r8_ categories (interchange, operations, logical, anor) |
| round8-stratimux | 5 | Stratimux concept | Quality routing, concept composition |
| mapping-display | 5 | Spool/mapping validation | Regular/Shifted frame correspondence |
| parser-position21-trace | 2 | Position 21 parsing | Marquee delimiter handling |
| terminology | 1 | Terminology validation | Core terminology consistency |
Total Binary Replacement: Tests use Round8's native tools (getRegularBitRotation, NumeralStore, Spools), not binary logic reimplementation. This proves Round8 tools validate Round8 operations using Round8's own infrastructure.
Round8 validates self-referential quality containers across all operations:
- ResultMuxity - Forward-only computation record with operation metadata
- WrungMuxity - Quality knows its own wrung (eliminates undefined checks)
- Pattern Consistency - Enables compositional quality routing
npm testExpected: Test Suites: 23 passed | Tests: 568 passed | Time: ~9s
GPL-3.0
Micah T. Keller - Founder @ PhuirE Research ([email protected])
https://github.com/Phuire-Research/Round8
Round8 - Pure spatial coordinate stratimuxian mathematics with data density as proven energy efficiency.