LambdaClass Profile picture
Jan 24 12 tweets 4 min read
(1/12) At LambdaClass, we’re proud to be making contributions to some of our favourite open-source projects. Here’s a quick thread on what we’re currently working on and the links to the GitHub repos 🧵

#Lambdathread
(2/12) Reth is a modular, performant and user-friendly Ethereum full-node implementation written in Rust. Built by Paradigm, it’s now open-sourced and we’re actively contributing to it. github.com/paradigmxyz/re…
(3/12) Zerosync is a STARK-based solution for syncing a Bitcoin full node instantly without downloading the entire block history. It creates a cryptographic proof that allows for validation of the entire transaction history and current balances. github.com/ZeroSync/ZeroS…
(4/12) Kakarot is an Ethereum Virtual Machine written in Cairo and deployed on the StarkNet layer 2 network. It’s able to run any EVM bytecode program and addresses Ethereum’s scaling issues. github.com/sayajin-labs/k…
(5/12) Beerus is a Starknet light client that allows for querying information and interacting with the chain without storing the entire network. github.com/keep-starknet-…
(6/12) Beerus can be used as a CLI tool or through a rest API. We’re currently contributing code to add missing features like RPC calls.
(7/12) AES Encryption Circuit is a ZK-Snark circuit to provide verifiable encryption. Written in Rust and using Arkworks as a backend, it lets you prove that a given ciphertext is the correct AES-128 encryption using a certain secret key. github.com/lambdaclass/AE…
(8/12) Libtorrent-rs is a BitTorrent library written in Rust. It provides a high-level and safe API to interact with BitTorrent protocol. github.com/lambdaclass/li…
(9/12) The library aims to be fully compatible with the original libtorrent C++ library and is actively maintained and updated.
(10/12) It can be used to build various BitTorrent clients, such as standalone applications and can be integrated into other Rust projects to add BitTorrent functionality. We are working on updating the library to support the latest version of the BitTorrent protocol, version 2.
(11/12) Merkle Patricia Tree is an implementation of a modified version of Ethereum’s Modified Merkle Patricia Trie (trie) data structure. github.com/lambdaclass/me…
(12/12) It’s a key component in blockchain technology and we’re actively working on it. Its performance keeps improving and we are now testing it against known libraries in the ecosystem.

• • •

Missing some Tweet in this thread? You can try to force a refresh
 

Keep Current with LambdaClass

LambdaClass Profile picture

Stay in touch and get notified when new unrolls are available from this author!

Read all threads

This Thread may be Removed Anytime!

PDF

Twitter may remove this content at anytime! Save it as PDF for later use!

Try unrolling a thread yourself!

how to unroll video
  1. Follow @ThreadReaderApp to mention us!

  2. From a Twitter thread mention us with a keyword "unroll"
@threadreaderapp unroll

Practice here first or read more on our help page!

More from @ClassLambda

Jan 16
(1/15) TRIES

Let’s dive into the world of data structures! Today, we’ll talk about Tries. Trie is used because it is the fastest for auto-complete suggestions. 🧵

#DataStructures #Lambdathread
(2/15) A trie (or prefix tree) is a tree-like data structure that is often used to store a collection of strings. Each node in the trie represents a character in a string, and the path from the root to a particular node represents a prefix of one of the strings in the collection.
(3/15) Its main advantages are related to efficient insertion, search, and deletion operations, as well as the ability to quickly find all strings that start with a particular prefix.
Read 15 tweets
Jan 11
ARRAYS VS. HASH MAPS

(1/12) As promised, we will continue with twitter threads about different concepts. Today we are going to explain the differences between ARRAYS and HASH MAPS, in both structures and uses. 👇🧵 Image
(2/12) What is the difference between arrays and hash maps? Arrays are faster for accessing an element at a specific position, and if you need to perform the same operation on all elements in the array, while hash maps are faster for looking up a value given a key.
(3/12) Arrays and hash maps are both data structures that are used to store and retrieve data. However, they differ in several ways:
▪️ Indexing
▪️ Search time
▪️ Insertion and deletion Image
Read 12 tweets

Did Thread Reader help you today?

Support us! We are indie developers!


This site is made by just two indie developers on a laptop doing marketing, support and development! Read more about the story.

Become a Premium Member ($3/month or $30/year) and get exclusive features!

Become Premium

Don't want to be a Premium member but still want to support us?

Make a small donation by buying us coffee ($5) or help with server cost ($10)

Donate via Paypal

Or Donate anonymously using crypto!

Ethereum

0xfe58350B80634f60Fa6Dc149a72b4DFbc17D341E copy

Bitcoin

3ATGMxNzCUFzxpMCHL5sWSt4DVtS8UqXpi copy

Thank you for your support!

Follow Us on Twitter!

:(