philcoin tools for Phil
Solana devnet · unaudited

A vault no wallet key can open.

Wallets are protected by a kind of maths a large quantum computer could undo. This vault is protected by hashing alone, which is believed to survive one. Every spend goes through Phil's compiled code.

No such computer exists today. This is a working demonstration on a test network, of the known way to be ready for one.

The fear, in plain words

What a wallet shows

Every transaction you sign shows your public key. Today nobody can work your private key out from it.

What could change

A large enough quantum computer could. Whoever had one could sign as you, and nothing on chain would look wrong.

What still holds

Hashing. Running a hash backwards stays hard, so signatures built only from hashes stay safe. They have one strict rule, below.

Is a wallet exposed?

Paste any Solana address to see what a quantum computer would be looking at. Nothing is asked of your wallet; the address is only sent to a public Solana node to read its balances.

The one rule: a key signs once

A hash-based key is 26 chains of hashes. A signature reveals a point part-way along each chain. Anyone can hash forward from a revealed point, so every extra signature from the same key gives a forger more of every chain. Try it here: this key is a throwaway and guards nothing.

Nothing signed yet. One signature is safe.

Where Phil comes in

“Use exactly once” is the rule Phil is built around. Written in Phil, a one-time key is a thing that signing uses up, so a second signature with it is refused before the program runs.

The vault

The vault holds one key's fingerprint. A spend is signed with that key and names the next key, and the vault moves to it in the same step. The used key is never accepted again, so the rule is kept on chain too.

A wallet only pays the deposit and the network fee. It never controls the vault.
Make a new vault

Coins such as Philcoin can be added once the vault exists.

How a spend is checked

1. Sign

Your browser signs one message with the current key: this vault, this recipient, this coin, this amount, the next key.

your browser
2. Upload

Anyone can carry it to Solana. Phil's server checks the upload arrived whole: the handshake, the policy, the bytes against their declared hash.

Phil's server
3. Verify

The program hashes each of the 26 chains forward to its end and compares the result with the fingerprint it holds.

our code
4. Pay and rotate

The vault takes the next key's fingerprint and the amount is paid, or, in a vault with a waiting time, recorded to be paid once the time has passed. The old key is finished.

our code

Before you rely on it

Where this comes from

Hash-based one-time signatures go back to Lamport and Winternitz in the 1970s. Putting one behind a Solana vault that rotates its key on every spend was shown by Dean Little's Solana Winternitz Vault in January 2025, and this follows that design. What is ours: every spend is an upload through the server Phil's compiler emits, and the use-once rule is shown in Phil.

This is a community project and is not affiliated with Phil or Solana.