How Email Check Works

Discover how we instantly find exposed accounts in gigabytes of leaked databases using an ultra-fast partitioned indexing structure.

Search Pipeline Sub-Millisecond Indexed Directory Tree Lookup

Unlike traditional scanners that search raw massive text dumps linearly (which takes minutes and eats RAM), our scanner utilizes a hierarchical, character-based partition tree. This splits the datasets into tiny files which can be located and scanned in under a millisecond.

1

Normalization

Your email is processed locally first. The system trims white spaces and converts all characters to lowercase to prevent search mismatches.

Input: " John.Doe@Gmail.com "
Normalized: "john.doe@gmail.com"
2

Index Partition Routing

We extract the first two characters of the email. These act as coordinates inside our database tree to locate the exact partition file containing your email record.

Email: "john.doe..." -> "j", "o"
Path: database/j/o.txt
3

Stream Matcher

Instead of loading the entire partition file in memory, we stream-read it line by line. This matches your email with extreme memory efficiency, ensuring the scanner remains fast even under high load.

Match query: john.doe@gmail.com
Finds: john.doe@gmail.com:pass123:SourceA
4

Breach Demarcation

If a match is found, the system parses the metadata to extract the compromised data source name, scoring indexes, and hash parameters to construct your final reports.

Raw: john.doe...:Collection_1 {1} [NOHASH]
Status: Found in Collection 1

Key Architecture Features

Sub-Millisecond Search
Indexed search routes directly to a slice of the database files.
Ultra-Low Memory Footprint
Partition files are streamed, keeping server memory at near zero.
Source Demarcation
Identifies the exact breach name (e.g. Collection 1) for the exposure.
Format Resilience
Tolerant of complex spaces, symbols, and case structures.
Zero DB Bloat
High-speed filesystem directory indexes avoid bloated DB servers.
No Data Retention
Emails are checked purely in memory; zero query logs are saved.

Linear Scanning vs Partition Slicing

Metric Linear Search (Naive) Partition Slicing (LeakOrigin)
Time Taken 3 - 10 minutes per query 0.001 - 0.005 seconds
RAM Usage Loads gigabytes into RAM Less than 1 MB (Line stream)
Scale Capability Crashes under concurrent scans Effortlessly scales to thousands of users
Cost Requires heavy computational instances Runs incredibly fast on lightweight hosts

Privacy & Security First

Protecting your identifier:

  • No Data Persistence: Email queries are never written to disk or logged. They are processed dynamically and forgotten.
  • Local Isolation: Searches are isolated per thread, preventing cross-session data leaks.
  • Offline-First Data: LeakOrigin checks local breach indexes, preventing third-party trackers from seeing what email you look up.
  • No Signup Required: Verify any address instantly and completely anonymously.

Recommended Actions If Leaked

Change passwords immediately on all accounts associated with this email address.
Use a password manager to generate unique, strong passwords for each online profile.
Enable Two-Factor Authentication (2FA) to add an extra barrier of protection.
Monitor your dashboard overview page to track ongoing security levels.