[GUEST ACCESS MODE: Data is scrambled or limited to provide examples. Make requests using your API key to unlock full data. Check https://lunarcrush.ai/auth for authentication information.]  House of ZK [@HouseofZK](/creator/twitter/HouseofZK) on x 49.6K followers Created: 2025-07-21 11:01:44 UTC ePrint Highlights Full report: We rounded up the most recent research from the Cryptology ePrint Archive, focused on ZK, cryptographic scalability, identity, and quantum resistance. Topics include ZK-verified AI inference, threshold ring signatures, private coins, and scalable SNARKs. zkGPT: An Efficient Non-interactive Zero-knowledge Proof Framework for LLM Inference: zkGPT proves inference correctness of GPT models without revealing internal model weights. Uses "constraint fusion" and "circuit squeeze" to reduce proving overhead. Achieves 185× speedup over prior systems, generating GPT-2 proofs in under XX seconds. Private Coins Extension with Verifiable Encryption: A protocol enabling encrypted coin values to be decrypted and verified privately via zero-knowledge proofs and Diffie-Hellman key exchange. Designed for privacy-preserving financial systems and verifiable hidden amounts. Generic Construction of Threshold Ring Signatures and Lattice-based Instantiations: Introduces GC-TRS, a threshold ring signature framework allowing anonymous “t-of-n” signing. Includes lattice-based implementations (LTRS, CTRS), with CTRS achieving logarithmic-size signatures in the number of signers. Hobbit: Space-Efficient zkSNARK with Optimal Prover Time: A zkSNARK that minimizes prover memory while preserving linear-time execution. Transparent, plausibly post-quantum secure, and avoids elliptic curve cryptography. Based on a novel polynomial commitment scheme and sumcheck protocol. Ring-LWR-based Commitments and ZK-PoKs for Verifiable Quantum-Safe Searchable Encryption: Introduces RLWR-based commitments and ZK protocols. Applied to private searchable encryption with strong post-quantum properties and low overhead. Efficiently Parsing Existing eID Documents for Zero-Knowledge Proofs: Focuses on extracting verifiable claims (e.g. age) from Belgian eID cards using ZKPs, without revealing other personal data. Designed for privacy-focused ID systems using existing credentials. Applications of Zero-Knowledge Proofs on Bitcoin: Three use cases for ZK on Bitcoin: proof of reserves, succinct blockchain validation for light clients, and private rollups via BitVM. Emphasizes scalability and privacy without core protocol changes. On Weak NIZKs, One-way Functions and Amplification: Explores weak NIZKs and shows they imply the existence of one-way functions. Offers minimal assumptions for bootstrapping stronger cryptographic primitives. FRIttata: Distributed Proof Generation of FRI-based SNARKs: Presents FRIttata, a horizontally scalable SNARK using a FRI-based commitment scheme. Eliminates trusted setup, preserves ZK, and optimizes communication via a "Fold-and-Batch" protocol. Gödel in Cryptography: Effectively ZK Proofs for NP with No Interaction, No Setup, and Perfect Soundness: Proposes a new ZK model based on logical unprovability, enabling perfectly sound proofs with no setup or interaction. Breaks past assumptions about the limits of zero-knowledge under minimal complexity constraints. XXX engagements  **Related Topics** [llm](/topic/llm) [coins](/topic/coins) [threshold](/topic/threshold) [inference](/topic/inference) [coins ai](/topic/coins-ai) [topics](/topic/topics) [zk](/topic/zk) [$qubt](/topic/$qubt) [Post Link](https://x.com/HouseofZK/status/1947250636761792696)
[GUEST ACCESS MODE: Data is scrambled or limited to provide examples. Make requests using your API key to unlock full data. Check https://lunarcrush.ai/auth for authentication information.]
House of ZK @HouseofZK on x 49.6K followers
Created: 2025-07-21 11:01:44 UTC
ePrint Highlights
Full report:
We rounded up the most recent research from the Cryptology ePrint Archive, focused on ZK, cryptographic scalability, identity, and quantum resistance. Topics include ZK-verified AI inference, threshold ring signatures, private coins, and scalable SNARKs.
zkGPT: An Efficient Non-interactive Zero-knowledge Proof Framework for LLM Inference: zkGPT proves inference correctness of GPT models without revealing internal model weights. Uses "constraint fusion" and "circuit squeeze" to reduce proving overhead. Achieves 185× speedup over prior systems, generating GPT-2 proofs in under XX seconds.
Private Coins Extension with Verifiable Encryption: A protocol enabling encrypted coin values to be decrypted and verified privately via zero-knowledge proofs and Diffie-Hellman key exchange. Designed for privacy-preserving financial systems and verifiable hidden amounts.
Generic Construction of Threshold Ring Signatures and Lattice-based Instantiations: Introduces GC-TRS, a threshold ring signature framework allowing anonymous “t-of-n” signing. Includes lattice-based implementations (LTRS, CTRS), with CTRS achieving logarithmic-size signatures in the number of signers.
Hobbit: Space-Efficient zkSNARK with Optimal Prover Time: A zkSNARK that minimizes prover memory while preserving linear-time execution. Transparent, plausibly post-quantum secure, and avoids elliptic curve cryptography. Based on a novel polynomial commitment scheme and sumcheck protocol.
Ring-LWR-based Commitments and ZK-PoKs for Verifiable Quantum-Safe Searchable Encryption: Introduces RLWR-based commitments and ZK protocols. Applied to private searchable encryption with strong post-quantum properties and low overhead.
Efficiently Parsing Existing eID Documents for Zero-Knowledge Proofs: Focuses on extracting verifiable claims (e.g. age) from Belgian eID cards using ZKPs, without revealing other personal data. Designed for privacy-focused ID systems using existing credentials.
Applications of Zero-Knowledge Proofs on Bitcoin: Three use cases for ZK on Bitcoin: proof of reserves, succinct blockchain validation for light clients, and private rollups via BitVM. Emphasizes scalability and privacy without core protocol changes.
On Weak NIZKs, One-way Functions and Amplification: Explores weak NIZKs and shows they imply the existence of one-way functions. Offers minimal assumptions for bootstrapping stronger cryptographic primitives.
FRIttata: Distributed Proof Generation of FRI-based SNARKs: Presents FRIttata, a horizontally scalable SNARK using a FRI-based commitment scheme. Eliminates trusted setup, preserves ZK, and optimizes communication via a "Fold-and-Batch" protocol.
Gödel in Cryptography: Effectively ZK Proofs for NP with No Interaction, No Setup, and Perfect Soundness: Proposes a new ZK model based on logical unprovability, enabling perfectly sound proofs with no setup or interaction. Breaks past assumptions about the limits of zero-knowledge under minimal complexity constraints.
XXX engagements
Related Topics llm coins threshold inference coins ai topics zk $qubt