The new project is being built in Stark.

ENS on Starknet#

Ethereum Name Service (ENS) is a service that maps character names to Ethereum addresses, making it easier to send Ethereum tokens.
ENS can also be used to create decentralized networks for hosting JPEG images and NFTs, and can use IPFS content hashes to ensure censorship resistance. Text records can also be stored on ENS, such as Twitter addresses, NFT information, and ENS can be seen as usernames for Website 3.0.
The locked network on ENS allows users to control ENS names and transfer locked funds to StarkNet, providing the possibility for cross-chain conversions.
Through smart contracts, RGN ENS allows users to have ENS names on StarkNet, including their Ethereum ERC20 tokens, NFTs, and other types of assets.
This is very useful for smart contract developers as they can now connect assets from two Ethereum networks.
This has already helped reduce the cost of cross-chain transactions and provide a secure decentralized identity system.
Through ENS, developers can create new networks, new alliances, and more scalable decentralized applications.

Panel Discussion: Blockchain, Data, and Reporting#

David Myhal entered the field through data exploration of blockchain and operates websites like Crypto fees.
Patrick McCory is a researcher primarily responsible for providing data for DApps and wallets like MetaMask.
Bartek is a researcher for L2Beat and MakerDao and co-founded the data analytics company TokenFlow.
Larry Cermak is the VP of Research at The Block and is responsible for moderating the discussion.
Data can uncover the fog of marketing and provide a deeper understanding of the current state of blockchain.
Adam Fiora is responsible for translating blockchain data into a format understandable to users.
The discussion includes how contracts work and the gas required to support each transaction.
The potential risks behind Alameda and the possibility of cryptocurrency hacks require us to learn how to read on-chain data better to improve data infrastructure.

Panel Discussion: StarkWare and the Future of Enterprise Finance#

David Levecki, CEO and co-founder, introduces real-world finance to blockchain using layer 2 to achieve digital currency CBD and real-world asset projects, improving privacy, reducing costs, and increasing speed.
I, founder and CEO of Applied Blockchain, a development company established in 2015, focusing on various blockchain applications. The first three years focused on enterprises with 20 years of experience in telecommunications, banking, and insurance. The next three years invested in cryptocurrencies, such as NFT markets, D5 protocols, bridging protocols, and smart contracts.
Louis, a member of Starknets and Rebuilding Maker, is also a blockchain strategy advisor for major financial enterprises.
The panel format is changed to encourage stronger opinions from the guests on stage and allow for discussions among them.
The first question is whether enterprise blockchain is effective, and if defined as using private blockchains to establish private cores and private LANs, it is not as effective as private databases.
The audience is allowed to ask questions, but the questions must be concise, and the moderator has the right to refuse or veto questions.
The guests on stage all have strong technical backgrounds and believe that Starck Ware can provide many possibilities for the development of blockchain.

Sorare Card Game#

Sorare is a virtual game with licensed collectibles, where players can buy or trade NFTs directly from the game.
The game is rapidly growing with over 1 million weekly active users, around 30,000 cards available for trading daily, and approximately $7 million in weekly transactions.
The auction market is in English auction format, where the price discovery is determined by the market, which also aligns with licensing agreements and makes it an enjoyable game.
Users have a demand for quick response in the auction market and expect immediate feedback after payment.
Sorare migrated to Starkx in 2021.
Users can receive rewards at the end of each week, including NFTs and physical rewards such as match tickets, clothing, and special experiences.
The auction market game is a strategic game, and the last minute is full of suspense and fun.

Visa Talk#

David Engel and Cuy Sheffield discuss Visa's interest in Web3.
Cuy Sheffield is the Crypto Chief at Visa, joining Visa through the acquisition of Trial Pay in 2015, and has a strong interest in payment technology.
Visa sees blockchain as a globally operating and permissioned technology, aiming to become a network within networks to meet the needs of different customers for value transfer.
Within Visa, blockchain is seen as an opportunity, and they focus on how to leverage blockchain networks, connect them to existing products, and build new brands on top of them.
Cuy Sheffield mentions that they have been working to understand blockchain knowledge for the past few years on a weekly basis.
The solutions Visa provides can improve transaction types between consumers, merchants, and B2B.
Most employees within Visa focus on payment technology and are passionately dedicated to combining blockchain and payment technology.

Cairo 1.0 Experiment#

Cairo 1 is an advanced, Turing-complete language for creating provable code.
Cairo 1 is based on Qazim, which adds security and simplicity.
This language is similar to Rust.
Cairo 1 has users, constants, enumerations, functions, variables, etc.
Cairo 1 has a basic syntax very similar to Rust.
Cairo 1 adds features that allow for provable execution even in the case of failure.

General ZK Computing Layer RISC ZERO#

Brian Redford has developed a new blockchain Bonsai network on StarkWare, which can be used as a general ZK computing accelerator, allowing application developers to unleash their creativity.
The first product is the Stark-based ZK VM, which can provide a secure virtual machine with a reliable physical instruction set.
This platform can be applied to games like Matchbox or other complex games like Doom.
Bonsai combines the global state and programming languages running on various chains, including Starknet.
Bonsai can provide various proof programs, such as execution proofs for Doom, which can be merged and searched through a Merkle tree.
Through ZK recursion, a large amount of computation can be reduced to a unique, verifiable state route that can be referenced by smart contracts.
Bonsai aims to reduce program recursion time to below 1 second, achieving infinite scalability.

Recursive STARK in zkEVM Context on Polygon ZKEVM#

Jordan, the technical lead of Polygon ZK EVM, explains how to aggregate multiple blocks into one proof.
The original ZK EVM circuit is very large and uses the Deluxe Brain Field Stark circuit.
The input data is similar to a blockchain, with hash values forming a chain, characterized by proofs between blocks (endpoints).
To aggregate multiple blocks into one proof, another circuit (developed language circum) is used for verification.
This circuit is a Stark circuit of about 2MB, with a width of over 1000 columns after introducing a certain amplification factor.
This technology uses recursive STARK proofs to aggregate multiple blocks into a small proof and verify it.
STARK proofs can transform global transactions from each block into a verified proof, making transactions faster and more efficient.

Soundness of FRI#

First, it is explained that the demonstration involves deep mathematics in geometry and focuses on the soundness of FRI proofs.
The naive attack is to replace the original function with an interpolation curve with a degree less than a specific number of points, which is affected by the probability (raw) of deviating from the set points for each query.
The final round of defense is a unique probability of 1, which can be compared with the function value to convert it into a maximum allowable point.
The naive attack provides an underestimated solution.
Its security estimate is determined by the fit between the function and the specified curve.
The fit decreases as the number of queries increases.
In practice, the most effective approach is to reach the size of the query volume curve.

FRIs and Other Delicacies#

First, the overall concept of verifying computation is explained: the interaction between a powerful computer (i.e., "the cloud") and a vulnerable verifier, with the hope of outsourcing some computational work to the cloud.
Then, several proof mechanisms are introduced: proof of work (requires doing as much work as the prover), verifiable random proofs (requires the verifier to be able to verify the work with a small number of queries), and interactive Oracle proofs (requires the verifier to get correct answers in linear time when verifying the work).
Several protocols for checking low-degree polynomials are mentioned, including the standard "FRI," DEEP FRI, and elliptic curve FRI.
The focus of this talk is on how to verify that the computation outsourced to the cloud is correct.
Hint: the main solution is to prove your work while providing some hints so that the verifier can verify the work with a small number of queries.
Finally, it is pointed out that completing the verification work in linear time is the ultimate goal in the IOPP model.

Security Boundaries of Hash Functions#

Succinct arguments are cryptographic proofs of computational integrity.
The proofs consist of probabilistic proofs and cryptographic commitments, where the probabilistic proofs prove the computation and the cryptographic commitments determine the cryptographic cost, resistance to quantum attacks, and other quality features of the proofs.
Today, the focus is on the security boundaries of probabilistic proofs combined with hash functions, with an emphasis on PCPs and their hash functions.
Probabilistic proofs come in different types, such as interactive, PCP, iota, giving the verifier different powers, such as multiple provers interacting simultaneously.
Probabilistic proofs also have different types of Oracle access, such as point query, polynomial query, and linear query.
The technology used by Starkware is PCPs combined with hash functions.
The security of probabilistic proofs and cryptographic commitments determines the security of the proofs.

StarkTank: Startup Pitches#

Each investment project has about two and a half minutes to present, and active investors can view relevant information about each investment project and provide timely feedback.
Alliance shares with investment project leaders to help investors seize opportunities and build bridges between investment projects.
Joey serves as the host to introduce the main content of the startup summit.
Investment project speaking time should not exceed two and a half minutes, otherwise they will discreetly move to the audience seats below.
Jocelyn joins the meeting as the MC.
The first investment project is Atlantis, a centralized private bond market that is opaque, illiquid, and only available to high-net-worth individuals, with a market size of up to $15 trillion.
RedStone Oracle
Giza, and other projects.

How Not to Build a Compiler#

Bob wants to build a compiler for the Bob language.
The compiler consists of a parser, type checker, and code generator.
Bob decides to build a parser that can never fail and always returns a syntax tree, accumulating errors.
Bob adds a language server to support autocompletion.
Bob's compiler becomes an API library that provides syntax and type information.
Whenever Bob uses autocompletion, he has to wait for a few minutes.
Bob builds a language server with complete autocompletion functionality and is very happy.