|
 |
[4] ai.viXra.org:2609.0075 [pdf] submitted on 2026-09-28 20:39:23
Authors: Lukas Saul, Robert Gludo, Jonathan Gludo
Comments: 9 Pages.
The Truth-It Network is a Solana-native binary oracle protocol. It allows a permissionednetwork of truth providers to answer yes/no questions through a commit-reveal voting scheme,with vote weight determined by an on-chain reputation score. Rewards are held in per-question vaults and distributed proportionally to winning vote weight. This whitepaper describes the protocol’s membership model, question lifecycle, reward distribution, rent reclamation, and reputation calculation.
Category: Data Structures and Algorithms
[3] ai.viXra.org:2609.0072 [pdf] submitted on 2026-09-28 20:32:24
Authors: Lukas Saul, Robert Gludo, Jonathan Gludo, Ian Spiro
Comments: 8 Pages.
SolBazaar (or Solzaar) is a Solana-native decentralized marketplace protocol. It allows merchants to register storefronts, list products, and settle orders through an external escrow program that enforces deposit, completion, and refund conditions on-chain. Reputation is accrued through buyer-submitted reviews gated by escrow completion, and order state is synchronized with product inventory through deterministic, escrow-driven transitions. This whitepaper describes the protocol’s membership model, product lifecycle, order settlement, reputation accrual, and dispute-handling interfaces. It situates the design within a longer literary and technical lineage that runs from science fiction’s imagined anarcho-capitalist markets through OpenBazaar’s empirical disappointments to a contract-layer response.
Category: Data Structures and Algorithms
[2] ai.viXra.org:2609.0068 [pdf] submitted on 2026-09-27 21:35:57
Authors: Brent Hartshorn, Gilead Cosman
Comments: 11 Pages.
Unity’s built-in 2D physics is an integration of the Box2D engine [12]. We build the same kind of2D game runtime from a different direction. Game scripts are written in a subset of C#, translated to a subset of C++ and then to C, and compiled together with a fork of Box2D v3 that we call Box2D-Packed. Our goal is a 2D runtime that is faster than Unity’s. This paper describes the two techniques we use to get there and measures each of them. The first is data packing: public handles shrink from 8 to 4 bytes, and the records the engine reads on every step are laid out by measured access patterns. Measured with Cachegrind’s exact cache simulation, last-level data cache misses fall by up to 65% on query-heavy scenes relative to Box2D v3, with unchanged instruction counts and bit-identical simulation results. The second is an intrusive engine: game logic is compiled into the physics engine at documented points, so it runswhile the engine’s data is still in cache, instead of through callbacks and event arrays. Injected pre-solve logic saves 1.3% of instructions, and injecting a platformer’s event handlers cuts L1 data misses by 2%, with identical game results. We also report where injection does not help: a per-body gravity hook that reads game data costs 7.65% more L1 misses, and event handlers followed by game work on the same objects add last-level misses. We compare against Box2D v3, not yet against Unity, and describe the measurements that remain.
Category: Data Structures and Algorithms
[1] ai.viXra.org:2609.0048 [pdf] submitted on 2026-09-22 20:46:18
Authors: L. B. Uvindu Daham
Comments: 15 Pages.
We present a definitive resolution to the P versus N P problem by embedding discrete constraint satisfaction problems (3-SAT) into continuous non-compact Riemannian manifolds via Maslov dequantization (h > 0 deformation). By constructing the Master Flow Equation governed by logsum-exp smoothing operators, we prove that the trajectories are bounded by a uniform polynomial spectral gap and structurally bypass relativization, natural proofs, and algebrization barriers. Utilizing Morse-Bott theory and asymptotic energy dissipation estimates, we demonstrate that all worst-case exponential trajectories are suppressed, achieving deterministic convergence to satisfying assignments in polynomial time O(nK ). Consequently, we establish that P= N P.
Category: Data Structures and Algorithms