Searchit is a concurrent, extensible, and profile-based web content discovery tool. It allows developers and security researchers to discover web content such as directories, files, and application endpoints on web servers.
Searchit provides a concurrent scanning engine, topological profile dependency resolution, interactive console progress controls, and a structured output system.
- Concurrent scan engine: Configurable worker pool and connection reuse policy.
- Recursive scanning: BFS and DFS traversal strategies with configurable recursion depth.
- Filtering: Filters responses by status code, body size, and custom headers.
- Profiles: Reusable scan configurations supporting inheritance/dependency resolution, creation, validation, visualization, and interactive editing.
- Interactive TUI: Live progress display enabled automatically in interactive terminals. Use
--no-progressto suppress. Console keyboard controls available during scans. - Output Formats: Supports text, JSON, and NDJSON output formats, with an optional quiet text mode.
Build from source (requires Go 1.26+):
Using the Makefile (recommended):
git clone https://github.com/unsubble/searchit.git
cd searchit
make buildThis compiles the binary to bin/searchit. To install it globally to your GOBIN path:
make installOr build manually:
go build -o bin/searchit .You can run the compiled binary directly:
./bin/searchit --helpScan a target with default settings using the embedded wordlist:
searchit scan -u https://example.comThe live progress display is enabled automatically when running in an interactive terminal.
To suppress it, pass --no-progress.
Scan using a built-in profile:
searchit scan -u https://example.com --profile wordpressComplete guides and documentation are available in the docs/ directory:
- Getting Started Guide
- Command Reference
- Profiles Guide
- Scan Configuration
- Recursion & Determinism Hardening
- Architecture & Technical Design
- Practical Examples
- Development & Contribution Standards
- Project Roadmap
Searchit is licensed under the MIT License.