OBEX ®
161 posts
OBEX ®
@TheObexProtocol
OBEX® :: A deterministic L1 blockchain engineered to eliminate forks, neutralize MEV, and deter Sybil attacks. Designed by @aminnizamdev.
Kuala Lumpur, Malaysia 参加日 Eylül 2025
7 フォロー中770 フォロワー
OBEX ® がリツイート
Greetings everyone.
Here’s an update or , a more of my thought process .
Gate is set (Alpha I)
Now next priority,
Revisit consensus mechanics.
The idea, how do I get a consensus mechanism that trust no one, requires no human (which always cheat and have the ability to act maliciously) , leaderless solution and most importantly fair and never can be gamed forever?
My answer ..
A mathematical absolute resolution system (MARS).
How so?
I’ll use VDF as beacon that seeds a parameter.
Define crazy details perfectly deterministic protocol rules that uses an element that is not bias and truly fair and game resistance (even with brute force)
What is it?
MATHEMATIC!
Yes. Maths.
Slot ‘n’ is seeded with vdf beacon seeds and then relies on previous block hash (which is truly unique) ,
and I’ll define strict sets of everything from txn formatting to protocols and everything deemed to be deterministic.
Some rough sketch would be :
how beavon advance ?
compute yₙ = VDF(yₙ₋₁)
header?
Hₙ = {
version,
slot = n,
parent = hash(Hₙ₋₁),
beacon = yₙ
}
VDF?
Eval(x) -> (y) (sequential)
Prove(x) -> π (need to be careful with this)
Verify(x, y, π) -> {true,false}
input x for slot n is y_{n-1} (the previous beacon output)
output is y_n
Now the beacon
y_n is valid iff there exists a proof π_n such that:
Verify(y_{n-1}, y_n, π_n) = true
there’s alot more actually, defining header, header ID and stuffs, to make header is single, canonical and ensures there’s always a single possible header anywhere anytime at any given situation so no forks instant finality no rollbacks and reorgs .
boy .. crazy stuff . we are on the unchartered territory.
big dreams ahead, stay cohesive everyone .
$OBEX !
English
OBEX ® がリツイート
We are into something gentleman, chiavdf of ‘Chia’s’ in C++ tamed and made it work in pure rust .
Now I am trying to find the sweet spot and number of iterations to land it sub-second.
Need more testing, experimenting and numbers manipulating, proper way is to write some bench scripts.
Pray for our dream.
$OBEX
English
OBEX ® がリツイート
Dev Log,
Guys, ive been retesting the engine of Alpha I ,
the normal setup :
512 MiB,
3 passes
16.7 million leaves of 32b from ram hard.
q derived 96 challenges.
yes it’s good, yes it’s sybil deterring, but when i tried to a smaller laptop, it struggles and resulting OOM (memory crashes/denies)
so,
i tried experimenting with down scaled version of 512MiB , yes it’s runnable. yes works absolutely goof and blazingly fast even in small laptops
but that’ll cost us the security, it’s a tradeoff.
so i do a deep study to find a solution,
i was thinking to incorporate SHA3 hash recursion, did a bench from 200k iteration to 20M iteration, the sweet spot is around 500k~ ish iteration.
SHA3 recursion is used by Solana in their architecture, it’s not as battle tested like SHA256 of bitcoin, but it’s been there and used by solana for almost 4 years now.
so , im testing if we can do this,
highly accessible for everyone , but still secure .
my theory is this,
although the we only run 1 MiB , the prove is mantained the same , with q = 96 challenge, this is trivial, so , i added sha3 recursion that requires previous answer to recurse forward.
so sybil cost scaled with identities.
did a bench on it, it serves the same purpose of VDF delay.
but VDF is still superior.
but, with sol obex as another gate , i think it’s doable .
here’s the update so far .
the current replacement setup ive been testing :
1 MiB,
500k+~ ish SHA3 recursion.
q = 96 challenges,
vrf seeds from rfc 9381 ristretto (elliptic curve) , merkle tree setups and everything else the same
the problem,
all vdf out there is not compatible with pure rust
$OBEX is build with pure rust,
they are either C/C++ env or wrapper , yes rust but i need CMake C LLVM and stuffs .
chiavdf from Chia project is made from C/C++
so either we go for SHA3 recursion, and find a way to secure .
high level understanding :
with vdf -
unpredictable ? UNDENIABLY
slot binding ? yes
verifiable ? totally
precompute resistance ? absolutely,
without vdf (means using SHA3 recursion)
unpredictable ? (yes, but limited until parent block known)
slot binding ? yes
verifiable ? totally
precompute resistance? (no, instant once parent known)
There must be a way.
English
