Engineering Brief · Hyfstele Hash

Hash-Based Post-Quantum-Safe Proofs of Set Intersection

A transparent, hash-only construction that proves two parties' committed sets intersect — without trusting either party, without a trapdoor setup, and without exposing either set.

PATENT PENDING · US PROVISIONAL 64/069,537

What

Two parties commit to their sets once. A verifier later checks whether the committed sets share a member — or that they don't — using only SHA-256-style hash operations against the public commitments. No interactive ceremony. No trusted party. No reliance on discrete-log or pairing assumptions that fall to a quantum adversary.

The construction is built on Bezout coprime-cofactors certification over a hash-based polynomial substrate. The artifact is small, the verification is fast, and the security argument reduces cleanly to the underlying hash's collision resistance.

Why this matters

Existing intersection proofs lean on cryptographic assumptions that don't survive the post-quantum transition. Trusted-setup constructions require a ceremony and a long-lived secret — neither is acceptable for federal records that must hold up under a Q-day adversary and a 7-year retention floor.

Where it ships

Status

Production reference implementation: hyfstele-hash::pq_set (Rust). 17-page formal specification on file with the USPTO. Patent pending — US Provisional Application No. 64/069,537, filed May 19, 2026.

Application No.
64/069,537
Filed
May 19, 2026
Title
Hash-Based Post-Quantum-Safe Proofs of Set Intersection via Bezout Coprime-Cofactors Certification
Applicant
Hibiscus Consulting LLC
Module
hyfstele-hash::pq_set