Pinned Tweet
누구나 다 할 수 있는거 똑같이 할거면 시작도 안했다. – at Seongnam-si, Republic of Korea
“A Regulatory Compliance Protocol for Asset Interoperability Between Traditional and Decentralized Finance in Tokenized Capital Markets”
slideshare.net/slideshow/a-r…
👀
RWA issuance gets the headlines. Regulatory enforcement is the real challenge.
15 financial authorities. 31 compliance requirements.
Oraclizer proposed ERC-8319 with @DanSpuller and @robviglione and went further with ERC-TRUST.
Not just another RWA narrative. Actual research and implementation.
youtu.be/3eYexG0jn7U
Jonghun Hong retweeted
Regulatory compliance must be mathematically verifiable, not merely implemented.
Building on ERC-8319, ERC-TRUST brings formally verified regulatory execution to security tokens.
From regulatory standards to machine-verified execution.
This is the foundation institutional RWA needs.
ERC-TRUST from @Oraclizer runs regulatory actions on security tokens: six typed actions, fail-closed, one receipt each. It builds on ERC-8319, which I co-authored with @robviglione and @DanSpuller, and our proofs ran on tools from @certora and @rv_inc.
github.com/Oraclizer/erc-tru…
ERC-7943 built in, ERC-3643 plugs in.
Dan wrote ERC-8319's policy principles, and ERC-TRUST lives by them: a technical capability is not a legal obligation, the chain carries out decisions made through due process and never makes them, and compliance stays modular, so no market is forced into another's rules.
Certora's Prover checked our rules that the ERC-3643 adapter can never claim Full and that its receipts carry the token's real restriction state. With Runtime Verification's KEVM and Kontrol, we proved on the compiled bytecode that raw freeze and forced-transfer calls stay closed, that failures and non-raising freezes leave state untouched, and that LIQUIDATE moves exactly its amount and ends with its receipt.
Thank you, Rob and Dan, and the Certora and Runtime Verification teams.
Jonghun Hong retweeted
We didn't just optimize StateSync-GKR. We built our own proving engine.
Less memory. Faster verification. Mathematically verified.
Built from first principles. Proven by mathematics.
While building StateSync-GKR at @Oraclizer, three questions kept coming back.
How far can we take it?
Is there a better way?
Why not prove the prover itself?
So we built our own engine and took it all the way. Less memory, more speed, machine-checked.
There's a new version of this post
Jonghun Hong retweeted
Meet StateSync-GKR 🟢
Proving state changes just got a lot lighter, and a lot faster to check.
Against its own baselines, it keeps 89× less in memory and checks the same proof up to 23.68× faster.
oraclizer.io/ss-gkr
Jonghun Hong retweeted
What happens when a state changes? 👇
We prove just that change, layer by layer, all the way to the new state root, on a path machine-checked in Isabelle/HOL.
Thanks to @muellerberndt for reviewing our challenge generation and sharpening our claims.
Jonghun Hong retweeted
ERC-TRUST 1.2 is, to our knowledge, the first security-token standard backed by machine-checked proof 🔵
The freeze is proven for every input, so the word guarantee now applies. It builds on ERC-8319, which we co-wrote with @DanSpuller.
research.oraclizer.io/erc-tr…
Jonghun Hong retweeted
Tests cover the cases someone wrote down. A proof leaves no case where it fails 👇
Every registered execution is checked on the exact compiled bytecode, and the freeze is proven for every possible input.
Thanks to @Certora, whose prover ran part of our verification.
Jonghun Hong retweeted
Don't take our word for it.
Whether a regulatory order ran exactly as the rules say no longer has to rest on anyone's word. The proofs are public, with the commands to replay them.
github.com/Oraclizer/erc-tru…
👀
Don't take our word for it.
Whether a regulatory order ran exactly as the rules say no longer has to rest on anyone's word. The proofs are public, with the commands to replay them.
github.com/Oraclizer/erc-tru…
👀
Tests cover the cases someone wrote down. A proof leaves no case where it fails 👇
Every registered execution is checked on the exact compiled bytecode, and the freeze is proven for every possible input.
Thanks to @Certora, whose prover ran part of our verification.
👀
ERC-TRUST 1.2 is, to our knowledge, the first security-token standard backed by machine-checked proof 🔵
The freeze is proven for every input, so the word guarantee now applies. It builds on ERC-8319, which we co-wrote with @DanSpuller.
research.oraclizer.io/erc-tr…
👀
What happens when a state changes? 👇
We prove just that change, layer by layer, all the way to the new state root, on a path machine-checked in Isabelle/HOL.
Thanks to @muellerberndt for reviewing our challenge generation and sharpening our claims.
👀
Meet StateSync-GKR 🟢
Proving state changes just got a lot lighter, and a lot faster to check.
Against its own baselines, it keeps 89× less in memory and checks the same proof up to 23.68× faster.
oraclizer.io/ss-gkr
어제 오늘 행사에 바쁘게 미팅다니다 짬내 참여한 바이낸스 @binance VIP 행사
사람들에게 필요한 세무 관련 세션에, 참석자들은 무료 상담을 약속하신 걸 보고 놀랐다.
Jonghun Hong retweeted
👀
On compliance: no existing token standard specifies regulatory enforcement (freeze/seize/confiscate, multi-authority, terminal states). So we wrote one — ERC-8319, co-authored with @DanSpuller and @robviglione , now in the Ethereum standards process: github.com/ethereum/ERCs/pul…
Jonghun Hong retweeted
👀
Thanks! We highly appreciate the contributions.
OPH requires specialist knowledge across many disciplines. The simulator hardware and consensus protocol layers are entirely foreign to Physicists while most CS people struggle with the Physics aspects.
I'm not even starting to talk about applied Physics, engineering, neuroscience, biology, philosophy etc. as we're still working on the fundamentals.