1. Support responses “Hey what is your best suggestion for finding phone numbers if I have a person’s email, url and full name. Is there one provider that is best to choose or should I just risk it and go for the waterfall?” Thanks for considering Clay! Could you clarify what you mean by "going for the waterfall"? Does that mean using provided APIs and default services in Clay. Clay supports the best-in-class providers, Hunter for email providers, Snov for sales automation, Linkedin for network scrapping, and more. A follow up question would be: Are you looking for a service or tool to find phone numbers based on personal information like email, URL, and full name? Are there any specific privacy or legal compliance concerns you need to consider in your search? Thank You! “Please let me know how Clay credits are calculated.” Thanks for your interest in understanding how Clay credits are calculated! Each Clay plan offers a monthly bucket of credits. Here’s how it works:

Statelessness is important in Ethereum as it allows for nodes that sync fast to be used, increasing trust assumptions for users due to an increased decentralised verification system. It is also great for state resurrection should we ever decide to prune out the stale state or even delete less relevant states. We will likely keep a state stored elsewhere instead of on full nodes, and should we ever need it, clients can use stateless blocks for execution and verification. Verkle trees are similar to Merkle trees in that they store large amounts of data and provide a proof for any single piece. If you're new to Merkle trees, we probably should go over it really quickly. We don't want absolute statelessness, we want weak statelessness. In the words of Darkrad, that means: "Validating block requires no state, but proposing blocks requires the full state". ETH2 Validators won't need full state - so staking from mobile devices (raspberry pi etc) becomes much easier. Light clients, however, should also be able to validate single blocks as fraud proofs. A quick note on states: "For the state tree, however, the situation is more complex. The state in Ethereum essentially consists of a key-value map, where the keys are addresses and the values are account declarations, listing the balance, nonce, code and storage for each account (where the storage is itself a tree)." 1 Merkle Trees Imagine you have a lot of data that you want to verify hasn't been tampered with. Instead of checking each piece of data individually, which can be time-consuming, you can use a Merkle tree.

How to solve popular Crypto questions Perfect secrecy Calculate the probability of both the schemes giving the same output for the same mesage for different values of $k$ from the group. If the message space is shorter than the generator space, it cannot be perfectly secret. Example of CPA secure system that’s not CCA secure Consider this scheme: $𝐸𝑛𝑐_𝑘 (𝑚) = 〈𝑟, 𝐹_𝑘(𝑟) ⊕ 𝑚〉, 𝑤ℎ𝑒𝑟𝑒 \space |𝑚| = 𝑛, 𝑟 ← 𝑈_𝑛, F_𝑘 \text{ 𝑖𝑠 𝑎 𝑃𝑅𝐹}$

Project Description: This project aims to develop a Django application that provides a simple email and password authentication system to allow users to sign up and log in. Additionally, the application allows listing all registered users. The project will use Django REST Framework (DRF) to develop a RESTful API. SQLite will be used as the database. Functional Requirements: User Sign Up: The user should be able to sign up by providing their email and password. User Login: The user should be able to log in with their email and password. User List: The application should allow listing all registered users. Authentication: The application should verify the user's credentials before granting access to their account. Authorization: Only authenticated users should be able to access the user list.

Abhinav Srivastava Interpolation Interpolation is a concept used in mathematics and logic to describe the process of constructing a new formula that "fills the gap" between two existing formulas. The objective of Craig's interpolation is to provide a way to find an intermediate formula between two logical formulas that preserves their logical relationship. Craig's interpolation theorem can be applied to formal verification, which is the process of checking whether a system or program satisfies certain properties or requirements. Specifically, interpolation can be used to simplify the process of verifying properties of a system or program by reducing the search space of the verification process. Formal verification typically involves exploring the state space of a system or program, which can be large and complex. By finding an interpolant between two formulas, we can often reduce the search space by focusing on the shared structure between the two formulas. For example, if we have a property that we want to verify, we can use interpolation to find a formula that captures the common structure between the property and the negation of the property. This formula can then be used to guide the search for counterexamples or to construct a proof of correctness. Craig’s Interpolation Theorem

Spock is a browser extension and SDK that offers passwordless authentication using public/private ECDSA keys. This technology allows users to securely sign in to websites and applications without the need for a traditional username and password. With Spock, a user generates a public/private ECDSA key pair that is securely stored on their device. When they want to log in to a website or application that uses Spock, they simply sign a challenge with their private key, which is then verified by the server using the user's public key. Spock can be easily integrated into any web application using its SDK, offering developers a simple way to offer secure and convenient passwordless authentication to their users. By eliminating the need for traditional passwords, Spock aims to provide a more user-friendly and secure login experience for both users and developers. Deliverables Spock browser extension: This would be a browser extension for popular web browsers like Chrome, Firefox, and Safari. The extension would provide users with a convenient and easy-to-use interface for generating and managing their ECDSA key pairs. Spock SDK: This would be a software development kit that allows developers to integrate Spock into their web applications. The SDK would provide the necessary tools and documentation for developers to implement passwordless authentication using the Spock protocol. Spock API: This would be an API that allows developers to access and manage user data for authentication and authorization purposes. The API could be used to store and retrieve user information, manage access controls, and provide other security-related features.

Do not steal these from me, I will steal your cookies otherwise. Adding support for Query Plan Guidance (QPG) for PostgreSQL on SQLancer - {Mail sent} - A lot of people seem interested, not sure how excited I am about this https://wiki.postgresql.org/wiki/GSoC_2023#PL.2FJava_refactoring_for_support_of_other_JVM_and_polyglot_languages Implement Dual Approximated Reachability Algorithm - {Ideation done} - {Mail sent} - most excited, but CPA checker issues are too obscure Improve test coverage for Julia - {Mail sent} - Everything on the Julia repo is solved it seems Test Case Generation/Model-based Testing with Modbat for JPF Implement variant PCA models in Pharo lang - {Learnt the various PCA method, now to implement them!} - {Fixed docs} IPv6 extended support on Haiku - {Got Haiku running, only ISO, not the source build} - {Eh, horrible fucking git, not interested anymore} Experiment support for post-quantum algorithms in X.509 certificates - {Also super interested, working on p11tool PR now}

Artichoke will use the Arti library binding for Tor in Rust to develop a command line toolbelt. Artichoke aims to help users monitor bandwidth, work with hidden service generators, simulate Tor networks, scan exit nodes and build circuits using either a Script (YAML) or via the CLI itself. Tor bandwidth monitor: A tool that can monitor the bandwidth usage of Tor clients and relay nodes. Hidden service generator: A tool that can generate new Tor onion addresses and associated private keys. Tor network simulator: A simulation environment that can simulate the behavior of the Tor network. Exit node scanner: A tool that can scan the Tor network for exit nodes. Tor circuit builder: A tool that can construct custom Tor circuits using Arti.

Objective The objective of this project is to develop an AI-assisted tool for automatically generating and verifying formal proofs for compiler design. The tool will use a combination of machine learning and formal verification techniques to generate formal proofs that verify the correctness of compiler optimizations and transformations. The tool will be designed to be modular and extensible, so that it can be easily integrated into existing compiler development workflows. Deliverables An AI-assisted tool for generating and verifying formal proofs for compiler design. A technical report documenting the tool design, algorithms, and experimental results. A set of benchmarks and evaluation metrics for measuring the performance and effectiveness of the tool. A set of example compiler optimizations and transformations demonstrating the effectiveness of the tool. Examples

Problems on Transactions and Concurrency: table bytes = tuple size (from query) * number of tuples, number of tuples per page = byte per page / bytes for a single tuple. Number of pages needed for the entire table = table size / byte of a single page. Say there are X unique/different values, from a certain condition, do (number of tuples / unique values) = number of records we need to consider. Query Optimization Cost is in terms of I/O operations Nested Loops -total block transfer or COST = br+mr*bs r outer relation, s inner relation $P_n$ will be tuples per page in n

(Awarded: 200 USD) Low-Medium severity issues Uninitialised state variables IndexLayout.factory is uninitialised when being used in _chargeAUMfees(). A possible exploit here would be to use factory.transfer() pre-emptively thus having a 0x00 address. Multiplication on Division In the core contracts, there are two instances where multiplication is done on a result of division. This might result in loss of precision in precision-sensitive DeFi contracts.

Finn Jensen (fjensen@bu.edu) Abhinav Srivastava (sabhinav@bu.edu) GitHub Link : https://github.com/AbhinavMir/miniproject GENI Link: urn:publicid:IDN+ch.geni.net:CS655-Fall2022+slice+Miniproject Slice: MiniProject Introduction / Problem Statement Google ImageNet is a large-scale image dataset created by Google that contains millions of labeled images. It is used by researchers and developers to train their machine learning models for computer vision tasks such as image classification, object detection, and segmentation.

What is the EVM? How does it work? At a high level, Ethereum Virtual Machine is a deterministic function that outputs a certain value for a certain input. The EVM is much like any other computer, but it specializes in running smart contracts. EVM is like JVM - but instead of using any other process virtual machine, on Ethereum we use EVM because we need things like finite determinism and gas-implementations. The compiler design behind EVM Solidity is a high-level language choice that compiles into bytecodes (machine readable set). Solidity is one of the more popular choices, otherwise Vyper, Flint, even C via ceagle can be your choices. Opcodes are low-level human-readable instruction sets that are representative of the deployed/creation bytecode. This creation bytecode is used to generate the runtime bytecode. The following contract is an example.

Note: The series is under construction! Introduction to Smart Contracts on Cosmos SDK - Part 1 Setting up your enviroment for Contract-enabled Cosmos Networks - Part 2 Walking through a simple contract written in Rust

Cosmos SDK and Starport: Development tools for the Cosmos Network Cosmos SDK is an open-sourced framework for building Blockchains. Cosmos SDK and Starport are tools to help developers scaffold and launch Blockchains easily. A popular analogy made is that Cosmos SDK is the Ruby-on-Rails of Blockchains. It ships with the core that allows basic functionalities of every Blockchain: ABCI, Consensus, State persistence etc. Cosmos also allows developers to edit the codebase to introduce the business logic of their applications. Smart Contracts: Programmable Logic on Blockchain Smart Contracts are code that reside on the network and run as required. For Ethereum, you might have already used Solidity to write code for the Ethereum Network. For example. here is the Solidity code for voting on a decentralized election application. function vote(uint proposal) public { Voter storage sender = voters[msg.sender]; require(sender.weight != 0, "Has no right to vote"); require(!sender.voted, "Already voted.");

sudo rm -rf ~/.wasmd wasmd init main --chain-id ibc-1 wasmd keys add acc_1 --recover Your BIP32 mnemonics: fluid cereal trash miracle casino menu true method exhaust pen fiber rural grape purchase rather table omit youth gain cage erase puppy sibling expand wasmd add-genesis-account acc_1 10000000000000000000stake wasmd gentx acc_1 100000000stake --chain-id ibc-1 wasmd collect-gentxs

In the last blog, we introduced CosmWasm and Cosmos SDK. In this blog we will set up the required tools. Which are - Starport: A tool to ease development with Cosmos SDK Wasmd: A Smart-Contract enabled Local Netowrk CosmWasm Toolset: To write and compile the contracts Installing Starport Starport is an interface to the Cosmos SDK which lets you build networks with simple CLI commands. You can use Starport in your browser, but it's not recommended for this article since we will be going back and forth with the code quite a bit.

Note: I've been able to research limited topics in this time, thus haven't been able to expand on most topics (every heading needs to be discussed, including each solution!). The language isn't formal or academic either (yet). The direction I'm aiming for is discussing important topics, quantitative analysis of the carbon footprint of present technologies, researching present innovations and their drawbacks and future ideas for developers with proposed architectures. Guidance from environmentalists and developers on a few things that I'm not sure of would be great. I'll need a few extra weeks to consolidate this into a solid introduction for artists and researchers. I'd love to get in touch at abhinavmir@protonmail.com. 1.0 Introduction NFTs (Non-Fungible Tokens) were introduced in EIP-721 as a standard for Non-Funglble Tokens or Deeds on the Ethereum network. Uploading an image to the Ethereum network would be expensive due to GasFees, which is why EIP-721 has an optional metadata interface [1]. While all owners of NFTs buy them for different reasons, one could state NFTs are valued for authenticity and speculation. While NFTs are most known for their usage in art, they have This paper quantitatively analyses the ecological impact of minting an NFT (ERC-721) on different platforms and discussses various mmethods of reducing the Carbon Footprint as well as weighs the pros and cons of these methods.

Introduction Nature-Inspired Swarm Intellignece take inspiration from natural agents such as birds, ants and wolves that interact with each other and the environment to optimize certain processes such as food foraging. While Nature-Inspired Optimization Techniques are not limited to Organism Swarm Optimization, that is what this paper focuses on. Particle Swarm Optimization, Water Drop Optimization are other examples along with algorithms inspired by human behvaiour, such as Political Optimizer, which focuses on 5 phases of a political party or organization. These discussions are interesting, but out of scope for our discussion. While we will discuss the social behaviour of the organsms, the organisms are represented by agents in programs. Q. Why do we need such algorithms? These algorithms are used to acheieve some degree of decentralization of intelligence while optimizing for food foraging. These metaheuristics are effective at attaining near-optimal solution and mminimization of search space. For example, using simple linear regression for networ routing may not be as effective as using Ant Colony Optmizer. Rule-Based models using metaheuristics have been developed to predict Bankruptcy as well - something that wouldn't be efficient using Support Vector Machines. As far as other optimization algorithms such as Stochastic Gradient Descent, there are certain problems with SGD that is solved individually by other algorithms. Frequent Updates cause problems with directions, computational resource usage etc.. Q. Why we chose these three algorithms?

Install GoLang wget -c https://dl.google.com/go/go1.14.2.linux-amd64.tar.gz -O - | sudo tar -xz -C /usr/local Add export PATH=$PATH:/usr/local/go/bin to ~/.profile (You can access it by typing in gedit ~/.profile). Run source ~/,profile. You should have GoLang by now. Install GoLang git clone https://github.com/cosmos/gaia && cd gaia && make install You now should have gaiad available on your command line. (NOTE: gaiacli is a deprecated command, use gaiad for all purposes).