mirrors/arti.git/Cargo.toml, branch arti-v1.1.11

New tor-log-ratelim crate

2023-11-16T19:31:15Z

This crate is meant to provide rate-limited log messages to tell users about problems that can happen too frequently to log individually. This version is based off an earlier design, and off of conversations with @diziet. It still needs tests.

Merge branch 'hss_config' into 'main'

2023-09-07T14:34:06Z

Begin working on configuration logic for onion services See merge request tpo/core/arti!1557

Create a tor-hsrproxy crate to handle "proxy to local port".

2023-09-07T13:56:24Z

I'm calling this a "reverse proxy" since I think a lot of folks like that terminology, though I'm not personally a huge fan. Calling it "`tor-hsproxy`" would IMO confuse people more about what kind of proxy it was. This is a separate crate from `tor-hsservice` because it's logically at a different level: if you're writing a little embedded onion service, you don't need this code. Right now there is only configuration logic here.

Move examples to examples/gsoc2023

2023-09-06T02:34:56Z

fix: add examples to main Cargo.toml

2023-09-06T02:33:52Z

Include debug symbols in "bench" profile

2023-07-27T14:20:14Z

Including full debug symbols makes the benchmark builds useful for profiling too.

Start implementing Proposal 327

2023-07-27T14:20:14Z

This adds a new tor-hspow crate with the first layers of support in place for onion service client puzzles as described in Proposal 327. The API here is experimental, and it's currently only implementing the self-contained parts of the client puzzle. So, it can verify and solve puzzles, but it has no event loop integration or nonce replay tracking or prioritization code yet. These things seem like they would eventually live in the same crate. Signed-off-by: Micah Elizabeth Scott

Reimplement Equi-X in Rust

2023-07-27T14:20:14Z

This is a new pure Rust implementation of the Equi-X algorithm designed by tevador for Tor's onion service proof of work puzzle v1. Equi-X is an asymmetric puzzle algorithm based on Equihash, with N=60, K=3, the XOR replaced with modular addition, a 16-bit index space, and HashX as the inner hash function. Signed-off-by: Micah Elizabeth Scott

Reimplement HashX in Rust

2023-07-27T14:20:06Z

This is a new pure Rust implementation of the HashX algorithm designed by tevador for Tor's onion service proof of work puzzle v1. HashX is a lightweight family of randomly generated hash functions. A seed, via blake2 and siphash, drives a program generation model which randomly selects opcodes and registers while following some constraints that avoid timing stalls or insufficient hash mixing. The execution of these hash funcions can be done using a pure Rust interpreter, or about 20x faster using a very simple just in time compiler based on the dynasm assembler crate. This has been implemented for x86_64 and aarch64. Signed-off-by: Micah Elizabeth Scott

Merge branch 'add-tor-geoip' into 'main'

2023-06-20T17:59:15Z

tor-geoip: Add new crate with GeoIP database functionality See merge request tpo/core/arti!1239