editorinchief@ijsreat.com +91 9840521421 Scholarly Open Access, Peer-reviewed, Refereed Journal e-ISSN 2583-1240 Since 2021
  1. Home
  2. Archives
  3. 2026
  4. Vol. 6 Issue 5
  5. Article
Original Article

Temple Enclave AI: Tenant-Encrypted, Mutually Private LM Engine

  • Paper ID 384
  • Volume 6, Issue 5
  • Pages 46-58
  • Published Online: September-October 2026
Open Access Peer Reviewed Crossref DOI

Authors

  • Milind K. Patil1

1 Syncaissa Systems Inc, USA.

Article Information

Published Online
September-October 2026
Pages
46-58
Article Type
Original Article
Check for updates
check update

Abstract

View PDF

Two solutions for serving one open-weight language model to many tenants. TEMPLE-KEY-TRUST-HOST. Every tenant speaks to the model in its own secret private language: a per-tenant key 𝜅=(𝜋,𝑄)—a homophonic permutation 𝜋 of the vocabulary and a secret orthogonal rotation 𝑄 of the residual stream. A pretrained transformer is exactly equivariant to 𝑄 once LayerNorm is folded into RMSNorm, so the host runs a rotated copy, computes bit-for-bit the base model’s function, and sees only permuted symbols and rotated vectors. No training, no runtime cost; tenants cannot read one another (0% cross-tenant recovery against an eight-attack suite). Its limit is a theorem: rotated copies of one body are mutually alignable, so the party that executes the model can read. TEMPLE-MASK-TRUST-NOBODY. The host therefore never computes on readable numbers: every linear map runs on the host over fixed-point activations one-time-padded on ℤ264; every nonlinear step, the KV cache and the unembedding run on the tenant; the host returns 𝑊(𝑥+𝑟)+𝑏 and the tenant subtracts a precomputed 𝑊𝑟. The masks are prompt-independent preprocessing, supplied by a second cheap server at another provider (TEMPLE-DEALER-TRUST-NO-TWO) or by the host itself under exact homomorphic encryption when idle, with a stateless clerk parking the batches (TEMPLE-MINT-TRUST-NONE). Verified by eighteen self-checking tests and deployed on a rented GPU, a native C++/CUDA host and tenant answer at 24–25 ms per token (40 tokens/s), token for token the plain model’s answer; with the host minting its own masks, 23 ms per token after 13.6 minutes of idle GPU per 8,192 tokens. Twelve alternatives are recorded with the measurement or theorem that set them aside; a reference implementation reproduces every number.

APC from ₹1200 + 18% GST

Peer-reviewed open access₹1200 Indian (₹1400 with DOI)$80 USD internationalpaid after acceptance Peer-reviewed open access₹1200 Indian$80 USD international ₹1200 Indian · $80 intl

  • CrossRef DOI
  • ISSN 2583-1240
  • Open Access
  • Peer Reviewed
  • Plagiarism Checked
  • Google Scholar
Submit Paper