gm,
our project ZkProof Portal won the
@AvailProject
Best appchain built with Avail DA at
@ETHGlobal
's Scaling Ethereum Hackathon!
Project Link: -
🏆 🛠️ 💻
cc:-
@Karan1294728
From getting rejected to finally becoming an official member of the Ethereum Protocol Fellowship Cohort 5!!🥺
I'm thrilled to announce that after contributing permissionlessly to the Ethereum protocol for 2 months, I've become an official member of EPF Cohort 5! 🥳🥳
🎉 Thrilled to announce that our project built on
@0xStackr
, PointCaster, had an amazing run at
@ethmumbai
:
🌟 Finalist in EthMumbai Social category
🥇 First place in PurpleDAO track
Project Link:
🎉Thrilled to announce that our team won the
@AvailProject
track prize in
@ETHGlobal
's Circuit Breaker Hackathon!
Our project PriviChainEx, enables interoperable private chains for trading tokenized assets using zkBridge. 🚀
with
@0xpanicError
exploring the nuances of Encapsulated vs systemic complexity in protocol design and here's the detailed breakdown:-
Encapsulated complexity occurs when there is a system with sub-systems that are internally complex, but that present a simple "interface" to the outside.
ZkProof Portal is an order book for proof markets where developers request zkProofs, provers submit proofs for rewards. Collateral bids ensure quality, while ratings ensure reliability.
How then do we navigate this tradeoff?
At this point, it should be clear that encapsulated complexity is generally less risky. The complexity of a system doesn't solely depend on the length of its specification.
where H is a hash function m is the message , k and K are the private and public keys. The true complexity is hidden inside the definition of the e function: elliptic curve pairings, one of the most difficult-to-understand pieces of math in cryptography.
BLS signatures are technically complex but manageable when treating the e function as a black box, making them relatively simple. Conversely, Schnorr signatures have less overall complexity but involve more components that could interact unpredictably with external elements.
Here is an example to explain this:-
BLS signatures and Schnorr signatures are two popular types of cryptographic signature schemes that can be made with elliptic curves.
BLS signatures appear mathematically very simple:
Signing : 𝛔 = H(m)*k
Verifying: e([1], 𝛔 ) = e(H(m), K)
Now, consider Schnorr signatures. Schnorr signatures rely only on basic elliptic curves. But the signing and verification logic is somewhat more complex:
For instance, a brief 10-line segment that interacts with every other part of the system can introduce more complexity than a 100-line function that operates independently like a black box.
Deciding which type of complexity to prefer is a complex issue with no straightforward answers. The most practical approach is to moderately prefer encapsulated complexity, without overcommitting, and to rely on careful judgment in each particular scenario.
While encapsulated complexity is generally preferred, it has its drawbacks. Bugs can arise in any code, and larger codebases almost guarantee bugs. Additionally, interacting with a subsystem in new ways can turn encapsulated complexity into systemic complexity.