explodethosebits 0.3.0__cp39-cp39-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl

etb/_version.py

@@ -0,0 +1,34 @@
+# file generated by setuptools-scm
+# don't change, don't track in version control
+
+__all__ = [
+    "__version__",
+    "__version_tuple__",
+    "version",
+    "version_tuple",
+    "__commit_id__",
+    "commit_id",
+]
+
+TYPE_CHECKING = False
+if TYPE_CHECKING:
+    from typing import Tuple
+    from typing import Union
+
+    VERSION_TUPLE = Tuple[Union[int, str], ...]
+    COMMIT_ID = Union[str, None]
+else:
+    VERSION_TUPLE = object
+    COMMIT_ID = object
+
+version: str
+__version__: str
+__version_tuple__: VERSION_TUPLE
+version_tuple: VERSION_TUPLE
+commit_id: COMMIT_ID
+__commit_id__: COMMIT_ID
+
+__version__ = version = '0.3.0'
+__version_tuple__ = version_tuple = (0, 3, 0)
+
+__commit_id__ = commit_id = 'gb249ff642'

etb/py.typed

@@ -0,0 +1,2 @@
+# Marker file for PEP 561
+# This file indicates that the etb package supports type hints

explodethosebits-0.3.0.dist-info/METADATA

@@ -0,0 +1,405 @@
+Metadata-Version: 2.2
+Name: explodethosebits
+Version: 0.3.0
+Summary: ExplodeThoseBits - CUDA-accelerated exhaustive bit tree analysis
+Keywords: forensics,bit-extraction,cuda,data-recovery,file-signatures,heuristics
+Author-Email: Odin Glynn-Martin <odin@odinglynn.com>
+License: MIT
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: C++
+Classifier: Topic :: Scientific/Engineering
+Classifier: Topic :: Security
+Classifier: Topic :: System :: Recovery Tools
+Project-URL: Homepage, https://github.com/odinglyn0/etb
+Project-URL: Repository, https://github.com/odinglyn0/etb
+Project-URL: Issues, https://github.com/odinglyn0/etb/issues
+Requires-Python: >=3.8
+Provides-Extra: test
+Requires-Dist: pytest>=7.0.0; extra == "test"
+Requires-Dist: pytest-cov>=4.0.0; extra == "test"
+Requires-Dist: hypothesis>=6.0.0; extra == "test"
+Provides-Extra: dev
+Requires-Dist: pytest>=7.0.0; extra == "dev"
+Requires-Dist: pytest-cov>=4.0.0; extra == "dev"
+Requires-Dist: hypothesis>=6.0.0; extra == "dev"
+Requires-Dist: black>=23.0.0; extra == "dev"
+Requires-Dist: isort>=5.0.0; extra == "dev"
+Requires-Dist: mypy>=1.0.0; extra == "dev"
+Description-Content-Type: text/markdown
+
+# ExplodeThoseBits! // ETB
+
+Exhaustive bit-tree traversal library. Takes bytes, explodes them into bits, walks every forward-only path through the bit space, reconstructs candidate byte sequences, scores them against known file signatures and heuristics. CUDA-accelerated for Hopper/Blackwell GPUs.
+
+![Quick Diagram](assets/quickDiagW.png)
+
+## What it does
+
+Given n input bytes, there are 9^n - 1 possible forward-only paths through the bit coordinate space (each byte has 8 bit positions, plus the choice to skip). The library systematically generates these paths, extracts bits along each path, packs them back into bytes, and evaluates whether the result looks like valid data.
+
+The search space is obviously intractable for any reasonable input size. A 16-byte input has ~1.8 × 10^15 paths. So the library implements multi-level early stopping that prunes branches at 4, 8, and 16 bytes based on:
+
+- Signature prefix matching (does it start like a PNG, JPEG, PDF, etc.)
+- Shannon entropy bounds (too low = repeated garbage, too high = random/encrypted)
+- Printable ASCII ratio
+- UTF-8 validity
+- Control character density
+- Null byte run length
+
+This reduces effective complexity from O(8^n) to O(k^d) where k is the effective branching factor after pruning and d is the depth at which most paths get killed.
+
+## Installation
+
+```bash
+pip install explodethosebits
+```
+
+Or build from source:
+
+```bash
+git clone https://github.com/odinglyn0/etb
+cd etb
+pip install .
+```
+
+Requires CUDA 12.x for GPU acceleration. Falls back to CPU if unavailable.
+
+## Usage
+
+### Basic extraction
+
+```python
+import etb
+
+# Extract from bytes
+data = open("suspicious.bin", "rb").read()
+candidates = etb.extract(data)
+
+for c in candidates:
+    print(f"{c.format_name}: {c.confidence:.2%}")
+    print(f"  Entropy: {c.heuristics.entropy:.2f}")
+    print(f"  Path length: {c.path.length()}")
+```
+
+### Extract from file
+
+```python
+candidates = etb.extract_from_file("suspicious.bin")
+```
+
+### With metrics
+
+```python
+result = etb.extract_with_metrics(data)
+
+print(f"Evaluated {result.metrics.paths_evaluated} paths")
+print(f"Prune rate: {result.metrics.prune_rate:.1%}")
+print(f"Effective branching factor: {result.metrics.effective_branching_factor:.2f}")
+print(f"Time: {result.metrics.wall_clock_seconds:.2f}s")
+```
+
+### Custom configuration
+
+```python
+config = etb.EtbConfig()
+
+# Adjust early stopping thresholds
+config.early_stopping.level1_threshold = 0.3  # More aggressive pruning
+config.early_stopping.level2_threshold = 0.4
+config.early_stopping.adaptive_thresholds = True
+
+# Entropy bounds
+config.entropy_min = 0.1  # Below this = repeated pattern
+config.entropy_max = 7.9  # Above this = random/encrypted
+
+# Bit pruning mode
+config.bit_pruning = etb.BitPruningConfig(etb.BitPruningMode.MSB_ONLY)  # O(4^d) instead of O(8^d)
+
+# Output options
+config.output.top_n_results = 20
+config.output.include_paths = True
+
+candidates = etb.extract(data, config)
+```
+
+### Load config from file
+
+```python
+etb.load_config("config.yaml")
+config = etb.ConfigManager.instance().get_config()
+```
+
+### Low-level API
+
+```python
+# Bit coordinates
+coord = etb.BitCoordinate(byte_index=0, bit_position=3)
+
+# Paths (forward-only constraint enforced)
+path = etb.Path()
+path.add(etb.BitCoordinate(0, 3))
+path.add(etb.BitCoordinate(1, 5))
+path.add(etb.BitCoordinate(2, 1))
+assert path.is_valid()  # byte indices must be strictly increasing
+
+# Extract bits along a path
+bits = etb.extract_bits_from_path(data, path)
+
+# Pack bits back to bytes
+reconstructed = etb.bits_to_bytes(bits)
+
+# Or do both at once
+reconstructed = etb.path_to_bytes(data, path)
+```
+
+### Path generation
+
+```python
+# Generate all paths for small inputs (careful with this)
+gen = etb.PathGenerator(input_length=4)
+for path in gen:
+    # 9^4 - 1 = 6560 paths
+    pass
+
+# With bit pruning
+config = etb.PathGeneratorConfig(input_length=4)
+config.bit_mask = 0xF0  # Only MSB positions
+gen = etb.PathGenerator(config)
+# Now 5^4 - 1 = 624 paths
+```
+
+### Signature matching
+
+```python
+# Load signature dictionary
+sigs = etb.SignatureDictionary()
+sigs.load_from_json("signatures.json")
+
+# Match against data
+matcher = etb.SignatureMatcher(sigs)
+match = matcher.match(data)
+
+if match.matched:
+    print(f"Detected: {match.format_name} ({match.category})")
+    print(f"Confidence: {match.confidence:.2%}")
+    print(f"Header matched: {match.header_matched}")
+    print(f"Footer matched: {match.footer_matched}")
+```
+
+### Heuristics analysis
+
+```python
+engine = etb.HeuristicsEngine()
+result = engine.analyze(data)
+
+print(f"Entropy: {result.entropy:.2f} bits/byte")
+print(f"Printable ratio: {result.printable_ratio:.2%}")
+print(f"Control char ratio: {result.control_char_ratio:.2%}")
+print(f"Max null run: {result.max_null_run}")
+print(f"UTF-8 validity: {result.utf8_validity:.2%}")
+print(f"Composite score: {result.composite_score:.2f}")
+```
+
+### Early stopping
+
+```python
+controller = etb.EarlyStoppingController()
+
+# Check if a partial reconstruction should be abandoned
+decision = controller.should_stop(partial_data)
+if decision.should_stop:
+    print(f"Stopped at level {decision.level}: {decision.reason}")
+```
+
+### Prefix trie (for deduplication)
+
+```python
+trie = etb.PrefixTrie()
+
+# Insert evaluated prefixes
+trie.insert(prefix_bytes, etb.PrefixStatus.VALID, score=0.8)
+trie.insert(bad_prefix, etb.PrefixStatus.PRUNED, score=0.1)
+
+# Check before evaluating
+if trie.is_pruned(candidate_prefix):
+    # Skip - ancestor was already pruned
+    pass
+
+# Stats
+print(f"Effective branching factor: {trie.get_effective_branching_factor():.2f}")
+```
+
+### Memoization cache
+
+```python
+cache = etb.PrefixCache()
+
+# Check cache before expensive evaluation
+entry = cache.lookup(prefix)
+if entry is not None:
+    score = entry.score
+    should_prune = entry.should_prune
+else:
+    # Evaluate and cache
+    result = engine.analyze(prefix)
+    cache.insert(prefix, result, score, should_prune)
+
+print(f"Cache hit rate: {cache.hit_rate():.1%}")
+```
+
+## How the exhaustive search works
+
+### Bit coordinate system
+
+Each bit in the input is addressed by (byte_index, bit_position) where bit_position ∈ [0,7] and 0 is LSB.
+
+### Forward-only paths
+
+A path is a sequence of bit coordinates where each coordinate's byte_index is strictly greater than the previous. This constraint:
+
+1. Ensures paths are acyclic
+2. Limits path length to at most n (input length)
+3. Makes the search space finite (though still exponential)
+
+### Path enumeration
+
+For n bytes with 8 bits each, the number of paths is:
+
+```
+Σ(k=1 to n) C(n,k) × 8^k = 9^n - 1
+```
+
+The library generates paths lazily using depth-first traversal with backtracking.
+
+### Multi-level early stopping
+
+The key to tractability. At each checkpoint depth:
+
+**Level 1 (4 bytes):**
+- Check signature prefix (first 4 bytes of PNG, JPEG, etc.)
+- Basic entropy check
+- Reject repeated byte patterns
+- Threshold: 0.2 composite score
+
+**Level 2 (8 bytes):**
+- Full entropy bounds check
+- Printable ratio for text detection
+- Control character density
+- Threshold: 0.3 composite score
+
+**Level 3 (16 bytes):**
+- Structural coherence
+- UTF-8 validity
+- Null run length
+- Threshold: 0.4 composite score
+
+Paths failing any level are pruned along with all descendants.
+
+### Adaptive thresholds
+
+When a high-scoring candidate is found (>0.8), thresholds tighten to 0.6. When the best score is low (<0.3), thresholds relax to 0.2. This focuses search on promising regions.
+
+### Bit pruning modes
+
+Reduce branching factor by limiting which bit positions are explored:
+
+- **EXHAUSTIVE**: All 8 positions. O(8^d). Most thorough.
+- **MSB_ONLY**: Positions 4-7 only. O(4^d). Good for most formats.
+- **SINGLE_BIT**: 2 positions. O(2^d). Fastest.
+- **CUSTOM**: Arbitrary bitmask.
+
+### Scoring
+
+Candidates are scored by weighted combination:
+
+- Signature match: 40%
+- Heuristic score: 30%
+- Length score: 15%
+- Structural validity: 15%
+
+Top-k candidates are maintained in a min-heap for efficient tracking.
+
+## CUDA acceleration
+
+GPU kernels for:
+
+- **Path generation**: Work-stealing across thread blocks, warp-level cooperative exploration
+- **Heuristics**: Shared memory histograms for entropy calculation
+- **Signature matching**: Constant memory broadcast for signature data
+- **Prefix pruning**: Atomic trie updates
+
+Optimized for SM 90 (Hopper) and SM 100 (Blackwell) with architecture-specific tuning.
+
+## Configuration reference
+
+See `data/config.yaml` for all options with documentation.
+
+Key parameters:
+
+| Parameter | Default | Description |
+|-----------|---------|-------------|
+| `early_stopping.level1_threshold` | 0.2 | Min score to continue at 4 bytes |
+| `early_stopping.level2_threshold` | 0.3 | Min score to continue at 8 bytes |
+| `early_stopping.level3_threshold` | 0.4 | Min score to continue at 16 bytes |
+| `entropy_min` | 0.1 | Below = repeated pattern |
+| `entropy_max` | 7.9 | Above = random/encrypted |
+| `bit_pruning.mode` | exhaustive | Bit position selection |
+| `memoization.max_cache_size_mb` | 1024 | LRU cache size |
+| `output.top_n_results` | 10 | Candidates to return |
+| `performance.batch_size` | 65536 | Paths per kernel launch |
+
+## Supported formats
+
+Signature detection for:
+
+- Images: PNG, JPEG, GIF, BMP
+- Documents: PDF
+- Archives: ZIP, RAR, 7Z
+- Executables: ELF, PE
+- Audio: MP3
+- Video: MP4
+
+Add custom signatures via JSON:
+
+```json
+{
+  "format": "CUSTOM",
+  "category": "custom",
+  "signatures": [
+    {"magic": "DEADBEEF", "offset": 0, "confidence": 0.9}
+  ],
+  "footer": {
+    "magic": "CAFEBABE",
+    "required": false
+  }
+}
+```
+
+## Building from source
+
+```bash
+mkdir build && cd build
+cmake ..
+cmake --build .
+ctest --output-on-failure
+```
+
+Requirements:
+- CMake 3.24+
+- CUDA Toolkit 12.x
+- C++17 compiler
+- Python 3.8+ (for bindings)
+
+## License
+
+MIT // See: LICENSE

explodethosebits-0.3.0.dist-info/RECORD

@@ -0,0 +1,88 @@
+etb/__init__.py,sha256=4vFFWXh9NpeuYmzGzG_s2LE3sc7dSqb578uxXMsd1Po,10139
+etb/__init__.pyi,sha256=T0Y68PIb4WRzGbSXUvr4PdcIxK0T3K_BeArqTT-Rshw,29394
+etb/_etb.cpython-39-x86_64-linux-gnu.so,sha256=zEscXU1ns6xlyzm7mnja475I4nkL2joZjRBSv4Jhrbo,1246513
+etb/_version.py,sha256=3Eub_Rq48jo03WM1mzU8MyJiD0AEkE0IGyVDV4Nn9Mc,712
+etb/py.typed,sha256=5cTSkPrzGked13zt9qANmllnHiCaAZ0n-74cQOoB6ME,89
+explodethosebits.libs/libcudart-c3a75b33.so.12.8.90,sha256=1_Id0fBsTR_W1HjnYGHt9fScp-2_WhPZlsXu9T5r1T8,745465
+include/etb/bit_coordinate.hpp,sha256=FPoI28-eQoMR3Q7tyEW1nhNd6MU_QiPoAL7-0-Cf4dY,1330
+include/etb/bit_extraction.hpp,sha256=7g3xyJNGEPIm0S5g0-kFzqBrxp7wsT-Azm3mszkmqmg,2751
+include/etb/bit_pruning.hpp,sha256=4_TV6gwW2gt55RuThwBwDVCPKv1sqCnnM8lrzRAk_zc,3576
+include/etb/config.hpp,sha256=Ot8_ZKAniNWtdTexKwD3FBaTPyDwP7gXEyZo1Aec-2s,8123
+include/etb/early_stopping.hpp,sha256=theUhuENFZfADyA9Qe48TSs44VZ28XVFAJwpl0C3gCw,7852
+include/etb/etb.hpp,sha256=HXxVVRldOu3nX6kvRwfzFK96jEQ6fTOiZ116P9Xul-Q,472
+include/etb/heuristics.hpp,sha256=5v69P2j9nO5DLE3vmF0nn5U_7wNvmLB3k3d-yyDph0I,5197
+include/etb/memoization.hpp,sha256=NCWcLhBiu2AbNHQIRczXh4KzINdW3ONVTk37E3VuvtE,8330
+include/etb/path.hpp,sha256=NA7dpiqtKjwNjuXj-PWmSI1Pn2RUnUu-l9Rx1OkWbjU,2227
+include/etb/path_count.hpp,sha256=CemlhLn1qS5Q9iNCwdBsx0THvz4j-E6CCwyFQ4rJKj8,2849
+include/etb/path_generator.hpp,sha256=rATLtVmQyCqi6g4g7RLhslzWdRbEvkjvQFCYHiEO0qY,4906
+include/etb/prefix_trie.hpp,sha256=cyQaQPMZqmIT0YyJtFG98oYFdkvPyxb7wblQQERRTqs,11025
+include/etb/reporting.hpp,sha256=1xokWdSeMPi_Ypknhsv4v2RHJ7GYxYG32wqImNGOwGo,13655
+include/etb/scoring.hpp,sha256=XCNdwpQaeyYPrJokW0pJ3vO5y5gRDjnvTBUdCaQeHR0,8153
+include/etb/signature.hpp,sha256=hjASYZc3eG6siF2IRqtTkOEz51iUe3JfyaCgD4yFUJA,6190
+include/etb/cuda/arch_optimizations.cuh,sha256=kOj8RDQjzTvMyYJXxdEJLXXsCX3mK7ekeKZewvMKal0,10299
+include/etb/cuda/blackwell_optimizations.cuh,sha256=gNDYFIibANlcM6dW_4lYFplfMANSE0-PSYAFe7kARhg,8842
+include/etb/cuda/cuda_common.cuh,sha256=wXAcSxJ1n9IJCII0Y-l3tr9i4mthiSd0y3Q8vC3smkw,7701
+include/etb/cuda/etb_cuda.cuh,sha256=rgPImi11MIF1NQcoxRQrVtjkcwBVFoZBEn_ua0Uczqc,5454
+include/etb/cuda/gpu_memory.cuh,sha256=3i8iVf2vR5l3qc4zhPmODiXDEeYYoCLRQHfNyLE8p30,11633
+include/etb/cuda/heuristics_kernel.cuh,sha256=QKd2QSByZ96Cch1NeeTyDUvHArQPB6yCPrvxn0BUxw4,9681
+include/etb/cuda/path_generator_kernel.cuh,sha256=yYtkHfQe-BKkmC6GLxQ6w9P4glWotYaKKKJXlLq1YrM,7865
+include/etb/cuda/prefix_pruner_kernel.cuh,sha256=D4Jmo5MCCUUpe07qlwbYXmwMaMXueKQRnSSG-wng5FY,11642
+include/etb/cuda/signature_kernel.cuh,sha256=VKLLygzl8YPcJs9t24_AOVsZfNoxWBluRmL5TZ5t_ac,9785
+include/gmock/gmock-actions.h,sha256=umcVDeXRNfFSN4ffXEO1aILIUF2ABY2OHtl12-OAMXs,87946
+include/gmock/gmock-cardinalities.h,sha256=pWV4fz4V-B4Yc9H_nZeIirHjdGYWUljP_9bUuvwIYhQ,6118
+include/gmock/gmock-function-mocker.h,sha256=hKFLJRqSV_JFU-FQB1IyZot_-bUgdr2jl-i0A1_OMDY,25756
+include/gmock/gmock-matchers.h,sha256=JdFlhCQ5sRps3uvBhCeWT__el8aScHCPM-tMF3SzxOQ,210247
+include/gmock/gmock-more-actions.h,sha256=OM5d19cj8Ii9B-CP5kyyUdaaE0fXYnv5ZQ7KxBr_GWk,38344
+include/gmock/gmock-more-matchers.h,sha256=td-mAvTwWpIAD__gYjbLutsgvajhpOVbHN3ye6WGIy8,4499
+include/gmock/gmock-nice-strict.h,sha256=dTJNL3ltp9YR-10dphDJBfU-dCR7Apgspj9dy5H0wzw,10858
+include/gmock/gmock-spec-builders.h,sha256=RD3FxdshhINRSrzb22HG1AzsgWRdPYQv4joefW7rjY0,82067
+include/gmock/gmock.h,sha256=pMzoMOhc6Ij0GwmOGzL9p0SyGtyX96ux7qLgcqJh-98,3723
+include/gmock/internal/gmock-internal-utils.h,sha256=Af8yApQyClDoNCaK6u4WHBXWqakqAUMDPjzNSUIJdl4,19372
+include/gmock/internal/gmock-port.h,sha256=NsmGCLIQGcPvmVpr4F1iDH-OfuWTNH8SOhZqoKN16c8,6070
+include/gmock/internal/gmock-pp.h,sha256=X82tFwexcvgADZ9Bn0HUQxhVhgCwCRZ4VRbq5JhDu08,13491
+include/gmock/internal/custom/README.md,sha256=Hs3AwbmmtM56lBHftQw7is7SqgPULmfuA3enogHV_2Q,510
+include/gmock/internal/custom/gmock-generated-actions.h,sha256=jv0WBks-GdmHJqFfi8QNqlk1duShkLLouVpv7nJCw28,314
+include/gmock/internal/custom/gmock-matchers.h,sha256=ttJF6V8GSahap-KUV_Q32kwvH7rbBALPxA9oAVneUQ8,1918
+include/gmock/internal/custom/gmock-port.h,sha256=7izIcgLnV1nP2YpdZXxp7oZOSSosY1hFhpONqBq4SZU,1953
+include/gtest/gtest-assertion-result.h,sha256=1lYuIsMW6DG_vCzeOxWPBjgKIufhxsHhgGiavuXFuXI,8503
+include/gtest/gtest-death-test.h,sha256=jey7huu_oUL9eKg8--tMXnPpgXkFjOcPzCeZNcSXQpo,14910
+include/gtest/gtest-matchers.h,sha256=1jfdGIlEQzxi2WoGL5sa2rhRV0xTfXAhJwx6UqJ1mpA,33067
+include/gtest/gtest-message.h,sha256=8ce9TgwCJA6ITe7SWi4L_QTl4MP9d4o7Emy7ZFMfZac,9203
+include/gtest/gtest-param-test.h,sha256=GttG4X5H_C9A3FuOms7E8B76OJoZu-ol0yrqKLlOMuY,24008
+include/gtest/gtest-printers.h,sha256=8zlupV1XfuBPFaKxSxS3btuKhNOFyDHe_YjP-FNbwnM,40511
+include/gtest/gtest-spi.h,sha256=_Au-uushG4Gi7D3ziOXl8lp8IukBhoOYVNLlsmziJuY,12843
+include/gtest/gtest-test-part.h,sha256=Inm5v9CK_3wPdkonFr3g06YdwSVzaHos_5ElaxdoG_A,7164
+include/gtest/gtest-typed-test.h,sha256=1WMTgwvzDWJx18H4ylfcUtlaELl-Ss5u-g8IWuUZMDo,15889
+include/gtest/gtest.h,sha256=k9oD3fbVub30CuTe2ZOQZ8ntC23pP3h_fo0Ydgm2sC0,91459
+include/gtest/gtest_pred_impl.h,sha256=hehQ5zWkLrtfmgGgGHCMHAubfYPJSxS31dKVEsALb_0,12783
+include/gtest/gtest_prod.h,sha256=PGMB71M9uGhuR03VoN5NmKMcu2MOInP3EkctG-JaomE,2502
+include/gtest/internal/gtest-death-test-internal.h,sha256=pw0RdO9mhjnHryF2REL45Iew_HDCN6cPkOMWGo6CYtY,13929
+include/gtest/internal/gtest-filepath.h,sha256=VEzpXS4eS3rhfuFw9IKqoJ4X0AVpmcTOfnpgl8OnVc8,10339
+include/gtest/internal/gtest-internal.h,sha256=ozgGyObKXrb4ObjgFb346uhIZBA1-UmYNPnUArgj1f4,63416
+include/gtest/internal/gtest-param-util.h,sha256=7_obPmo1VKro_IL76IwcMhX3I7s-LkRL9CT2iMR2oDA,38172
+include/gtest/internal/gtest-port-arch.h,sha256=N_bVxwMi7l9PhPr8tOji9Lvwilr8ZKZjbPap9F1EIZg,4305
+include/gtest/internal/gtest-port.h,sha256=wi71yGDavD50Il86VMLXIkN1rS3Sr2GdP4y-fpF_x1Q,90033
+include/gtest/internal/gtest-string.h,sha256=DMCMdGvOsrEBxh_7yQXFmOti_uPCYsRYXCGxDYo-ZQg,7323
+include/gtest/internal/gtest-type-util.h,sha256=wc9TRjV5Alp7JUZuloCneNdL7_UtimS26D_LbdmeS7c,7349
+include/gtest/internal/custom/README.md,sha256=YI7FrFdKbmTk_C9Lziz8f_dToE1oItb_luQ__1HGzME,1269
+include/gtest/internal/custom/gtest-port.h,sha256=XgZ0fJ6LhunYQfq9YcLwRbK7ETNxbxJ75KljztHETgE,1873
+include/gtest/internal/custom/gtest-printers.h,sha256=uVr9okJujE8JwR0yltUi-zNrJIwNp-B4OI20uwcsIWY,2094
+include/gtest/internal/custom/gtest.h,sha256=IdIKHGTqOMIMSxIzfCYaGhiYnSowcQqD37XNmjuzxV4,1858
+lib/libetb_core.a,sha256=FcEXBmw-5rIybCUM3X5gltBqpziR_qKuI_mZyaecHfE,613770
+lib64/libgmock.a,sha256=OjOBFsYqA-uOZs6zufryp4BwA3J3FZB8CMhwbNDBocE,216152
+lib64/libgmock_main.a,sha256=dc-xljvl9jiCr1Gt92-grIcqrzwNuKORJGPuuDOlciw,2302
+lib64/libgtest.a,sha256=6y521XKJd1KsWpLraoHSkV9PYvMpSTH6rMMmM3cqZt0,924530
+lib64/libgtest_main.a,sha256=0H094qb5NcuEpfxnShDkgq3nPhXBS8tVaUKHXRuFixQ,2310
+lib64/cmake/GTest/GTestConfig.cmake,sha256=5MiTs-meYwnesdFVxLr9P6p8i-NDsIoMcGX37tDFUGw,1073
+lib64/cmake/GTest/GTestConfigVersion.cmake,sha256=4KpyG_iigbXIsrdVrFEPNhReAGuPgZ-ztbSDepzcPm4,1862
+lib64/cmake/GTest/GTestTargets-release.cmake,sha256=5qblhjj2_YHot0xkyD5lzsC8UWJtgAZy3g1SvzMRzR0,2276
+lib64/cmake/GTest/GTestTargets.cmake,sha256=QII3nhQtDWavEIhikc2KiUzdZSat7zuUpiE9iZ-nun4,5418
+lib64/pkgconfig/gmock.pc,sha256=diJMLCQN5FUXZLIyAxFtRLPEVkLAjWgVIuqT5wneQOM,322
+lib64/pkgconfig/gmock_main.pc,sha256=rDMeLMh3n1B5dyiaDU0QMKKZ9OGx9YKrd7uFSxOsqUs,329
+lib64/pkgconfig/gtest.pc,sha256=yOLxfIgh_apH26949y1SGz80vDDZ0-cGv1ymP3rfQmE,297
+lib64/pkgconfig/gtest_main.pc,sha256=BDse7t3rKcuktqCq21d_91xU-XXRQThQ2U7rw1f0iLk,329
+explodethosebits-0.3.0.dist-info/METADATA,sha256=mza30WHxCRBDGLoIKMoAQWM4yItz9cx8fxzLG772qh8,11444
+explodethosebits-0.3.0.dist-info/WHEEL,sha256=177YrMfLRJpclnQFtuDXCuQvUj0IE4OiC0tN0TTOv_E,153
+explodethosebits-0.3.0.dist-info/RECORD,,
+explodethosebits-0.3.0.dist-info/licenses/LICENSE,sha256=9vYYUwkzSB_caEDeiotaG1xPudQwqs4j2NxEvKXQVw4,1063
+explodethosebits-0.3.0.dist-info/sboms/auditwheel.cdx.json,sha256=lYP8BPF_X5hRPYYC66xbZTwlVNQTA95wVOEV1q2Rw7o,1496

explodethosebits-0.3.0.dist-info/WHEEL

@@ -0,0 +1,6 @@
+Wheel-Version: 1.0
+Generator: scikit-build-core 0.11.6
+Root-Is-Purelib: false
+Tag: cp39-cp39-manylinux_2_27_x86_64
+Tag: cp39-cp39-manylinux_2_28_x86_64
+

explodethosebits-0.3.0.dist-info/licenses/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Odin G.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

explodethosebits-0.3.0.dist-info/sboms/auditwheel.cdx.json

@@ -0,0 +1 @@
+{"bomFormat": "CycloneDX", "specVersion": "1.4", "version": 1, "metadata": {"component": {"type": "library", "bom-ref": "pkg:pypi/explodethosebits@0.3.0?file_name=explodethosebits-0.3.0-cp39-cp39-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl", "name": "explodethosebits", "version": "0.3.0", "purl": "pkg:pypi/explodethosebits@0.3.0?file_name=explodethosebits-0.3.0-cp39-cp39-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl"}, "tools": [{"name": "auditwheel", "version": "6.6.0"}]}, "components": [{"type": "library", "bom-ref": "pkg:pypi/explodethosebits@0.3.0?file_name=explodethosebits-0.3.0-cp39-cp39-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl", "name": "explodethosebits", "version": "0.3.0", "purl": "pkg:pypi/explodethosebits@0.3.0?file_name=explodethosebits-0.3.0-cp39-cp39-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl"}, {"type": "library", "bom-ref": "pkg:rpm/almalinux/cuda-cudart-12-8@12.8.90-1#08ffa5b368f3fe6bbbd64a1e92f39f76564e25c38342c0a2e3b36431d519f50c", "name": "cuda-cudart-12-8", "version": "12.8.90-1", "purl": "pkg:rpm/almalinux/cuda-cudart-12-8@12.8.90-1"}], "dependencies": [{"ref": "pkg:pypi/explodethosebits@0.3.0?file_name=explodethosebits-0.3.0-cp39-cp39-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl", "dependsOn": ["pkg:rpm/almalinux/cuda-cudart-12-8@12.8.90-1#08ffa5b368f3fe6bbbd64a1e92f39f76564e25c38342c0a2e3b36431d519f50c"]}, {"ref": "pkg:rpm/almalinux/cuda-cudart-12-8@12.8.90-1#08ffa5b368f3fe6bbbd64a1e92f39f76564e25c38342c0a2e3b36431d519f50c"}]}

include/etb/bit_coordinate.hpp

@@ -0,0 +1,45 @@
+#ifndef ETB_BIT_COORDINATE_HPP
+#define ETB_BIT_COORDINATE_HPP
+
+#include <cstdint>
+
+namespace etb {
+
+/**
+ * Represents a coordinate in the bit extraction system.
+ * Maps each bit to (byte_index, bit_position) where bit_position is in range [0,7].
+ */
+struct BitCoordinate {
+    uint32_t byte_index;    // Index into input byte array
+    uint8_t bit_position;   // Position within byte [0-7], 0 = LSB
+
+    BitCoordinate() : byte_index(0), bit_position(0) {}
+    BitCoordinate(uint32_t byte_idx, uint8_t bit_pos) 
+        : byte_index(byte_idx), bit_position(bit_pos) {}
+
+    // Comparison operators for ordering
+    bool operator<(const BitCoordinate& other) const {
+        return byte_index < other.byte_index;
+    }
+
+    bool operator==(const BitCoordinate& other) const {
+        return byte_index == other.byte_index && bit_position == other.bit_position;
+    }
+
+    bool operator!=(const BitCoordinate& other) const {
+        return !(*this == other);
+    }
+
+    /**
+     * Check if this coordinate is valid for a given input length.
+     * @param input_length Length of the input byte array
+     * @return true if coordinate is within bounds
+     */
+    bool is_valid(uint32_t input_length) const {
+        return byte_index < input_length && bit_position <= 7;
+    }
+};
+
+} // namespace etb
+
+#endif // ETB_BIT_COORDINATE_HPP