deglib: Python Bindings for the Dynamic Exploration Graph

Python bindings for the high-performance C++ Dynamic Exploration Graph (DEG) library, enabling approximate nearest neighbor search (ANNS) and graph exploration with state-of-the-art recall vs. QPS trade-offs.

Installation
- From PyPI
- Build from Source
Quickstart & Examples
Concepts & Parameters
Example Projects
API Reference
Development Setup

Installation

From PyPI

pip install deglib

Build from Source

To build and install the package directly from the repository:

cd python/
python setup.py copy_build_files
pip install .

Quickstart & Examples

Basic Usage

import numpy as np
import deglib

num_samples, dims = 10_000, 128

# 1. Create random feature dataset and query vector
data = np.random.random((num_samples, dims)).astype(np.float32)
query = np.random.random(dims).astype(np.float32)

# 2. Build index directly from data (multithreaded by default)
graph = deglib.builder.build_from_data(data, edges_per_vertex=32, callback="progress")

# 3. Query top-k nearest neighbors
indices, distances = graph.search(query, k=10, eps=0.1)

print("Nearest neighbors:", indices)
print("Distances:", distances)

Graph Types & Lifecycles

All search graphs are represented by DynamicExplorationGraph, backed by one of three internal graph engines:

Fixed-Capacity Mutable (SizeBoundedGraph): Memory is preallocated for a fixed maximum capacity. Fast and memory-efficient for static/batch datasets.

space = deglib.FloatSpace.create(dims=128, metric=deglib.Metric.FP32_L2)
graph = deglib.create_empty(capacity=10_000, feature_space=space, edges_per_vertex=32)

Chunk-Allocated Mutable (DynamicGraph): Dynamically allocates memory in chunks (e.g. 1024 vertices per chunk). Ideal for streaming datasets where total capacity is unknown.
```
graph = deglib.create_dynamic_empty(feature_space=space, edges_per_vertex=32, chunk_size=1024)
```
Read-Only Deployment (ReadOnlyGraph): Stripped of mutation structures for minimal memory footprint and maximum query throughput.
```
readonly_graph = graph.to_readonly()
```

Saving and Loading Graphs

# Save mutable graph to disk
graph.save_graph("index.deg")

# Load as compact, optimized read-only graph for production search
readonly_graph = deglib.load_readonly_graph("index.deg")

# Load as dynamic graph supporting further insertions and deletions
dynamic_graph = deglib.load_dynamic_graph("index.deg")

# Load as fixed-capacity mutable graph
mutable_graph = deglib.load_mutable_graph("index.deg")

Incremental / Streaming Graph Construction

For continuous additions and removals, use GraphBuilder:

import numpy as np
import deglib
from deglib.builder import GraphBuilder, OptimizationTarget
from deglib.distances import FloatSpace, Metric

dims = 128
max_capacity = 10_000
edges_per_vertex = 32

# 1. Create feature space and empty mutable graph
space = FloatSpace.create(dims, metric=Metric.FP32_L2)
graph = deglib.create_empty(max_capacity, space, edges_per_vertex)

# 2. Initialize builder
builder = GraphBuilder(graph, optimization_target=OptimizationTarget.StreamingData, seed=42)

# 3. Add entries (individually or in batches)
labels = np.arange(100, dtype=np.uint32)
features = np.random.random((100, dims)).astype(np.float32)
builder.add_entry(labels, features)

# 4. Remove entries by external label
builder.remove_entry(42)

# 5. Build / optimize
builder.build()

Filtered Search & Candidate Reranking

from deglib.search import Filter, rerank

# Search only within allowed external labels
allowed_ids = np.array([1, 5, 10, 42, 99], dtype=np.int32)
search_filter = Filter(allowed_ids)

indices, distances = graph.search(query, k=5, eps=0.1, filter_labels=search_filter)

# Exact distance reranking across candidates
queries = np.random.random((10, dims)).astype(np.float32)
candidates = np.random.randint(0, 1000, size=(10, 50), dtype=np.uint32)
base_vectors = np.random.random((1000, dims)).astype(np.float32)

top_indices, top_distances = rerank(
    space=graph.get_feature_space(),
    queries=queries,
    candidate_indices=candidates,
    base_vectors=base_vectors,
    k_top=10,
    return_distances=True,
)

Exploratory Search & Graph Navigation

DEG supports exploratory search directly from existing vertex labels:

# Explore graph starting from entry vertex label 105
explored_labels, distances = graph.explore(entry_external_label=105, k=10, eps=0.1, include_entry=False)

Graph Optimization, Quantization & Reranking Pipeline

A complete end-to-end pipeline demonstrating FLAS pre-sorting, multithreaded graph building, RNG edge pruning, Int8 quantization, ReadOnlyGraph conversion, and deployment with Searcher for automatic query quantization and high-precision reranking:

import numpy as np
import deglib
from deglib.optimization import presort, prune_non_rng_edges, ScalarQuantizerInt8
from deglib.search import create_searcher

num_vectors, dims = 10_000, 128
data = np.random.randn(num_vectors, dims).astype(np.float32)
query = np.random.randn(dims).astype(np.float32)

# 1. Pre-sort vectors using FLAS for improved memory locality and index construction speed
perm = presort(data, metric=deglib.Metric.FP32_InnerProduct, callback="progress")
sorted_data = data[perm]

# 2. Build exploration graph on unquantized/original data
graph = deglib.builder.build_from_data(
    sorted_data,
    metric=deglib.Metric.FP32_InnerProduct,
    edges_per_vertex=32,
    callback="progress",
)

# 3. Prune redundant non-RNG edges to optimize graph topology
pruned_count = prune_non_rng_edges(graph)
print(f"Pruned {pruned_count} redundant edges.")

# 4. Fit Int8 quantizer on base dataset and quantize features for memory reduction and ultra-fast search
quantizer = ScalarQuantizerInt8()
quantizer.fit(sorted_data)
quant_int8_data = quantizer.quantize(sorted_data)
int8_space = deglib.FloatSpace.create(dims, deglib.Metric.Int8_InnerProduct)

# 5. Convert mutable graph to a compact ReadOnlyGraph equipped with the quantized features
readonly_graph = graph.to_readonly(feature_space=int8_space, custom_features=quant_int8_data)

# 6. Create high-performance Searcher equipped with base vectors for exact candidate reranking
rerank_space = deglib.FloatSpace.create(dims, deglib.Metric.FP32_InnerProduct)
searcher = create_searcher(
    graph=readonly_graph,
    quantizer=quantizer,
    refine_space=rerank_space,
    refine_data=sorted_data,
)

# 7. Query search (query is automatically quantized and top candidates are reranked)
indices, distances = searcher.search(query, k=10, eps=0.1, rerank_factor=1.5, return_distances=True)
print("Top-10 nearest neighbor indices:", indices)
print("Top-10 exact distances:", distances)

Concepts & Parameters

`OptimizationTarget`

Controls the topology optimization strategy:

OptimizationTarget.LowLID: Default for datasets with low local intrinsic dimensionality (supports multithreaded building).
OptimizationTarget.HighLID: Optimized for datasets with high local intrinsic dimensionality (supports multithreaded building).
OptimizationTarget.StreamingData: Optimized for continuous dynamic additions and deletions.

Search Parameter `eps`

The epsilon parameter expands the search priority queue during graph exploration.
Small values (e.g. eps=0.001 or eps=0.01): Faster query execution.
Higher values (e.g. eps=0.1 to eps=0.3): Higher recall rate.

Supported Metrics & Data Types

Metric.FP32_L2: Euclidean distance (np.float32)
Metric.FP32_InnerProduct: Inner product / cosine distance (np.float32)
Metric.Uint8_L2: 8-bit unsigned integer Euclidean distance (np.uint8)
Metric.Uint8_InnerProduct: 8-bit unsigned integer inner product (np.uint8)
Metric.FP16_L2: 16-bit half-precision Euclidean distance (np.uint16)
Metric.FP16_InnerProduct: 16-bit half-precision inner product (np.uint16)
Metric.EVP_InnerProduct: Quantized Extreme Value Property bit-packed vectors (np.uint8)
Metric.Int8_InnerProduct: 8-bit signed integer inner product (np.int8)
Metric.Int8_L2: 8-bit signed integer Euclidean distance (np.int8)

API Reference

For a complete overview of all Python modules, classes, and function signatures, see API.md or the Official Documentation.

Example Projects

Ready-to-run example scripts with visual progress and evaluation are located in the examples/ directory:

examples/knng/: k-NN graph construction benchmark using EVP quantization and FP16 reranking (SISAP 2026 Challenge Task 1).
examples/mips/: Maximum Inner Product Search (MIPS) benchmark using $(d+1)$-dimensional $L_2$ transformation, FLAS pre-sorting, and SIMD FP16 inner products (SISAP 2026 Challenge Task 2).
examples/static_data/: Static dataset indexing and ANNS benchmark.
examples/vibe/: VIBE benchmark for modern embedding datasets with scalar quantization and interactive Plotly visualizations.
examples/dynamic_data/: Dynamic streaming additions and deletions.
examples/sliding_window/: Sliding window continuous update benchmark against CleANN.

Development Setup

If you want to contribute, modify C++ bindings, run tests, or build release packages:

# 1. Setup virtual environment and dependencies (using uv)
cd python/
uv venv
uv pip install setuptools==83.0.0 pybind11==3.0.4 build==1.5.0 wheel==0.48.0
uv run python setup.py copy_build_files

# 2. Install in editable mode
uv pip install -e . --no-build-isolation --verbose

# 3. Run test suite
uv run pytest

# 4. Format code
uv run ruff format .

# 5. Build distribution packages (sdist and binary wheels)
uv run python -m build

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

deglib-0.2.5.tar.gz (179.2 kB view details)

Uploaded Aug 30, 2026 Source

Built Distributions

If you're not sure about the file name format, learn more about wheel file names.

The dropdown lists show the available interpreters, ABIs, and platforms. Enable javascript to be able to filter the list of wheel files.

deglib-0.2.5-cp315-cp315-win_amd64.whl (1.9 MB view details)

Uploaded Aug 30, 2026 CPython 3.15Windows x86-64

deglib-0.2.5-cp315-cp315-musllinux_1_2_x86_64.whl (2.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.15musllinux: musl 1.2+ x86-64

deglib-0.2.5-cp315-cp315-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl (1.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.15manylinux: glibc 2.27+ x86-64manylinux: glibc 2.28+ x86-64

deglib-0.2.5-cp315-cp315-macosx_13_0_arm64.whl (441.1 kB view details)

Uploaded Aug 30, 2026 CPython 3.15macOS 13.0+ ARM64

deglib-0.2.5-cp314-cp314-win_amd64.whl (1.9 MB view details)

Uploaded Aug 30, 2026 CPython 3.14Windows x86-64

deglib-0.2.5-cp314-cp314-musllinux_1_2_x86_64.whl (2.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.14musllinux: musl 1.2+ x86-64

deglib-0.2.5-cp314-cp314-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl (1.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.14manylinux: glibc 2.27+ x86-64manylinux: glibc 2.28+ x86-64

deglib-0.2.5-cp314-cp314-macosx_13_0_arm64.whl (441.1 kB view details)

Uploaded Aug 30, 2026 CPython 3.14macOS 13.0+ ARM64

deglib-0.2.5-cp313-cp313-win_amd64.whl (1.8 MB view details)

Uploaded Aug 30, 2026 CPython 3.13Windows x86-64

deglib-0.2.5-cp313-cp313-musllinux_1_2_x86_64.whl (2.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.13musllinux: musl 1.2+ x86-64

deglib-0.2.5-cp313-cp313-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl (1.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.13manylinux: glibc 2.27+ x86-64manylinux: glibc 2.28+ x86-64

deglib-0.2.5-cp313-cp313-macosx_13_0_arm64.whl (440.5 kB view details)

Uploaded Aug 30, 2026 CPython 3.13macOS 13.0+ ARM64

deglib-0.2.5-cp312-cp312-win_amd64.whl (1.8 MB view details)

Uploaded Aug 30, 2026 CPython 3.12Windows x86-64

deglib-0.2.5-cp312-cp312-musllinux_1_2_x86_64.whl (2.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.12musllinux: musl 1.2+ x86-64

deglib-0.2.5-cp312-cp312-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl (1.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.12manylinux: glibc 2.27+ x86-64manylinux: glibc 2.28+ x86-64

deglib-0.2.5-cp312-cp312-macosx_13_0_arm64.whl (440.5 kB view details)

Uploaded Aug 30, 2026 CPython 3.12macOS 13.0+ ARM64

deglib-0.2.5-cp311-cp311-win_amd64.whl (1.8 MB view details)

Uploaded Aug 30, 2026 CPython 3.11Windows x86-64

deglib-0.2.5-cp311-cp311-musllinux_1_2_x86_64.whl (2.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.11musllinux: musl 1.2+ x86-64

deglib-0.2.5-cp311-cp311-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl (1.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.11manylinux: glibc 2.27+ x86-64manylinux: glibc 2.28+ x86-64

deglib-0.2.5-cp311-cp311-macosx_13_0_arm64.whl (439.1 kB view details)

Uploaded Aug 30, 2026 CPython 3.11macOS 13.0+ ARM64

deglib-0.2.5-cp310-cp310-win_amd64.whl (1.8 MB view details)

Uploaded Aug 30, 2026 CPython 3.10Windows x86-64

deglib-0.2.5-cp310-cp310-musllinux_1_2_x86_64.whl (2.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.10musllinux: musl 1.2+ x86-64

deglib-0.2.5-cp310-cp310-manylinux_2_27_x86_64.manylinux_2_28_x86_64.whl (1.6 MB view details)

Uploaded Aug 30, 2026 CPython 3.10manylinux: glibc 2.27+ x86-64manylinux: glibc 2.28+ x86-64

deglib-0.2.5-cp310-cp310-macosx_13_0_arm64.whl (438.1 kB view details)

Uploaded Aug 30, 2026 CPython 3.10macOS 13.0+ ARM64

File details

Details for the file deglib-0.2.5.tar.gz.

File metadata

Download URL: deglib-0.2.5.tar.gz
Upload date: Aug 30, 2026
Size: 179.2 kB
Tags: Source
Uploaded using Trusted Publishing? Yes
Uploaded via: twine/7.0.0 CPython/3.13.14

File hashes

Hashes for deglib-0.2.5.tar.gz
Algorithm	Hash digest
SHA256	`56ecfcf006fe4b5b1bb40057cbf41525ec060cb116023e1e4a657fb140b08fb0`
MD5	`a070de63643d3036f0483393838c477e`
BLAKE2b-256	`e8a82b16bf03c28ef4779e5d7df9382bd7b79703a61422f1f3d0ac9255a46059`

Algorithm	Hash digest
SHA256	`20742c8ef44e8fc1c5193bcd940b7cf338a02e1dc0a98fa5c9573db7149f8df8`
MD5	`2caf14f8e41a2117e941f8b6136a5def`
BLAKE2b-256	`36d98a765a8b23e885b51e328538cc1370fe6032634e8576197a24190edd9296`

Algorithm	Hash digest
SHA256	`a9e1fed6ca3acc3f54c949b35c4ebb6011c8de33407286d5353f9caf2cd4a72e`
MD5	`b84967fadc6bcab8c7d9b92c6ff46706`
BLAKE2b-256	`21b3f305fd67a943d606c19c562c3beb8721af923279071ebb0d92677efc03c4`

Algorithm	Hash digest
SHA256	`28beb80583a1a939e952c7f2805985b04f983b2bf8de74c776cf3b06fe300c69`
MD5	`e8e093361beff1863ff69237495d406e`
BLAKE2b-256	`2b3ef176fc0e6d9ad391b3e2a42e791b2ec5d2bc57ac92a13b19a76e34046ed1`

Algorithm	Hash digest
SHA256	`3edda089ebd95354168a0f3124272a6a1b9700eff5ed27f329a5d5b022ada815`
MD5	`e148fa098f7e0ca23ede067f296a4a5e`
BLAKE2b-256	`ea718afd330f182d873c2866132d76c818fbfc83db0e1ae3b720057d8720e60a`

Algorithm	Hash digest
SHA256	`21699b6ce3b2936776f9834328b2a915e0a26208afd1d5e0c2a36333431d9513`
MD5	`760afee442abe18f921f8178469d492b`
BLAKE2b-256	`205d8c83197d22143495e61a862170c27cd3216f4f22e33828f0db6136817922`

Algorithm	Hash digest
SHA256	`136f48d9708dcc85010fd33b9501fa01f8cfdda61c3b4158bad120140240ded4`
MD5	`113186d30da03c7ea7a6dac414b479b9`
BLAKE2b-256	`9f13c57fa7958735f801319bfac34bf5fbf9725d4073d4ffd39fdca68e253389`

Algorithm	Hash digest
SHA256	`878d7261492e4cddb55b6a4f4ec674162a669ed5c368a56351edcb6fea6346d0`
MD5	`082f4a9e8bcad4fe308e3219f6230f3d`
BLAKE2b-256	`1b5360b18937ed1e816bd9368a9291ff4b5210ee80fdf46d604ccb830a130790`

Algorithm	Hash digest
SHA256	`cf33a370f7395fc41a59feb797b008e7ecb437073d4336225c622bd5859d34f6`
MD5	`62f78b68d2851ee270e04de04c9ed5a9`
BLAKE2b-256	`bc51137fd11b9d4f24d7f0f32b96b4f97b1734a70260fad3337c23614733a044`

Algorithm	Hash digest
SHA256	`a24590e087273da4ab25d70f04a23fc93053bb2e5dba72afbaf8d4b5b54e443d`
MD5	`9ac9e7f2185db224f0f2e0bc07f25e41`
BLAKE2b-256	`6e4450389866505e94228ed7be0fd19d193fdc5646a46eb0fd45c79642e53388`

Algorithm	Hash digest
SHA256	`c3dc9b89358e31dfd3a09f1a18244581753bb6cfde518e7b7c44bf797c1526d9`
MD5	`b40e40fdcf1db6cadd7e32343cc7cc2c`
BLAKE2b-256	`46dfd47ff1b5258f03c422cfbd30d655a1a76ed4df845212656149bec13a6d59`

Algorithm	Hash digest
SHA256	`d505a9d8ecf3f1fbe76f7d3d1f14118b65a421ba67e3d7efef96bdf409e20a1b`
MD5	`46f39e9a2d49c8204f6c2d3623d87310`
BLAKE2b-256	`436b78d4e8b509eea07e40b59fbbefd3ec0b003fd4bcfa37b20cf5374226a273`

Algorithm	Hash digest
SHA256	`21d4092cb427a533fcbc384dbafb3209fb2f54b07fcd7e9e66c793cba016cf4f`
MD5	`f508656e0083a16cb8ff27040ea31897`
BLAKE2b-256	`59c7ec83d7934e01c9105da3de957fe9287032c91f55ea1be9cb9efefe5b2fed`

Algorithm	Hash digest
SHA256	`4571dfe4d5b73baa5f14e8e3a64d9bcc0f43c6b3aaf5f7c3c2cc0a7817e3888c`
MD5	`d41f19c6adf74b598b088df25471ed1b`
BLAKE2b-256	`fce8802909c2efc0c97411015ff91febff8ab183cabf248a4822b8058ac01006`

Algorithm	Hash digest
SHA256	`bc16e9a77759ea5566762fb1a09b61032edceb98c9f6930673ee8e0d1d95e0b9`
MD5	`3cd1bc9b121c0b9fe967cdd7fa283cc3`
BLAKE2b-256	`6c7f93c207fbdb744e17202cdc41f71d7b302d54e7da0f1276d89c788e5c65ae`

Algorithm	Hash digest
SHA256	`cf8669269bf9f3017415dfa5ec0fee830528e81785ead8f38f356f2963edaabc`
MD5	`ab9f7f0287b53fda5d6ee38b2148d4bf`
BLAKE2b-256	`426d41eba6f1e6761bb6cb5c02e43095e22516a134d07eca23daec6ddc0a292d`

Algorithm	Hash digest
SHA256	`097d0058772235b97f6a1f539b084cef42af69a8415c9cdc092ea7b6ba3748e0`
MD5	`16deb974f953476f744e47b5b0e6abfc`
BLAKE2b-256	`ad21034e07688045039597fdecec11855e03040d7cac3e30d80174069f9a8bfd`

Algorithm	Hash digest
SHA256	`5a5cb83e10222e20e326bd9fd34a23a4ab6ccde9d6a7180f0895f86dceaee8c3`
MD5	`17a040a74757e715e154176c22bf04b6`
BLAKE2b-256	`8fbb9c24c1e6a5577ed5a3a157f793f6cedde34b4b4f1838a8da9167a76cbe91`

Algorithm	Hash digest
SHA256	`4942782aa37178247aba964f06f359dd812bd03f22ad92a5ddb16ad6937dd48b`
MD5	`c15f7ef98f302578f40c4af77522123f`
BLAKE2b-256	`83a65659ad40f60179066cc5b06f1a1b649949391339ab054995a6a8f8b18426`

Algorithm	Hash digest
SHA256	`3aee7e80f8b892829540e4d7bb3ed45c61c796a88e5dfc54efe219de0cdb25d2`
MD5	`60a6dd96388bebedd1a3a9a5152917af`
BLAKE2b-256	`a35729f25a0ced22ca2a0ae8ee7f53edd3f751a5f814d24bfd0a44a754c5ef86`

Algorithm	Hash digest
SHA256	`fbe20a03aa3132467d74abb9ca4d06848e3c10b12fed36eb4f30af7a2bb927b6`
MD5	`116a1384b5b2e5edbdbdf2bb55a8f2df`
BLAKE2b-256	`cb65cceef390c8b7bb22fb1af644712623b79943b7f43b6da9946d2c0330e9c6`

deglib 0.2.5

deglib: Python Bindings for the Dynamic Exploration Graph

Table of Contents

Installation

From PyPI

Build from Source

Quickstart & Examples

Basic Usage

Graph Types & Lifecycles

Saving and Loading Graphs

Incremental / Streaming Graph Construction

Filtered Search & Candidate Reranking

Exploratory Search & Graph Navigation

Graph Optimization, Quantization & Reranking Pipeline

Concepts & Parameters

OptimizationTarget

Search Parameter eps

Supported Metrics & Data Types

API Reference

Example Projects

Development Setup

Project links

Key dates

Owner

2 maintainers

Credits

GitHub Statistics

Requires

Provides Extra

Tags

Classifiers

Download files

Source Distribution

Built Distributions

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

File hashes

Provenance

File details

File metadata

`OptimizationTarget`

Search Parameter `eps`

Algorithm	Hash digest
SHA256	`cad9ef4f0a04aefd00efd56f3ecbabe81cfe84885a3f707773961a615a602079`
MD5	`1410d6fe3eeded31fd0749105ecdc132`
BLAKE2b-256	`6255ab4a18f60db3d4696b72231640d0fba58aea7252e69406be4ba2a4ae8353`

Algorithm	Hash digest
SHA256	`70c0e878b6fe4ef01cc3d90c4ad5375409aa709633db0cecbd3ae1e5fe4c1463`
MD5	`d7d62dd97b627f63c05d8512080642c7`
BLAKE2b-256	`b72ea008b82c7e7f11c1ab7a03dde87f29b118e2e6f4eff2a9001533f791d5af`

Algorithm	Hash digest
SHA256	`389d14eb17411f35a53b8b5c15fd9542be9b013060de861217a56eec1b534949`
MD5	`acc4524f6d03addd169179992bd74af9`
BLAKE2b-256	`148e260bddf4ca1d804d92909f3f8ad82aee2e4f852cb6a26e2769fcc919a423`

Algorithm	Hash digest
SHA256	`850d8d429adb766ff1f26ad61018da0c43f2af1850e5db48ece9015290381fb6`
MD5	`943e8ef1dfd08152ee615dc467cac46b`
BLAKE2b-256	`50ea82389ab2ca0209ba1e4582cf503119b326ae15f271dbc62c1f97d65cf7b7`