- Timers for individual count
- Clustering
- Persistence through RDB
- Persistence through AOF
mCaptcha uses a leaky- bucket-enabled counter to keep track of traffic/challenge requests.
-
At
t=0
(wheret
is time), if someone is visiting an mCaptcha-protected website, the counter for that website will be initialized and set to 1. -
It should also automatically decrement(by 1) after a certain period, say
t=cooldown
. We call this cool down period and is constant for a website. -
If at
t=x
(wherex<cooldown
), another user visits the same website, the counter becomes 2 and will auto decrement att = cooldown + x
for second user.Note that, for the decrement to work, we require two different timers that goes off at two different instants. The current(
v0.1.3
) oflibmcaptcha
implements this with internal data structures and timers --- something that can't be shared across several machines in a distributed setting.So we figured we'd use Redis to solve this problem and get synchronisation and persistence for free.
This Redis module implements auto decrement on a special data type(which is also defined in this module).
If a timer is supposed to go off to
decrement key myCounter
at t=y
(where y is an instant in future),
-
A hashmap called
mcaptcha_cache:decrement:y
(prefix might vary) is created with key-value pairskeyName: DecrementCount
(myCounter: 1
in our case) -
A timer will be created to go off at
t=y
-
Any further decrement operations that are scheduled for
t=y
are registered with the same hashmap(mcaptcha_cache:decrement:y
). -
At
t=y
, a procedure will be executed to read all values of the hashmap(mcaptcha_cache:decrement:y
) and performs all registered decrements. When its done, it cleans itself up.
This way, we are not spinning timers for every decrement operation but instead, one for every "pocket".
This module creates and manages data of three types:
mcaptcha_cache:captcha:y
wherey
(last character) is variablemcaptcha_cache:pocket:x
wherex
(last character) is variablemcaptcha:timer:z
wherez
(last character) is pocket name from step 2(See Hacks).
WARNING: Please don't modify these manually. If you do so, then Redis will panic
This module is capable of cleaning up after itself so manual clean up is unnecessary. If you have needs that are not met my this module and you which access/mutate data manually, please open an issue. I'd be happy to help.
There are two ways to run cache
:
Use image from DockerHub:
$ docker run -p 6379:6379 mcaptcha/cache
or build from source:
$ docker build -t mcaptcha/cache .
$ docker run -p 6379:6379 mcaptcha/cache
Make sure you have Rust installed: https://www.rust-lang.org/tools/install
Then, build as usual:
cargo build --release
redis-server --loadmodule ./target/release/libcache.so
Every counter has a name and a leak-rate in seconds.
If counter exists, then count is incremented. Otherwise, it is created.
MCAPTCHA_CACHE.COUNT <counter-name> <leak-rate-in-seconds>
MCAPTCHA_CACHE.GET <counter-name>
NOTE: These benchmarks are for reference only. Do not depend upon them too much. When in doubt, please craft and run benchmarks that are better suited to your workload.
To run benchmarks locally, launch Redis server with module loaded and:
$ make bench
- platform:
Intel core i7-9750h
➜ cache git:(master) ✗ make bench
./scripts/bench.sh
running set and get without pipelining
SET: 128600.82 requests per second, p50=0.191 msec
GET: 128617.36 requests per second, p50=0.191 msec
mCaptcha cache without piplining
MCAPTCHA_CACHE.ADD_VISITOR mycounter: 127811.86 requests per second, p50=0.207 msec
MCAPTCHA_CACHE.GET mycounter: 123243.77 requests per second, p50=0.199 msec
running set and get with pipelining
SET: 1416430.62 requests per second, p50=0.479 msec
GET: 1644736.88 requests per second, p50=0.391 msec
mCaptcha cache with piplining
MCAPTCHA_CACHE.ADD_VISITOR mycounter: 396039.59 requests per second, p50=1.903 msec
MCAPTCHA_CACHE.GET mycounter: 889679.75 requests per second, p50=0.791 msec
I couldn't find any ways to persist timers to disk(RDB
/AOF
). So I'm
using a dummy record(mcaptcha:timer:*
see Gotchas) which
will expire after an arbitrary time(see POCKET_EXPIRY_OFFSET
in
lib.rs
). When that expiry occurs, I derive the key of
the pocket from the values that are passed to expiration event handlers
and perform clean up of both the pocket and counters registered with the
pocket.
Ideally, I should be able to persist timers but I couldn't find ways to do that.
2023 development is funded through the NGI0 Entrust Fund, via NLnet. Please see here for more details.