mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
Coming soon…
zkfol.com
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
Coming soon…
zkfol.com
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
$1,000 giveaway, ends in 240 MINUTES.
Two winners of $500.
Retweet, join: t.me/trenchwithtrav
Drop your wallet👇🏼
There is nothing like the @wearecultdao community 🩸🩸🩸
56
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
There is nothing like the @wearecultdao community 🩸🩸🩸
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
Liquidity for RVLT/ETH on @QuickswapDEX has been burned.
polygonscan.com/tx/0x56d242d…
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
We have a dream. And by the sheer force of our will. It will become reality.
Never surrender.
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
Letssssss goooooo where's my $CULT family at ❤️❤️❤️✨️
xitter.cf/i/spaces/1AKEmvrWQgAKL
I’m going to @harrybo_rg’s upcoming Space. Will you join too? xitter.cf/i/spaces/1AKEmvrWQgAKL
1
75
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
zkFollow me and get very rare and uninspiring tweets. But I do to spaces.
xitter.cf/i/spaces/1RJjpbvPkepKw
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
Set a reminder for my upcoming Space! xitter.cf/i/spaces/1RJjpbvPkepKw
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
Replying to @ModulusZK
@ModulusZK IS #revolutionary
simple breakdown:
You write the rules of a contract in plain logical statements
(if this
then that
and these numbers must add up).
The system turns those exact rules into math that can be checked.
There is NO separate computer program underneath that might do something different from what you wrote.
Money or data only moves if someone can prove the rules were followed. If the proof cannot be made, nothing happens.
Bugs tend to stop the action instead of letting someone take funds by surprise.
On an ordinary desktop computer, @ModulusZK is able to finish a large calculation in a few milliseconds and produce a tiny proof.
Comparable systems that run code inside a zero-knowledge virtual machine took several seconds and needed far more memory for the same task.
Instead of experts hand-crafting low-level cryptographic circuits or rewriting everything for a special virtual machine, YOU describe ordinary logical conditions.
The compiler handles the conversion into a form that short cryptographic proofs can verify.
#PRIVACY COMES INCLUDED. The proof shows the rules were satisfied without revealing the private numbers (balances, trades, or checks).
Hiding the details does not add extra work because the proof was already required.
powered by $CULT DAO
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
Take a look at moduluszk.io
1/4
Modulus zkFOL. The documentation is public.
The contract is the specification. Applications are written as first-order logic predicates, and a state transition is admitted only if it can be proved to satisfy them.
docs.moduluszk.io
2/4
No bytecode. No virtual machine. No execution layer.
Nothing executes on chain. Conditions are checked, and state moves when the mathematics permits it.
3/4
Three consequences follow from the design.
A contract cannot diverge from its specification, because there is one artifact. A defect produces a refusal, not a loss. Cost does not depend on how elaborate the logic is. The fee is static in units of the native asset.
4/4
Privacy is a property of the substrate. Every transaction already carries a proof, so private state stays publicly verifiable at no extra cost.
The prover envelope, on one desktop CPU, same algorithm, fib(10,000): 4.82 ms, a 49.8 KB proof, under 10 MB of memory.
github.com/zkFOL/zkfol
Cultdao.io @wearecultdao
🤖 Made with AI
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
Come at us ZK bros.
We’re pleased to report that @moduluszk's zkFOL tech stack is now public for review at github.com/zkFOL/zkfol/.
The paper draft is also online at github.com/zkFOL/zkfol/blob/…
Our docs and website have been updated inline.
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
We’re pleased to report that @moduluszk's zkFOL tech stack is now public for review at github.com/zkFOL/zkfol/.
The paper draft is also online at github.com/zkFOL/zkfol/blob/…
Our docs and website have been updated inline.
mergenchi 𐰢𐰼𐰏𐰨𐰃 retweeted
Who’s ready?
*hint* Nobody.





















