onnx vs The Stack v2
The Stack v2 ranks higher at 59/100 vs onnx at 26/100. Capability-level comparison backed by match graph evidence from real search data.
| Feature | onnx | The Stack v2 |
|---|---|---|
| Type | Repository | Dataset |
| UnfragileRank | 26/100 | 59/100 |
| Adoption | 0 | 1 |
| Quality | 0 | 1 |
| Ecosystem | 0 | 0 |
| Match Graph | 0 | 0 |
| Pricing | Free | Free |
| Capabilities | 14 decomposed | 11 decomposed |
| Times Matched | 0 | 0 |
onnx Capabilities
ONNX serializes neural network models to a standardized binary format using Protocol Buffers (protobuf), with a versioned operator schema system that enables forward/backward compatibility across framework versions. The architecture uses onnx.proto definitions that map to in-memory IR (Intermediate Representation) objects, allowing models trained in PyTorch, TensorFlow, or other frameworks to be persisted and loaded with operator semantics preserved through operator versioning and domain-based namespacing.
Unique: Uses a dual-layer versioning system combining operator-level versioning (via opset versions) and domain-based namespacing (ai.onnx, ai.onnx.ml, com.microsoft, etc.) to enable incremental schema evolution without breaking existing models; external_data_helper.py provides transparent handling of models exceeding protobuf's 2GB limit by splitting tensors into separate files
vs alternatives: More portable than framework-native formats (SavedModel, .pt) because it enforces a canonical operator schema; more efficient than JSON-based formats (TensorFlow's JSON) due to protobuf binary encoding
ONNX implements a type and shape inference system that traverses the computation graph, propagating tensor shapes and data types through operators using operator schema definitions. The inference engine uses partial evaluation to compute constant folding and data propagation rules defined in operator schemas (via type_inference_function and shape_inference_function), enabling static analysis of model outputs without executing the model. This is implemented in C++ (onnx/defs/data_type_utils.cc) with Python bindings for accessibility.
Unique: Implements bidirectional shape inference (forward and backward propagation) combined with partial evaluation of constant subgraphs; uses operator schema registry to apply type-specific inference rules (e.g., broadcasting rules for element-wise ops, reduction rules for aggregation ops) without executing the model
vs alternatives: More comprehensive than TensorFlow's shape inference because it handles operator-specific semantics through schema-driven rules; faster than PyTorch's symbolic shape tracing because it doesn't require model execution
ONNX supports function bodies (FunctionProto) that enable defining custom operators as compositions of primitive ONNX operators. Functions are stored in the model's opset_import and can be referenced like built-in operators. This enables operator abstraction, code reuse, and domain-specific operator definitions without requiring C++ kernel implementations. Function bodies are expanded during model execution or compilation, enabling optimization of composed operators.
Unique: Enables operator abstraction through function bodies that are composed of primitive operators, allowing custom operators without C++ implementation; functions are first-class citizens in the ONNX IR, enabling optimization and analysis of composed operators
vs alternatives: More flexible than C++ kernel implementations because functions can be modified without recompilation; more portable than framework-specific custom operators because functions use standard ONNX operators
ONNX uses CMake for cross-platform building with automatic protobuf code generation (onnx/gen_proto.py), Python extension building via setuptools, and platform-specific configuration for Windows, Linux, and macOS. The build system generates C++ bindings for Python (onnx_cpp2py_export), compiles operator schema definitions, and produces platform-specific wheels with abi3 compatibility for Python 3.12+. Build configuration is managed through CMakeLists.txt with external dependency management for protobuf and googletest.
Unique: Uses CMake with automatic protobuf code generation (gen_proto.py) to maintain synchronization between .proto definitions and C++ code; implements abi3 wheel building for Python 3.12+ enabling single binary distribution across multiple Python versions
vs alternatives: More flexible than setuptools-only builds because CMake enables C++ compilation and optimization; more maintainable than manual protobuf compilation because gen_proto.py automates code generation
ONNX implements comprehensive CI/CD workflows (.github/workflows/main.yml) that run automated tests across multiple Python versions and platforms, perform code quality checks (linting, type checking), and orchestrate releases to PyPI. The pipeline includes backend test execution, security scanning, and compliance automation. Release orchestration handles version bumping, changelog generation, and wheel building for multiple platforms.
Unique: Implements multi-platform CI/CD with automated backend test execution across different ONNX runtimes; release orchestration handles version management, changelog generation, and multi-platform wheel building with abi3 compatibility
vs alternatives: More comprehensive than basic CI because it includes backend testing and security scanning; more automated than manual release processes because it orchestrates version bumping and PyPI publishing
ONNX provides a reference implementation (onnx/reference/ops/) that executes ONNX models using NumPy-based operator kernels, enabling model inference without external runtimes. The reference implementation is used for testing, validation, and as a fallback for operators not optimized in production runtimes. It supports all standard ONNX operators and provides numerical accuracy baseline for comparing against optimized implementations.
Unique: Provides NumPy-based operator kernels for all standard ONNX operators, enabling pure-Python model inference without external runtime dependencies; used as ground truth for testing and validation
vs alternatives: More portable than ONNX Runtime because it has minimal dependencies; more accurate for testing because it provides canonical operator semantics
ONNX maintains a global operator schema registry (onnx/defs/operator_sets.h) that stores versioned definitions for 200+ operators across multiple domains (ai.onnx, ai.onnx.ml, ai.onnx.training, com.microsoft, etc.). Each operator definition includes input/output signatures, type constraints, attributes, and inference functions. The registry supports operator versioning (opset versions 1-21+) allowing operators to evolve while maintaining backward compatibility; deprecated operators are marked but remain available for legacy models.
Unique: Uses a C++ registry pattern (onnx/defs/*.cc files) with lazy initialization and domain-based namespacing to support 200+ operators across multiple domains without monolithic registration; operator versioning is enforced at schema level with deprecated operator tracking, enabling safe evolution of operator semantics
vs alternatives: More structured than TensorFlow's op registry because it enforces type constraints and shape inference at schema definition time; more extensible than PyTorch's operator system because domains allow third-party operator contributions without core library changes
ONNX provides a Python API (onnx/helper.py, onnx/compose.py) for programmatic graph construction and manipulation, enabling developers to create models by instantiating NodeProto objects, connecting them via ValueInfoProto edges, and composing them into GraphProto structures. The API supports node insertion, edge rewiring, subgraph extraction, and graph merging operations. Internally, graphs are represented as directed acyclic graphs (DAGs) where nodes are operators and edges are named tensor values; the composition API abstracts protobuf manipulation.
Unique: Provides helper functions (make_node, make_graph, make_model) that abstract protobuf construction, reducing boilerplate; compose.py enables graph merging and subgraph extraction with automatic input/output inference, allowing composition of pre-built model fragments
vs alternatives: Lower-level than PyTorch's nn.Module API but more explicit about graph structure; more flexible than TensorFlow's Keras API because it allows arbitrary DAG topologies without layer-based constraints
+6 more capabilities
The Stack v2 Capabilities
Aggregates 67 TB of source code from the Software Heritage archive, filtering for permissively licensed repositories (MIT, Apache 2.0, BSD, etc.) across 600+ programming languages. Uses automated license detection and validation to ensure legal compliance for model training. Implements a rigorous deduplication pipeline at file and repository levels to eliminate redundant training data and reduce dataset bloat.
Unique: Largest open-source code dataset at 67 TB with automated opt-out governance allowing repository owners to request removal, combined with rigorous deduplication and PII removal pipeline — no other public dataset offers this scale with legal compliance and community control mechanisms
vs alternatives: Larger and more legally compliant than GitHub's CodeSearchNet (14M files) or Google's BigQuery public datasets, with explicit opt-out governance vs. implicit inclusion, and covers 600+ languages vs. Codex training data's undisclosed language distribution
Implements a community-driven opt-out system where repository owners can request removal of their code from the dataset without legal takedown notices. Maintains a registry of excluded repositories and re-applies exclusions during dataset updates. Provides transparent governance documentation and a clear submission process for removal requests, balancing open access with creator rights.
Unique: First large-scale code dataset to implement opt-out governance at dataset level rather than relying solely on license compliance, with transparent registry and community submission process — shifts power from dataset creators to code contributors
vs alternatives: More respectful of creator autonomy than GitHub Copilot's training approach (no opt-out) or academic datasets (one-time snapshot), and more scalable than individual DMCA takedowns
Automated pipeline that scans source code for personally identifiable information (email addresses, API keys, SSH keys, credit card patterns, phone numbers) and removes or redacts them before dataset release. Uses regex patterns, entropy-based detection for secrets, and heuristic rules to identify sensitive data. Operates at file level with configurable sensitivity thresholds to balance data utility against privacy risk.
Unique: Combines regex pattern matching, entropy-based secret detection, and heuristic rules in a unified pipeline with configurable sensitivity — more comprehensive than simple regex-only approaches, but trades off false positive rate against security coverage
vs alternatives: More thorough than GitHub's secret scanning (which only flags known patterns) because it includes entropy-based detection for unknown secret formats, but less accurate than specialized tools like TruffleHog due to language-agnostic approach
Indexes 67 TB of source code across 600+ programming languages with language-aware metadata (syntax, file extension, language family). Enables retrieval by language, license, repository, or code patterns. Uses Software Heritage's existing indexing infrastructure as foundation, augmented with language detection and classification. Supports both bulk download and filtered queries for specific language subsets.
Unique: Leverages Software Heritage's existing language detection and indexing infrastructure, then augments with BigCode-specific language classification and filtering — avoids reinventing language detection while providing dataset-specific query capabilities
vs alternatives: More comprehensive language coverage (600+ languages) than GitHub's Linguist (500+ languages) and more accessible than Software Heritage's raw API because it's pre-filtered for permissive licenses and deduplicated
Removes duplicate code files and repositories using content hashing (SHA-256 or similar) and fuzzy matching for near-duplicates. Operates in two stages: exact deduplication via hash matching, then fuzzy matching (e.g., Jaccard similarity or MinHash) to catch semantically identical code with minor formatting differences. Preserves one canonical copy of each unique code pattern while removing redundant training examples.
Unique: Two-stage deduplication combining exact hash matching with fuzzy similarity matching (likely MinHash or Jaccard) to catch both identical and near-identical code — more thorough than single-stage approaches but computationally expensive
vs alternatives: More aggressive deduplication than CodeSearchNet (which uses simple hash matching) because it catches near-duplicates, but less semantic than clone detection tools (which understand code structure) because it's content-based
Integrates with Software Heritage's comprehensive archive of 200+ million repositories and their full version control history. Extracts source code snapshots from Software Heritage's Git/Mercurial/SVN repositories, preserving repository metadata (commit history, author info, timestamps). Provides access to code at specific points in time, enabling historical analysis or training on code evolution patterns.
Unique: Leverages Software Heritage's universal code archive (200M+ repositories) as data source, providing access to code that would be impossible to collect via GitHub API alone — enables training on archived/deleted repositories and non-GitHub platforms (GitLab, Gitea, etc.)
vs alternatives: More comprehensive than GitHub-only datasets because it includes code from GitLab, Gitea, SourceForge, and other platforms archived by Software Heritage; more legally defensible than web scraping because it uses an established, community-maintained archive
Tracks and validates SPDX license identifiers for each repository, ensuring only permissively licensed code (MIT, Apache 2.0, BSD, etc.) is included. Maintains license metadata alongside code files, enabling downstream users to verify legal compliance. Implements license hierarchy and compatibility checking to handle dual-licensed or complex licensing scenarios.
Unique: Combines automated SPDX detection with manual review and maintains license metadata alongside code, enabling downstream users to verify compliance — more transparent than datasets that simply claim 'permissive licenses' without proof
vs alternatives: More legally rigorous than GitHub's CodeSearchNet (which doesn't validate licenses) and more transparent than Codex training data (which doesn't disclose license filtering at all)
Maintains versioned snapshots of the dataset (e.g., v2.0, v2.1) with documented changes between versions (new repositories added, deduplication improvements, PII removal updates). Provides checksums and manifests for reproducibility, enabling researchers to cite specific dataset versions and reproduce results. Tracks dataset lineage and transformation history.
Unique: Maintains semantic versioning and detailed changelogs for dataset releases, enabling researchers to cite specific versions and understand dataset evolution — more rigorous than one-off dataset releases without versioning
vs alternatives: More reproducible than academic datasets that are released once without versioning, and more transparent than commercial datasets (Codex) that don't disclose version history or changes
+3 more capabilities
Verdict
The Stack v2 scores higher at 59/100 vs onnx at 26/100. onnx leads on ecosystem, while The Stack v2 is stronger on adoption and quality.
Need something different?
Search the match graph →