Public corpus · Abstracts
Research papers
This is the bibliographic front door for Technology, not a blog. Full abstracts and audience tags help you open a primary PDF without wading through marketing.
Primary sources · model-scoped reading
Read the document stack with reader chips (crypto, exec, builder) as a public corpus front door, then follow Abstract → PDF. The no-patent-claims badge keeps papers separate from claim charts. Takeaway: papers are primary sources for model-scoped reading, not a patent claim chart.
How to use this library
Filter by audience (architect, cryptographer, executive, developer, researcher) or pick a starter pack. Chrome stays plain; abstracts may use specialist vocabulary. The public papers corpus currently indexes 16 PDFs.
- Exec: naive-attack intuition, cognitive sovereignty, passwordless-or-not.
- Crypto: toward perfect secrecy, Rosario–Wang formalism, quantum-* papers.
- Builder: agentic AI systems, complexity white paper.
The corpus mixes information-theoretic secrecy arguments with computational and quantum intractability analyses. Use tags here, then the Math hub to place each paper in the ITS-versus-hardness map.
Catalog
Title, year, audiences, abstract, and PDF via the site papers API. Deep-link a paper with /technology/papers#<slug>.
Showing 16 of 16 papers.
- CryptographerResearcherArchitectOpen PDF →
Abstract
This paper presents a unified account of the Rosario / Wang New Dimensions construction: a commitment and proof architecture in which the secret is not compressed into the public record and then protected by computational difficulty, but is absent from the observable channel under stated balance, freshness, and sealing assumptions. The construction joins three formal objects. A Structured Ambiguity Container (SAC) publishes a scaffold that displays k^n plausible selector paths while withholding the private path. An Entropic Hyperplane Protocol (EHP) derives session-specific balanced manifolds and lets the prover answer in a synonym vocabulary through a private morphism. A Secure Verification Environment (SVE) performs membership checks and accumulation internally and emits only a nonce-scoped event bit. Under the Four Pillars P1–P4 - path-complete projection, uniform private synonyms, zero mutual information, and session-bound freshness - the observable channel satisfies a Shannon-style zero-information condition I(J;O∣C)=I(φ;O∣C)=I(σ;O∣C)=I(M;O∣C)=0. The ideal SAC/EHP/SVE model isolates a channel-shaping route to Vernam-class zero mutual information, with an ENI6MA engineering embodiment and application sketches spanning human authentication, API/service mesh, agentic workflows, edge/OT carriers, and regulated deployments - plus explicit obligations for nonce reservation, τ binding, burn-before-validate, payload tiers, and constant-time verification.
- ArchitectCryptographerResearcherOpen PDF →
Abstract
A quantitative information-theoretic analysis of how much an adversary can learn by observing a complete ENI6MA / Rosario–Wang authentication ceremony. The paper separates surface bits (Shannon entropy of symbols an observer can record) from effective bits (secret-relevant mutual information those recordings pin down), and argues that effective mutual information with the secret remains zero across rounds and ceremonies under the named model. Three mechanisms enforce the result: lossy hyperplane collapse that destroys ring/position/alphabet structure, a private witness synonym (one of 720 unknown bijections) that severs the bearing transcript from the colored challenge, and a per-round one-time pad that uniformizes the wire payload. Aimed at security engineers and architects evaluating shoulder-surfing and observer-ledger threat models.
- ArchitectExecutiveDeveloperOpen PDF →
Abstract
Written for challengers who worry that watching multiple successful logins reveals the password and private map, or that random guessing eventually hits both, this essay explains why those paths do not work for the ENI6MA rotating-ring method (not mathematically, statistically, computationally, or physically). Most mental models of authentication come from passwords: capture the string and the game is over. ENI6MA instead asks users to prove knowledge without exporting the secret. Each round rotates a ring by fresh entropy, paints it into zones, and accepts a masked witness token via a private map outsiders do not know. Ephemerality means yesterday’s geometry will not return; masking means public labels lack a legend. Together these principles separate “I saw the ceremony” from “I learned the secret,” clarifying surface versus effective bits for architects and executives.
- CryptographerResearcherOpen PDF →
Abstract
This white paper introduces ENI6MA as a stateless, witness-driven proof-of-knowledge architecture that replaces long-lived secrets with ephemeral, time-coupled evidence. Five cooperating strata cover a two-way hash keystream, entropy-pool sealing, a deterministic runtime loader, session entropy and offset computation that rotates concentric alphabet rings, and a control matrix that extracts per-round offsets for a six-zone manifold. In each round the prover reveals only a witness set and the verifier performs set-membership checks with linear verification cost using symmetric primitives. Security is argued from combinatorial breadth: with canonical rings, six hyperplanes, and fresh color bijections, the structure-free search space grows enormous with round count, while balanced foliation yields a policy-tunable false-accept rate. Because rings re-rotate and morphisms are redrawn, transcript marginals are intended to be flat and non-reusable, addressing exfiltration and replay failure modes of key-centric systems.
- CryptographerArchitectResearcherOpen PDF →
Abstract
This paper presents an end-to-end security argument for an ENI6MA-style interactive proof in which the attacker gains nothing in Shannon’s sense of perfect secrecy. The mechanism combines a one-time, entropy-dependent projection of the alphabet into six perceptual leaves; ring-rotation diffusion that spreads symbol appearances across a large configuration space; confusion from a private bijective map to six synonyms; and a second-layer enumeration of the 6! leaf permutations. Under uniformity and independence of one-time elements, correct nonce discipline, and balanced probes, the authors argue that mutual information between the hidden next symbol and the observable transcript is zero: every observable value is equally probable across rounds. The second half addresses computational and operational posture, arguing that classical and quantum adversaries find little traction when transcripts carry no reusable residue or statistically binding correlation with the secret.
- CryptographerResearcherOpen PDF →
Abstract
This work presents a unified formalism for the ENI6MA protocol grounded in the Rosario–Wang holographic manifold collapse and informational entanglement. It addresses the fragility of credentialed systems that store long-lived secrets, and positions the construction as an alternative to heavy algebraic zero-knowledge machinery for real-time human interaction. Identity is treated as per-event work: a language of disjoint enumerated alphabets, eigenvalue-labeled symbols, and a secret commitment array. Each round, the verifier rotates rings and foliates them into zones; the agent’s private morphism maps interface inputs to zone indices. Session uniqueness comes from high-entropy seeds and time, so identical visible layouts map to distinct internal states. The resulting witnesses are spatio-temporally bound and intended to be non-reusable outside their envelope.
- ResearcherCryptographerOpen PDF →
Abstract
This document specifies an interactive, human-in-the-loop proof-of-knowledge protocol that projects agent-committed alphabets into a rotating, foliated manifold of hyperplanes. A verifying circuit derives per-ring offsets from committed entropy and optional time, rotates the rings, and partitions them each round; the agent selects a zone via a private morphism from UI inputs. The protocol is configurable at commitment (alphabet count and sizes, hyperplane count, and secret length) while examples use n = 6 and L = 6 for clarity. Entropy drives deterministic yet unpredictable offsets; the verifying circuit alone computes foliations, preserving security separation. Acceptance is conjunctive across secret symbols via a membership accumulator with a clear PASS/FAIL outcome. The framework generalizes across modalities and is aimed at practical human-centric deployments with auditable index logs.
- ResearcherCryptographerOpen PDF →
Abstract
The authors formalize the ENI6MA cypher as a cognitive–cryptographic primitive in which a human or agentic twin proves knowledge without disclosure. Gestalt perception is treated as a cryptographic advantage when symbols from known alphabets are embedded in a stochastic manifold projection with per-round entropy. The prover holds a private bijection from semantic synonyms to perceptual leaves and emits only masked witnesses, so the verifier can check membership while learning nothing about the secret sequence. The design aims at Shannon-style transcript silence, diffusion across holographic leaves, and confusion via private-map permutations. The paper analyzes false-accept probabilities and attacker hypothesis dynamics, and connects the primitive to presence-as-work, deepfake-resilient identity framing, and agentic security without biometric storage or external MFA tokens.
- CryptographerArchitectOpen PDF →
Abstract
This paper analyzes a membership-only proof-of-knowledge protocol whose observable transcript is limited to six-way leaf identifiers. Balanced partitions of a large alphabet, independently rotating rings, and a private bijection over six labels throttle information leakage per round while stripping exploitable structure. The attacker’s problem is formalized as identifying a marked hypothesis in a combinatorial space whose size grows with secret length; information-theoretic lower bounds give the rounds needed to isolate a unique solution, with black-box classical and quantum time bounds via BBBV/Grover limits. Resource models then fold in reversible oracle construction, fault-tolerant overheads, and physical-layer constraints. The conclusion argued is that, even under optimistic hardware assumptions, the protocol remains computationally intractable for the baseline and longer secret lengths examined.
- ResearcherCryptographerOpen PDF →
Abstract
This paper quantifies the hypothesis space and the fastest physically permitted quantum attack times against a membership-only proof-of-knowledge in which a prover holds multiple distinct secrets over a large alphabet. For the allow-repetitions model multiplied by a six-way private bijection, the global hypothesis count is expressed in closed form and approximated for long secrets. Using the Θ(√M) quantum query lower bound for unstructured search, the authors convert oracle calls into wall-clock time under an absolute physical ceiling (an idealized cosmic computer at the Margolus–Levitin energy-limited rate). Best-case and conservative upper bounds for long-secret parameterizations yield timescales far beyond any practical horizon. The introduction frames quantum computing as powerful but bounded, cautioning against omnipotence myths when evaluating authentication designs that expose no algebraic witness.
- CryptographerArchitectOpen PDF →
Abstract
This essay presents a membership-only proof-of-knowledge protocol in which a prover convinces an observer she knows secrets without revealing them. Three intertwined ideas (balanced partitions into six equal leaves, independent ring rotations that eliminate positional anchors, and a private bijection that permutes leaf labels) throttle leakage to at most log₂6 bits per round and, in expectation, to essentially zero useful signal for predicting the next character. The adversary’s task collapses to unstructured search over a vast hypothesis space. The paper formalizes rounds-to-uniqueness requirements and shows how modest increases in secret length raise post-quantum security margins under Grover/BBBV. The design space emphasized is combinatorics, symmetry, and information throttling jointly enforcing intractability, so observations across rounds do not accumulate usable correlation against the secret.
- ResearcherExecutiveOpen PDF →
Abstract
This paper presents the Rosario–Wang Proof and the ENI6MA cypher as a human-centric cryptographic primitive that replaces stored credentials with per-event, verifiable work. A secret morphism compiled into prover and verifier “twins” steers a trajectory on a finite orientation ring when composed with fresh entropy and agent choices, producing a one-time witness by construction. The cognitive novelty is converting a high-dimensional family of alphabets into a foliated manifold that humans can search with fast membership tests (“is my symbol in this zone?”) rather than recalling a password. Freshness is enforced by an entropy-driven rotation function that binds each round to time and context. Rotated alphabets are partitioned into balanced zones; a private interface morphism maps gestures to zones without revealing the mapping. Soundness is framed with explicit false-accept accounting over ring size, witness length, and session entropy.
- ResearcherOpen PDF →
Abstract
This paper proposes an “informational entanglement” framing that unifies spatio-temporal entropy and attestation into a keyless authentication primitive. Two compiled twins sharing a sealed private morphism transform fresh session entropy, timestamp, and contextual inputs into a one-time holographic witness (an ephemeral trajectory on a discrete orientation ring). Identity is recast as per-event, per-context work rather than a stored credential. The construction emphasizes structural replay resistance via temporal nonces, bilateral liveness through oscillating challenge–response, and optional session keys from the same seed. Conservative security parameters include per-attempt error bounds in terms of ring size, rounds, and entropy, with constant-time execution and a passive zero-knowledge view of transcripts. Engineering constraints (trusted time, robust entropy, and side-channel hardening) are discussed so the guarantees can hold in practice.
- ResearcherExecutiveOpen PDF →
Abstract
This accessible paper explains how the ENI6MA / Rosario–Wang Proof uses cognitive methods to protect the witness (the hidden information that proves identity or knowledge) without exposing it during authentication. Minds (human or artificial) perceive patterns, map symbols to private meanings, and make fast membership decisions; ENI6MA builds an interactive ceremony around those abilities. A verifier sends structured probes; the prover answers with masked reactions meaningful only through a private map. The exchange is ephemeral, entropy-tied, and carrier-agnostic across modalities. Observers can record everything yet still cannot reconstruct the map or witness. The authors introduce private-map bijections, manifold projections, balanced leaves, and membership checks with minimal notation, then discuss resistance to eavesdropping, replay, and model-inversion attacks for readers with interest in security and cognitive science.
- ExecutiveArchitectOpen PDF →
Abstract
This multi-part work positions ENI6MA as a cognitive layer alongside self-sovereign identity primitives (DIDs, verifiable credentials, wallets, and registries). It reviews SSI’s key-centric model and edge cases such as device loss, key compromise, and rotation burden, then motivates “keyless sovereignty” where memory and meaning become the user’s primary credential. Later chapters introduce the Rosario–Wang Proof as a stateless projection that extends VC concepts into in-mind commitments, reducing reliance on issuer registries and revocation lists while preserving verifiability. ENI6MA is framed as a Layer-0 substrate that SSI tooling can leverage in hybrid architectures, with ledgers remaining valuable for audit while cognitive proofs optimize privacy and performance. The audience is executives and architects evaluating next-generation identity stacks.
- ExecutiveArchitectOpen PDF →
Abstract
This essay critiques the systemic problems not addressed by contemporary passwordless trends (passkeys, FIDO tokens, and mobile MFA apps). While hardware-bound credentials reduce phishing and stuffing for interactive users, the author argues they bind users to specific devices and vendor escrow or sync services, ceding sovereignty over storage and recovery. Passwordless struggles in heterogeneous estates, breaks for headless automation and server-to-server APIs, and falters where proximity checks fail. Recovery often reintroduces passwords, SMS, or biometrics. The underlying PKI is shifted into firmware and cloud sync layers still exposed to supply-chain and side-channel risk. Passwordless is framed as a tactical patch; proof-based authority that removes reusable secrets is positioned as a strategic alternative for executives and architects comparing migration paths.
Protocol integration docs live on Developers: this library is primary sources, not a shipping API guide.
Relation to Math / Fundamentals
Papers prove and deepen. Fundamentals state the capability description in Overview terms. Math formalizes on-site. For claim scope (what absolute language means) read Claims. Shared vocabulary lives in the glossary and notation.
Start from the Technology overview if you still need the two-roads framing.
IP strip
White papers and abstracts are fine here. Patent claim text is not: filings are legal instruments, not website tutorials. Rights notice only: /about/ip.