{"block_close_oss.c33fd1fe9c":"Community and ecosystem","compliance-matrix.7f98f01046":"Certified","compliance-matrix.c584a3644f":"Compliant","compliance-matrix.f61eadaf15":"In Progress","compliance-matrix.9cbe42aaff":"Planned","compliance-matrix.000bdb44ca":"View evidence","core-extras.96d330537a":"Base IR","core-extras.bee831a169":"Substrate","core-extras.61a0822826":"Apps on Core","core-extras.15438cc098":"not supported","core-extras.ad565d9d01":"Feature","core-extras.0155bf03e5":"Segment legend","core-extras.8b7110078e":"Algorithm groups by data type","core-extras.25ab4276a6":"Scrollable capability matrix","open-source-bitweave.cf59b38d96":"Knowledge pipeline built on the BitWeave meaning layer.","open-source-bitweave.4a86080d67":"Spindle","open-source-bitweave.fe0a091fdb":"Products","open-source-bitweave.06360f8092":"Parse before you index.","open-source-bitweave.188fb5d6cf":"Reed","open-source-bitweave.6cc3364a24":"Semantic engine","open-source-bitweave.13d10244f7":"Correctly rounded math underneath BitWeave.","open-source-bitweave.cd84197771":"Numerus","open-source-bitweave.d5d6e83bf2":"Continue exploring","open-source-bitweave.75e393a1ac":"Explore the project","open-source-bitweave.f9743247fa":"Read the documentation","open-source-bitweave.b093628f67":"Ask about the release","open-source-bitweave.439a7e327a":"BitWeave publishes in the fifth round of the foundation release programme. Build one semantic state from it and run it on standard CPUs.","open-source-bitweave.362ea24da7":"Make meaning computable, then decide what to build with it","open-source-bitweave.90e40d5043":"Get started","open-source-bitweave.c91597c8b9":"BitWeave","open-source-bitweave.650fabe787":"Binary semantic engine","open-source-bitweave.6213ba393b":"OSS / BitWeave","open-source-bitweave.9430c0ce76":"Three runtimes","open-source-bitweave.bbb2ae0d5c":"One index format","open-source-bitweave.b0e1a631d6":"one file","open-source-bitweave.498f1198f0":"One on-disk index format across all three.","open-source-bitweave.1bacaf21b2":"Portable","open-source-bitweave.995d13a22d":"Browser side, compatible smaller states, offline.","open-source-bitweave.4e946026a7":"WASM","open-source-bitweave.1bc9c9b434":"TCP or UDS server, language-agnostic clients.","open-source-bitweave.1d10323c27":"Standalone","open-source-bitweave.085564e484":"Embed directly in a Rust, C, or Python process.","open-source-bitweave.5ac3aa81b6":"In-process","open-source-bitweave.311cf02617":"Where BitWeave runs","open-source-bitweave.d53f3da0a7":"POSTURE","open-source-bitweave.37055d056f":"PORTABLE INDEX","open-source-bitweave.8d4ba065ae":"SERVER","open-source-bitweave.7b8a89cea4":"LIBRARY","open-source-bitweave.824414eeb1":"BitWeave runs as an in-process library, as a standalone TCP or Unix-socket server, or compiled to WASM for browser-side execution over a compatible smaller state. The .bwks state format is the same in all three modes; build on a server and deploy the same state to a browser without rebuilding.","open-source-bitweave.28e2120b7a":"Standalone server. WASM module","open-source-bitweave.a08f3f603a":"Embedded library","open-source-bitweave.e677c20f56":"Deployment posture","open-source-bitweave.ec8058a30d":"Self-verifiable numbers","open-source-bitweave.b5019c12ab":"Benchmark receipts publish with the repository, in round five","open-source-bitweave.11a2504fb2":"index and query","open-source-bitweave.fdb6eeaf49":"run benchmarks","open-source-bitweave.d04a75ea8b":"Reproduce the numbers","open-source-bitweave.f9af8c1989":"BENCHMARK API","open-source-bitweave.d19e97c9a9":"REPRODUCIBLE","open-source-bitweave.fdaea4234f":"1.000 RECALL","open-source-bitweave.5d3603369b":"10K DOCS","open-source-bitweave.ba2df8903e":"9,473 QPS","open-source-bitweave.f7b3bcc873":"On the published DBpedia 100K run, BitWeave's exact multi-query configuration returned 9,473 QPS at recall 1.000 in 19 MB on an i9-13900KF desktop with 24 cores, AVX2 and 48 GB. The measured two-bit approximate comparison system returned 3,580 QPS in 38 MB on the same host and data. At D4096 over 10K documents, measured Hybrid-MultiQ runs held recall 1.000 at 35,842 QPS on random data, 34,459 on clustered data and 27,828 on text-derived data. At 250K documents, exact multi-query brute force measured 2,653 QPS at recall 1.000. These are benchmark receipts, not universal promises; rerun the suite on your own corpus and hardware once the repository publishes.","open-source-bitweave.bd9c0e88c5":"on 10K docs. Consumer CPU","open-source-bitweave.03bf99bcb5":"9,473 QPS, exact recall,","open-source-bitweave.63c9045599":"Performance","open-source-bitweave.a072a1c192":"Exact final score","open-source-bitweave.f26aad0e7a":"Multi-query batching","open-source-bitweave.a7ac26b2d9":"Exact at very large scale. Most buckets.","open-source-bitweave.de0282deea":"High fidelity","open-source-bitweave.57571301d4":"More buckets, tighter candidate sets.","open-source-bitweave.745a35c5e0":"Narrow bands","open-source-bitweave.782cae1a75":"Good recall, moderate candidate churn.","open-source-bitweave.03342dbb85":"Balanced","open-source-bitweave.b6f368b99a":"Low candidate count, highest throughput.","open-source-bitweave.e82ce6e09b":"Wide bands","open-source-bitweave.bd2847694e":"Bands vs. throughput","open-source-bitweave.c646630197":"LSH BAND SCALE","open-source-bitweave.42e9067764":"EXACT RESCORE","open-source-bitweave.c8bce154ec":"MULTI-QUERY BATCHING","open-source-bitweave.71da159b9e":"A linear scan is fast on SIMD at small scale but becomes the bottleneck on very large corpora. The LSH index splits hypervectors into bands; candidates that collide in any band are scored exactly. Hybrid-MultiQ batches four queries per SIMD register to hold exact recall at throughput. The index is built once and queried many times.","open-source-bitweave.a5d5c25929":"Sub-linear candidate generation at scale","open-source-bitweave.4794a3e582":"Locality-sensitive hashing","open-source-bitweave.77ed54f1e4":"LSH index","open-source-bitweave.8b5e5e9059":"Binary hot path","open-source-bitweave.04b98cb687":"Binary algebra over GF(2)","open-source-bitweave.e19d0821a5":"XNOR and POPCNT Hamming distance.","open-source-bitweave.8d105cf44d":"Compare","open-source-bitweave.5c546bc216":"Cyclic shift, encodes order and position.","open-source-bitweave.393bb39440":"Permute","open-source-bitweave.e9b53f5c63":"Self-inverse, binds a key to a value.","open-source-bitweave.83a9e49fc4":"Bind","open-source-bitweave.04e41391d6":"XOR","open-source-bitweave.c2e1dfa6bb":"Majority vote, superposes a set of concepts.","open-source-bitweave.23ed731baa":"Bundle","open-source-bitweave.17fd8dce6b":"Three operations","open-source-bitweave.0f3443e016":"HDC PRIMITIVES","open-source-bitweave.6757848af7":"DETERMINISTIC","open-source-bitweave.549dcff4e1":"POPCNT","open-source-bitweave.8f0ff8c5f3":"4096 BITS","open-source-bitweave.533c20d229":"A document, a query, a passage, a code symbol all encode as a binary hypervector of fixed dimension. The default is 4096 bits, because the random-projection arithmetic is well-behaved there and a 4096-bit XOR and popcount fits cleanly in AVX2, AVX-512, and NEON registers. The encoder is deterministic; the same text produces the same hypervector on every run.","open-source-bitweave.6aa820d31f":"Bundle, bind, permute","open-source-bitweave.b7361204f7":"Binary hypervectors","open-source-bitweave.e981714bbd":"Hyperdimensional encoding","open-source-bitweave.5f4cd20f6f":"Knowledge governance built on the BitWeave meaning layer.","open-source-bitweave.a532c9b406":"Constraint engine over retrieved facts.","open-source-bitweave.03f923bd0d":"Lattice","open-source-bitweave.756d2c5e53":"Parse and content-address before indexing.","open-source-bitweave.dfc9567572":"Bit-exact arithmetic underneath HDC.","open-source-bitweave.9c9c867837":"Pair with","open-source-bitweave.5446bc43fd":"Inspectable implementation, version pinning, and no proprietary runtime dependency.","open-source-bitweave.8211342807":"NIS2, supply chain","open-source-bitweave.1cd24419b5":"No vendor outage to ride out.","open-source-bitweave.6b5c0ceac8":"DORA, operational resilience","open-source-bitweave.8b025d8221":"Pinned semantic contract, same ordered result on every server.","open-source-bitweave.71f692af2e":"EU AI Act, transparency","open-source-bitweave.3f0bfaf911":"Indexes live on infrastructure you control. No vendor processing.","open-source-bitweave.d9fbbe03b4":"GDPR, data residency","open-source-bitweave.380f063397":"EU AI ACT","open-source-bitweave.8788b8a933":"DORA","open-source-bitweave.a5b7d57a85":"GDPR","open-source-bitweave.d0161e12a5":"Data stays in the jurisdiction you choose. The chain of custody is auditable. Compliance is addressed in the architecture rather than added through a dashboard.","open-source-bitweave.4e0e92fa0a":"by design","open-source-bitweave.0941a63e7c":"Self-hosted","open-source-bitweave.68f0ae4911":"Compliance","open-source-bitweave.3d9de21661":"Origin, The Netherlands","open-source-bitweave.c82d1b09cf":"EU","open-source-bitweave.7fbda97572":"9,473 QPS exact, DBpedia 100K","open-source-bitweave.b0c3d2e439":"Recall, Hybrid-MultiQ","open-source-bitweave.d540426e86":"10K Hybrid-MultiQ sweep","open-source-bitweave.aab50eb6e3":"No GPU needed","open-source-bitweave.ff221d4752":"CPU","open-source-bitweave.116e418d3c":"9,473 QPS, DBpedia 100K","open-source-bitweave.3f7e1fd914":"Recall","open-source-bitweave.2d82a36e77":"QPS exact","open-source-bitweave.b13e136af4":"EU origin","open-source-bitweave.6b5eb5323e":"Binary hypervectors","open-source-bitweave.bb7382de57":"Designed and built in The Netherlands.","open-source-bitweave.44ab85a252":"Origin","open-source-bitweave.8c000d26c6":"Exact, held across measured scales.","open-source-bitweave.a9cf981930":"9,473 QPS at recall 1.000 on DBpedia 100K, no GPU in the run.","open-source-bitweave.09aeb9207c":"QPS, 100K docs","open-source-bitweave.52f82ed30e":"Hybrid-MultiQ at 10K docs, 1.000 recall.","open-source-bitweave.e0c97bd053":"What ships","open-source-bitweave.6f19d16ea8":"PROJECT STAT","open-source-bitweave.ef646c2e78":"NO GPU","open-source-bitweave.6400de170a":"9,473 queries per second at recall 1.000 on DBpedia 100K, in 19 MB on an i9-13900KF desktop with AVX2 and no GPU in the run. The semantic engine beneath the Dweve stack.","open-source-bitweave.fb939666dc":"Standard CPU","open-source-bitweave.a55e5a1229":"Measured on","open-source-bitweave.fca77b7e3a":"Semantic state, measured","open-source-bitweave.981ff4f7f4":"No code needed","open-source-bitweave.97aa2f329a":"Plain outcomes","open-source-bitweave.aa6cc4aadb":"A deterministic result you can explain later.","open-source-bitweave.45ac82f360":"Auditable","open-source-bitweave.17142684e1":"The corpus stays on machines you control.","open-source-bitweave.237dfa0a21":"Private","open-source-bitweave.2e640542f1":"Retrieval on the request path, not a batch job.","open-source-bitweave.8db6a2f1d3":"Fast","open-source-bitweave.e98cc5e7e5":"Keep the files and meaning map fixed, and the order can be reproduced.","open-source-bitweave.45705488b9":"Repeatable","open-source-bitweave.54c155efe3":"What each scenario needs","open-source-bitweave.42d217a775":"WHY IT FITS","open-source-bitweave.16de25af88":"CODE","open-source-bitweave.91de13eb99":"FRAUD","open-source-bitweave.1879da5549":"RAG","open-source-bitweave.315b39a0fc":"KB","open-source-bitweave.354b1d51b8":"The same semantic state powers similarity search, multi-vector passage matching, metadata-filtered search, duplicate detection, clustering, one-shot prototypes and RAG grounding. Search is the visible query. The reusable substrate beneath it is the value.","open-source-bitweave.db72a632a6":"many operations","open-source-bitweave.e3c4a86d9c":"One state,","open-source-bitweave.14a29ba383":"Use cases","open-source-bitweave.13f71ffcde":"No external service","open-source-bitweave.8d9886bc08":"AVX2 / AVX-512 / NEON / WASM SIMD","open-source-bitweave.90a4236251":"XNOR + POPCNT","open-source-bitweave.af289982cd":"HDC encoder, LSH index, SIMD distance","open-source-bitweave.779d1d6ab6":"BitWeave engine","open-source-bitweave.cbc3e04861":"maturin bindings","open-source-bitweave.6e3604888c":"Python","open-source-bitweave.fe520723ff":"Embed in Go, C++","open-source-bitweave.9652018eda":"C ABI","open-source-bitweave.f705da1a2d":"index / search","open-source-bitweave.6fae63a153":"Native API, zero copy","open-source-bitweave.0cbc58f0cf":"Rust crate","open-source-bitweave.1286479dcb":"Where BitWeave plugs in","open-source-bitweave.07a56cd0db":"INTEGRATION GRAPH","open-source-bitweave.8b21c0e40c":"PYTHON","open-source-bitweave.700b401ca5":"CLI","open-source-bitweave.d59ed14bf9":"RUST","open-source-bitweave.7c159bc49e":"A Rust crate, a CLI, a stable C ABI, a WASM build and Python bindings via maturin. The SDK is the in-process path, the server exposes a shared boundary with authentication and observability, and the bindings cross into existing languages without reimplementing the representation. WASM brings compatible smaller states into browser-side execution. Every surface carries the same semantic state, the same index contracts and the same ordered answers, verified against one conformance baseline so the engine does not acquire a new meaning per client.","open-source-bitweave.cf96e8afde":"Wrap. Stream","open-source-bitweave.91826ba9cb":"Embed","open-source-bitweave.899e5920ef":"One semantic state, every surface","open-source-bitweave.265b7edc93":"Different backends","open-source-bitweave.6cc044fb1e":"Same hypervectors","open-source-bitweave.f5730052f5":"Cold-start partitioning for very large datasets.","open-source-bitweave.ccf5174e52":"Inverted file","open-source-bitweave.225f6cec44":"Tunable recall, multiple band families.","open-source-bitweave.4a127545e5":"Locality hash","open-source-bitweave.144917dfe4":"LSH candidates plus exact rescore. Default for exact search.","open-source-bitweave.9aece73774":"Hybrid-MultiQ","open-source-bitweave.15f67b3f00":"Exact SIMD scan, batched queries. 1.000 recall.","open-source-bitweave.6e393db513":"BruteForce-MultiQ","open-source-bitweave.1978e9873a":"Choose per scale","open-source-bitweave.96bd99014b":"INDEX LADDER","open-source-bitweave.ee263b044b":"IVF","open-source-bitweave.1316183ae7":"LSH","open-source-bitweave.71b05f76b5":"HYBRID","open-source-bitweave.42e2e99df7":"BRUTEFORCE","open-source-bitweave.5c46b55019":"BruteForce-MultiQ for exact, tight corpora, Hybrid-MultiQ for exact recall at larger scale, and tunable LSH and IVF backends for the very largest corpora. Every index is one operation family over the same hypervectors.","open-source-bitweave.af3e429fe0":"Pick the latency","open-source-bitweave.296f2b253e":"Pick the index","open-source-bitweave.27d5e75c4b":"Index families","open-source-bitweave.507e1f2ce3":"The same pinned semantic contract, on standard CPUs you already own, returns the same ordered result.","open-source-bitweave.d07aa9ffec":"BitWeave design brief","open-source-bitweave.9664a70d02":"Bundle the context. Bind the relationship. Permute the order. Compare the result.","open-source-bitweave.c4b75ee835":"Binary hypervectors carry semantic meaning as packed bits. External floating-point sources cross a declared one-way conversion boundary; the native representation and all internal comparison and scoring remain binary or fixed-point.","open-source-bitweave.3e6668acd6":"Semantic in bits","open-source-bitweave.8d89fe4f27":"Cache lines","open-source-bitweave.689f63487f":"4096 bits","open-source-bitweave.a57e06f454":"Vector","open-source-bitweave.f5a12137b6":"Packed binary hypervector.","open-source-bitweave.0d8a7046c8":"Store","open-source-bitweave.5f5a8a0389":"Cyclic shift, order and position.","open-source-bitweave.e71b62b5ef":"XOR per pair, key/value encoding.","open-source-bitweave.d7e1cccfa5":"Majority of bits, set encoding.","open-source-bitweave.3c8b5b63db":"Three primitives","open-source-bitweave.3c7d398176":"HDC OPERATIONS","open-source-bitweave.77ad0405f4":"PERMUTE","open-source-bitweave.736022c738":"BIND","open-source-bitweave.533ab199c8":"BUNDLE","open-source-bitweave.9c40e8e39a":"HDC encodes meaning across thousands of binary dimensions where bundling captures sets, binding captures pairs and permutation captures order. The result is a single fixed-width hypervector that fits in a few cache lines. Document-level and token-level modes coexist, so a whole document can bundle into one vector or keep a set of token vectors for late interaction. The representation stays similar under modest bit noise, so the same construction survives small perturbations without widening the vector or adding a separate positional tensor.","open-source-bitweave.cf17a8606e":"computing in bits","open-source-bitweave.a20b97ee7c":"Hyperdimensional","open-source-bitweave.5821fec7ee":"Encoding","open-source-bitweave.3bd957ed51":"Bit-identical answer","open-source-bitweave.a9f21121a6":"Packed bits","open-source-bitweave.9fc388f835":"XNOR and POPCNT distance, top-k surfaced.","open-source-bitweave.489f487724":"Score","open-source-bitweave.2e93bfc958":"Query hashes too, walks only matching buckets.","open-source-bitweave.e0c705d18e":"Walk","open-source-bitweave.67294f2067":"LSH families hash hypervectors into buckets.","open-source-bitweave.40dafe4cff":"Bucket","open-source-bitweave.6f620ecf4b":"Document into a binary hypervector via bundling and binding.","open-source-bitweave.782e817cf0":"Encode","open-source-bitweave.bb8e4d7f02":"Doc to query, sub-ms","open-source-bitweave.3891c9037c":"SEMANTIC PIPELINE","open-source-bitweave.a62a7a3d23":"ORGANISE","open-source-bitweave.2704c1d8c3":"COMPOSE","open-source-bitweave.c3e816a801":"ENCODE","open-source-bitweave.b6d4cab99f":"Input becomes a binary hypervector. Bundle, bind and permute compose sets, roles and order before any query runs. Indexes, filters and reranking organise candidates without redefining the type. The .bwks state persists the codebook, vectors, metadata and provenance together. SIMD dispatch executes it on the hardware you already have, and RAG or a direct match is one use of the result. The dependency direction is deliberate: compute never imports application concerns, encoders can change without touching the index kernels, and the type crosses every layer. The query API is the last layer, not the product.","open-source-bitweave.7f8f3df939":"Organise. Persist. Execute. Use","open-source-bitweave.3bf4f74266":"Encode. Compose","open-source-bitweave.b040b4179b":"Architecture","open-source-bitweave.db798dca65":"Drift vs truth","open-source-bitweave.720fd9cc24":"Theirs vs yours","open-source-bitweave.2202f0db15":"Migration is a quarter-long project.","open-source-bitweave.1ef1565eea":"Vendor lock-in","open-source-bitweave.50ddb6a564":"Same query, different answer next week.","open-source-bitweave.90e63ee041":"Result drift","open-source-bitweave.8a3d417c16":"Per query plus per GB plus per indexed doc.","open-source-bitweave.610f44a7fb":"Pricing surprise","open-source-bitweave.ba2cd07a76":"Indexes live where the vendor wants.","open-source-bitweave.3221ca4577":"Data jurisdiction","open-source-bitweave.13bfe2860c":"What dependence hurts","open-source-bitweave.2cb33e6f7d":"CLOUD-SEARCH PAIN","open-source-bitweave.5000106a90":"RESULT DRIFT","open-source-bitweave.0b9fee55bd":"PRICE DRIFT","open-source-bitweave.87a121968c":"DATA OUT","open-source-bitweave.eb28eac7fe":"The semantic middle of the AI stack is supplied by a chain of providers. One embeds the content, one stores the vectors, one selects candidates, one reranks them, and a model turns the result into prose. Each layer changes its model, index, price and region independently, and nobody can name the complete semantic state.","open-source-bitweave.f33fe58635":"is paid five times over","open-source-bitweave.a18c3e6f1e":"The semantic tax","open-source-bitweave.8a9400005c":"The meaning layer is rented","open-source-bitweave.727a7278db":"Rust 1.89","open-source-bitweave.abaa25202c":"Saturates SIMD on commodity hardware.","open-source-bitweave.6d08f088df":"No GPU","open-source-bitweave.1b39ff78a1":"Default hypervector dimension.","open-source-bitweave.7658e643c5":"Bit vectors","open-source-bitweave.6fc173311f":"EXACT RECALL","open-source-bitweave.86f6aa8016":"HDC","open-source-bitweave.28e945bb4a":"BitWeave turns text, images, audio, and existing vectors into fixed-width binary hypervectors: a native semantic type with an algebra you can compose, compare, index, filter, rank, store, and run anywhere. Search is one operation. RAG is one application.","open-source-bitweave.2e2f7208dc":"as a native data type","open-source-bitweave.d73b5d4aa9":"Binary semantics","open-source-bitweave.aba68c05b7":"What BitWeave is","open-source-bitweave.f89887146f":"Data stays in the jurisdiction you choose. The chain of custody is auditable. Compliance is addressed in the architecture rather than added through a dashboard, so each obligation a review raises has a structural answer rather than a promise.","open-source-bitweave.2758d423c6":"No rebuild","open-source-bitweave.cbd17d59ba":"No lock-in","open-source-bitweave.7651314a00":"Once BitWeave publishes, point it at one folder and build the first semantic state without relying on an external service.","open-source-bitweave.1f91748126":"The download","open-source-bitweave.25b0a9e547":"A folder of your own files. They stay exactly where they are, on your side of the wall.","open-source-bitweave.8485be9e7b":"Your documents","open-source-bitweave.5ede26dd5e":"The standard servers or computers you already run. No GPU, nothing specialist to buy.","open-source-bitweave.08a557101e":"Your hardware","open-source-bitweave.3402d3ea89":"No migration project","open-source-bitweave.dafe96a5cc":"WHAT IT TAKES","open-source-bitweave.c689932b7d":"OFFLINE","open-source-bitweave.0844696f10":"SHARED SERVICE","open-source-bitweave.33caf180c5":"EMBEDDED","open-source-bitweave.ff235456c7":"Adoption does not mean a migration programme. The same engine runs three ways: inside a tool your staff already use, as one shared internal service for every team, or offline on a single machine for the most sensitive material. Compatible semantic state moves between all three, so the first choice is never a one-way door.","open-source-bitweave.68e6dc2e72":"Change your mind later","open-source-bitweave.4e199524d2":"Pick how it runs","open-source-bitweave.88645a457e":"How it gets adopted","open-source-bitweave.9755fe3253":"Run by you","open-source-bitweave.6af74613cf":"Built in Europe","open-source-bitweave.7c3bbdc59e":"One pinned semantic contract, reproduced on every supported machine.","open-source-bitweave.3fea358e98":"Trust in the answer","open-source-bitweave.ef15b0521f":"Licensed code you can keep and move, with no shutdown to fear.","open-source-bitweave.cf31bcb60e":"If the supplier changes","open-source-bitweave.9433c03c00":"No per-query charge and no specialist accelerator fleet; the operating cost is the standard CPU infrastructure you choose.","open-source-bitweave.59bd1ff6f9":"What it costs","open-source-bitweave.7d27818949":"You pick the jurisdiction, not a vendor far away.","open-source-bitweave.a4b2edef2b":"Where data lives","open-source-bitweave.f7b610a5ae":"Four control points","open-source-bitweave.d954112db6":"WHY OWNERSHIP MATTERS","open-source-bitweave.0c22d3c22d":"YOUR JURISDICTION","open-source-bitweave.81806bc5d4":"NO VENDOR LOCK-IN","open-source-bitweave.bcb35d156d":"EU SOVEREIGNTY","open-source-bitweave.566ccf84cf":"A managed semantic service decides where data lives, how usage is metered, and when its behaviour changes. BitWeave hands those decisions back to your team: run it on standard servers, choose the jurisdiction, pin the semantic contract, and keep the index with the source material.","open-source-bitweave.391c12fa7a":"or your team does","open-source-bitweave.61f56066b2":"A managed service sets the terms","open-source-bitweave.e913b6237b":"Sovereignty and lock-in","open-source-bitweave.370f9c844a":"Each one removed","open-source-bitweave.58ec45b595":"Answers that change between reviews on their schedule.","open-source-bitweave.d763fe3a85":"Drifting results","open-source-bitweave.5d30233a5a":"A price rise or shutdown you cannot walk away from.","open-source-bitweave.9e652a9c39":"A GPU fleet to procure, power, and keep cool.","open-source-bitweave.d21121e15d":"Specialist hardware","open-source-bitweave.4a5085466e":"Per query, per GB, per indexed document, every month.","open-source-bitweave.b188fe5ee6":"Metered bill","open-source-bitweave.1861a514d1":"Four recurring drains","open-source-bitweave.7bbc9a26ba":"WHAT DEPENDENCE COSTS","open-source-bitweave.3115880727":"NO LOCK-IN","open-source-bitweave.00036ec4c1":"NO GPU FLEET","open-source-bitweave.467a6fdbcd":"NO PER-QUERY FEE","open-source-bitweave.f8376c05cb":"A self-hosted semantic engine changes the shape of cost and risk. There is no metered cloud bill that grows with every query and no specialist hardware to procure. A portable index and pinned semantic contract make every change explicit, reproducible, and independent of one supplier.","open-source-bitweave.1ba3158b60":"Remove the risk","open-source-bitweave.69d0e5fd86":"Lower the bill","open-source-bitweave.6f696724c6":"What it saves and de-risks","open-source-bitweave.7e3daa9cdb":"No fee","open-source-bitweave.2ec6a93c43":"Self-hosted, so documents never leave the building, and the jurisdiction is the one you choose.","open-source-bitweave.ddcfa58876":"Data stays put","open-source-bitweave.b1aeea7873":"Standard CPU servers you already operate. No GPU fleet to buy, no foreign cloud to depend on.","open-source-bitweave.d7bcaeae45":"On your hardware","open-source-bitweave.ec938a7dd4":"Inspect the implementation, pin it and move it between your own environments. No supplier controls the switch.","open-source-bitweave.35a0ab3b85":"You own it","open-source-bitweave.f21f4200e4":"Three answers up front","open-source-bitweave.16d947664c":"WHAT A REVIEW NEEDS","open-source-bitweave.c968638a6e":"SELF-HOSTED","open-source-bitweave.caae7db9e9":"Procurement starts with two questions: where does it run, and who controls it? BitWeave runs on standard CPU servers your team already operates, keeps source material and semantic state in the jurisdiction you choose, and exposes a reproducible contract instead of a remote black box. There is no per-query meter and no GPU fleet to acquire.","open-source-bitweave.96127f5c14":"Yours to run","open-source-bitweave.3d1e7bdec2":"Semantic memory","open-source-bitweave.6312480ba4":"The short brief","open-source-bitweave.dfad7f6e00":"No catch","open-source-bitweave.935738be1b":"No expertise","open-source-bitweave.079e8c5883":"Kept on systems you control, with no supplier switch-off.","open-source-bitweave.2502483d83":"Forever","open-source-bitweave.727edd6bf4":"Kept","open-source-bitweave.7cdb5b602e":"So you can check it and rely on it.","open-source-bitweave.8a5949b3f8":"Every answer","open-source-bitweave.b76aee974c":"Same","open-source-bitweave.bc2474916c":"No charge for asking it questions.","open-source-bitweave.7aab7ca897":"Surprise bills","open-source-bitweave.8a9324dac1":"They stay on your own computer.","open-source-bitweave.aca6dd17f0":"Your papers","open-source-bitweave.70f8bb9a8a":"Home","open-source-bitweave.f7dd5c66e9":"The short version","open-source-bitweave.a34745e93c":"PUT YOUR MIND AT EASE","open-source-bitweave.d8ddbc8b42":"FIFTH RELEASE ROUND","open-source-bitweave.20e47f6e9e":"NO BILL","open-source-bitweave.20a32b7930":"YOUR DATA","open-source-bitweave.10a114ff04":"You should not have to be a computer expert to feel safe using something. So here are the straight answers to the things people worry about most. Where your documents go, whether a surprise bill is coming, whether you can trust what it tells you, and whether it can be taken away.","open-source-bitweave.139dc5ef37":"to the real worries","open-source-bitweave.d8cdb2be9e":"Plain answers","open-source-bitweave.1b4f0ecc7e":"Why it is safe","open-source-bitweave.1a03bcb291":"No jargon","open-source-bitweave.c80e161083":"No setup","open-source-bitweave.7e951ce76d":"The right document comes back, and the same answer comes back next time too.","open-source-bitweave.f6abc6c3f5":"You get the right one","open-source-bitweave.b0af9a0229":"It searches only the documents on your computer. Nothing is sent away.","open-source-bitweave.1e0f455297":"It looks at home","open-source-bitweave.525d736701":"Type what you want the way you would say it. No codes, no special words.","open-source-bitweave.a8d67e1bf6":"Ask in plain words","open-source-bitweave.bbbf622b20":"Nothing to learn","open-source-bitweave.5a36575002":"START TO FINISH","open-source-bitweave.2fb4f93d3e":"YOU HAVE IT","open-source-bitweave.ecfb85ed41":"IT LOOKS","open-source-bitweave.6ae3305594":"TYPE IT","open-source-bitweave.9b461411ed":"You type a question the way you would say it aloud. A product built with BitWeave can look through documents on your own computer and bring back the files that belong together. No search language to learn.","open-source-bitweave.fdf6958b23":"and you are done","open-source-bitweave.20d69dfb49":"Three plain steps,","open-source-bitweave.ecd1c529a8":"How you would use it","open-source-bitweave.704869f20f":"In plain words","open-source-bitweave.9a6215377d":"On your computer","open-source-bitweave.d6478ee8b5":"Ask again tomorrow and the answer does not quietly change.","open-source-bitweave.dbc04f1861":"Tells you the same","open-source-bitweave.5484844440":"It helps your files read properly, whatever program first made them.","open-source-bitweave.5674681964":"Opens it cleanly","open-source-bitweave.a9d6f1ffcf":"You ask, it brings the right document back without making you wait.","open-source-bitweave.11871952d0":"Finds it fast","open-source-bitweave.4ddc0a1d91":"Three things it always does","open-source-bitweave.4be94ab0cd":"A SIMPLE PROMISE","open-source-bitweave.7e826f7af3":"TRUST","open-source-bitweave.33906a7dfd":"OPEN","open-source-bitweave.29e8adfc80":"FIND","open-source-bitweave.a24057540f":"When a product helps you find related files, reopen an old document, or check the sources behind an answer, BitWeave can provide the map of meaning underneath. You feel the benefit without having to see the machinery.","open-source-bitweave.f779ee31b2":"in everyday moments","open-source-bitweave.3d661c608a":"Quiet help","open-source-bitweave.a39c218b1c":"Where it helps you","open-source-bitweave.e0aafffa02":"Answered","open-source-bitweave.3562777bc6":"Ask","open-source-bitweave.a45db1e5c6":"No loading wheel staring back at you.","open-source-bitweave.8220f8470d":"No spinning","open-source-bitweave.7930bf9fc2":"Calm","open-source-bitweave.6ec35b5622":"No special machine, no waiting on the internet.","open-source-bitweave.185a1fab38":"Own computer","open-source-bitweave.755844bc39":"Yours","open-source-bitweave.6a5922c384":"The answer appears as soon as you ask.","open-source-bitweave.67ac56e727":"Not later","open-source-bitweave.e3b8204056":"Now","open-source-bitweave.d04d868b53":"A mountain of papers does not slow it down.","open-source-bitweave.41925fd75a":"Pile is fine","open-source-bitweave.f4e20b0cb8":"Big","open-source-bitweave.ab5171087f":"In everyday words","open-source-bitweave.f229a5f9df":"WHY IT FEELS QUICK","open-source-bitweave.ef35bd23d1":"YOUR COMPUTER","open-source-bitweave.eac9c59256":"ANY SIZE","open-source-bitweave.a81fc0b4a0":"NO WAITING","open-source-bitweave.b97a2c2f6a":"The map is built to respond quickly, whether it covers a folder of letters or a large document library. It runs on ordinary hardware, without specialist equipment.","open-source-bitweave.7f6cd39d10":"an answer right away","open-source-bitweave.464dd97212":"A big pile of papers,","open-source-bitweave.828b8bbecc":"How fast it feels","open-source-bitweave.69bfc818a3":"No surprises","open-source-bitweave.38a1b38eaf":"No bill, and nobody can take it away.","open-source-bitweave.519c433f56":"To keep","open-source-bitweave.75f527181b":"Free","open-source-bitweave.26ac7f9a64":"Your documents stay on your own computer.","open-source-bitweave.48cd18dabc":"Your data","open-source-bitweave.c2ec950012":"The same files and map reproduce the same ordered result.","open-source-bitweave.a16a4eda7c":"Answer","open-source-bitweave.48d8365eec":"Brings back the right document quickly.","open-source-bitweave.85d9398ba3":"Meaning map","open-source-bitweave.f31727ff20":"WHAT THE MAP ENABLES","open-source-bitweave.fe453a5f12":"HONEST","open-source-bitweave.536a08d31b":"FAST","open-source-bitweave.1c34a90a63":"SIMPLE","open-source-bitweave.ecbd58d802":"Think of BitWeave as a map of what belongs together. A product can use that map to connect your question with related documents, quickly and on your own computer. When the files, question, and semantic contract stay the same, the ordered result stays the same too.","open-source-bitweave.20c4e69b11":"that you can trust","open-source-bitweave.039e723fa3":"A map of meaning","open-source-bitweave.afae86e6ff":"In plain words","open-source-bitweave.79073eaaf2":"The Netherlands","open-source-bitweave.4c2efbb4cb":"EU by default","open-source-bitweave.e03947cc0c":"Sovereignty","open-source-bitweave.6eef664840":"None","open-source-bitweave.68808ea95a":"Per-query bill","open-source-bitweave.472b645d59":"Stays in the building","open-source-bitweave.e5e429bcc9":"Data","open-source-bitweave.a3e1e7e81b":"Your servers, standard CPU","open-source-bitweave.1d197d39c5":"Where it runs","open-source-bitweave.68cfdec4a9":"No vendor lock-in","open-source-bitweave.bf5dde2d06":"Lock-in","open-source-bitweave.6da13addb0":"Source","open-source-bitweave.b2f787616e":"Your servers","open-source-bitweave.fef8e889dc":"Runtime","open-source-bitweave.50a5cb4a7d":"For operations","open-source-bitweave.a7472188e3":"See the procurement brief","open-source-bitweave.5028381ecc":"BitWeave gives teams a semantic representation that runs on standard servers without a GPU fleet or a per-query cloud bill. You control the deployment, keep data on your own infrastructure, and can inspect the same fixed-width state from ingestion through search or classification.","open-source-bitweave.9d58e1135c":"Standard CPUs, local data","open-source-bitweave.9cb843f38d":"on servers you control","open-source-bitweave.57322adf66":"Search you own","open-source-bitweave.cba774ca9b":"BitWeave","open-source-bitweave.f51f687fe4":"A licensed copy remains yours to keep","open-source-bitweave.18d57df0d5":"Can it be taken away","open-source-bitweave.4dcda32940":"Publishes in round five","open-source-bitweave.64ae43e8fe":"Cost","open-source-bitweave.4b74390a50":"Monthly bill","open-source-bitweave.6172bebc6a":"None needed","open-source-bitweave.c1398852f3":"Special equipment","open-source-bitweave.dd80c16201":"Pinned meaning, reproducible order","open-source-bitweave.d7e70b6e08":"Same question","open-source-bitweave.1fe0f79001":"Stay at home","open-source-bitweave.8bc3d64b7a":"Your own computer","open-source-bitweave.f8c94a3b4b":"What it is","open-source-bitweave.7ccd8cfc31":"For everyone","open-source-bitweave.06c805023d":"What the meaning map changes","open-source-bitweave.1f15f313b0":"BitWeave helps products recognise which documents, images, or notes belong together. It runs on ordinary computers, keeps the material on machines you control, and preserves the ordered result when the files and question stay the same. No specialist hardware or per-query cloud bill.","open-source-bitweave.8b5c08d64c":"On your own computer","open-source-bitweave.ef4d99d264":" that finds your answers","open-source-bitweave.46315ae9c7":"A fast, honest helper","open-source-bitweave.9bc01a1abe":"Standard CPU, optional GPU","open-source-bitweave.b76ab65957":"Hardware","open-source-bitweave.5e284dafec":"4096-bit hypervectors (default)","open-source-bitweave.45e147abd9":"Dimension","open-source-bitweave.ce31b3f9b5":"1.000 exact, Hybrid-MultiQ","open-source-bitweave.da0e471414":"9,473 QPS exact at DBpedia 100K","open-source-bitweave.fc65cf253d":"Throughput","open-source-bitweave.3123868410":"Repository","open-source-bitweave.6ed8d2034b":"Rust (Apache 2.0)","open-source-bitweave.89b86ab0e6":"Language","open-source-bitweave.3229609e15":"Core model","open-source-bitweave.942587e61e":"Project sheet","open-source-bitweave.d4a74b503a":"Read the docs","open-source-bitweave.8d840ebf08":"BitWeave turns text, images, audio, and existing vectors into fixed-width binary hypervectors, then gives that type a complete runtime: HDC composition, exact and approximate similarity, metadata filtering, multi-vector interaction, collection management, durable state, and SIMD dispatch. It makes semantic state a type you can compose, compare, index, and move between ordinary systems.","open-source-bitweave.201393598b":"The query API is the last layer","open-source-bitweave.5e0a07b993":" binary data type","open-source-bitweave.d8d7de1a1e":"Meaning is a","open-source-bitweave.81b34dba3d":"Own","open-source-bitweave.00d60e31a4":"Run","open-source-bitweave.8e685d5409":"Hold","open-source-bitweave.183f00f483":"Keep","open-source-bitweave.f411a1fb62":"Free","open-source-bitweave.12c4217ea6":"BRUTE","open-source-bitweave.eea4a7cd68":"HYBRID","open-source-bitweave.a802d92d31":"LSH","open-source-bitweave.7b19a04f73":"IVF","open-source-bitweave.9770a6a81d":"bw-cli","open-source-bitweave.00db09ab06":"PLAIN","open-source-bitweave.35e0d0360a":"LIVE","open-source-bitweave.27e88b861f":"EASY","open-source-bitweave.10a87133a3":"SAFE","open-source-bitweave.b1762f76a9":"BRIEF","open-source-bitweave.5d0b2f6bd4":"OBSERVED","open-source-bitweave.6fecf9081b":"CONTROL","open-source-bitweave.6d6a4a4acc":"ADOPT","open-source-bitweave.6e10953f3e":"OPEN","open-source-bitweave.8215b59ccb":"ENGINE","open-source-bitweave.1a38655a63":"TUNABLE","open-source-bitweave.34512fba1d":"PERSIST","open-source-bitweave.790392d6b8":"EXECUTE","open-source-bitweave.d0765bbac1":"COMPARE","open-source-bitweave.52dd7acef9":"CONFORMANCE","open-source-bitweave.section.bw-eng-contract.eyebrow":"The binary hypervector every layer agrees on","open-source-bitweave.section.bw-eng-contract.headlineLead":"The hypervector is not an output","open-source-bitweave.section.bw-eng-contract.headlineAccent":"it is the system contract","open-source-bitweave.section.bw-eng-contract.body":"BitWeave is a binary hypervector engine written in Rust, built around one logical type: a fixed-width packed binary hypervector. Encoders produce it. Algebra composes it. Similarity kernels compare it. Indexes organise it. Collection schemas attach metadata to it. Snapshots preserve it. Shards distribute it. SDKs and servers expose operations over it. The project is wide because the contract between those layers is narrow, and that contract is what BitWeave means by computable meaning.","open-source-bitweave.section.bw-eng-contract.secondaryKicker":"Contract discipline","open-source-bitweave.section.bw-eng-contract.secondaryBody":"The logical ID is not a promise that two byte layouts are identical. It says that the system knows which representation release the object belongs to and which operations are valid over it. A blocked compute cache can be regenerated.","open-source-bitweave.section.bw-eng-contract.secondaryBodySecond":"A GPU buffer can be reloaded, and a collection can rebuild a compatible index. Neither event authorises a change to the encoder manifest or score rule. That needs a new release identity because it changes what the vector means.","open-source-bitweave.section.bw-eng-contract.pill.1":"LOGICAL TYPE","open-source-bitweave.section.bw-eng-contract.pill.2":"DECLARED ENCODER","open-source-bitweave.section.bw-eng-contract.pill.3":"SIX LAYERS","open-source-bitweave.section.bw-eng-contract.footer":"The contract is useful because the layers above and below it do not reach through one another.","open-source-bitweave.section.bw-eng-layers.eyebrow":"Architecture that keeps the primitive stable","open-source-bitweave.section.bw-eng-layers.headlineLead":"Dependencies flow upward","open-source-bitweave.section.bw-eng-layers.headlineAccent":"meaning does not leak downward","open-source-bitweave.section.bw-eng-layers.body":"BitWeave's workspace is organised into six strict system layers: compute, encoding, operations and search, data and storage, compression and quantisation, and application surfaces. A lower layer has no reason to know which application will call it. The bit kernel does not know about BPE. The text encoder does not know whether the vector will enter LSH or an exhaustive scan. The storage format does not need an HTTP request to exist. Each layer can therefore be replaced on its own, without the layers above it being rewritten around the change.","open-source-bitweave.section.bw-eng-layers.secondaryKicker":"Replace one layer without moving the rest","open-source-bitweave.section.bw-eng-layers.secondaryBody":"Consider a domain that replaces a generic text encoder with a regulated vocabulary and a domain-owned codebook. Compute does not change. The Hamming metric does not change. The collection and storage contracts can remain compatible after the corpus is deliberately re-encoded.","open-source-bitweave.section.bw-eng-layers.secondaryBodySecond":"Conversely, the same vectors can move from exact scan to IVF without retraining the encoder. This is the operational payoff of the layering rule: migrations name the layer that changed instead of rebuilding the entire semantic stack because one implementation detail moved.","open-source-bitweave.section.bw-eng-layers.pill.1":"STRICT LAYERS","open-source-bitweave.section.bw-eng-layers.pill.2":"NO UPWARD REACH","open-source-bitweave.section.bw-eng-layers.pill.3":"REPLACEABLE","open-source-bitweave.section.bw-eng-layers.footer":"The bottom layer is small enough to inspect word by word.","open-source-bitweave.section.bw-eng-bits.eyebrow":"The native semantic type","open-source-bitweave.section.bw-eng-bits.headlineLead":"Four thousand and ninety-six bits","open-source-bitweave.section.bw-eng-bits.headlineAccent":"held as sixty-four words","open-source-bitweave.section.bw-eng-bits.body":"At the common D4096 dimension, `BitVec` is 512 bytes: sixty-four packed `u64` words aligned for the machine. Other declared dimensions double the word count while preserving the same type contract. `BitSlice` provides an immutable zero-copy view over compatible word storage for paths that do not need ownership. Dimension validation happens before operations are allowed to combine or compare vectors.","open-source-bitweave.section.bw-eng-bits.secondaryKicker":"Alignment and accounting","open-source-bitweave.section.bw-eng-bits.secondaryBody":"Packed words also make memory accounting unusually direct. A D4096 corpus of one million native vectors has an irreducible packed-vector payload of roughly 512 MB before IDs, metadata and index structures. That logical payload can be counted in advance.","open-source-bitweave.section.bw-eng-bits.secondaryBodySecond":"Physical layouts may add a blocked cache, buckets, centroids, tombstones or page cache. BitWeave reports those as separate layers, so an evaluator can distinguish the bytes that belong to the representation from those that belong to the chosen execution plan.","open-source-bitweave.section.bw-eng-bits.pill.1":"PACKED U64","open-source-bitweave.section.bw-eng-bits.pill.2":"512 BYTES AT D4096","open-source-bitweave.section.bw-eng-bits.pill.3":"Q16.16 SCORE","open-source-bitweave.section.bw-eng-bits.footer":"Packed bits become structural state through a four-operation algebra.","open-source-bitweave.section.bw-eng-algebra.eyebrow":"The algebra over semantic state","open-source-bitweave.section.bw-eng-algebra.headlineLead":"Bundle, bind and permute","open-source-bitweave.section.bw-eng-algebra.headlineAccent":"then compare the result","open-source-bitweave.section.bw-eng-algebra.body":"BitWeave's algebra is hyperdimensional computing made operational. Majority bundling creates a superposition similar to its contributors. XOR binding associates compatible vectors and is self-inverse under the same contract. Permutation creates a deterministic positional or ordered role. Comparison measures the relation through packed bits. Four operations are enough for sets, prototypes, key-value relations and sequences, with no further data type.","open-source-bitweave.section.bw-eng-algebra.secondaryKicker":"Capacity is evaluated, not assumed","open-source-bitweave.section.bw-eng-algebra.secondaryBody":"Useful algebra needs capacity tests. Bundle unrelated contributors and the prototype approaches noise. Reuse the same role construction inconsistently and unbinding quality falls. Use another permutation for queries and the spaces become incompatible in use.","open-source-bitweave.section.bw-eng-algebra.secondaryBodySecond":"BitWeave therefore treats contributor count, dimension, codebook separation, recovery accuracy and task metric as encoder evidence. Simple operations still need a measured operating envelope. The system around them records where their useful region ends.","open-source-bitweave.section.bw-eng-algebra.pill.1":"MAJORITY","open-source-bitweave.section.bw-eng-algebra.pill.2":"XOR","open-source-bitweave.section.bw-eng-algebra.pill.3":"PERMUTE","open-source-bitweave.section.bw-eng-algebra.pill.4":"HAMMING","open-source-bitweave.section.bw-eng-algebra.footer":"Algebra can only be reproduced when the encoder contract is treated as data.","open-source-bitweave.section.bw-eng-manifest.eyebrow":"Same source is not enough","open-source-bitweave.section.bw-eng-manifest.headlineLead":"Vectors without their encoder","open-source-bitweave.section.bw-eng-manifest.headlineAccent":"are only numbers","open-source-bitweave.section.bw-eng-manifest.body":"A query vector and a corpus vector are comparable only inside compatible spaces. That compatibility is defined by the normalisation, tokeniser or feature extractor, codebook, projection or hash functions, dimension, seed, role scheme, mode and implementation version. A file containing vectors but not the encoder contract that produced them is portable bytes without portable semantics.","open-source-bitweave.section.bw-eng-manifest.secondaryKicker":"Representation releases","open-source-bitweave.section.bw-eng-manifest.secondaryBody":"A representation release should be promoted like any other production artefact. It is part of correctness, not a note beside the model. Training data and split, tokeniser statistics, codebook checksum, preservation metric, separation metric, task score and generated corpus identity belong in its evidence.","open-source-bitweave.section.bw-eng-manifest.secondaryBodySecond":"A release may remain compatible with an earlier file format while being semantically incompatible with its vectors. BitWeave keeps format compatibility and semantic compatibility as separate questions, so a file that opens is never mistaken for a query that still means the same thing.","open-source-bitweave.section.bw-eng-manifest.pill.1":"NORMALISATION","open-source-bitweave.section.bw-eng-manifest.pill.2":"CODEBOOK","open-source-bitweave.section.bw-eng-manifest.pill.3":"SEED","open-source-bitweave.section.bw-eng-manifest.pill.4":"VERSION","open-source-bitweave.section.bw-eng-manifest.footer":"The manifest is the first recognition check: one source can create several valid semantic states.","open-source-bitweave.section.bw-eng-text.eyebrow":"Text encoding as a declared choice","open-source-bitweave.section.bw-eng-text.headlineLead":"One vector for compactness","open-source-bitweave.section.bw-eng-text.headlineAccent":"or token vectors for interaction","open-source-bitweave.section.bw-eng-text.body":"BitWeave's text path can train a BPE vocabulary from the target corpus while retaining character fallback for unseen material. Tokens map through a codebook or hash projection into binary hypervectors. Role binding or permutation can preserve position before contributors are bundled into a document-level vector.","open-source-bitweave.section.bw-eng-text.secondaryKicker":"Document and token trade-off","open-source-bitweave.section.bw-eng-text.secondaryBody":"One document vector makes memory and broad matching predictable, but bundling can hide a decisive small passage inside a long document. Token-level state retains more evidence and allows each query facet to select the best local match.","open-source-bitweave.section.bw-eng-text.secondaryBodySecond":"That precision costs several vectors per document and a more expensive scoring contract. BitWeave calls neither mode accurate nor fast without measurement. The corpus, query length, vector count and MaxSim plan belong in the benchmark receipt.","open-source-bitweave.section.bw-eng-text.pill.1":"BPE","open-source-bitweave.section.bw-eng-text.pill.2":"CHARACTER FALLBACK","open-source-bitweave.section.bw-eng-text.pill.3":"DOCUMENT OR TOKEN","open-source-bitweave.section.bw-eng-text.footer":"Image and audio reach the same logical type through their own evidence pipelines.","open-source-bitweave.section.bw-eng-modalities.eyebrow":"One destination type, several feature contracts","open-source-bitweave.section.bw-eng-modalities.headlineLead":"Pictures are not tokenised words","open-source-bitweave.section.bw-eng-modalities.headlineAccent":"and audio is not a picture","open-source-bitweave.section.bw-eng-modalities.body":"The image encoder works from visual evidence such as patches, local binary patterns, census transforms, gradients, colour and scale. The audio encoder works from STFT and mel features, spectral shape, temporal windows and positional permutation. Structured and custom encoders can provide named features directly. Each path targets the logical hypervector only after its own modality-specific stages.","open-source-bitweave.section.bw-eng-modalities.secondaryKicker":"Feature contracts stay modality-specific","open-source-bitweave.section.bw-eng-modalities.secondaryBody":"An image encoder can be tested on viewpoint, crop and lighting robustness. An audio encoder can be tested on noise, tempo and temporal displacement. A text encoder can be tested on paraphrase and terminology. Each path needs its own evidence, limits and scope.","open-source-bitweave.section.bw-eng-modalities.secondaryBodySecond":"Those metrics should travel with the codebook, rather than being replaced by one cross-modal benchmark that proves little about each path. Alignment, when introduced, becomes another named model or transformation with its own training data and evaluation.","open-source-bitweave.section.bw-eng-modalities.pill.1":"IMAGE","open-source-bitweave.section.bw-eng-modalities.pill.2":"AUDIO","open-source-bitweave.section.bw-eng-modalities.pill.3":"EXPLICIT QUANTISATION","open-source-bitweave.section.bw-eng-modalities.footer":"Once represented, the same substrate supports an operation field larger than top-k.","open-source-bitweave.section.bw-eng-operations.eyebrow":"Operations over the type","open-source-bitweave.section.bw-eng-operations.headlineLead":"Nearest is one spoke","open-source-bitweave.section.bw-eng-operations.headlineAccent":"not the centre of the system","open-source-bitweave.section.bw-eng-operations.body":"BitWeave can find nearest neighbours, but the same score and representation support distance ranges, near-duplicate screening, similarity grouping, prototype matching, candidate routing, structured filters, hybrid text and vector retrieval, and context selection. Token-level and patch-level representations add late interaction where one vector per item is too coarse.","open-source-bitweave.section.bw-eng-operations.secondaryKicker":"Prototype and routing stay scoped","open-source-bitweave.section.bw-eng-operations.secondaryBody":"Bundled prototypes make lightweight one-shot or example-based matching possible without a gradient fit. The result is a distance to the examples supplied under the current encoder, which makes the operation cheap to run and straightforward to check.","open-source-bitweave.section.bw-eng-operations.secondaryBodySecond":"Candidate routing is likewise a shortlist operation. A downstream workflow may validate policy, apply thresholds or request human review. The engine provides explicit semantic state and scores; the application owns the final operational meaning.","open-source-bitweave.section.bw-eng-operations.pill.1":"NEAREST","open-source-bitweave.section.bw-eng-operations.pill.2":"RANGE","open-source-bitweave.section.bw-eng-operations.pill.3":"DUPLICATE","open-source-bitweave.section.bw-eng-operations.pill.4":"PROTOTYPE","open-source-bitweave.section.bw-eng-operations.pill.5":"FILTER","open-source-bitweave.section.bw-eng-operations.footer":"The index implements candidate work for several spokes, and each index carries a different contract.","open-source-bitweave.section.bw-eng-indexes.eyebrow":"Candidate generation is not verification","open-source-bitweave.section.bw-eng-indexes.headlineLead":"Open funnel first","open-source-bitweave.section.bw-eng-indexes.headlineAccent":"solid exact score second","open-source-bitweave.section.bw-eng-indexes.body":"Exact scan, hybrid, LSH, CSR, forest and IVF are workload choices over the same corpus. Scale, data distribution, mutation pattern, filter selectivity, memory and recall determine the plan. Brute force stays the right answer at the scales where a packed SIMD scan is cheaper and exact. Approximate indexes earn their place wherever their candidate contract and measured recall stay visible.","open-source-bitweave.section.bw-eng-indexes.secondaryKicker":"Decision flow","open-source-bitweave.section.bw-eng-indexes.secondaryBody":"The practical index selector asks more than corpus size. The index is execution policy over the representation, not part of its identity. Selection considers distribution shape, insertion frequency, metadata-filter selectivity, interactive or batch use, available memory and whether exact recall is required.","open-source-bitweave.section.bw-eng-indexes.secondaryBodySecond":"CSR may suit a stable, read-heavy corpus and fail a rapidly mutating one. IVF may suit structured data and fail near-random vectors without fallback. Exact scan remains the correctness baseline and an economically valid production mode. That baseline remains part of every plan.","open-source-bitweave.section.bw-eng-indexes.pill.1":"INDEX LADDER","open-source-bitweave.section.bw-eng-indexes.pill.2":"FILTER PLAN","open-source-bitweave.section.bw-eng-indexes.pill.3":"EXACT VERIFIER","open-source-bitweave.section.bw-eng-indexes.footer":"The shared verifier is fast because the corpus is laid out for the query rather than merely stored.","open-source-bitweave.section.bw-eng-layout.eyebrow":"The physical machine is part of the algorithm","open-source-bitweave.section.bw-eng-layout.headlineLead":"Load one query word once","open-source-bitweave.section.bw-eng-layout.headlineAccent":"reuse it across a block","open-source-bitweave.section.bw-eng-layout.body":"Row-major layout is natural for storage and individual access. It is wasteful when one query word must be compared against the same word position in thousands of documents. Blocked structure-of-arrays transposes document blocks so a query word is loaded once and reused across several document words. Current block sizes follow architecture and implementation needs, with active-tail handling for the final partial block.","open-source-bitweave.section.bw-eng-layout.secondaryKicker":"Scalar equivalence as evidence","open-source-bitweave.section.bw-eng-layout.secondaryBody":"Kernel dispatch is trustworthy only when the optimised path matches the scalar reference across boundary dimensions, random vectors, identical vectors, opposites, partial tails and adversarial alignment. Its receipt names the host architecture, detected features, selected kernel, candidate count and batch shape.","open-source-bitweave.section.bw-eng-layout.secondaryBodySecond":"A GPU fallback reason is useful evidence too: transfer dominated, the device was unavailable, the corpus was not resident or the batch stayed below threshold. Remaining on the CPU is then a stated execution plan with a reason attached. The receipt makes that decision reviewable.","open-source-bitweave.section.bw-eng-layout.pill.1":"BLOCKED SOA","open-source-bitweave.section.bw-eng-layout.pill.2":"RUNTIME DISPATCH","open-source-bitweave.section.bw-eng-layout.pill.3":"BATCH-AWARE","open-source-bitweave.section.bw-eng-layout.footer":"A fast query path becomes a system only when mutation and durable state remain explicit.","open-source-bitweave.section.bw-eng-storage.eyebrow":"Semantic state that survives change","open-source-bitweave.section.bw-eng-storage.headlineLead":"Record first, apply second","open-source-bitweave.section.bw-eng-storage.headlineAccent":"then checkpoint and compact","open-source-bitweave.section.bw-eng-storage.body":"BitWeave's collection layer is where the vector database lives. It gives vector state identifiers, schemas, typed metadata, validation and supported transaction boundaries. The storage engine gives that state a versioned `.bwks` snapshot, typed section directory, checksums and compatible format version. A temporary write and atomic rename prevent an incomplete snapshot from becoming the promoted state.","open-source-bitweave.section.bw-eng-storage.secondaryKicker":"Deletion and durability language","open-source-bitweave.section.bw-eng-storage.secondaryBody":"A tombstone is not physical erasure. It prevents supported logical results from returning the item and marks the state for later compaction. Until compaction, bytes can remain in the base corpus, a backup or an older snapshot according to retention policy. That delay remains visible.","open-source-bitweave.section.bw-eng-storage.secondaryBodySecond":"A WAL append is durably acknowledged only when the path performs the required sync. BitWeave keeps these distinctions visible because legal deletion, crash recovery and low-latency mutation are separate requirements and should not borrow one another's vocabulary.","open-source-bitweave.section.bw-eng-storage.pill.1":"SCHEMA","open-source-bitweave.section.bw-eng-storage.pill.2":"WAL","open-source-bitweave.section.bw-eng-storage.pill.3":"TOMBSTONE","open-source-bitweave.section.bw-eng-storage.pill.4":"MMAP","open-source-bitweave.section.bw-eng-storage.footer":"One node can now recover its semantic state. The next boundary is cluster state.","open-source-bitweave.section.bw-eng-distributed.eyebrow":"Beyond one machine","open-source-bitweave.section.bw-eng-distributed.headlineLead":"Local index semantics inside","open-source-bitweave.section.bw-eng-distributed.headlineAccent":"explicit distributed state","open-source-bitweave.section.bw-eng-distributed.body":"In a distributed deployment, a shard remains a local BitWeave collection and index. Consistent hashing limits movement when nodes join or leave. Replicas provide additional read capacity and failover under the configured policy. Raft coordinates crash-fault-tolerant leadership and ordered cluster state. It does not protect against Byzantine participants.","open-source-bitweave.section.bw-eng-distributed.secondaryKicker":"Consistency remains explicit","open-source-bitweave.section.bw-eng-distributed.secondaryBody":"Cluster language stays as narrow as the implementation. Reads may be served from eligible replicas while writes route through primaries and replicate under the current policy. The operation receipt states which path applied.","open-source-bitweave.section.bw-eng-distributed.secondaryBodySecond":"A result receipt can name the topology epoch, shard set, replica role and merge rule. If rebalancing or failover occurred, it remains visible in operational state even when the final score and order are unchanged.","open-source-bitweave.section.bw-eng-distributed.pill.1":"SHARDS","open-source-bitweave.section.bw-eng-distributed.pill.2":"REPLICAS","open-source-bitweave.section.bw-eng-distributed.pill.3":"RAFT","open-source-bitweave.section.bw-eng-distributed.pill.4":"OBSERVABILITY","open-source-bitweave.section.bw-eng-distributed.footer":"The same engine can now sit inside an application, behind a service or in a smaller compatible runtime.","open-source-bitweave.section.bw-eng-surfaces.eyebrow":"Enter at the layer the product needs","open-source-bitweave.section.bw-eng-surfaces.headlineLead":"Embed it, script it, serve it","open-source-bitweave.section.bw-eng-surfaces.headlineAccent":"or call it from another runtime","open-source-bitweave.section.bw-eng-surfaces.body":"BitWeave exposes a high-level Rust SDK, a command-line interface, a standalone server, a stable C ABI, Python bindings and WebAssembly for suitable workloads. These are adapters around the engine, not independently evolving semantic implementations. The SDK can own the full in-process lifecycle. The CLI makes representation and collection operations reproducible in automation. The server adds an operational network boundary. Bindings let other languages call the same core. None of them re-implements the encoder, the format or the search, so a result obtained through one surface can be reproduced through another.","open-source-bitweave.section.bw-eng-surfaces.secondaryKicker":"Scoped parity","open-source-bitweave.section.bw-eng-surfaces.secondaryBody":"Surface parity is compatibility-scoped. A browser build suits smaller compatible state and local operations, not every distributed or server feature. Authentication and RBAC belong to the server surface, while an embedded application owns its own security boundary.","open-source-bitweave.section.bw-eng-surfaces.secondaryBodySecond":"Each surface publishes the operations, format versions and optional features it supports, so callers know the verb set before integration. Once the repository publishes, the same Apache 2.0 terms let evaluators inspect, modify and redistribute the boundary their product needs.","open-source-bitweave.section.bw-eng-surfaces.pill.1":"RUST","open-source-bitweave.section.bw-eng-surfaces.pill.2":"CLI","open-source-bitweave.section.bw-eng-surfaces.pill.3":"SERVER","open-source-bitweave.section.bw-eng-surfaces.pill.4":"C ABI","open-source-bitweave.section.bw-eng-surfaces.pill.5":"PYTHON","open-source-bitweave.section.bw-eng-surfaces.pill.6":"WASM","open-source-bitweave.section.bw-eng-surfaces.footer":"The engine is broad, but the evaluation can remain narrow: inspect one item from source to cluster.","open-source-bitweave.section.bw-biz-sprawl.eyebrow":"The hidden duplication in AI programmes","open-source-bitweave.section.bw-biz-sprawl.headlineLead":"The seventh capability started","open-source-bitweave.section.bw-biz-sprawl.headlineAccent":"by indexing the same data again","open-source-bitweave.section.bw-biz-sprawl.body":"Search, recommendation, duplicate detection, routing, agent context, matching and analytics often touch the same bounded information domain. Yet each project begins with another preprocessing pipeline, another embedding or encoder, another vector space, another metadata copy and another service contract. The organisation owns the original documents. It does not own a reusable computational form of them.","open-source-bitweave.section.bw-biz-sprawl.secondaryKicker":"What to put on the programme map","open-source-bitweave.section.bw-biz-sprawl.secondaryBody":"Treat each semantic state as a named programme dependency. Record its domain, encoder, codebook, dimension, owner, update cadence, consuming products and exit plan. The map should expose repeated conversion and duplicate update work.","open-source-bitweave.section.bw-biz-sprawl.secondaryBodySecond":"The exercise usually reveals several states serving the same domain while no team owns consistency between them. BitWeave gives that owner one place to manage the reusable layer, while genuinely different semantic spaces remain separate by design.","open-source-bitweave.section.bw-biz-sprawl.pill.1":"ONE DOMAIN","open-source-bitweave.section.bw-biz-sprawl.pill.2":"ONE CONTRACT","open-source-bitweave.section.bw-biz-sprawl.pill.3":"SEVERAL OPERATIONS","open-source-bitweave.section.bw-biz-sprawl.footer":"Representation sprawl is the problem. Ownership of the semantic layer is the answer.","open-source-bitweave.section.bw-biz-ownership.eyebrow":"The derived asset beneath the model","open-source-bitweave.section.bw-biz-ownership.headlineLead":"Owning the source","open-source-bitweave.section.bw-biz-ownership.headlineAccent":"is not owning what it derives","open-source-bitweave.section.bw-biz-ownership.body":"The semantic layer decides how information is normalised, which relationships survive encoding, what counts as similar, where the index lives, how it is recovered and whether another application can reuse it. Those decisions often sit behind model and database endpoints even though the resulting state was derived from the organisation's own material. Ownership is only real when that derived state can be rebuilt from material you already hold, on a schedule you set, without asking anyone for permission to read it back.","open-source-bitweave.section.bw-biz-ownership.secondaryKicker":"The asset test","open-source-bitweave.section.bw-biz-ownership.secondaryBody":"Source ownership is incomplete if derived state cannot be rebuilt without a supplier. The organisation should be able to inspect the semantic layer, name its release, move it to another compatible runtime and keep operating if a dependency disappears.","open-source-bitweave.section.bw-biz-ownership.secondaryBodySecond":"BitWeave keeps the codebook, vector state, database format and implementation together as one owned release artefact. The package can travel with its evidence, rather than leaving continuity dependent on an endpoint or a promise of a later export.","open-source-bitweave.section.bw-biz-ownership.pill.1":"ENCODER OWNED","open-source-bitweave.section.bw-biz-ownership.pill.2":"STATE VERSIONED","open-source-bitweave.section.bw-biz-ownership.pill.3":"FORMAT OPEN","open-source-bitweave.section.bw-biz-ownership.footer":"Ownership matters because the same representation can do more than return neighbours.","open-source-bitweave.section.bw-biz-operations.eyebrow":"Search is one spoke","open-source-bitweave.section.bw-biz-operations.headlineLead":"One semantic state can support","open-source-bitweave.section.bw-biz-operations.headlineAccent":"several measurable outcomes","open-source-bitweave.section.bw-biz-operations.body":"A bounded domain encoded once can support semantic search, related-item discovery, near-duplicate screening, grouping, matching against known prototypes, metadata-aware decisions, candidate routing and context retrieval. The value is that they share the same explicit representation, collection state and operational controls wherever the domain and the evaluation justify it.","open-source-bitweave.section.bw-biz-operations.secondaryKicker":"Revenue and service design","open-source-bitweave.section.bw-biz-operations.secondaryBody":"The first project pays for corpus preparation, encoder evaluation, collection design and deployment. When a second operation fits the same representation contract, it can begin from that state instead of returning to raw files and another supplier selection.","open-source-bitweave.section.bw-biz-operations.secondaryBodySecond":"Reuse does not remove the need to validate the new outcome, thresholds or human checks. It changes where the work begins: the team tests the operation and its decision boundary instead of rebuilding the semantic infrastructure underneath it.","open-source-bitweave.section.bw-biz-operations.pill.1":"FIND","open-source-bitweave.section.bw-biz-operations.pill.2":"COMPARE","open-source-bitweave.section.bw-biz-operations.pill.3":"GROUP","open-source-bitweave.section.bw-biz-operations.pill.4":"ROUTE","open-source-bitweave.section.bw-biz-operations.pill.5":"RETRIEVE","open-source-bitweave.section.bw-biz-operations.footer":"The recognition moment is when the organisation sees the same conversion chain for the seventh time.","open-source-bitweave.section.bw-biz-encoders.eyebrow":"Keep existing investments explicit","open-source-bitweave.section.bw-biz-encoders.headlineLead":"Meaning can begin in bits","open-source-bitweave.section.bw-biz-encoders.headlineAccent":"or arrive by measured conversion","open-source-bitweave.section.bw-biz-encoders.body":"BitWeave supports native binary encoding paths and explicit conversion of existing vector estates. Organisations therefore do not have to make one ideological choice for every workload. A local hash-based text encoder can avoid a remote embedding call. A specialised neural embedding can remain the right source for another domain and enter through quantisation. Each route still carries a contract: source modality, dimension, normalisation, codebook or quantisation rule, and implementation version. Native paths keep the codebook local; imported vectors are accepted only after their dimensions and error envelope are declared. That lets a buyer compare quality, memory and dependency exposure without pretending the routes are interchangeable.","open-source-bitweave.section.bw-biz-encoders.secondaryKicker":"Procurement consequence","open-source-bitweave.section.bw-biz-encoders.secondaryBody":"The route varies by domain. Sensitive material may use a local encoder. Public or specialist scientific content may justify an external domain-trained embedding followed by an owned one-way conversion and index.","open-source-bitweave.section.bw-biz-encoders.secondaryBodySecond":"Procurement can then ask one concrete question. Which dependency earns its place because it improves the declared task metric, and which exists only because the rest of the semantic stack was bundled behind it?","open-source-bitweave.section.bw-biz-encoders.pill.1":"NATIVE BINARY","open-source-bitweave.section.bw-biz-encoders.pill.2":"IMPORTED VECTOR","open-source-bitweave.section.bw-biz-encoders.pill.3":"ERROR CONTRACT","open-source-bitweave.section.bw-biz-encoders.footer":"The representation becomes valuable when it is surrounded by a real data system.","open-source-bitweave.section.bw-biz-database.eyebrow":"The vector database beneath the benchmark","open-source-bitweave.section.bw-biz-database.headlineLead":"Give the primitive a database","open-source-bitweave.section.bw-biz-database.headlineAccent":"not just an index","open-source-bitweave.section.bw-biz-database.body":"BitWeave includes collection management because production information state needs identifiers, metadata, validation, mutation and recovery. A collection can define vector and metadata fields, choose a compatible index, validate documents and support declared commit or rollback scopes. Products can therefore share one semantic collection without each building another metadata database beside it.","open-source-bitweave.section.bw-biz-database.secondaryKicker":"One source of operational truth","open-source-bitweave.section.bw-biz-database.secondaryBody":"Shared collection state reduces disputes between product teams. If search says an item is active while duplicate review says it is deleted, the usual cause is two metadata copies and two update jobs.","open-source-bitweave.section.bw-biz-database.secondaryBodySecond":"A single schema and one mutation path settle that disagreement at the source. Search, duplicate review and routing can remain separate products while agreeing on identifiers, status and the transaction that changed them.","open-source-bitweave.section.bw-biz-database.pill.1":"COLLECTIONS","open-source-bitweave.section.bw-biz-database.pill.2":"SCHEMAS","open-source-bitweave.section.bw-biz-database.pill.3":"FILTERS","open-source-bitweave.section.bw-biz-database.pill.4":"TRANSACTIONS","open-source-bitweave.section.bw-biz-database.footer":"Operational state must survive a crash, a deployment move and a change of index.","open-source-bitweave.section.bw-biz-durable.eyebrow":"Portable semantic infrastructure","open-source-bitweave.section.bw-biz-durable.headlineLead":"The corpus-derived state can be","open-source-bitweave.section.bw-biz-durable.headlineAccent":"released, restored and moved","open-source-bitweave.section.bw-biz-durable.body":"Rebuilding an index is sometimes acceptable. Reconstructing the exact semantic state behind an old result is harder when the encoder, codebook, metadata and ordering rules have moved. BitWeave's versioned state format lets compatible representation and index sections be kept as a named artefact, while the write-ahead log and checkpoints preserve live changes after a snapshot.","open-source-bitweave.section.bw-biz-durable.secondaryKicker":"Continuity planning","open-source-bitweave.section.bw-biz-durable.secondaryBody":"A recovery exercise belongs in the evaluation, not in an appendix after purchase. Stop the process after acknowledged writes, reopen the latest snapshot, replay the log and verify logical deletions.","open-source-bitweave.section.bw-biz-durable.secondaryBodySecond":"Then rebuild a compatible index, compare result receipts and restore the collection on another supported machine. That test turns portability and durability from contract language into an operation the buyer has completed.","open-source-bitweave.section.bw-biz-durable.pill.1":"VERSIONED SNAPSHOT","open-source-bitweave.section.bw-biz-durable.pill.2":"WAL RECOVERY","open-source-bitweave.section.bw-biz-durable.pill.3":"BACKUP","open-source-bitweave.section.bw-biz-durable.footer":"Durability answers ownership. Scale answers how many machines that state can occupy.","open-source-bitweave.section.bw-biz-scale.eyebrow":"Scale as a deployment choice","open-source-bitweave.section.bw-biz-scale.headlineLead":"Embed it first","open-source-bitweave.section.bw-biz-scale.headlineAccent":"shard it when the domain earns it","open-source-bitweave.section.bw-biz-scale.body":"BitWeave can begin inside one application, move behind an internal service, map a large read-only state, add replicas and eventually distribute a collection across shards. The hypervector and collection contract do not need to become a different product at each step. Hardware and topology change the execution posture, not the identity of the semantic state.","open-source-bitweave.section.bw-biz-scale.secondaryKicker":"Avoid premature distribution","open-source-bitweave.section.bw-biz-scale.secondaryBody":"The lowest viable rung is the strongest first deployment. Embedded or single-service use brings fewer failure modes, lower operating cost and a shorter evidence chain while preserving the representation contract.","open-source-bitweave.section.bw-biz-scale.secondaryBodySecond":"Sharding should arrive when corpus size, throughput, availability or data placement requires it. BitWeave keeps that move available without making a distributed cluster the price of the first useful workload.","open-source-bitweave.section.bw-biz-scale.pill.1":"EMBEDDED","open-source-bitweave.section.bw-biz-scale.pill.2":"SERVICE","open-source-bitweave.section.bw-biz-scale.pill.3":"SHARDED","open-source-bitweave.section.bw-biz-scale.pill.4":"OPTIONAL GPU","open-source-bitweave.section.bw-biz-scale.footer":"The architecture is broad. Retrieval remains the easiest workload to measure publicly.","open-source-bitweave.section.bw-biz-benchmark.eyebrow":"A public benchmark receipt","open-source-bitweave.section.bw-biz-benchmark.headlineLead":"9,473 queries per second","open-source-bitweave.section.bw-biz-benchmark.headlineAccent":"at measured recall 1.000","open-source-bitweave.section.bw-biz-benchmark.body":"On the published DBpedia 100K run, BitWeave's exact multi-query configuration returned 9,473 queries per second at recall 1.000 in 19 MB on an i9-13900KF desktop with 24 cores, AVX2 and 48 GB. The measured two-bit approximate comparison system returned 3,580 queries per second in 38 MB on the same host and data.","open-source-bitweave.section.bw-biz-benchmark.secondaryKicker":"Benchmark discipline in a buying process","open-source-bitweave.section.bw-biz-benchmark.secondaryBody":"The public number is a starting receipt, not a sizing quote. The buyer should rerun the exact baseline, chosen approximate modes, filters and batch shapes on their own material.","open-source-bitweave.section.bw-biz-benchmark.secondaryBodySecond":"Build time, update cost, memory, tail latency and recovery time belong beside QPS. A complete receipt turns performance into a repeatable engineering decision under the buyer's conditions.","open-source-bitweave.section.bw-biz-benchmark.pill.1":"DBPEDIA 100K","open-source-bitweave.section.bw-biz-benchmark.pill.2":"RECALL 1.000","open-source-bitweave.section.bw-biz-benchmark.pill.3":"19 MB","open-source-bitweave.section.bw-biz-benchmark.pill.4":"NO GPU IN RUN","open-source-bitweave.section.bw-biz-benchmark.footer":"Performance is supporting evidence. The larger asset is one engine across several surfaces.","open-source-bitweave.section.bw-biz-surfaces.eyebrow":"Adopt without moving every application","open-source-bitweave.section.bw-biz-surfaces.headlineLead":"Embed it where the data lives","open-source-bitweave.section.bw-biz-surfaces.headlineAccent":"or serve it where teams share it","open-source-bitweave.section.bw-biz-surfaces.body":"A product can embed the Rust SDK, a pipeline can use the CLI, other native runtimes can call the C ABI, analysis teams can use Python, a shared estate can use the server, and suitable small workloads can use a WebAssembly build. The choice is an integration posture, not a new semantic implementation. The same state and the same format sit behind every one of them.","open-source-bitweave.section.bw-biz-surfaces.secondaryKicker":"Migration without a flag day","open-source-bitweave.section.bw-biz-surfaces.secondaryBody":"Two postures can run side by side. A hosted search service can remain user-facing while BitWeave builds and evaluates the owned representation. Compare results and establish exact baselines before traffic moves.","open-source-bitweave.section.bw-biz-surfaces.secondaryBodySecond":"Consumers can then move one workload at a time. Because the state and interfaces are separable, each team can keep its language and deployment model until it is ready to adopt another boundary.","open-source-bitweave.section.bw-biz-surfaces.pill.1":"EMBED","open-source-bitweave.section.bw-biz-surfaces.pill.2":"SCRIPT","open-source-bitweave.section.bw-biz-surfaces.pill.3":"SERVE","open-source-bitweave.section.bw-biz-surfaces.pill.4":"BIND","open-source-bitweave.section.bw-biz-surfaces.pill.5":"BROWSER","open-source-bitweave.section.bw-biz-surfaces.footer":"The decision to make is where one shared domain earns its place.","open-source-bitweave.section.bw-biz-adopt.eyebrow":"A credible first adoption","open-source-bitweave.section.bw-biz-adopt.headlineLead":"Choose one real domain","open-source-bitweave.section.bw-biz-adopt.headlineAccent":"then prove more than search on it","open-source-bitweave.section.bw-biz-adopt.body":"The best BitWeave evaluation starts with one bounded corpus whose useful relationships can be measured. Product catalogues, policy libraries, support knowledge, codebases, media archives and fraud-reference sets are good design shapes whenever several semantic operations touch the same material.","open-source-bitweave.section.bw-biz-adopt.secondaryKicker":"Go or no-go criteria","open-source-bitweave.section.bw-biz-adopt.secondaryBody":"A pilot should stop if the representation does not preserve the task relationships or a second operation cannot honestly reuse it. It should also stop when operating the state costs more than the fragmentation it replaces.","open-source-bitweave.section.bw-biz-adopt.secondaryBodySecond":"Proceed when quality meets the declared baseline and the state reopens and reproduces. The case strengthens when the integration boundary fits and the team can name how a compatible feature will reuse the asset.","open-source-bitweave.section.bw-biz-adopt.pill.1":"ONE DOMAIN","open-source-bitweave.section.bw-biz-adopt.pill.2":"TWO OPERATIONS","open-source-bitweave.section.bw-biz-adopt.pill.3":"SAVE AND REOPEN","open-source-bitweave.section.bw-biz-adopt.footer":"Encode one domain. Keep the representation. Build the next feature on state you already own.","open-source-bitweave.section.bw-con-pattern.eyebrow":"In plain words","open-source-bitweave.section.bw-con-pattern.headlineLead":"Give each useful thing","open-source-bitweave.section.bw-con-pattern.headlineAccent":"a pattern the computer can keep","open-source-bitweave.section.bw-con-pattern.body":"A product built with BitWeave can turn supported words, pictures, sounds or other data into compact patterns made of on and off positions. That is what computable meaning is: a working shape rather than a copy of the source, and the thing that lets the computer keep going after the first feature has finished.","open-source-bitweave.section.bw-con-pattern.secondaryKicker":"A feature, not a replacement for the source","open-source-bitweave.section.bw-con-pattern.secondaryBody":"The original file still matters. The compact pattern is kept because it is useful for repeated comparison, not because it contains every word, pixel or sound. It cannot stand in for the source.","open-source-bitweave.section.bw-con-pattern.secondaryBodySecond":"A product should always be able to show the original item behind a match. BitWeave helps find relationships between items; the source remains the thing a person sees, reads or listens to when checking the result.","open-source-bitweave.section.bw-con-pattern.pill.1":"COMPACT","open-source-bitweave.section.bw-con-pattern.pill.2":"REUSABLE","open-source-bitweave.section.bw-con-pattern.pill.3":"LOCAL-CAPABLE","open-source-bitweave.section.bw-con-pattern.footer":"Different sources reach the same kind of pattern by roads that stay named.","open-source-bitweave.section.bw-con-sources.eyebrow":"Several entrances","open-source-bitweave.section.bw-con-sources.headlineLead":"Words, pictures and sounds","open-source-bitweave.section.bw-con-sources.headlineAccent":"take different roads to one type","open-source-bitweave.section.bw-con-sources.body":"A sentence is split into meaningful pieces of text. A picture is examined in patches for texture, edges and colour. A recording is examined in short windows for timing and frequency. Each road keeps the evidence that matters for its kind of source before producing the compact pattern used by the rest of the engine.","open-source-bitweave.section.bw-con-sources.secondaryKicker":"Why the roads stay visible","open-source-bitweave.section.bw-con-sources.secondaryBody":"A product maker can explain which route was used for each kind of item. That matters when a result looks wrong. The problem might come from the words chosen for text, the visual features chosen for a photograph or the timing window chosen for sound.","open-source-bitweave.section.bw-con-sources.secondaryBodySecond":"Keeping those routes visible makes improvement possible. The maker can find the part that produced the result, test it against the right kind of evidence and change that route without pretending every source was processed in the same way.","open-source-bitweave.section.bw-con-sources.pill.1":"TEXT PATH","open-source-bitweave.section.bw-con-sources.pill.2":"IMAGE PATH","open-source-bitweave.section.bw-con-sources.pill.3":"AUDIO PATH","open-source-bitweave.section.bw-con-sources.footer":"Once information has a pattern, the product can put simple structure into it.","open-source-bitweave.section.bw-con-structure.eyebrow":"More than a fingerprint","open-source-bitweave.section.bw-con-structure.headlineLead":"Patterns can hold","open-source-bitweave.section.bw-con-structure.headlineAccent":"groups, labels and order","open-source-bitweave.section.bw-con-structure.body":"A product can join several compatible patterns into a group pattern that remains close to the members. It can pair a pattern with a label or role, such as \"supplier\" or \"country\". It can move a pattern in a repeatable way so first, second and third remain different. Those three actions let a fixed-size pattern carry simple structure rather than acting only as a fingerprint.","open-source-bitweave.section.bw-con-structure.secondaryKicker":"How far simple structure goes","open-source-bitweave.section.bw-con-structure.secondaryBody":"A group pattern is a useful summary of its members, not a container from which each member can be recovered. A label pairing works only when the product uses the same labels and conversion rules again.","open-source-bitweave.section.bw-con-structure.secondaryBodySecond":"An ordered pattern preserves the kind of order the product deliberately put into it. Each form is a practical tool with a defined limit, rather than a complete copy of the items from which it was made.","open-source-bitweave.section.bw-con-structure.pill.1":"JOIN","open-source-bitweave.section.bw-con-structure.pill.2":"PAIR","open-source-bitweave.section.bw-con-structure.pill.3":"ORDER","open-source-bitweave.section.bw-con-structure.footer":"The same pattern can now support several useful actions, and search is only one of them.","open-source-bitweave.section.bw-con-actions.eyebrow":"What products can build with it","open-source-bitweave.section.bw-con-actions.headlineLead":"Find is one action","open-source-bitweave.section.bw-con-actions.headlineAccent":"among several","open-source-bitweave.section.bw-con-actions.body":"A product can find the closest item, return everything inside a chosen distance, spot something that is nearly a duplicate, group related items or compare a new item with a small pattern made from known examples. The result is usually an ID, a distance, a score or a group. Another part of the product decides how to show it to the person.","open-source-bitweave.section.bw-con-actions.secondaryKicker":"What still needs a person","open-source-bitweave.section.bw-con-actions.secondaryBody":"A close match may be useful and still be wrong for the decision at hand. Two contracts can discuss the same subject and impose different obligations. Two photographs can look alike and show different people.","open-source-bitweave.section.bw-con-actions.secondaryBodySecond":"A prototype can suggest a category without settling it. Products should use the score according to the importance of the decision and show the source item whenever a person needs to check the result.","open-source-bitweave.section.bw-con-actions.pill.1":"COMPARE","open-source-bitweave.section.bw-con-actions.pill.2":"GROUP","open-source-bitweave.section.bw-con-actions.pill.3":"CHECK","open-source-bitweave.section.bw-con-actions.pill.4":"FIND","open-source-bitweave.section.bw-con-actions.footer":"Those actions can run close to the files, on the machine the product chooses.","open-source-bitweave.section.bw-con-local.eyebrow":"Where the patterns and index live","open-source-bitweave.section.bw-con-local.headlineLead":"The product can keep them","open-source-bitweave.section.bw-con-local.headlineAccent":"on the machine it chooses","open-source-bitweave.section.bw-con-local.body":"A product can run the engine in its own process, on a private server or, for suitable smaller state, in a browser or edge environment. No hosted service sits in the path. The patterns, codebooks and index can stay near the files rather than travelling to a provider each time the product needs to compare them.","open-source-bitweave.section.bw-con-local.secondaryKicker":"Local now, shared later","open-source-bitweave.section.bw-con-local.secondaryBody":"A local product can later copy a compatible state to a private server, share a read-only subset with a browser or split a larger collection across several machines. The move should be deliberate, and the state should carry a version.","open-source-bitweave.section.bw-con-local.secondaryBodySecond":"More people and devices can then reach the feature without silently moving the original files somewhere new. The folder stays inside the boundary the product chose, while compatible state travels only where the product allows it.","open-source-bitweave.section.bw-con-local.pill.1":"RUNS LOCAL","open-source-bitweave.section.bw-con-local.pill.2":"OFFLINE-CAPABLE","open-source-bitweave.section.bw-con-local.pill.3":"YOUR CHOICE","open-source-bitweave.section.bw-con-local.footer":"The interface can change later without throwing away the compatible semantic state.","open-source-bitweave.section.bw-con-open.eyebrow":"The engine beneath the feature","open-source-bitweave.section.bw-con-open.headlineLead":"The code and compatible state","open-source-bitweave.section.bw-con-open.headlineAccent":"can remain available","open-source-bitweave.section.bw-con-open.body":"BitWeave is released under Apache 2.0. Developers can inspect it, build it, include it in another product, pin a version and keep a compatible copy under the licence terms. The engine and the state it produces stay with the people who built on them. A pinned version keeps working after that, because reading the state back depends on nothing of ours.","open-source-bitweave.section.bw-con-open.secondaryKicker":"The simplest summary","open-source-bitweave.section.bw-con-open.secondaryBody":"BitWeave gives software a compact way to remember relationships between items. A product can use that shape to compare, group, check and find while keeping the state local or moving it between compatible places.","open-source-bitweave.section.bw-con-open.secondaryBodySecond":"The engine underneath remains available for inspection once it publishes. A person should still be able to see the original source and understand what the surrounding product chose to do with the result.","open-source-bitweave.section.bw-con-open.pill.1":"APACHE 2.0","open-source-bitweave.section.bw-con-open.pill.2":"KEEP THE LICENSED COPY","open-source-bitweave.section.bw-con-open.pill.3":"KEEP THE STATE","open-source-bitweave.section.bw-con-open.footer":"Give the information a form the computer can keep working with, and let the product decide how people use it.","open-source-bitweave.hero.eyebrow":"BitWeave","open-source-bitweave.hero.title.lead":"Meaning as a data type.","open-source-bitweave.hero.title.accent":"A binary hypervector engine in Rust.","open-source-bitweave.hero.technical.lede":"BitWeave is a binary hypervector engine in Rust under Apache-2.0. A declared encoder contract turns text, images and audio into fixed-width binary hypervectors that stay one logical type with native operations, from a single process to a shard group. BitWeave publishes in the fifth round of the foundation release programme.","open-source-bitweave.hero.technical.action.primary":"Ask about the release","open-source-bitweave.hero.technical.action.secondary":"Read the documentation","open-source-bitweave.hero.technical.ledger.label":"Project sheet","open-source-bitweave.hero.technical.ledger.pill":"For engineers","open-source-bitweave.hero.technical.ledger.row.coreModel.label":"Core model","open-source-bitweave.hero.technical.ledger.row.coreModel.value":"Binary hypervectors","open-source-bitweave.hero.technical.ledger.row.language.label":"Language","open-source-bitweave.hero.technical.ledger.row.language.value":"Rust","open-source-bitweave.hero.technical.ledger.row.repository.label":"Repository","open-source-bitweave.hero.ledger.row.repository.value":"Publishes in round five","open-source-bitweave.hero.technical.ledger.row.throughput.label":"Throughput","open-source-bitweave.hero.technical.ledger.row.throughput.value":"9,473 QPS at recall 1.000","open-source-bitweave.hero.technical.ledger.row.corpus.label":"Measured corpus","open-source-bitweave.hero.technical.ledger.row.corpus.value":"DBpedia 100K in 19 MB","open-source-bitweave.hero.technical.ledger.row.dimension.label":"Dimension","open-source-bitweave.hero.technical.ledger.row.dimension.value":"4,096-bit hypervectors (default)","open-source-bitweave.hero.technical.ledger.row.hardware.label":"Hardware","open-source-bitweave.hero.technical.ledger.row.hardware.value":"Standard CPU, optional GPU","open-source-bitweave.hero.technical.ledger.row.origin.label":"Origin","open-source-bitweave.hero.ledger.row.origin.value":"The Netherlands","open-source-bitweave.hero.business.lede":"BitWeave is a binary hypervector engine in Rust under Apache-2.0. It supports vector search, duplicate detection, grouping and routing. A team can own one declared representation and reuse it instead of rebuilding a vector stack for every feature. BitWeave publishes in the fifth round of Dweve's foundation release programme, with its documentation at docs.dweve.com the same day.","open-source-bitweave.hero.business.action.primary":"Follow the business case","open-source-bitweave.hero.business.action.secondary":"How to evaluate","open-source-bitweave.hero.business.ledger.label":"Project sheet","open-source-bitweave.hero.business.ledger.pill":"For operations","open-source-bitweave.hero.business.ledger.row.runtime.label":"Runtime","open-source-bitweave.hero.business.ledger.row.runtime.value":"Your servers","open-source-bitweave.hero.business.ledger.row.source.label":"Repository","open-source-bitweave.hero.business.ledger.row.lockIn.label":"Lock-in","open-source-bitweave.hero.business.ledger.row.lockIn.value":"No required proprietary runtime","open-source-bitweave.hero.business.ledger.row.whereItRuns.label":"Where it runs","open-source-bitweave.hero.business.ledger.row.whereItRuns.value":"Your servers, standard CPU","open-source-bitweave.hero.business.ledger.row.data.label":"Data","open-source-bitweave.hero.business.ledger.row.data.value":"Your chosen infrastructure","open-source-bitweave.hero.business.ledger.row.bill.label":"Per-query bill","open-source-bitweave.hero.business.ledger.row.bill.value":"No per-query meter","open-source-bitweave.hero.business.ledger.row.sovereignty.label":"Sovereignty","open-source-bitweave.hero.business.ledger.row.sovereignty.value":"Choose the jurisdiction","open-source-bitweave.hero.business.ledger.row.origin.label":"Origin","open-source-bitweave.hero.consumer.lede":"BitWeave treats meaning as a data type. A product built with it can give your words, pictures and sounds one compact pattern, then find, compare and group them without starting over each time. It publishes in the fifth round of Dweve's release programme, and the documentation arrives at docs.dweve.com that same day.","open-source-bitweave.hero.consumer.action.primary":"See it in plain words","open-source-bitweave.hero.consumer.action.secondary":"Where it runs","open-source-bitweave.hero.consumer.ledger.label":"In plain words","open-source-bitweave.hero.consumer.ledger.pill":"For everyone","open-source-bitweave.hero.consumer.ledger.row.whatItIs.label":"What it is","open-source-bitweave.hero.consumer.ledger.row.whatItIs.value":"A map of meaning","open-source-bitweave.hero.consumer.ledger.row.ownComputer.label":"Your own computer","open-source-bitweave.hero.consumer.ledger.row.ownComputer.value":"On the machine you choose","open-source-bitweave.hero.consumer.ledger.row.sameQuestion.label":"Same question","open-source-bitweave.hero.consumer.ledger.row.sameQuestion.value":"Fixed meaning, reproducible order","open-source-bitweave.hero.consumer.ledger.row.equipment.label":"Special equipment","open-source-bitweave.hero.consumer.ledger.row.equipment.value":"None needed","open-source-bitweave.hero.consumer.ledger.row.bill.label":"Monthly bill","open-source-bitweave.hero.consumer.ledger.row.bill.value":"No hosted-service meter","open-source-bitweave.hero.consumer.ledger.row.cost.label":"Cost","open-source-bitweave.hero.consumer.ledger.row.cost.value":"No licence fee","open-source-bitweave.hero.consumer.ledger.row.takenAway.label":"Can it be taken away","open-source-bitweave.hero.consumer.ledger.row.takenAway.value":"You can keep a licensed copy","open-source-bitweave.banner.bw-con-recognition.eyebrow":"The repeated upload","open-source-bitweave.banner.bw-con-recognition.lead":"One folder, three tools.","open-source-bitweave.banner.bw-con-recognition.leadAccent":"One shared pattern did the job.","open-source-bitweave.banner.bw-con-recognition.paragraph.1":"One tool receives the folder to search it. Another receives the same folder to find duplicate pictures. A third receives it to group related material. Three copies, three accounts, three hidden conversions and three versions of what related means.","open-source-bitweave.banner.bw-con-recognition.paragraph.2":"A product built with BitWeave keeps one compatible pattern state near the files and reuses it for several actions. A genuinely different job can still be given its own conversion. What stops is the same relationship layer being rebuilt every time another button is added.","open-source-bitweave.banner.bw-con-recognition.panelHeader":"One folder","open-source-bitweave.banner.bw-con-recognition.panelTag":"three old tools","open-source-bitweave.banner.bw-con-recognition.check.1":"uploaded for search","open-source-bitweave.banner.bw-con-recognition.check.2":"uploaded for duplicates","open-source-bitweave.banner.bw-con-recognition.check.3":"uploaded for grouping","open-source-bitweave.banner.bw-con-recognition.check.4":"three copies","open-source-bitweave.banner.bw-con-recognition.check.5":"three hidden representations","open-source-bitweave.banner.bw-con-recognition.check.6":"three separate update jobs","open-source-bitweave.banner.bw-con-recognition.check.marker":"✓","open-source-bitweave.banner.bw-con-recognition.verdict.label":"the files did not need three meanings; BitWeave gives the features one shared shape","open-source-bitweave.banner.bw-con-recognition.verdict.marker":"✓","open-source-bitweave.banner.bw-con-recognition.footline":"reuse the pattern where the task contract fits, and name a new one where it does not","open-source-bitweave.breadcrumb.home":"Open Source","open-source-bitweave.close.accent":"then decide what to build on it","open-source-bitweave.close.panel.title":"What the encoding leaves you","open-source-bitweave.close.panel.tag":"STATE","open-source-bitweave.close.panel.row.0.label":"Vectors","open-source-bitweave.close.panel.row.0.value":"Binary hyperdimensional, on ordinary CPUs","open-source-bitweave.close.panel.row.1.label":"Algebra","open-source-bitweave.close.panel.row.1.value":"Bundle, bind, permute, compare","open-source-bitweave.close.panel.row.2.label":"Surfaces","open-source-bitweave.close.panel.row.2.value":"Rust, CLI, server, C ABI, Python, WebAssembly","open-source-bitweave.close.panel.row.3.label":"Terms","open-source-bitweave.close.panel.row.3.value":"Apache 2.0","open-source-bitweave.close.panel.foot":"Publication is planned in fortnightly rounds. BitWeave and its documentation go live together, in the fifth round.","open-source-bitweave.breadcrumb.current":"BitWeave","open-source-bitweave.close.label":"Get started","open-source-bitweave.close.headline":"Make meaning computable","open-source-bitweave.close.body":"BitWeave publishes in the fifth round of Dweve's foundation release programme, with its documentation at docs.dweve.com the same day. Encode one real domain and inspect the state it produces before deciding what to build on it.","open-source-bitweave.close.action.primary":"Ask about the release","open-source-bitweave.close.action.secondary":"Read the documentation","open-source-bitweave.next.eyebrow":"Continue exploring","open-source-bitweave.next.numerus.category":"Related project","open-source-bitweave.next.numerus.title":"Numerus","open-source-bitweave.next.numerus.description":"Correctly rounded maths for BitWeave.","open-source-bitweave.next.reed.category":"Related project","open-source-bitweave.next.reed.title":"Reed","open-source-bitweave.next.reed.description":"Parse before you index.","open-source-bitweave.next.spindle.category":"Products","open-source-bitweave.next.spindle.title":"Spindle","open-source-bitweave.next.spindle.description":"Knowledge pipeline built on BitWeave's meaning layer.","oss-bitweave-adoption-postures.chrome.path":"Four adoption postures","oss-bitweave-adoption-postures.chrome.status":"same receipt on both postures","oss-bitweave-adoption-postures.chrome.meta":"four postures / one collection","oss-bitweave-adoption-postures.shared.name":"one semantic collection","oss-bitweave-adoption-postures.shared.sub":"one encoder release / one state version","oss-bitweave-adoption-postures.shared.receipt":"one operation receipt","oss-bitweave-adoption-postures.posture.embedded.name":"embedded application","oss-bitweave-adoption-postures.posture.embedded.role":"user-facing path during migration","oss-bitweave-adoption-postures.posture.embedded.owner":"product team","oss-bitweave-adoption-postures.posture.embedded.boundary":"application process security","oss-bitweave-adoption-postures.posture.server.name":"internal server","oss-bitweave-adoption-postures.posture.server.role":"shared estate during migration","oss-bitweave-adoption-postures.posture.server.owner":"platform team","oss-bitweave-adoption-postures.posture.server.boundary":"authenticated network, roles, rate limits","oss-bitweave-adoption-postures.posture.binding.name":"python binding","oss-bitweave-adoption-postures.posture.binding.role":"evaluation over the same core","oss-bitweave-adoption-postures.posture.binding.owner":"analysis team","oss-bitweave-adoption-postures.posture.binding.boundary":"evaluation workspace","oss-bitweave-adoption-postures.posture.browser.name":"browser-compatible export","oss-bitweave-adoption-postures.posture.browser.role":"small read-only subset","oss-bitweave-adoption-postures.posture.browser.owner":"product team","oss-bitweave-adoption-postures.posture.browser.boundary":"explicit size and feature limits","oss-bitweave-adoption-postures.fact.owner":"owner","oss-bitweave-adoption-postures.fact.boundary":"boundary","oss-bitweave-adoption-postures.compare.label":"results compared under the same state and operation receipt","oss-bitweave-adoption-postures.band.left":"an integration posture, not a new semantic implementation","oss-bitweave-adoption-postures.band.right":"one state / four boundaries","oss-bitweave-album.chrome.path":"Simple structure in patterns","oss-bitweave-album.chrome.status":"three examples, three structures","oss-bitweave-album.chrome.meta":"illustrative","oss-bitweave-album.album.title":"the trip album","oss-bitweave-album.album.note":"five photo patterns join into one group pattern","oss-bitweave-album.record.title":"the catalogue record","oss-bitweave-album.record.pairColour":"colour: red","oss-bitweave-album.record.pairSupplier":"supplier: Acme","oss-bitweave-album.record.ask":"ask for the colour label","oss-bitweave-album.record.answer":"the red codebook neighbour","oss-bitweave-album.record.note":"asking for a label returns what was paired with it","oss-bitweave-album.playlist.title":"the playlist","oss-bitweave-album.playlist.first":"first clip","oss-bitweave-album.playlist.second":"second clip","oss-bitweave-album.playlist.third":"third clip","oss-bitweave-album.playlist.note":"positions keep first, second and third apart","oss-bitweave-album.band.text":"groups, labels and order in one fixed-size pattern","oss-bitweave-album.band.meta":"structure, not equations","oss-bitweave-algebra.kicker.label":"Four primitives","oss-bitweave-algebra.kicker.sub":"and their invariants","oss-bitweave-algebra.tag":"HDC","oss-bitweave-algebra.primitive.bundle.name":"bundle","oss-bitweave-algebra.primitive.bundle.use":"Set or prototype","oss-bitweave-algebra.primitive.bundle.invariant":"Output dimension equals input dimension.","oss-bitweave-algebra.primitive.bind.name":"bind","oss-bitweave-algebra.primitive.bind.use":"Role or relation","oss-bitweave-algebra.primitive.bind.invariant":"Bind twice with the same compatible role to recover.","oss-bitweave-algebra.primitive.permute.name":"permute","oss-bitweave-algebra.primitive.permute.use":"Position or order","oss-bitweave-algebra.primitive.permute.invariant":"Deterministic and reversible under the matching inverse.","oss-bitweave-algebra.primitive.compare.name":"compare","oss-bitweave-algebra.primitive.compare.use":"Distance or similarity","oss-bitweave-algebra.primitive.compare.invariant":"Integer count over equal dimensions.","oss-bitweave-algebra.foot.left":"small algebra","oss-bitweave-algebra.foot.right":"large structures built by composition","oss-bitweave-benchmark.48c4f6322c":"1.000 recall held, no GPU","oss-bitweave-benchmark.5763aac061":"BitWeave benchmark receipts from the published DBpedia 100K run and D4096/10K sweep. The measured two-bit comparison system is the separate approximate baseline. Re-run the suite on your own hardware once the repository publishes.","oss-bitweave-benchmark.3f7e1fd914":"Recall","oss-bitweave-benchmark.88306943fe":"Method","oss-bitweave-benchmark.feaafc538f":"Corpus","oss-bitweave-benchmark.c2df9b9326":"Index","oss-bitweave-benchmark.c33151163e":"queries per second","oss-bitweave-benchmark.9550373e8b":"Measured","oss-bitweave-benchmark.ca99d6e3a7":"QPS","oss-bitweave-benchmark.4d191277f0":"i9 AVX2, no GPU","oss-bitweave-benchmark.90d4c1fba7":"publishes with the repository","oss-bitweave-benchmark.611be6bd7a":"cargo bench, comprehensive_benchmark","oss-bitweave-benchmark.872def41e5":"2-bit, approximate","oss-bitweave-benchmark.9ebae9baa7":"10K docs","oss-bitweave-benchmark.9397c6889b":"Quantized competitor baseline","oss-bitweave-benchmark.2f8a68d821":"d=4096, exact scan","oss-bitweave-benchmark.b281cb451b":"100K docs","oss-bitweave-benchmark.2d93b9a0c2":"SIMD brute-force","oss-bitweave-benchmark.dea451d359":"d=1536, 19 MB index","oss-bitweave-benchmark.862caa6459":"DBpedia OpenAI embeddings","oss-bitweave-benchmark.5f263a5835":"d=4096, AVX2","oss-bitweave-benchmark.0ab121d2bd":"Multi-query batched LSH","oss-bitweave-benchmark-receipt.kicker.label":"What belongs beside every number","oss-bitweave-benchmark-receipt.kicker.sub":"the complete receipt","oss-bitweave-benchmark-receipt.tag":"MEASURED","oss-bitweave-benchmark-receipt.row.corpus.field":"corpus","oss-bitweave-benchmark-receipt.row.corpus.value":"DBpedia, 100,000 documents","oss-bitweave-benchmark-receipt.row.dimension.field":"source dimension","oss-bitweave-benchmark-receipt.row.dimension.value":"1,536","oss-bitweave-benchmark-receipt.row.path.field":"path","oss-bitweave-benchmark-receipt.row.path.value":"exact multi-query","oss-bitweave-benchmark-receipt.row.host.field":"host","oss-bitweave-benchmark-receipt.row.host.value":"i9-13900KF, 24 cores, AVX2, 48 GB","oss-bitweave-benchmark-receipt.row.result.field":"result","oss-bitweave-benchmark-receipt.row.result.value":"9,473 QPS, recall 1.000, 19 MB","oss-bitweave-benchmark-receipt.row.comparison.field":"comparison","oss-bitweave-benchmark-receipt.row.comparison.value":"3,580 QPS, 38 MB on same host and data","oss-bitweave-benchmark-receipt.footline.left":"benchmark ships to be rerun","oss-bitweave-benchmark-receipt.footline.right":"the machine and recall stay attached","oss-bitweave-biz-asset-banner.eyebrow":"The whole commercial correction","oss-bitweave-biz-asset-banner.lead":"The source is valuable.","oss-bitweave-biz-asset-banner.accent":"The reusable form has value.","oss-bitweave-biz-asset-banner.paragraph.one":"Models, indexes and services can change. The representation release behind a product determines what relationships were preserved, which items could be compared, which operations shared state and whether a past result can be reproduced. Treating that layer as temporary plumbing creates an exit problem below the model and below the database.","oss-bitweave-biz-asset-banner.paragraph.two":"BitWeave makes that state inspectable and operational: encoder manifest, codebook, vectors, collection schema, metadata, index contract, snapshot, mutation state and runtime path. Apache 2.0 gives the organisation the right to keep the code and the format. The semantic asset stays where the organisation put it, and it survives any endpoint that once served it.","oss-bitweave-biz-asset-banner.panel.header":"What remains owned","oss-bitweave-biz-asset-banner.panel.tag":"representation release","oss-bitweave-biz-asset-banner.chip.encoderCodebook":"encoder and codebook","oss-bitweave-biz-asset-banner.chip.binaryState":"binary semantic state","oss-bitweave-biz-asset-banner.chip.collectionMetadata":"collection and metadata","oss-bitweave-biz-asset-banner.chip.snapshotRecovery":"snapshot and recovery","oss-bitweave-biz-asset-banner.chip.benchmarkReceipt":"benchmark receipt","oss-bitweave-biz-asset-banner.chip.sourceBuildRights":"source and build rights","oss-bitweave-biz-asset-banner.chip.status":"owned","oss-bitweave-biz-asset-banner.verdict":"BitWeave lets you own the layer where information becomes reusable machine state","oss-bitweave-biz-asset-banner.footline":"a technical exit requires the state as well as the source code","oss-bitweave-business-brief.ee7558770d":"No per-query meter","oss-bitweave-business-brief.3e5674b0ba":"Read every line. Pin any version. File any issue.","oss-bitweave-business-brief.93ffb9d5ca":"Self-hosted","oss-bitweave-business-brief.d31e27ec0a":"PROCUREMENT BRIEF","oss-bitweave-business-brief.353372ce55":"Self-hosted and built in Europe. Data stays in the jurisdiction you choose, which gives GDPR and EU AI Act reviews a concrete architectural starting point.","oss-bitweave-business-brief.4e57e62941":"EU sovereignty by default","oss-bitweave-business-brief.2384e06726":"It runs on infrastructure you already control. There is no outside service holding your documents and no per-query bill arriving each month.","oss-bitweave-business-brief.8069eb6eb2":"No data leaves the building","oss-bitweave-business-brief.2d0129a2e0":"The implementation and index format are inspectable and portable. Pin a version, move it between your environments, and keep one supplier out of the critical path.","oss-bitweave-business-brief.870c4d024a":"No vendor lock-in","oss-bitweave-business-brief.6ec6600189":"Built in The Netherlands","oss-bitweave-business-brief.44ab85a252":"Origin","oss-bitweave-business-brief.dd2f73afbb":"Your own servers, standard CPU","oss-bitweave-business-brief.1d197d39c5":"Where it runs","oss-bitweave-business-brief.b6e77c24ce":"Where it lives","oss-bitweave-business-brief.6b5eb5323e":"Standard CPU","oss-bitweave-business-brief.fef8e889dc":"Runtime","oss-bitweave-business-compliance.105b4f6a19":"Local data · pinned contract","oss-bitweave-business-compliance.5728f75f20":"Compliance starts in the architecture, not in a dashboard you bolt on later.","oss-bitweave-business-compliance.79ddb0b165":"Addressed in the architecture","oss-bitweave-business-compliance.039155239f":"OBLIGATION MAP","oss-bitweave-business-compliance.612db9ef22":"Inspectable supply chain","oss-bitweave-business-compliance.a1671c99f6":"There is no proprietary runtime dependency. Your team can inspect the implementation, pin a version, and reproduce the same semantic contract during review.","oss-bitweave-business-compliance.d7704c0f0e":"Is the supply chain auditable?","oss-bitweave-business-compliance.67574c2823":"No third-party operational dependency","oss-bitweave-business-compliance.69375a7f8b":"There is no outside service in the request path to fail. The engine runs inside your own estate, so a vendor outage is not your outage.","oss-bitweave-business-compliance.184f6d1d64":"What happens if the supplier goes down?","oss-bitweave-business-compliance.8788b8a933":"DORA","oss-bitweave-business-compliance.b25b37d2a3":"Deterministic, reproducible output","oss-bitweave-business-compliance.0b79a644a5":"A pinned semantic contract reproduces the same ordered result on every supported machine. Any model change is explicit and can be accounted for in a review.","oss-bitweave-business-compliance.a3e9b5be02":"Can you explain and reproduce a result?","oss-bitweave-business-compliance.d75a4de2ef":"EU AI Act","oss-bitweave-business-compliance.565ef17a9d":"Self-hosted, no vendor processing","oss-bitweave-business-compliance.b6a05bd192":"The index runs on infrastructure you already control. Documents never reach an outside processor, so data residency is whatever you choose.","oss-bitweave-business-compliance.4110b5d251":"Where does the data physically live?","oss-bitweave-business-compliance.a5b7d57a85":"GDPR","oss-bitweave-business-compliance.f79b79c2c5":"Same architecture, all four obligations","oss-bitweave-business-glyph.9de18531fb":"A per-query cloud bill","oss-bitweave-business-glyph.bec1e39665":"No per-query bill","oss-bitweave-business-glyph.e19955c6ef":"A GPU fleet to procure","oss-bitweave-business-glyph.f7a9c09a71":"Standard CPU","oss-bitweave-business-glyph.1ef1565eea":"Proprietary dependency","oss-bitweave-business-glyph.60d4ad2a16":"Portable index, pinned runtime","oss-bitweave-business-glyph.fba9536fa5":"Your data leaves your boundary","oss-bitweave-business-glyph.463e5a9102":"Your chosen infrastructure","oss-bitweave-business-glyph.6b5eb5323e":"Self-hosted","oss-bitweave-business-glyph.fb82e1f290":"Run it on your infrastructure","oss-bitweave-business-glyph.c82d1b09cf":"EU","oss-bitweave-business-glyph.64dada2dd9":"Choose the jurisdiction","oss-bitweave-business-glyph.35a0ab3b85":"You control it","oss-bitweave-business-glyph.3dd9ed6823":"Not a managed service","oss-bitweave-business-glyph.1517d57a8d":"Managed service or self-host","oss-bitweave-business-glyph.5653d671a1":"Procurement view, BitWeave","oss-bitweave-business-glyph.0d7087527e":"Signed off","oss-bitweave-business-glyph.639e82dad7":"A vendor's service","oss-bitweave-business-glyph.c07973deb0":"BitWeave, self-hosted","oss-bitweave-business-glyph.6ec6600189":"Built in The Netherlands","oss-bitweave-business-glyph.4cbd04a536":"your servers","oss-bitweave-business-postures.kicker.label":"Choose the boundary","oss-bitweave-business-postures.kicker.sub":"one engine behind each","oss-bitweave-business-postures.tag":"ADOPT","oss-bitweave-business-postures.row.embedded.posture":"embedded","oss-bitweave-business-postures.row.embedded.fit":"single product, local latency, application-owned security","oss-bitweave-business-postures.row.pipeline.posture":"pipeline","oss-bitweave-business-postures.row.pipeline.fit":"repeatable indexing, migration and benchmark jobs","oss-bitweave-business-postures.row.service.posture":"internal service","oss-bitweave-business-postures.row.service.fit":"shared collections, server controls and independent scaling","oss-bitweave-business-postures.row.binding.posture":"binding","oss-bitweave-business-postures.row.binding.fit":"existing Python or native systems over the same core","oss-bitweave-business-postures.row.browser.posture":"browser/edge","oss-bitweave-business-postures.row.browser.fit":"smaller compatible local state and offline features","oss-bitweave-business-postures.footline.left":"the surface can change later","oss-bitweave-business-postures.footline.right":"the representation stays as it was","oss-bitweave-business-rollout.0ced4b442c":"Inside a tool you already run","oss-bitweave-business-rollout.1a89fe2cc4":"Best when search lives in one application","oss-bitweave-business-rollout.877dce2d16":"It sits inside an existing application, so staff keep the screen they know. Nothing new to log into, nothing new to learn.","oss-bitweave-business-rollout.cdac2009e4":"No new login","oss-bitweave-business-rollout.3c6a0d5093":"No separate service","oss-bitweave-business-rollout.1581eceabb":"Same workflow","oss-bitweave-business-rollout.8b6197598c":"A shared internal service","oss-bitweave-business-rollout.33677eac30":"Best when many teams search the same library","oss-bitweave-business-rollout.55c5784e59":"It runs once on your own servers and answers every team across the building. One place to maintain, one place to govern.","oss-bitweave-business-rollout.9fee2122b7":"One install","oss-bitweave-business-rollout.402ca4a71d":"Many teams","oss-bitweave-business-rollout.6ec5103411":"Central control","oss-bitweave-business-rollout.35fd035816":"Offline on a single machine","oss-bitweave-business-rollout.eee21e7c8f":"Best for a private desk or a site with no network","oss-bitweave-business-rollout.ade571d5f3":"It works on one computer with no connection at all. Ideal for sensitive material that must never touch a network.","oss-bitweave-business-rollout.e33899926b":"No connection","oss-bitweave-business-rollout.56067a3bd9":"Fully private","oss-bitweave-business-rollout.f7210a3806":"Portable index","oss-bitweave-business-rollout.37587a0d26":"The standard servers or computers you already own. No GPU.","oss-bitweave-business-rollout.e5c1f3f453":"A folder of your own documents. They stay where they are.","oss-bitweave-business-rollout.982bcb9129":"A local BitWeave build on your own servers, once the repository publishes.","oss-bitweave-business-rollout.29e5325986":"The same index moves between all three, so the first choice is never the last.","oss-bitweave-business-rollout.a1a84077bc":"All your team needs to start","oss-bitweave-business-sovereignty.94effababa":"Standard CPUs, local data","oss-bitweave-business-sovereignty.cf22cc071c":"Self-hosted and built in Europe. EU sovereignty is the starting point, not an add-on.","oss-bitweave-business-sovereignty.7629410065":"BitWeave, self-hosted","oss-bitweave-business-sovereignty.c61c053ac2":"Managed cloud search","oss-bitweave-business-sovereignty.8c25713cd6":"The same pinned state returns the same ordered result","oss-bitweave-business-sovereignty.f0cbd4a848":"Results that quietly drift as their index updates","oss-bitweave-business-sovereignty.6e63afcee7":"Can you trust the answer","oss-bitweave-business-sovereignty.43f4406619":"Inspectable implementation you can pin and move","oss-bitweave-business-sovereignty.3c2d15d502":"A price rise or shutdown you cannot escape","oss-bitweave-business-sovereignty.cf31bcb60e":"If the supplier changes","oss-bitweave-business-sovereignty.ee7558770d":"Standard CPUs, no per-query meter","oss-bitweave-business-sovereignty.66467281f7":"A meter that grows with every query and document","oss-bitweave-business-sovereignty.59bd1ff6f9":"What it costs","oss-bitweave-business-sovereignty.df36ea325d":"On your servers, in a jurisdiction you choose","oss-bitweave-business-sovereignty.8b0faa6e1e":"On a vendor server, in a jurisdiction they pick","oss-bitweave-business-sovereignty.1d6d97874a":"Where your data lives","oss-bitweave-business-value.bec1e39665":"No per-query bill","oss-bitweave-business-value.639ad3b629":"Cuts the metered cloud bill","oss-bitweave-business-value.0337100de4":"A self-hosted engine has no per-query and no per-document charge. The cost is the hardware you already run, not a meter that grows with every search.","oss-bitweave-business-value.98c200b9c5":"Standard CPU","oss-bitweave-business-value.2c291481b3":"No GPU fleet to buy","oss-bitweave-business-value.a45fcbabad":"It runs on the commodity servers in your data centre. There is no specialist accelerator to procure, power, and keep cool just to search your own documents.","oss-bitweave-business-value.6b5eb5323e":"Portable index","oss-bitweave-business-value.6ee462e6b2":"Removes vendor lock-in","oss-bitweave-business-value.704e3827ef":"A portable index and inspectable runtime keep a pricing change or supplier outage from becoming an existential risk to a service you depend on.","oss-bitweave-business-value.3477f4d91d":"Pinned meaning","oss-bitweave-business-value.843226e90e":"De-risks the audit","oss-bitweave-business-value.baf53b401e":"The same pinned semantic contract reproduces the same ordered result on every supported machine. Any change between reviews is explicit, so last quarter's evidence can be reproduced.","oss-bitweave-business-value.ae56e3cb43":"IT SAVES","oss-bitweave-business-value.0cbdf05114":"IT DE-RISKS","oss-bitweave-business-value.949ecb3cbd":"Own it, do not rent it","oss-bitweave-business-value.35a0ab3b85":"You own it","oss-bitweave-business-value.4bc89cb813":"Two savings, two risks reduced","oss-bitweave-business-value.5888802f01":"Each line is a bill you stop paying or a risk you stop carrying","oss-bitweave-business-value.518e9861a1":"Owned, not rented","oss-bitweave-business-value.fa3740bf3c":"The saving","oss-bitweave-business-value.96808098f7":"The safeguard","oss-bitweave-cadence-banners.binaryContract.eyebrow":"BitWeave / representation contract","oss-bitweave-cadence-banners.binaryContract.lead":"Packed bits are useful","oss-bitweave-cadence-banners.binaryContract.accent":"because their meaning is declared","oss-bitweave-cadence-banners.binaryContract.body.one":"At D4096, a native vector occupies sixty-four packed `u64` words. That makes the payload countable, but the bytes alone do not say which encoder, dimension or score contract produced them.","oss-bitweave-cadence-banners.binaryContract.body.two":"The representation release keeps those choices beside the vector state. A rebuilt cache may change the physical layout; changing the encoder contract creates a different semantic release.","oss-bitweave-cadence-banners.binaryContract.panel":"Representation receipt","oss-bitweave-cadence-banners.binaryContract.tag":"DECLARED","oss-bitweave-cadence-banners.binaryContract.item.dimension.label":"Logical dimension","oss-bitweave-cadence-banners.binaryContract.item.dimension.detail":"Operations reject incompatible vector widths.","oss-bitweave-cadence-banners.binaryContract.item.dimension.status":"D4096","oss-bitweave-cadence-banners.binaryContract.item.words.label":"Packed payload","oss-bitweave-cadence-banners.binaryContract.item.words.detail":"Sixty-four machine words hold the native vector.","oss-bitweave-cadence-banners.binaryContract.item.words.status":"512 BYTES","oss-bitweave-cadence-banners.binaryContract.item.score.label":"Score rule","oss-bitweave-cadence-banners.binaryContract.item.score.detail":"Comparison follows an explicit fixed-point contract.","oss-bitweave-cadence-banners.binaryContract.item.score.status":"Q16.16","oss-bitweave-cadence-banners.binaryContract.item.release.label":"Representation release","oss-bitweave-cadence-banners.binaryContract.item.release.detail":"Encoder identity and semantic compatibility travel together.","oss-bitweave-cadence-banners.binaryContract.item.release.status":"IDENTIFIED","oss-bitweave-cadence-banners.binaryContract.verdict":"the payload is compact, while the contract keeps it interpretable","oss-bitweave-cadence-banners.binaryContract.footer":"physical layout can change without quietly changing semantic identity","oss-bitweave-cadence-banners.operationRoute.eyebrow":"BitWeave / one type, several operations","oss-bitweave-cadence-banners.operationRoute.lead":"Different sources meet","oss-bitweave-cadence-banners.operationRoute.accent":"only after their own encoding work","oss-bitweave-cadence-banners.operationRoute.body.one":"Text, image, audio and structured data do not share an intake pipeline. Each source keeps its own feature extraction, evidence and limits before it reaches the binary hypervector contract.","oss-bitweave-cadence-banners.operationRoute.body.two":"Once represented, the same explicit operations can bundle, bind, compare, group or shortlist that state. The application still owns the final meaning of a score or route.","oss-bitweave-cadence-banners.operationRoute.panel":"From source to checked operation","oss-bitweave-cadence-banners.operationRoute.tag":"SCOPED","oss-bitweave-cadence-banners.operationRoute.item.encode.label":"Use a source-specific encoder","oss-bitweave-cadence-banners.operationRoute.item.encode.detail":"Feature evidence remains appropriate to the modality.","oss-bitweave-cadence-banners.operationRoute.item.encode.status":"INPUT","oss-bitweave-cadence-banners.operationRoute.item.represent.label":"Create the declared hypervector","oss-bitweave-cadence-banners.operationRoute.item.represent.detail":"Dimension, codebook and release identity stay attached.","oss-bitweave-cadence-banners.operationRoute.item.represent.status":"STATE","oss-bitweave-cadence-banners.operationRoute.item.operate.label":"Apply the named operation","oss-bitweave-cadence-banners.operationRoute.item.operate.detail":"Nearest search is one option among several.","oss-bitweave-cadence-banners.operationRoute.item.operate.status":"OPERATION","oss-bitweave-cadence-banners.operationRoute.item.verify.label":"Check the result against the task","oss-bitweave-cadence-banners.operationRoute.item.verify.detail":"Task evidence and thresholds remain outside the primitive.","oss-bitweave-cadence-banners.operationRoute.item.verify.status":"EVIDENCE","oss-bitweave-cadence-banners.operationRoute.verdict":"one substrate does not erase the differences between source contracts","oss-bitweave-cadence-banners.operationRoute.footer":"representation is shared; evidence remains specific to the job","oss-bitweave-cadence-banners.durableState.eyebrow":"BitWeave / durable collection state","oss-bitweave-cadence-banners.durableState.lead":"Fast comparison matters","oss-bitweave-cadence-banners.durableState.accent":"only if the state can recover","oss-bitweave-cadence-banners.durableState.body.one":"The collection contract separates logical vector state from the structures used to search it quickly. Schema, metadata and semantic identity survive even when an index or blocked compute cache is rebuilt.","oss-bitweave-cadence-banners.durableState.body.two":"Snapshots, a write-ahead log and explicit recovery rules make the mutation path reviewable. A tombstone remains distinct from physical erasure, and durable acknowledgement depends on the required sync.","oss-bitweave-cadence-banners.durableState.panel":"Recovery readiness","oss-bitweave-cadence-banners.durableState.tag":"RECOVERABLE","oss-bitweave-cadence-banners.durableState.item.schema.label":"Versioned schema","oss-bitweave-cadence-banners.durableState.item.schema.detail":"Identifiers, vectors and typed metadata keep one contract.","oss-bitweave-cadence-banners.durableState.item.schema.status":"KNOWN","oss-bitweave-cadence-banners.durableState.item.snapshot.label":"Checked snapshot","oss-bitweave-cadence-banners.durableState.item.snapshot.detail":"A temporary write and atomic rename protect promotion.","oss-bitweave-cadence-banners.durableState.item.snapshot.status":"VERSIONED","oss-bitweave-cadence-banners.durableState.item.wal.label":"Write-ahead log","oss-bitweave-cadence-banners.durableState.item.wal.detail":"Mutation order and durable acknowledgement stay explicit.","oss-bitweave-cadence-banners.durableState.item.wal.status":"ORDERED","oss-bitweave-cadence-banners.durableState.item.recovery.label":"Recovery path","oss-bitweave-cadence-banners.durableState.item.recovery.detail":"The collection returns before derived indexes are rebuilt.","oss-bitweave-cadence-banners.durableState.item.recovery.status":"READY","oss-bitweave-cadence-banners.durableState.verdict":"semantic state returns before acceleration structures are recreated","oss-bitweave-cadence-banners.durableState.footer":"durability belongs to the collection contract, not to a search index","oss-bitweave-cadence-banners.ownedState.eyebrow":"BitWeave / programme-owned state","oss-bitweave-cadence-banners.ownedState.lead":"Source code is not enough","oss-bitweave-cadence-banners.ownedState.accent":"keep the released representation too","oss-bitweave-cadence-banners.ownedState.body.one":"A working estate includes the encoder choices, codebook, collection schema, vector state and recovery artefacts that make current results reproducible. Rebuilding those choices from source later creates avoidable uncertainty.","oss-bitweave-cadence-banners.ownedState.body.two":"Keeping the release together gives another team a bounded handover. They can restore the collection, inspect its identity and compare a replacement without first reconstructing what the old system meant.","oss-bitweave-cadence-banners.ownedState.panel":"Handover inventory","oss-bitweave-cadence-banners.ownedState.tag":"OWNED","oss-bitweave-cadence-banners.ownedState.item.encoder.label":"Encoder release","oss-bitweave-cadence-banners.ownedState.item.encoder.detail":"Normalisation, codebook, seed and version are retained.","oss-bitweave-cadence-banners.ownedState.item.encoder.status":"KEPT","oss-bitweave-cadence-banners.ownedState.item.collection.label":"Collection contract","oss-bitweave-cadence-banners.ownedState.item.collection.detail":"Schema and semantic identity remain readable.","oss-bitweave-cadence-banners.ownedState.item.collection.status":"KEPT","oss-bitweave-cadence-banners.ownedState.item.snapshot.label":"Restorable state","oss-bitweave-cadence-banners.ownedState.item.snapshot.detail":"Snapshot and recovery evidence travel with the release.","oss-bitweave-cadence-banners.ownedState.item.snapshot.status":"KEPT","oss-bitweave-cadence-banners.ownedState.item.handover.label":"Replacement boundary","oss-bitweave-cadence-banners.ownedState.item.handover.detail":"A new implementation can be compared against the retained asset.","oss-bitweave-cadence-banners.ownedState.item.handover.status":"READY","oss-bitweave-cadence-banners.ownedState.verdict":"the organisation retains the meaning of its vector state, not only the program","oss-bitweave-cadence-banners.ownedState.footer":"a complete release can be restored, inspected and handed to another team","oss-bitweave-candidate-funnel.chrome.path":"One verifier for every candidate","oss-bitweave-candidate-funnel.chrome.status":"one shared verifier","oss-bitweave-candidate-funnel.chrome.meta":"exact / lsh / ivf","oss-bitweave-candidate-funnel.query.label":"one query","oss-bitweave-candidate-funnel.plan.exact.name":"exact scan","oss-bitweave-candidate-funnel.plan.exact.candidates":"Full eligible corpus","oss-bitweave-candidate-funnel.plan.exact.params":"packed SIMD scan","oss-bitweave-candidate-funnel.plan.exact.recall":"recall 1.000","oss-bitweave-candidate-funnel.plan.exact.readout":"Exact scan sends the full eligible corpus to the verifier, so its recall mark is solid: no true neighbour could be omitted before scoring. Where a packed SIMD scan is cheaper, brute force is both the correctness baseline and a valid production mode.","oss-bitweave-candidate-funnel.plan.lsh.name":"LSH","oss-bitweave-candidate-funnel.plan.lsh.candidates":"Outlined candidate set","oss-bitweave-candidate-funnel.plan.lsh.params":"bands and tables declared with the plan","oss-bitweave-candidate-funnel.plan.lsh.recall":"measured per plan","oss-bitweave-candidate-funnel.plan.lsh.readout":"LSH sends an outlined candidate set whose bands and tables are declared with the plan. The verifier still scores every received candidate with complete Hamming; the recall figure belongs to the candidate contract and is measured and reported with it.","oss-bitweave-candidate-funnel.plan.ivf.name":"IVF","oss-bitweave-candidate-funnel.plan.ivf.candidates":"Outlined candidate set","oss-bitweave-candidate-funnel.plan.ivf.params":"probe count declared with the plan","oss-bitweave-candidate-funnel.plan.ivf.recall":"measured per plan","oss-bitweave-candidate-funnel.plan.ivf.readout":"IVF sends an outlined candidate set whose probe count is declared with the plan. Verification is the same complete Hamming pass over received candidates; recall is measured for the plan rather than assumed from the index family.","oss-bitweave-candidate-funnel.verifier.name":"BatchVerifier","oss-bitweave-candidate-funnel.verifier.detail":"Complete Hamming over every received candidate, per-item, serial batch or Rayon by count.","oss-bitweave-candidate-funnel.verifier.tie":"top-k under the declared tie rule","oss-bitweave-candidate-funnel.filter.title":"metadata filter plan, split by selectivity","oss-bitweave-candidate-funnel.filter.pre.label":"pre-filter","oss-bitweave-candidate-funnel.filter.pre.detail":"selective tenant predicate, before candidate generation","oss-bitweave-candidate-funnel.filter.post.label":"post-filter","oss-bitweave-candidate-funnel.filter.post.detail":"broad status predicate, after candidates","oss-bitweave-candidate-funnel.receipt.label.mode":"candidate mode","oss-bitweave-candidate-funnel.receipt.label.count":"candidates","oss-bitweave-candidate-funnel.receipt.label.recall":"recall","oss-bitweave-candidate-funnel.receipt.label.verification":"verification","oss-bitweave-candidate-funnel.receipt.label.k":"k","oss-bitweave-candidate-funnel.receipt.label.tie":"tie-break","oss-bitweave-candidate-funnel.receipt.value.verification":"complete Hamming","oss-bitweave-candidate-funnel.receipt.value.k":"declared by the caller","oss-bitweave-candidate-funnel.receipt.value.tie":"distance, then document ID","oss-bitweave-candidate-funnel.band.left":"candidates are proposals; the verifier decides","oss-bitweave-candidate-funnel.band.right":"mode, count, verification, k, tie-break","oss-bitweave-catalogue-reuse.chrome.path":"One catalogue, many outcomes","oss-bitweave-catalogue-reuse.chrome.status":"four readers, one release","oss-bitweave-catalogue-reuse.chrome.meta":"reuse map","oss-bitweave-catalogue-reuse.hub.title":"Product catalogue","oss-bitweave-catalogue-reuse.hub.collection":"one collection","oss-bitweave-catalogue-reuse.hub.release":"one encoder release","oss-bitweave-catalogue-reuse.hub.legend":"All four features read the same collection and the same encoder release.","oss-bitweave-catalogue-reuse.feature.panels.name":"Similar-product panels","oss-bitweave-catalogue-reuse.feature.panels.note":"related items from the same vectors","oss-bitweave-catalogue-reuse.feature.duplicates.name":"Duplicate listing review","oss-bitweave-catalogue-reuse.feature.duplicates.note":"near-duplicate screening on the same state","oss-bitweave-catalogue-reuse.feature.grouping.name":"Automatic family grouping","oss-bitweave-catalogue-reuse.feature.grouping.note":"neighbourhoods and prototypes over one space","oss-bitweave-catalogue-reuse.feature.routing.name":"Category-routing suggestions","oss-bitweave-catalogue-reuse.feature.routing.note":"new items routed to a category prototype","oss-bitweave-catalogue-reuse.fifth.name":"Visual similarity across product photos","oss-bitweave-catalogue-reuse.fifth.note":"aligned on purpose and labelled as such","oss-bitweave-catalogue-reuse.fifth.tag":"separate aligned image contract","oss-bitweave-catalogue-reuse.band.left":"reuse where the contract already holds","oss-bitweave-catalogue-reuse.band.right":"a named contract where it is made","oss-bitweave-chosen-boundary.chrome.path":"The boundary you choose","oss-bitweave-chosen-boundary.chrome.status":"compare, group and find inside","oss-bitweave-chosen-boundary.chrome.meta":"one chosen boundary","oss-bitweave-chosen-boundary.boundary.label":"the chosen boundary","oss-bitweave-chosen-boundary.inside.folder":"the folder","oss-bitweave-chosen-boundary.inside.patterns":"the patterns","oss-bitweave-chosen-boundary.inside.index":"the index","oss-bitweave-chosen-boundary.action.compare":"compare","oss-bitweave-chosen-boundary.action.group":"group","oss-bitweave-chosen-boundary.action.find":"find","oss-bitweave-chosen-boundary.actions.note":"stay inside","oss-bitweave-chosen-boundary.outside.product":"the surrounding product","oss-bitweave-chosen-boundary.outside.optional":"optional: the product's own choice","oss-bitweave-chosen-boundary.outside.model":"an external model","oss-bitweave-chosen-boundary.move.title":"the same state, later","oss-bitweave-chosen-boundary.move.state":"the versioned state","oss-bitweave-chosen-boundary.move.snapshot":"a compatible snapshot","oss-bitweave-chosen-boundary.move.server":"a private server","oss-bitweave-chosen-boundary.band.text":"the engine runs where the product puts it","oss-bitweave-chosen-boundary.band.meta":"moved deliberately, with a version","oss-bitweave-cluster-state.kicker.label":"Cluster receipt","oss-bitweave-cluster-state.kicker.sub":"what a query needs to name","oss-bitweave-cluster-state.tag":"CLUSTER","oss-bitweave-cluster-state.field.epoch.name":"epoch","oss-bitweave-cluster-state.field.epoch.purpose":"which topology routed the operation","oss-bitweave-cluster-state.field.term.name":"term/leader","oss-bitweave-cluster-state.field.term.purpose":"which Raft state coordinated mutations","oss-bitweave-cluster-state.field.shards.name":"shards","oss-bitweave-cluster-state.field.shards.purpose":"which local indexes participated","oss-bitweave-cluster-state.field.replicas.name":"replicas","oss-bitweave-cluster-state.field.replicas.purpose":"which copies served reads or awaited failover","oss-bitweave-cluster-state.field.merge.name":"merge rule","oss-bitweave-cluster-state.field.merge.purpose":"how local top results became one global order","oss-bitweave-cluster-state.field.rebalance.name":"rebalance state","oss-bitweave-cluster-state.field.rebalance.purpose":"whether movement could affect latency or capacity","oss-bitweave-cluster-state.foot.left":"distribution stays visible","oss-bitweave-cluster-state.foot.right":"topology is named state","oss-bitweave-collection.kicker.label":"One collection contract","oss-bitweave-collection.kicker.sub":"what products share","oss-bitweave-collection.tag":"VECTORDB","oss-bitweave-collection.row.id.component":"document ID","oss-bitweave-collection.row.id.purpose":"stable identity independent of index position","oss-bitweave-collection.row.vector.component":"vector field","oss-bitweave-collection.row.vector.purpose":"native or imported representation with dimension contract","oss-bitweave-collection.row.metadata.component":"metadata fields","oss-bitweave-collection.row.metadata.purpose":"typed filters, ownership and application context","oss-bitweave-collection.row.index.component":"index choice","oss-bitweave-collection.row.index.purpose":"execution policy separable from the corpus","oss-bitweave-collection.row.transaction.component":"transaction scope","oss-bitweave-collection.row.transaction.purpose":"declared atomic mutations where supported","oss-bitweave-collection.row.backup.component":"backup state","oss-bitweave-collection.row.backup.purpose":"portable collection-level recovery","oss-bitweave-collection.foot.left":"the database operates on the type","oss-bitweave-collection.foot.right":"the type stays the contract","oss-bitweave-collection-shared.chrome.path":"Three applications, one collection","oss-bitweave-collection-shared.chrome.status":"three readers, one schema","oss-bitweave-collection-shared.chrome.meta":"shared state","oss-bitweave-collection-shared.app.search.name":"Internal search","oss-bitweave-collection-shared.app.search.note":"vectors and metadata in one read","oss-bitweave-collection-shared.app.duplicates.name":"Duplicate review","oss-bitweave-collection-shared.app.duplicates.note":"near-duplicate screening on the same state","oss-bitweave-collection-shared.app.routing.name":"Routing","oss-bitweave-collection-shared.app.routing.note":"candidate classes from the same vectors","oss-bitweave-collection-shared.collection.title":"One collection","oss-bitweave-collection-shared.collection.note":"The schema the products share; no separate metadata copies.","oss-bitweave-collection-shared.schema.id":"document ID","oss-bitweave-collection-shared.schema.vector":"D4096 vector","oss-bitweave-collection-shared.schema.tenant":"tenant","oss-bitweave-collection-shared.schema.status":"status","oss-bitweave-collection-shared.schema.language":"language","oss-bitweave-collection-shared.schema.source":"source type","oss-bitweave-collection-shared.transaction.title":"one transaction","oss-bitweave-collection-shared.transaction.body":"A vector and its status change together: one commit or one rollback.","oss-bitweave-collection-shared.filters.title":"two filter plans","oss-bitweave-collection-shared.filter.tenant.name":"tenant filter","oss-bitweave-collection-shared.filter.tenant.note":"selective, runs before vector matching","oss-bitweave-collection-shared.filter.status.name":"status filter","oss-bitweave-collection-shared.filter.status.note":"broad, runs after candidates","oss-bitweave-collection-shared.band.left":"one schema and one mutation path settle it at the source","oss-bitweave-collection-shared.band.right":"the products read the same state","oss-bitweave-consumer-everyday.7f7a9f2e62":"Apache 2.0 terms let you keep a licensed copy, once BitWeave publishes.","oss-bitweave-consumer-everyday.d87f8e242c":"You do not need to know how it works. Here is what it quietly does for you in everyday life.","oss-bitweave-consumer-everyday.5dfc859134":"It works on the computer in front of you. Your documents stay home instead of being sent off to a stranger.","oss-bitweave-consumer-everyday.66c4ebb8ae":"When you worry about your privacy","oss-bitweave-consumer-everyday.69f32063b5":"It helps your files open and read cleanly, no matter which program first made them, so nothing gets lost.","oss-bitweave-consumer-everyday.821d00abfd":"When you open a document","oss-bitweave-consumer-everyday.db76bf53c6":"Ask the same thing tomorrow and you get the same answer. It does not quietly change what it told you.","oss-bitweave-consumer-everyday.8c308d9936":"When you want to be sure of the answer","oss-bitweave-consumer-everyday.cdfa87a15b":"It looks through a big pile of papers and brings back the right one quickly, the way a helpful librarian would.","oss-bitweave-consumer-everyday.8c97f52a25":"When you ask the computer to find something","oss-bitweave-consumer-explainer.d1e931c22e":"Put simply","oss-bitweave-consumer-explainer.60ca889ea4":"Like a public recipe in a cookbook. Once you have it, it is yours for good.","oss-bitweave-consumer-explainer.f642b26be0":"Anyone is allowed to use it without paying. Nobody can take it back or lock you out later.","oss-bitweave-consumer-explainer.4296f47a9b":"Free, and yours to keep","oss-bitweave-consumer-explainer.c19f5b32c2":"Like keeping your photos in a drawer at home instead of mailing them to a stranger.","oss-bitweave-consumer-explainer.ce788bf5df":"It runs on the computer you already own. Your documents do not have to be sent off to a company far away.","oss-bitweave-consumer-explainer.749e33fe03":"It stays in your own home","oss-bitweave-consumer-explainer.2a70784b32":"Like using the same edition of a map. Keep the map and the question fixed, and the route stays reproducible.","oss-bitweave-consumer-explainer.1fcb8172fd":"When the files, question, and semantic contract stay the same, a product built with BitWeave reproduces the same ordered result.","oss-bitweave-consumer-explainer.ae07774871":"A result tied to its map","oss-bitweave-consumer-explainer.a323e37da1":"Like a library map that places related books near one another, even when their titles use different words.","oss-bitweave-consumer-explainer.9d986bd4fd":"Products built with BitWeave can map how documents relate, then bring back the files that belong together when you ask a question.","oss-bitweave-consumer-explainer.36621dfdf4":"It gives files a map of meaning","oss-bitweave-consumer-explainer.7ed149da71":"You ask","oss-bitweave-consumer-explainer.e5a1f89c48":"In your own words, for anything you half remember.","oss-bitweave-consumer-explainer.f09449e84d":"It maps the pile","oss-bitweave-consumer-explainer.745987c8a6":"Every paper is placed by what it means, not just the words printed on it.","oss-bitweave-consumer-explainer.257ea0e43a":"You see the related files","oss-bitweave-consumer-explainer.a7c556fc41":"The papers that belong together come back, in the right order.","oss-bitweave-consumer-explainer.6a37a6819c":"Letters","oss-bitweave-consumer-explainer.815465782c":"Bills","oss-bitweave-consumer-explainer.4bec957572":"Forms","oss-bitweave-consumer-explainer.70440046a3":"Notes","oss-bitweave-consumer-explainer.168b7d17ea":"Your pile","oss-bitweave-consumer-explainer.1958b3b594":"The related set","oss-bitweave-consumer-explainer.1251cc0dd7":"What comes back","oss-bitweave-consumer-glyph.ae4b9f9d06":"brings you the right one","oss-bitweave-consumer-glyph.f00f59e220":"It searches only the papers on your own computer.","oss-bitweave-consumer-glyph.f375ad491a":"A calm helper looks","oss-bitweave-consumer-glyph.aca6dd17f0":"Your papers","oss-bitweave-consumer-glyph.02ff2f02db":"asked in plain words","oss-bitweave-consumer-glyph.c7ed7bee69":"Find my letter from the bank.","oss-bitweave-consumer-glyph.4296f47a9b":"Licensed copy, yours to keep","oss-bitweave-consumer-glyph.34e5fa45f5":"The same ordered result","oss-bitweave-consumer-glyph.b899b2957a":"On your chosen machine","oss-bitweave-consumer-safety.7df5301123":"Four everyday worries, four plain answers. Nothing here asks you to be a computer expert, and nothing asks you to simply take our word for it.","oss-bitweave-consumer-safety.1b4f0ecc7e":"Why it is safe","oss-bitweave-consumer-safety.d6e7363b38":"No. It is free and open for anyone. Once you have it, no company can switch it off or lock you out.","oss-bitweave-consumer-safety.b88672ccae":"Can it be taken away?","oss-bitweave-consumer-safety.c5bb4c7d3d":"Yes. When the files and meaning map stay fixed, the ordered result can be reproduced and checked.","oss-bitweave-consumer-safety.f68bffae52":"Can I trust the answer?","oss-bitweave-consumer-safety.3db5e63d86":"No. There is no fee for asking it questions. You are not paying by the question or by the page.","oss-bitweave-consumer-safety.5b2975ea35":"Will I get a surprise bill?","oss-bitweave-consumer-safety.cef967e04f":"Nowhere. They stay on the computer in front of you. Nothing is shipped off to a company you never met.","oss-bitweave-consumer-safety.02154eb4d8":"Where do my documents go?","oss-bitweave-consumer-speed.777fea6369":"All of it on your own computer","oss-bitweave-consumer-speed.01224eb31a":"You ask, it answers. No waiting, no spinning wheel.","oss-bitweave-consumer-speed.168de5eb92":"However big the pile","oss-bitweave-consumer-speed.66253d5ff4":"of papers","oss-bitweave-consumer-speed.07f1f3bd2d":"Even with a mountain of papers, the answer still comes back at once.","oss-bitweave-consumer-speed.9b6802e3dd":"A whole library","oss-bitweave-consumer-speed.ac51f7cecc":"It walks straight to the right drawer and the right page.","oss-bitweave-consumer-speed.3db598871f":"A filing cabinet","oss-bitweave-consumer-speed.5035ac2103":"It lands on the right letter before you finish blinking.","oss-bitweave-consumer-speed.36623fbd93":"A folder of letters","oss-bitweave-consumer-speed.49eb226176":"The same instant answer, whether it is one letter or a whole archive.","oss-bitweave-consumer-steps.eed0829e33":"That is the whole thing. Three plain steps, and your documents never leave home.","oss-bitweave-consumer-steps.0c17892955":"Press find, and your answer appears here.","oss-bitweave-consumer-steps.2379231efe":"Tied to the same map","oss-bitweave-consumer-steps.31ce2eb6ab":"Find my documents","oss-bitweave-consumer-steps.e9ec3c6abc":"Found: Washing machine warranty.pdf","oss-bitweave-consumer-steps.10ad53c211":"It hands you the right document straight away. Ask again next week and you get the very same answer.","oss-bitweave-consumer-steps.dd9f685ab7":"It brings the right one","oss-bitweave-consumer-steps.ede1f108cb":"Looking through your own folder...","oss-bitweave-consumer-steps.94cc6e8a66":"It searches only the documents on your own computer. Nothing is sent away to a company you never met.","oss-bitweave-consumer-steps.1e0f455297":"It looks at home","oss-bitweave-consumer-steps.05938613a7":"Where is my warranty for the washing machine?","oss-bitweave-consumer-steps.9b98e6f140":"Type the thing you are looking for the way you would say it to a person. No special words, no codes.","oss-bitweave-consumer-steps.d296250198":"You ask in plain words","oss-bitweave-contract.kicker.label":"One vector","oss-bitweave-contract.kicker.sub":"what travels with it","oss-bitweave-contract.tag":"CONTRACT","oss-bitweave-contract.vector.label":"the vector","oss-bitweave-contract.vector.note":"fixed width, packed bits","oss-bitweave-contract.field.dimension.field":"dimension","oss-bitweave-contract.field.dimension.name":"The logical width","oss-bitweave-contract.field.dimension.body":"D4096, D8192, D16384 or D32768 under the current type family.","oss-bitweave-contract.field.encoder.field":"encoder","oss-bitweave-contract.field.encoder.name":"How source became bits","oss-bitweave-contract.field.encoder.body":"Name, mode, normalisation and implementation version.","oss-bitweave-contract.field.codebook.field":"codebook","oss-bitweave-contract.field.codebook.name":"The semantic basis","oss-bitweave-contract.field.codebook.body":"Identifier and checksum, so the same token does not quietly mean new bits.","oss-bitweave-contract.field.state.field":"state","oss-bitweave-contract.field.state.name":"Where this vector belongs","oss-bitweave-contract.field.state.body":"Collection, schema, document ID and compatible index state.","oss-bitweave-contract.foot.left":"one logical type","oss-bitweave-contract.foot.right":"and a manifest around it","oss-bitweave-contract-record.chrome.path":"What the encoder records","oss-bitweave-contract-record.chrome.status":"hd algebra","oss-bitweave-contract-record.chrome.meta":"illustrative / d4096","oss-bitweave-contract-record.op.bundle.name":"Bundle","oss-bitweave-contract-record.op.bundle.formula":"maj(a, b, c)","oss-bitweave-contract-record.op.bundle.body":"Majority vote per bit position. Three bound role pairs superpose into one record vector. Bundling is lossy: capacity depends on dimension, contributor count and correlation.","oss-bitweave-contract-record.op.bind.symbol":"XOR","oss-bitweave-contract-record.op.bind.name":"Bind","oss-bitweave-contract-record.op.bind.formula":"a ^ b","oss-bitweave-contract-record.op.bind.body":"XOR per bit. Supplier, country and risk category each bind to their role. Bind again with the same role and the value is recovered exactly.","oss-bitweave-contract-record.op.permute.name":"Permute","oss-bitweave-contract-record.op.permute.formula":"rotl(a, 1)","oss-bitweave-contract-record.op.permute.body":"Cyclic bit shift. Permuted event roles place the same record in a three-event sequence, so order is preserved without growing the vector.","oss-bitweave-contract-record.mark.recoverable":"bind recoverable","oss-bitweave-contract-record.mark.lossy":"bundle lossy","oss-bitweave-contract-record.vis.kicker.before":"32-bit slice of the","oss-bitweave-contract-record.vis.kicker.after":"operation","oss-bitweave-contract-record.vis.row.record":"record","oss-bitweave-contract-record.vis.row.role":"role","oss-bitweave-contract-record.vis.row.out":"out","oss-bitweave-contract-record.vis.compare":"Country role query: bind the bundle with the country role and compare against the country codebook. The nearest item keeps its complete Hamming score.","oss-bitweave-contract-record.band.text":"Four operations compose sets, relations and sequences over one record.","oss-bitweave-contract-record.band.meta":"gf(2), packed bits","oss-bitweave-deploy.19dab0f42e":"portable, built once","oss-bitweave-deploy.bb390c83c5":"three runtimes","oss-bitweave-deploy.4ff1036e09":"one index format","oss-bitweave-deploy.c0641123c6":"deploy :: index.bw","oss-bitweave-deploy.f18b0aa192":"Browser-side retrieval over an index built on a server. Documentation search, code search, client-side privacy.","oss-bitweave-deploy.ca31c0e614":"WASM module","oss-bitweave-deploy.eee56c8206":"A single binary serving structured requests. Useful when several processes share one index or scale retrieval on its own.","oss-bitweave-deploy.c74732565c":"TCP / Unix socket","oss-bitweave-deploy.0e76ed0bd6":"Standalone server","oss-bitweave-deploy.df646158d9":"Embed the index in your search service or knowledge backend. No separate process, no RPC overhead.","oss-bitweave-deploy.4c45dfd9e8":"Rust / C ABI / Python","oss-bitweave-deploy.dd595bccf2":"In-process library","oss-bitweave-dimensions.kicker.label":"Declared dimensions","oss-bitweave-dimensions.kicker.sub":"one logical family","oss-bitweave-dimensions.tag":"BITS","oss-bitweave-dimensions.column.dimension":"dimension","oss-bitweave-dimensions.column.words":"words","oss-bitweave-dimensions.column.bytes":"bytes","oss-bitweave-dimensions.dim.d4096.name":"D4096","oss-bitweave-dimensions.dim.d4096.words":"64","oss-bitweave-dimensions.dim.d4096.bytes":"512","oss-bitweave-dimensions.dim.d4096.purpose":"Common default, compact enough for broad CPU use.","oss-bitweave-dimensions.dim.d8192.name":"D8192","oss-bitweave-dimensions.dim.d8192.words":"128","oss-bitweave-dimensions.dim.d8192.bytes":"1,024","oss-bitweave-dimensions.dim.d8192.purpose":"More representational room at twice the comparison work.","oss-bitweave-dimensions.dim.d16384.name":"D16384","oss-bitweave-dimensions.dim.d16384.words":"256","oss-bitweave-dimensions.dim.d16384.bytes":"2,048","oss-bitweave-dimensions.dim.d16384.purpose":"Larger domains or constructions with more superposition.","oss-bitweave-dimensions.dim.d32768.name":"D32768","oss-bitweave-dimensions.dim.d32768.words":"512","oss-bitweave-dimensions.dim.d32768.bytes":"4,096","oss-bitweave-dimensions.dim.d32768.purpose":"The widest current canonical family.","oss-bitweave-dimensions.foot.left":"dimension is explicit","oss-bitweave-dimensions.foot.right":"and checked before composition","oss-bitweave-durable-state.kicker.label":"Four durability questions","oss-bitweave-durable-state.kicker.sub":"answered separately","oss-bitweave-durable-state.tag":"STATE","oss-bitweave-durable-state.row.released.question":"what was released?","oss-bitweave-durable-state.row.released.answer":"snapshot version and typed section directory","oss-bitweave-durable-state.row.changed.question":"what changed after it?","oss-bitweave-durable-state.row.changed.answer":"WAL sequence and checkpoint","oss-bitweave-durable-state.row.deleted.question":"what was deleted logically?","oss-bitweave-durable-state.row.deleted.answer":"tombstone state","oss-bitweave-durable-state.row.removed.question":"what was removed physically?","oss-bitweave-durable-state.row.removed.answer":"compaction and new snapshot","oss-bitweave-durable-state.footline.left":"snapshot is point-in-time","oss-bitweave-durable-state.footline.right":"live state is snapshot plus change","oss-bitweave-encode-spec.2e9c1415b3":"Same text, same bits","oss-bitweave-encode-spec.c53583fec6":"A document, a query, a passage, or a code symbol all encode to one fixed-width binary hypervector.","oss-bitweave-encode-spec.414154872d":"GF(2), binary","oss-bitweave-encode-spec.c46d09a1ad":"bw-hd :: encoder.spec","oss-bitweave-encode-spec.fe52117751":"Hamming distance over packed bits. A single SIMD popcount path on AVX2, AVX-512 and NEON. The canonical comparison path is binary.","oss-bitweave-encode-spec.90a4236251":"XNOR + POPCNT","oss-bitweave-encode-spec.3bf1eca830":"Similarity","oss-bitweave-encode-spec.822043ba67":"Encodes order and position. \"X then Y\" is distinct from \"Y then X\" without expanding the vector.","oss-bitweave-encode-spec.a8cbfa66d0":"Cyclic shift","oss-bitweave-encode-spec.393bb39440":"Permute","oss-bitweave-encode-spec.0a90c5963e":"Superposes contributing hypervectors. Querying for any contributor returns it with high confidence up to a capacity bound.","oss-bitweave-encode-spec.88ec5d3e4f":"Majority vote","oss-bitweave-encode-spec.23ed731baa":"Bundle","oss-bitweave-encode-spec.1eb485979c":"Commutative, associative, self-inverse. Bind a concept to a role tag, unbind by XOR with the same tag, recover the concept exactly.","oss-bitweave-encode-spec.04e41391d6":"XOR","oss-bitweave-encode-spec.83a9e49fc4":"Bind","oss-bitweave-encode-spec.bc70f8f99a":"Seeded RNG, no wall-clock, no learned weights. The same text produces the same hypervector on every run and every machine.","oss-bitweave-encode-spec.f6798670ec":"Deterministic","oss-bitweave-encode-spec.7dca2524a7":"Encoder","oss-bitweave-encode-spec.80e2dae9fd":"The canonical default. Large enough to discriminate many concepts, small enough to stay in cache. DBpedia embeddings run at d=1536.","oss-bitweave-encode-spec.689f63487f":"4096 bits","oss-bitweave-encode-spec.45e147abd9":"Dimension","oss-bitweave-encoder-choice.kicker.label":"Four routes","oss-bitweave-encoder-choice.kicker.sub":"each operationally explicit","oss-bitweave-encoder-choice.console.title":"Encoder route workbench","oss-bitweave-encoder-choice.console.subtitle":"Four declared routes, each with its advantage and obligation.","oss-bitweave-encoder-choice.tag":"CHOICE","oss-bitweave-encoder-choice.cell.advantage":"advantage","oss-bitweave-encoder-choice.cell.obligation":"obligation","oss-bitweave-encoder-choice.row.native.route":"native","oss-bitweave-encoder-choice.row.native.advantage":"compact direct binary state and HDC composition","oss-bitweave-encoder-choice.row.native.obligation":"evaluate the encoder on the real task","oss-bitweave-encoder-choice.row.imported.route":"imported","oss-bitweave-encoder-choice.row.imported.advantage":"reuse specialised embedding quality","oss-bitweave-encoder-choice.row.imported.obligation":"measure quantisation and re-index on space changes","oss-bitweave-encoder-choice.row.mixed.route":"adaptive","oss-bitweave-encoder-choice.row.mixed.advantage":"packed binary path plus adaptive integer or fixed-point state","oss-bitweave-encoder-choice.row.mixed.obligation":"declare the representation, bounds and hand-off","oss-bitweave-encoder-choice.row.custom.route":"custom","oss-bitweave-encoder-choice.row.custom.advantage":"domain-owned feature representation","oss-bitweave-encoder-choice.row.custom.obligation":"version and test the custom encoder","oss-bitweave-encoder-choice.foot.left":"every conversion is named","oss-bitweave-encoder-choice.foot.right":"each route earns its own evidence","oss-bitweave-eng-close-banner.eyebrow":"The whole engineering argument","oss-bitweave-eng-close-banner.lead":"One logical semantic type.","oss-bitweave-eng-close-banner.accent":"Every trade-off names its layer.","oss-bitweave-eng-close-banner.paragraph.one":"A serious BitWeave evaluation should follow one item through the complete path: normalised source, tokeniser or feature pipeline, codebook, hypervector, algebra, similarity, candidate plan, exact verification, filter, physical layout, selected kernel, collection state, snapshot, WAL and runtime surface. The result should name each layer instead of compressing the system into a search latency.","oss-bitweave-eng-close-banner.paragraph.two":"Then move the state. Reopen the compatible snapshot through another surface. Replay the same operation. Change the encoder and observe that the representation release changes. Change the index and observe that the compatible corpus does not need to be re-encoded. Add a shard and observe that topology changes while the vector contract remains. Those tests reveal whether the representation is infrastructure or merely a hidden side effect.","oss-bitweave-eng-close-banner.panel.header":"One-item inspection","oss-bitweave-eng-close-banner.panel.tag":"source to cluster","oss-bitweave-eng-close-banner.panel.item.manifest":"encoder manifest","oss-bitweave-eng-close-banner.panel.item.algebra":"algebra trace","oss-bitweave-eng-close-banner.panel.item.operation":"operation receipt","oss-bitweave-eng-close-banner.panel.item.exactness":"exactness report","oss-bitweave-eng-close-banner.panel.item.kernel":"kernel selection","oss-bitweave-eng-close-banner.panel.item.snapshot":"snapshot directory","oss-bitweave-eng-close-banner.panel.item.mutation":"mutation state","oss-bitweave-eng-close-banner.panel.item.epoch":"cluster epoch","oss-bitweave-eng-close-banner.panel.item.surface":"surface response","oss-bitweave-eng-close-banner.verdict":"the query is one method; BitWeave is the explicit semantic state around it","oss-bitweave-eng-close-banner.footline":"inspect the bits, the contract, the state and the path that served them","oss-bitweave-exactness.kicker.label":"Four separate claims","oss-bitweave-exactness.kicker.sub":"each reported on its own","oss-bitweave-exactness.tag":"EXACTNESS","oss-bitweave-exactness.claim.encoding.stage":"encoding","oss-bitweave-exactness.claim.encoding.question":"Did the same contract produce the vector?","oss-bitweave-exactness.claim.encoding.answer":"reproducible or changed","oss-bitweave-exactness.claim.candidates.stage":"candidates","oss-bitweave-exactness.claim.candidates.question":"Could the true neighbour have been omitted?","oss-bitweave-exactness.claim.candidates.answer":"exact or approximate","oss-bitweave-exactness.claim.score.stage":"score","oss-bitweave-exactness.claim.score.question":"Was full Hamming evaluated for this candidate?","oss-bitweave-exactness.claim.score.answer":"complete or coarse","oss-bitweave-exactness.claim.filter-order.stage":"filter/order","oss-bitweave-exactness.claim.filter-order.question":"Were predicates and tie-breaks exact?","oss-bitweave-exactness.claim.filter-order.answer":"declared and deterministic","oss-bitweave-exactness.foot.left":"four claims","oss-bitweave-exactness.foot.right":"each one reported independently","oss-bitweave-four-moments.chrome.path":"Four familiar product moments","oss-bitweave-four-moments.chrome.status":"four moments, one engine","oss-bitweave-four-moments.chrome.meta":"illustrative","oss-bitweave-four-moments.layer.feature":"what the person sees","oss-bitweave-four-moments.layer.engine":"what the engine returns","oss-bitweave-four-moments.moment.duplicates.feature":"duplicate photo review","oss-bitweave-four-moments.moment.duplicates.result":"distance","oss-bitweave-four-moments.moment.notes.feature":"related note discovery","oss-bitweave-four-moments.moment.notes.result":"neighbourhood","oss-bitweave-four-moments.moment.family.feature":"product family suggestion","oss-bitweave-four-moments.moment.family.result":"prototype score","oss-bitweave-four-moments.moment.lookup.feature":"private source lookup","oss-bitweave-four-moments.moment.lookup.result":"ordered IDs","oss-bitweave-four-moments.note":"The result is usually an ID, a distance, a score or a group. The product decides how to show it.","oss-bitweave-four-moments.band.text":"four familiar moments, one relationship engine","oss-bitweave-four-moments.band.meta":"result first, screen second","oss-bitweave-handover.chrome.path":"A release bundle that travels","oss-bitweave-handover.chrome.status":"state id verified","oss-bitweave-handover.chrome.meta":"bundle vs endpoint","oss-bitweave-handover.owned.kicker":"the release bundle","oss-bitweave-handover.owned.from":"handing team","oss-bitweave-handover.owned.to":"receiving team","oss-bitweave-handover.bundle.source":"source code reference","oss-bitweave-handover.bundle.manifest":"encoder manifest","oss-bitweave-handover.bundle.codebook":"codebook","oss-bitweave-handover.bundle.backup":"collection backup","oss-bitweave-handover.bundle.snapshot":".bwks snapshot","oss-bitweave-handover.bundle.receipt":"benchmark receipt","oss-bitweave-handover.check.inProcess":"reopened in-process","oss-bitweave-handover.check.server":"reopened behind a server","oss-bitweave-handover.check.operation":"one operation reproduced","oss-bitweave-handover.check.stateId":"state id verified","oss-bitweave-handover.endpoint.kicker":"endpoint-only handover","oss-bitweave-handover.endpoint.step.login":"a login to the hosted service","oss-bitweave-handover.endpoint.step.export":"an export to be arranged later","oss-bitweave-handover.endpoint.step.terminated":"contract terminated","oss-bitweave-handover.endpoint.end.title":"export missing","oss-bitweave-handover.endpoint.end.sub":"the state never left the endpoint","oss-bitweave-handover.band.left":"one bundle, not a login and a later export","oss-bitweave-handover.band.right":"state id verified on receipt","oss-bitweave-hdc.0bc695e72f":"GF(2), binary hot path","oss-bitweave-hdc.d9d544c65d":"Bundle, bind, and permute compose. A sentence is a bundle of word bindings; a document is a bundle of sentences.","oss-bitweave-hdc.1b7a55e08c":"32-bit slice of the","oss-bitweave-hdc.ebee3b5d70":"default 4096 bits","oss-bitweave-hdc.04b98cb687":"GF(2) algebra","oss-bitweave-hdc.15a897064a":"bw-hd :: hypervector","oss-bitweave-hdc.6b177d90fd":"Cyclic bit shift. Encodes order and position so that \"X then Y\" differs from \"Y then X\" without growing the vector.","oss-bitweave-hdc.f95fff9523":"rotl(a, 1)","oss-bitweave-hdc.393bb39440":"Permute","oss-bitweave-hdc.38550ab415":"XOR per bit. Binds a key to a value; XOR with the same key recovers the value exactly, since XOR is its own inverse.","oss-bitweave-hdc.30d8eeb430":"a ^ b","oss-bitweave-hdc.83a9e49fc4":"Bind","oss-bitweave-hdc.04e41391d6":"XOR","oss-bitweave-hdc.81059a618b":"Majority vote per bit position. Bundles a set of concepts into one hypervector that still answers for each member.","oss-bitweave-hdc.c9fd902649":"maj(a, b, ...)","oss-bitweave-hdc.23ed731baa":"Bundle","oss-bitweave-hero-glyph.brandLabel":"BitWeave","oss-bitweave-hero-glyph.209f23a161":"CPU only","oss-bitweave-hero-glyph.e9580ef3e0":"no GPU","oss-bitweave-hero-glyph.b7a011c9e6":"-bit hypervectors","oss-bitweave-hero-glyph.d59ed14bf9":"RUST","oss-bitweave-hero-glyph.c1f65ddb75":"Engine","oss-bitweave-hero-glyph.1b290eb385":"Cargo.toml","oss-bitweave-hero-glyph.6581d1dc66":"SearchHit, top-k","oss-bitweave-hero-glyph.e2ae20d9ae":"Rust","oss-bitweave-hero-glyph.44a8aa6dc3":"Binary semantic engine,","oss-bitweave-hero-glyph.373de7a391":"AVX2, CPU","oss-bitweave-hero-glyph.c614ba7c45":"Auto","oss-bitweave-index-ladder.21f5b675ce":"1.000 recall on the exact paths","oss-bitweave-index-ladder.63533a4248":"One set of hypervectors feeds every index. Swap the backend without re-encoding the corpus.","oss-bitweave-index-ladder.33680ccdb3":"Architectural","oss-bitweave-index-ladder.9550373e8b":"Measured","oss-bitweave-index-ladder.b924bd3b7c":"pick per scale","oss-bitweave-index-ladder.28904242ea":"same hypervectors","oss-bitweave-index-ladder.7aac0d02ae":"bw-search :: index families","oss-bitweave-index-ladder.4fa14d7585":"Inverted-file partitioning for cold-start on large datasets. Probes a subset of cells per query.","oss-bitweave-index-ladder.19e6b9a1fb":"very large corpora","oss-bitweave-index-ladder.ee263b044b":"IVF","oss-bitweave-index-ladder.b253fb6492":"Locality-sensitive hashing with multiple band families. Trade recall for throughput by widening bands.","oss-bitweave-index-ladder.52cf4214bd":"large corpora","oss-bitweave-index-ladder.1316183ae7":"LSH","oss-bitweave-index-ladder.7e1b12c1fc":"LSH candidate generation plus an exact rescore. The default for exact search; throughput depends on the corpus, bands, candidate budget and hardware.","oss-bitweave-index-ladder.18f0c385ae":"1.000 exact","oss-bitweave-index-ladder.41d898876d":"10K docs and up","oss-bitweave-index-ladder.9aece73774":"Hybrid-MultiQ","oss-bitweave-index-ladder.a2451326f1":"SIMD scan of every vector, batched four queries per register. At D4096 over 10K documents, measured Hybrid-MultiQ reached 35,842 QPS on random data, 34,459 on clustered data and 27,828 on text-derived data, all at recall 1.000.","oss-bitweave-index-ladder.4d710b1ee7":"up to ~100K docs","oss-bitweave-index-ladder.6e393db513":"BruteForce-MultiQ","oss-bitweave-index-ladder.3858fc5c12":"Best pick by corpus size","oss-bitweave-intake-matrix.kicker.label":"Entrances","oss-bitweave-intake-matrix.kicker.sub":"not assumed alignment","oss-bitweave-intake-matrix.tag":"ENCODERS","oss-bitweave-intake-matrix.row.image.name":"image","oss-bitweave-intake-matrix.row.image.evidence":"patches, texture, gradients, colour, optional learned features","oss-bitweave-intake-matrix.row.image.destination":"binary hypervector","oss-bitweave-intake-matrix.row.audio.name":"audio","oss-bitweave-intake-matrix.row.audio.evidence":"frames, spectrum, mel bands, temporal roles","oss-bitweave-intake-matrix.row.audio.destination":"binary hypervector or facets","oss-bitweave-intake-matrix.row.structured.name":"structured","oss-bitweave-intake-matrix.row.structured.evidence":"named application features","oss-bitweave-intake-matrix.row.structured.destination":"binary hypervector","oss-bitweave-intake-matrix.row.imported.name":"external source vector","oss-bitweave-intake-matrix.row.imported.evidence":"one-way quantiser, codebooks and error contract","oss-bitweave-intake-matrix.row.imported.destination":"declared binary, ternary or adaptive integer/fixed-point state","oss-bitweave-intake-matrix.foot.left":"same destination type","oss-bitweave-intake-matrix.foot.right":"alignment remains an explicit contract","oss-bitweave-keep-it.chrome.path":"Keep the state with the work","oss-bitweave-keep-it.chrome.status":"the state travels, the labels stay","oss-bitweave-keep-it.chrome.meta":"apache 2.0","oss-bitweave-keep-it.stop.app":"an embedded app","oss-bitweave-keep-it.stop.server":"a private server","oss-bitweave-keep-it.stop.local":"a small compatible local build","oss-bitweave-keep-it.stop.state":"the same versioned state","oss-bitweave-keep-it.attached.label":"still attached","oss-bitweave-keep-it.attached.encoder":"encoder ID","oss-bitweave-keep-it.attached.version":"state version","oss-bitweave-keep-it.attached.receipt":"operation receipt","oss-bitweave-keep-it.rights.title":"kept under the licence","oss-bitweave-keep-it.right.inspect":"inspect","oss-bitweave-keep-it.right.embed":"embed","oss-bitweave-keep-it.right.modify":"modify","oss-bitweave-keep-it.right.rebuild":"rebuild","oss-bitweave-keep-it.right.keep":"keep","oss-bitweave-keep-it.scope.title":"belongs to the product above","oss-bitweave-keep-it.scope.judgement":"judgement","oss-bitweave-keep-it.scope.alignment":"cross-modal alignment","oss-bitweave-keep-it.scope.answer":"any generated answer","oss-bitweave-keep-it.band.text":"keep the code, keep the state","oss-bitweave-keep-it.band.meta":"apache 2.0","oss-bitweave-kernel-plan.kicker.label":"Plan inputs","oss-bitweave-kernel-plan.kicker.sub":"before one instruction is issued","oss-bitweave-kernel-plan.tag":"EXECUTE","oss-bitweave-kernel-plan.input.host.name":"host ISA","oss-bitweave-kernel-plan.input.host.effect":"selects supported scalar or SIMD kernel","oss-bitweave-kernel-plan.input.candidates.name":"candidate count","oss-bitweave-kernel-plan.input.candidates.effect":"per-item, serial batch or Rayon path","oss-bitweave-kernel-plan.input.batch.name":"query batch","oss-bitweave-kernel-plan.input.batch.effect":"interactive lane, tiled multi-query or GPU batch","oss-bitweave-kernel-plan.input.cache.name":"layout cache","oss-bitweave-kernel-plan.input.cache.effect":"reuse existing blocked state or regenerate after mutation","oss-bitweave-kernel-plan.input.transfer.name":"device transfer","oss-bitweave-kernel-plan.input.transfer.effect":"GPU only when upload and download are amortised","oss-bitweave-kernel-plan.foot.left":"the fastest path depends on shape","oss-bitweave-kernel-plan.foot.right":"the score contract does not","oss-bitweave-layer-cutaway.kicker.label":"Six layers","oss-bitweave-layer-cutaway.kicker.sub":"what each one owns","oss-bitweave-layer-cutaway.tag":"LAYERS","oss-bitweave-layer-cutaway.flow.label":"dependencies flow up","oss-bitweave-layer-cutaway.layer.surfaces.name":"Surfaces","oss-bitweave-layer-cutaway.layer.surfaces.body":"SDK, CLI, server, ABI, Python and suitable WebAssembly builds.","oss-bitweave-layer-cutaway.layer.conversion.name":"Conversion","oss-bitweave-layer-cutaway.layer.conversion.body":"Compression and quantisation for compatible external or archival state.","oss-bitweave-layer-cutaway.layer.data.name":"Data","oss-bitweave-layer-cutaway.layer.data.body":"Collections, schemas, metadata, transactions, storage, recovery and mapping.","oss-bitweave-layer-cutaway.layer.operations.name":"Operations","oss-bitweave-layer-cutaway.layer.operations.body":"Similarity, indexes, filters, routing, reranking and multi-vector interaction.","oss-bitweave-layer-cutaway.layer.encoding.name":"Encoding","oss-bitweave-layer-cutaway.layer.encoding.body":"Text, image, audio, structured and custom paths into the logical type.","oss-bitweave-layer-cutaway.layer.compute.name":"Compute","oss-bitweave-layer-cutaway.layer.compute.body":"Packed vectors, HDC algebra, scores, layouts and scalar or accelerated kernels.","oss-bitweave-layer-cutaway.foot.left":"dependencies flow up","oss-bitweave-layer-cutaway.foot.right":"the vector contract flows through","oss-bitweave-local-choices.tag":"LOCAL","oss-bitweave-local-choices.kicker.label":"Where it may run","oss-bitweave-local-choices.kicker.sub":"chosen by the product","oss-bitweave-local-choices.place.app.name":"inside the app","oss-bitweave-local-choices.place.app.fit":"small or medium local features and lowest boundary count","oss-bitweave-local-choices.place.server.name":"private server","oss-bitweave-local-choices.place.server.fit":"shared collection inside an organisation","oss-bitweave-local-choices.place.edge.name":"browser or edge","oss-bitweave-local-choices.place.edge.fit":"smaller compatible state and offline use","oss-bitweave-local-choices.place.cluster.name":"cluster","oss-bitweave-local-choices.place.cluster.fit":"larger collections split across several machines","oss-bitweave-local-choices.foot.left":"the engine runs where you put it","oss-bitweave-local-choices.foot.right":"the surrounding product keeps its own settings","oss-bitweave-lsh-bands.183f338136":"Band split","oss-bitweave-lsh-bands.a2ba57b432":"Each hypervector splits into equal-size bands. Band layout is fixed at index time so every vector and query is split the same way.","oss-bitweave-lsh-bands.4a50b5aacd":"Band hash","oss-bitweave-lsh-bands.10dea1c8ae":"Each band hashes into a bucket in a flat hash table. A bucket lookup is a single dereference, not a scan.","oss-bitweave-lsh-bands.346f26c50b":"Candidate union","oss-bitweave-lsh-bands.97bf7860b5":"A query hashes the same way and hits the same buckets. The candidate set is the union of hits across all bands. Multi-query batching packs four queries per SIMD register.","oss-bitweave-lsh-bands.5fed8decbd":"Exact rescore","oss-bitweave-lsh-bands.c5e73b1f24":"Candidates are rescored exactly with full Hamming distance. Top-k is returned with deterministic tie-breaking on (distance, doc_id), bounded by candidate count, not index size.","oss-bitweave-lsh-bands.26b93639a8":"bw-search :: lsh.bands","oss-bitweave-lsh-bands.05183f4f7d":"bands collide","oss-bitweave-lsh-bands.ad902d7ce0":"sublinear candidates","oss-bitweave-lsh-bands.d8eb6a2bee":"query hypervector, split into","oss-bitweave-lsh-bands.65438b0785":"candidate set,","oss-bitweave-lsh-bands.6835d85203":"buckets hit","oss-bitweave-lsh-bands.70d820dbe8":"A query touches only the buckets it lands in. Rescore is bounded by the candidate count, not the index size.","oss-bitweave-lsh-bands.eb4537c68f":"Exact final score; measured D4096/10K sweep: 35,842, 34,459 or 27,828 QPS at recall 1.000","oss-bitweave-lsh-bands.9999c2cc9b":"Collision key","oss-bitweave-lsh-bands.130a928320":"Band collides","oss-bitweave-lsh-bands.eef732c385":"Band misses","oss-bitweave-manifest.kicker.label":"Encoder manifest","oss-bitweave-manifest.kicker.sub":"minimum durable fields","oss-bitweave-manifest.tag":"MANIFEST","oss-bitweave-manifest.field.mode.field":"source mode","oss-bitweave-manifest.field.mode.example":"text/document","oss-bitweave-manifest.field.mode.why":"Distinguishes one bundled vector from token-level facets.","oss-bitweave-manifest.field.pipeline.field":"pipeline","oss-bitweave-manifest.field.pipeline.example":"BPE + hash projection","oss-bitweave-manifest.field.pipeline.why":"Names the transformations that preserve task structure.","oss-bitweave-manifest.field.codebook.field":"codebook","oss-bitweave-manifest.field.codebook.example":"id + checksum","oss-bitweave-manifest.field.codebook.why":"Prevents a token from mapping to changed bits silently.","oss-bitweave-manifest.field.dimension.field":"dimension","oss-bitweave-manifest.field.dimension.example":"D4096","oss-bitweave-manifest.field.dimension.why":"Defines every later algebra and metric operation.","oss-bitweave-manifest.field.seed.field":"seed/version","oss-bitweave-manifest.field.seed.example":"pinned","oss-bitweave-manifest.field.seed.why":"Makes regeneration and comparison possible.","oss-bitweave-manifest.foot.left":"same source plus same manifest","oss-bitweave-manifest.foot.right":"same vector under the supported contract","oss-bitweave-measured-plan.chrome.path":"The complete benchmark","oss-bitweave-measured-plan.chrome.status":"recall 1.000 measured","oss-bitweave-measured-plan.chrome.meta":"dbpedia 100k / 10k sweep / 250k exact","oss-bitweave-measured-plan.receipt.kicker":"the published run, complete","oss-bitweave-measured-plan.receipt.figureLabel":"queries per second at recall 1.000","oss-bitweave-measured-plan.receipt.corpus.field":"corpus","oss-bitweave-measured-plan.receipt.corpus.value":"DBpedia, 100,000 documents","oss-bitweave-measured-plan.receipt.dimension.field":"source dimension","oss-bitweave-measured-plan.receipt.dimension.value":"1,536","oss-bitweave-measured-plan.receipt.path.field":"path","oss-bitweave-measured-plan.receipt.path.value":"exact multi-query","oss-bitweave-measured-plan.receipt.host.field":"host","oss-bitweave-measured-plan.receipt.host.value":"i9-13900KF, 24 cores, AVX2, 48 GB","oss-bitweave-measured-plan.receipt.result.field":"result","oss-bitweave-measured-plan.receipt.result.value":"9,473 QPS, recall 1.000, 19 MB","oss-bitweave-measured-plan.receipt.comparison.field":"comparison","oss-bitweave-measured-plan.receipt.comparison.value":"3,580 QPS, 38 MB, same host and data","oss-bitweave-measured-plan.sweep.kicker":"the 10k distribution sweep","oss-bitweave-measured-plan.sweep.sub":"d4096 over 10,000 documents, hybrid-multiq","oss-bitweave-measured-plan.sweep.random.label":"random","oss-bitweave-measured-plan.sweep.clustered.label":"clustered","oss-bitweave-measured-plan.sweep.text.label":"text-derived","oss-bitweave-measured-plan.sweep.recall":"recall 1.000","oss-bitweave-measured-plan.sweep.unit":"QPS","oss-bitweave-measured-plan.exact.kicker":"the 250k exact lane","oss-bitweave-measured-plan.exact.figureLabel":"queries per second, exact scan","oss-bitweave-measured-plan.exact.fact.corpus":"250,000 documents","oss-bitweave-measured-plan.exact.fact.path":"exact multi-query brute force","oss-bitweave-measured-plan.exact.fact.recall":"recall 1.000","oss-bitweave-measured-plan.worksheet.kicker":"capacity worksheet","oss-bitweave-measured-plan.worksheet.exact.label":"exact, 19 MB","oss-bitweave-measured-plan.worksheet.exact.slot":"19 MB","oss-bitweave-measured-plan.worksheet.exact.count":"two corpus copies per allocation","oss-bitweave-measured-plan.worksheet.comparison.label":"two-bit, 38 MB","oss-bitweave-measured-plan.worksheet.comparison.slot":"38 MB","oss-bitweave-measured-plan.worksheet.comparison.count":"one corpus copy per allocation","oss-bitweave-measured-plan.worksheet.note":"At a fixed storage allocation sized for the measured comparison configuration, the exact configuration holds two copies of the corpus.","oss-bitweave-measured-plan.band.left":"read the recall contract before the throughput","oss-bitweave-measured-plan.band.right":"9,473 qps / recall 1.000 / 19 mb","oss-bitweave-modal-pipelines.chrome.path":"Many inputs, one destination","oss-bitweave-modal-pipelines.chrome.status":"one destination type","oss-bitweave-modal-pipelines.chrome.meta":"three conversion paths","oss-bitweave-modal-pipelines.native.image.source":"image","oss-bitweave-modal-pipelines.native.image.stage1":"patches","oss-bitweave-modal-pipelines.native.image.stage2":"feature descriptors","oss-bitweave-modal-pipelines.native.image.out":"D4096 logical vector","oss-bitweave-modal-pipelines.native.image.manifest":"manifest: image path","oss-bitweave-modal-pipelines.native.audio.source":"audio","oss-bitweave-modal-pipelines.native.audio.stage1":"temporal windows","oss-bitweave-modal-pipelines.native.audio.stage2":"mel bands","oss-bitweave-modal-pipelines.native.audio.out":"D4096 logical vector","oss-bitweave-modal-pipelines.native.audio.manifest":"manifest: audio path","oss-bitweave-modal-pipelines.native.alignment":"alignment required","oss-bitweave-modal-pipelines.imported.title":"external source, outside BitWeave","oss-bitweave-modal-pipelines.imported.source":"1,536-d FP32 source vector","oss-bitweave-modal-pipelines.imported.meta":"6,144 B before one-way conversion","oss-bitweave-modal-pipelines.imported.boundary.label":"measured one-way conversion","oss-bitweave-modal-pipelines.imported.boundary.note":"inside: no FP32 state, bus, score or compute","oss-bitweave-modal-pipelines.path.int8.name":"INT8","oss-bitweave-modal-pipelines.path.int8.detail":"one byte per dimension","oss-bitweave-modal-pipelines.path.int8.size":"1,536 B","oss-bitweave-modal-pipelines.path.int8.ordering":"ordering closest to the source","oss-bitweave-modal-pipelines.path.int8.readout":"The one-way conversion produces a declared INT8 state at 1,536 B. BitWeave stores, compares and scores that quantised representation; the FP32 source state does not cross the boundary. Its measured ordering error against the source space is the smallest, and the quantiser travels with the imported representation contract.","oss-bitweave-modal-pipelines.path.ternary.name":"ternary","oss-bitweave-modal-pipelines.path.ternary.detail":"about two bits per dimension","oss-bitweave-modal-pipelines.path.ternary.size":"384 B","oss-bitweave-modal-pipelines.path.ternary.ordering":"small measured ordering drift","oss-bitweave-modal-pipelines.path.ternary.readout":"The one-way conversion produces a declared ternary state at 384 B, a quarter of the INT8 state. BitWeave stores, compares and scores that quantised representation; the ordering drift against the source space is measured and declared with the conversion, and the codebooks and training data behind it become part of the contract.","oss-bitweave-modal-pipelines.path.binary.name":"binary","oss-bitweave-modal-pipelines.path.binary.detail":"one sign bit per dimension","oss-bitweave-modal-pipelines.path.binary.size":"192 B","oss-bitweave-modal-pipelines.path.binary.ordering":"the coarsest ordering of the three","oss-bitweave-modal-pipelines.path.binary.readout":"The one-way sign conversion produces a declared binary state at 192 B. BitWeave stores, compares and scores that packed representation, never the FP32 source. It is the smallest state and the largest measured ordering error of the three, reported on its own rather than inheriting the native binary claim.","oss-bitweave-modal-pipelines.band.left":"image and audio arrive through their own evidence; external vectors stop at measured conversion","oss-bitweave-modal-pipelines.band.right":"alignment stays an explicit contract","oss-bitweave-mutation-timeline.chrome.path":"Every change stays traceable","oss-bitweave-mutation-timeline.chrome.status":"three intact entries replayed","oss-bitweave-mutation-timeline.chrome.meta":"ORDERED SEQUENCE","oss-bitweave-mutation-timeline.event.insert.name":"insert","oss-bitweave-mutation-timeline.event.insert.body":"WAL append with sequence and checksum; collection updated, blocked layout cache invalidated","oss-bitweave-mutation-timeline.event.second.name":"insert","oss-bitweave-mutation-timeline.event.second.body":"appended in order under its own sequence and checksum","oss-bitweave-mutation-timeline.event.delete.name":"delete","oss-bitweave-mutation-timeline.event.delete.body":"a tombstone is written; logically gone at once, physically present until compaction","oss-bitweave-mutation-timeline.event.crash.name":"crash","oss-bitweave-mutation-timeline.event.crash.body":"the log stops after three entries","oss-bitweave-mutation-timeline.event.recovery.name":"recovery","oss-bitweave-mutation-timeline.event.recovery.body":"the last valid snapshot opens and the three intact entries replay","oss-bitweave-mutation-timeline.event.compact.name":"checkpoint + compact","oss-bitweave-mutation-timeline.event.compact.body":"a new .bwks base, physical dead weight removed","oss-bitweave-mutation-timeline.wal.label":"the write-ahead log","oss-bitweave-mutation-timeline.wal.one.state":"intact","oss-bitweave-mutation-timeline.wal.two.state":"intact","oss-bitweave-mutation-timeline.wal.three.state":"tombstone","oss-bitweave-mutation-timeline.wal.four.state":"torn, refused","oss-bitweave-mutation-timeline.wal.caption":"recovery replays the intact entries and refuses the torn fourth","oss-bitweave-mutation-timeline.mapped.label":"memory-mapped snapshot","oss-bitweave-mutation-timeline.mapped.file":"shared .bwks snapshot","oss-bitweave-mutation-timeline.mapped.reader.one":"reader A faults in its pages","oss-bitweave-mutation-timeline.mapped.reader.two":"reader B faults in different pages","oss-bitweave-mutation-timeline.mapped.caption":"shared immutable readers; the operating system owns paging","oss-bitweave-mutation-timeline.band.left":"recorded before it is applied","oss-bitweave-mutation-timeline.band.right":"REPLAY STOPS AT THE TEAR","oss-bitweave-no-reach-through.chrome.path":"Layers keep their boundaries","oss-bitweave-no-reach-through.chrome.status":"three pass, one stopped","oss-bitweave-no-reach-through.chrome.meta":"six sheets, one rail","oss-bitweave-no-reach-through.stack.kicker":"six sheets, one vector rail","oss-bitweave-no-reach-through.sheet.surfaces":"L6 surfaces","oss-bitweave-no-reach-through.sheet.conversion":"L5 conversion","oss-bitweave-no-reach-through.sheet.data":"L4 data","oss-bitweave-no-reach-through.sheet.operations":"L3 operations","oss-bitweave-no-reach-through.sheet.encoding":"L2 encoding","oss-bitweave-no-reach-through.sheet.compute":"L1 compute","oss-bitweave-no-reach-through.stack.caption":"the vector contract flows through every sheet","oss-bitweave-no-reach-through.change.tokeniser.name":"A new tokeniser","oss-bitweave-no-reach-through.change.tokeniser.body":"Touches only encoding and produces the same declared destination type.","oss-bitweave-no-reach-through.change.tokeniser.touches":"encoding only","oss-bitweave-no-reach-through.change.index.name":"A new index","oss-bitweave-no-reach-through.change.index.body":"Touches operations and data without entering the encoder.","oss-bitweave-no-reach-through.change.index.touches":"operations and data","oss-bitweave-no-reach-through.change.browser.name":"A browser surface","oss-bitweave-no-reach-through.change.browser.body":"Touches the top layer and reads a compatible snapshot.","oss-bitweave-no-reach-through.change.browser.touches":"surfaces only","oss-bitweave-no-reach-through.change.http.name":"An HTTP parameter redefining score normalisation","oss-bitweave-no-reach-through.change.http.body":"Tries to reach from the surface down into compute and change what a score means.","oss-bitweave-no-reach-through.change.http.touches":"surfaces reaching compute","oss-bitweave-no-reach-through.change.http.reason":"Stopped: a surface may select a declared mode, not invent a different primitive.","oss-bitweave-no-reach-through.pass.badge":"passes","oss-bitweave-no-reach-through.stop.badge":"stopped","oss-bitweave-no-reach-through.band.text":"A change names the layer it touches.","oss-bitweave-no-reach-through.band.meta":"boundaries hold","oss-bitweave-operation-field.kicker.label":"Operation field","oss-bitweave-operation-field.kicker.sub":"one representation at the centre","oss-bitweave-operation-field.tag":"OPERATE","oss-bitweave-operation-field.row.find.name":"find","oss-bitweave-operation-field.row.find.operations":"nearest, range, retrieve, hybrid text and vector","oss-bitweave-operation-field.row.compare.name":"compare","oss-bitweave-operation-field.row.compare.operations":"distance, near duplicate, version relation","oss-bitweave-operation-field.row.group.name":"group","oss-bitweave-operation-field.row.group.operations":"similarity clusters, neighbourhoods, prototypes","oss-bitweave-operation-field.row.decide.name":"decide","oss-bitweave-operation-field.row.decide.operations":"threshold, route, candidate shortlist","oss-bitweave-operation-field.row.interact.name":"interact","oss-bitweave-operation-field.row.interact.operations":"MaxSim over token, patch or frame facets","oss-bitweave-operation-field.foot.left":"search is visible","oss-bitweave-operation-field.foot.right":"and it shares the hub with seven others","oss-bitweave-outcome-families.kicker.label":"Five outcome families","oss-bitweave-outcome-families.kicker.sub":"one bounded domain","oss-bitweave-outcome-families.tag":"REUSE","oss-bitweave-outcome-families.row.find.family":"find","oss-bitweave-outcome-families.row.find.outcome":"related items and context candidates","oss-bitweave-outcome-families.row.compare.family":"compare","oss-bitweave-outcome-families.row.compare.outcome":"distance, duplicate likelihood and version relation","oss-bitweave-outcome-families.row.group.family":"group","oss-bitweave-outcome-families.row.group.outcome":"similarity neighbourhoods and prototypes","oss-bitweave-outcome-families.row.route.family":"route","oss-bitweave-outcome-families.row.route.outcome":"send an item towards a candidate class or workflow","oss-bitweave-outcome-families.row.check.family":"check","oss-bitweave-outcome-families.row.check.outcome":"inside or outside a declared distance threshold","oss-bitweave-outcome-families.foot.left":"one semantic asset","oss-bitweave-outcome-families.foot.right":"several operations over it","oss-bitweave-overview.b80c17b392":"1.000 recall","oss-bitweave-overview.6b5eb5323e":"Binary HDC","oss-bitweave-overview.e5cf775c25":"Rust · Apache 2.0","oss-bitweave-overview.e891a65911":"Self-hosted, with no telemetry or per-query meter. Once BitWeave publishes, pin a version and inspect every layer.","oss-bitweave-overview.027ec6f663":"On your servers","oss-bitweave-overview.0560af982b":"Saturates SIMD on commodity hardware. A GPU backend exists for the very largest corpora, but the headline numbers are pure CPU.","oss-bitweave-overview.98c200b9c5":"Standard CPU","oss-bitweave-overview.18b73af740":"Seeded RNG, no wall-clock, tie-breaking sorted on (distance, doc_id). The same query returns the same result on x86, ARM, and WASM.","oss-bitweave-overview.dedd41e9ed":"Reproducible order","oss-bitweave-overview.3b4f3d9ab7":"Multi-query batching packs four queries into one SIMD register for roughly 3.8x throughput, the path that holds exact recall at scale.","oss-bitweave-overview.fd1cab1148":"Four queries per register","oss-bitweave-overview.53aba0e1cf":"Hamming distance over packed bits with XNOR and POPCNT runs on AVX2, AVX-512 and NEON pipelines. The native representation and the canonical comparison path are binary.","oss-bitweave-overview.83662fb6a3":"Distance in bits","oss-bitweave-overview.355b4fd1fd":"Documents and queries become binary hypervectors. Bundling by majority vote, binding by XOR, and permutation by cyclic shift preserve semantic structure in bits.","oss-bitweave-overview.9f77ca8d82":"Hypervector encoding","oss-bitweave-owned-state.kicker.label":"The semantic asset","oss-bitweave-owned-state.kicker.sub":"what has to remain together","oss-bitweave-owned-state.tag":"OWNED","oss-bitweave-owned-state.row.manifest.part":"encoder manifest","oss-bitweave-owned-state.row.manifest.reason":"defines what the representation preserves","oss-bitweave-owned-state.row.codebook.part":"codebook","oss-bitweave-owned-state.row.codebook.reason":"keeps token or feature identity stable","oss-bitweave-owned-state.row.vectors.part":"vectors","oss-bitweave-owned-state.row.vectors.reason":"the reusable computational state","oss-bitweave-owned-state.row.index.part":"index and parameters","oss-bitweave-owned-state.row.index.reason":"the declared execution plan","oss-bitweave-owned-state.row.metadata.part":"metadata and schema","oss-bitweave-owned-state.row.metadata.reason":"the structured conditions around similarity","oss-bitweave-owned-state.row.version.part":"version and checksums","oss-bitweave-owned-state.row.version.reason":"the identity and integrity of the release","oss-bitweave-owned-state.foot.left":"not merely the original files","oss-bitweave-owned-state.foot.right":"the state derived from them","oss-bitweave-pattern-sources.chrome.path":"Three sources, one pattern","oss-bitweave-pattern-sources.chrome.status":"three sources, one pattern size","oss-bitweave-pattern-sources.chrome.meta":"separate lanes, same width","oss-bitweave-pattern-sources.lane.note.label":"a short note","oss-bitweave-pattern-sources.lane.photo.label":"a photograph","oss-bitweave-pattern-sources.lane.audio.label":"an audio clip","oss-bitweave-pattern-sources.lane.converter":"its own conversion lane","oss-bitweave-pattern-sources.lane.pattern":"same-sized pattern","oss-bitweave-pattern-sources.caption":"Comparing across different source kinds needs a product designed to align them. Same size alone is not enough.","oss-bitweave-pattern-sources.action.combine.name":"combine","oss-bitweave-pattern-sources.action.combine.plain":"make one group pattern from several items","oss-bitweave-pattern-sources.action.compare.name":"compare","oss-bitweave-pattern-sources.action.compare.plain":"how close two compatible patterns are","oss-bitweave-pattern-sources.action.group.name":"group","oss-bitweave-pattern-sources.action.group.plain":"items that sit near one another","oss-bitweave-pattern-sources.action.find.name":"find","oss-bitweave-pattern-sources.action.find.plain":"the closest items in an ordered list","oss-bitweave-pattern-sources.band.text":"each source keeps its own road to the same kind of pattern","oss-bitweave-pattern-sources.band.meta":"patterns in, actions out","oss-bitweave-pilot.kicker.label":"Pilot evidence","oss-bitweave-pilot.kicker.sub":"before wider rollout","oss-bitweave-pilot.tag":"EVALUATE","oss-bitweave-pilot.step.manifest.evidence":"encoder manifest and task evaluation","oss-bitweave-pilot.step.baseline.evidence":"exact baseline and selected operation metric","oss-bitweave-pilot.step.second.evidence":"second operation reusing the same collection","oss-bitweave-pilot.step.restore.evidence":"snapshot, WAL and restore test","oss-bitweave-pilot.step.surface.evidence":"same state through a second compatible surface","oss-bitweave-pilot.step.change.evidence":"change report for a new encoder or corpus release","oss-bitweave-pilot.footline.left":"prove reuse before scale","oss-bitweave-pilot.footline.right":"keep the state when the pilot ends","oss-bitweave-pilot-board.chrome.path":"A pilot with a clear baseline","oss-bitweave-pilot-board.chrome.status":"baseline declared","oss-bitweave-pilot-board.chrome.meta":"two operations / one release","oss-bitweave-pilot-board.base.encoder":"one encoder release","oss-bitweave-pilot-board.base.collection":"one policy library collection","oss-bitweave-pilot-board.operation.lookup.name":"semantic lookup","oss-bitweave-pilot-board.operation.lookup.taskMetric":"related-clause discovery quality","oss-bitweave-pilot-board.operation.lookup.exactBaseline":"exact multi-query run recorded","oss-bitweave-pilot-board.operation.lookup.selectedIndex":"approximate mode accepted against baseline","oss-bitweave-pilot-board.operation.duplicates.name":"near-duplicate clause review","oss-bitweave-pilot-board.operation.duplicates.taskMetric":"duplicate clause detection quality","oss-bitweave-pilot-board.operation.duplicates.exactBaseline":"same exact baseline reused","oss-bitweave-pilot-board.operation.duplicates.selectedIndex":"same collection, no re-encode","oss-bitweave-pilot-board.field.taskMetric":"task metric","oss-bitweave-pilot-board.field.exactBaseline":"exact baseline","oss-bitweave-pilot-board.field.selectedIndex":"selected index","oss-bitweave-pilot-board.wide.restore.label":"restore test","oss-bitweave-pilot-board.wide.restore.sub":"snapshot, WAL and reopen","oss-bitweave-pilot-board.wide.replay.label":"second-surface replay","oss-bitweave-pilot-board.wide.replay.sub":"same operation, second surface","oss-bitweave-pilot-board.wide.handover.label":"state handover","oss-bitweave-pilot-board.wide.handover.sub":"state kept when the pilot ends","oss-bitweave-pilot-board.gate.title":"a third operation is proposed","oss-bitweave-pilot-board.gate.rule":"Accepted only when its evaluation demonstrates that the existing representation preserves the required structure.","oss-bitweave-pilot-board.band.left":"one bounded corpus, relationships measured","oss-bitweave-pilot-board.band.right":"two operations / one encoder release","oss-bitweave-pipeline.782e817cf0":"Encode","oss-bitweave-pipeline.d179109ab7":"A document becomes a binary hypervector through HDC bundling and binding. Semantic structure persists in the bit pattern.","oss-bitweave-pipeline.09ed4980db":"hd::encode(doc) -> Hypervector","oss-bitweave-pipeline.40dafe4cff":"Bucket","oss-bitweave-pipeline.5e3e4bfb72":"The hypervector splits into bands; each band hashes to a bucket. Multiple bands raise the chance that near neighbours collide.","oss-bitweave-pipeline.b30ba739fc":"lsh::insert(vec, doc_id)","oss-bitweave-pipeline.e0c705d18e":"Walk","oss-bitweave-pipeline.4dc5cd68e9":"A query hashes the same way and visits only the buckets it lands in. The candidate set is the union of those hits, not the whole index.","oss-bitweave-pipeline.489f487724":"Score","oss-bitweave-pipeline.d8f50207ef":"Candidates are rescored exactly with XNOR and POPCNT. Top-k is returned with deterministic tie-breaking on (distance, doc_id).","oss-bitweave-pipeline.8759038238":"simd::popcount_xnor(q, v)","oss-bitweave-pipeline.4d5e9a7273":"bw-search :: pipeline","oss-bitweave-pipeline.51d01a86c0":"binary hot path","oss-bitweave-pipeline.e98be43aec":"bit-identical answer","oss-bitweave-plain-actions.tag":"ACTIONS","oss-bitweave-plain-actions.kicker.label":"Four actions","oss-bitweave-plain-actions.kicker.sub":"what comes back","oss-bitweave-plain-actions.action.compare.name":"compare","oss-bitweave-plain-actions.action.compare.result":"how close two compatible patterns are","oss-bitweave-plain-actions.action.group.name":"group","oss-bitweave-plain-actions.action.group.result":"items that sit near one another","oss-bitweave-plain-actions.action.check.name":"check","oss-bitweave-plain-actions.action.check.result":"inside or outside a chosen distance","oss-bitweave-plain-actions.action.find.name":"find","oss-bitweave-plain-actions.action.find.result":"the closest items in an ordered list","oss-bitweave-plain-actions.foot.left":"the engine returns relationships","oss-bitweave-plain-actions.foot.right":"the product decides what to do with them","oss-bitweave-plain-algebra.tag":"STRUCTURE","oss-bitweave-plain-algebra.kicker.label":"Three simple actions","oss-bitweave-plain-algebra.kicker.sub":"translated from the engine","oss-bitweave-plain-algebra.action.join.name":"join","oss-bitweave-plain-algebra.action.join.meaning":"make one group pattern from several items","oss-bitweave-plain-algebra.action.join.example":"a trip album or topic prototype","oss-bitweave-plain-algebra.action.pair.name":"pair","oss-bitweave-plain-algebra.action.pair.meaning":"attach a value to a label or role","oss-bitweave-plain-algebra.action.pair.example":"colour: red, supplier: Acme","oss-bitweave-plain-algebra.action.order.name":"order","oss-bitweave-plain-algebra.action.order.meaning":"make position part of the pattern","oss-bitweave-plain-algebra.action.order.example":"first, second and third clip","oss-bitweave-plain-algebra.foot.left":"fixed size remains fixed","oss-bitweave-plain-algebra.foot.right":"the structure comes from the operation","oss-bitweave-plain-pattern.tag":"PLAIN","oss-bitweave-plain-pattern.kicker.label":"What the pattern is","oss-bitweave-plain-pattern.kicker.sub":"and what it is not","oss-bitweave-plain-pattern.col.is":"it is","oss-bitweave-plain-pattern.col.isNot":"it is not","oss-bitweave-plain-pattern.row.fixedSize.is":"a fixed-size shape for computation","oss-bitweave-plain-pattern.row.fixedSize.isNot":"the original document or picture","oss-bitweave-plain-pattern.row.declared.is":"made from a declared conversion","oss-bitweave-plain-pattern.row.declared.isNot":"a secret human-like understanding","oss-bitweave-plain-pattern.row.relationships.is":"useful for comparing relationships","oss-bitweave-plain-pattern.row.relationships.isNot":"proof that something is true","oss-bitweave-plain-pattern.row.small.is":"small enough to keep and move","oss-bitweave-plain-pattern.row.small.isNot":"a finished application on its own","oss-bitweave-plain-pattern.foot.left":"the product decides what the person sees","oss-bitweave-plain-pattern.foot.right":"BitWeave supplies the engine beneath it","oss-bitweave-problem.f4686ecab3":"Own it instead","oss-bitweave-problem.66d1ed968a":"When search is someone else's service, they decide where your data lives, what it costs, and whether the answer stays the same.","oss-bitweave-problem.7629410065":"BitWeave, self-hosted","oss-bitweave-problem.c61c053ac2":"Someone else's cloud search","oss-bitweave-problem.2b03e214ac":"Their search, or yours","oss-bitweave-problem.3e27174daf":"A portable index format and inspectable runtime, with no proprietary service to escape.","oss-bitweave-problem.f114bcfcf7":"Custom analysers and vendor SDKs make migration a quarter-long project.","oss-bitweave-problem.3e70d34bd1":"How hard it is to leave","oss-bitweave-problem.a9106809fe":"A pinned semantic contract reproduces the same ordered result on every supported server.","oss-bitweave-problem.26574df546":"The same question can return a different answer next week as the index updates.","oss-bitweave-problem.18b98c93be":"Whether answers hold","oss-bitweave-problem.d59d5d1a62":"You pay for the hardware you already own. No per-query meter.","oss-bitweave-problem.87f877b46b":"Per query, per gigabyte, per indexed document, with prices that change between cycles.","oss-bitweave-problem.59bd1ff6f9":"What it costs","oss-bitweave-problem.8ab5d2f730":"Indexes run on infrastructure you control, in the jurisdiction you choose.","oss-bitweave-problem.31e1f054c6":"Indexes sit in the region the vendor prefers, not the one you must answer to.","oss-bitweave-problem.45359e4abf":"Where the data lives","oss-bitweave-promise.tag":"OPEN","oss-bitweave-promise.kicker.label":"What it promises","oss-bitweave-promise.kicker.sub":"and the condition on each","oss-bitweave-promise.row.samePattern.name":"same pattern","oss-bitweave-promise.row.samePattern.condition":"same complete encoder contract","oss-bitweave-promise.row.sameResult.name":"same operation result","oss-bitweave-promise.row.sameResult.condition":"same compatible state, settings and ordering rule","oss-bitweave-promise.row.local.name":"local execution","oss-bitweave-promise.row.local.condition":"when the surrounding product chooses local paths","oss-bitweave-promise.row.portable.name":"portable state","oss-bitweave-promise.row.portable.condition":"between compatible format versions and feature sets","oss-bitweave-promise.row.inspectable.name":"inspectable engine","oss-bitweave-promise.row.inspectable.condition":"source and rights under Apache 2.0","oss-bitweave-promise.foot.left":"similarity is a measurement","oss-bitweave-promise.foot.right":"the product makes the judgement","oss-bitweave-release-artefact.chrome.path":"A release you can inspect","oss-bitweave-release-artefact.chrome.status":"one release, four stations","oss-bitweave-release-artefact.chrome.meta":"promotion path","oss-bitweave-release-artefact.card.title":"Semantic release","oss-bitweave-release-artefact.card.tag":"owned artefact","oss-bitweave-release-artefact.field.corpus.name":"corpus ID","oss-bitweave-release-artefact.field.corpus.gloss":"the source state behind the release","oss-bitweave-release-artefact.field.manifest.name":"encoder manifest","oss-bitweave-release-artefact.field.manifest.gloss":"the contract that produced the vectors","oss-bitweave-release-artefact.field.codebook.name":"codebook checksum","oss-bitweave-release-artefact.field.codebook.gloss":"token identity pinned to its bits","oss-bitweave-release-artefact.field.dimension.name":"dimension","oss-bitweave-release-artefact.field.dimension.gloss":"D4096 under the declared type family","oss-bitweave-release-artefact.field.schema.name":"collection schema","oss-bitweave-release-artefact.field.schema.gloss":"typed metadata around the vectors","oss-bitweave-release-artefact.field.version.name":"state version","oss-bitweave-release-artefact.field.version.gloss":"the identity of this release","oss-bitweave-release-artefact.field.index.name":"index mode","oss-bitweave-release-artefact.field.index.gloss":"the declared execution plan","oss-bitweave-release-artefact.field.receipt.name":"benchmark receipt","oss-bitweave-release-artefact.field.receipt.gloss":"the measured evidence attached","oss-bitweave-release-artefact.boundary.label":"the organisation’s own surfaces","oss-bitweave-release-artefact.station.evaluation.name":"Evaluation","oss-bitweave-release-artefact.station.evaluation.note":"task metrics decide promotion","oss-bitweave-release-artefact.station.production.name":"Production","oss-bitweave-release-artefact.station.production.note":"the serving state, named","oss-bitweave-release-artefact.station.surface.name":"Second surface","oss-bitweave-release-artefact.station.surface.note":"a compatible copy, same identity","oss-bitweave-release-artefact.station.archive.name":"Archive","oss-bitweave-release-artefact.station.archive.note":"kept for replay and comparison","oss-bitweave-release-artefact.diff.before":"current release","oss-bitweave-release-artefact.diff.layer":"codebook changed","oss-bitweave-release-artefact.diff.after":"new identity","oss-bitweave-release-artefact.diff.note":"A later release changes the codebook and receives a new identity; the diff names which layer changed.","oss-bitweave-release-artefact.band.left":"identity, date and diff on every release","oss-bitweave-release-artefact.band.right":"the package travels as one artefact","oss-bitweave-repeated-stack-banner.eyebrow":"The architecture diagram said vector search","oss-bitweave-repeated-stack-banner.lead":"The query was one method.","oss-bitweave-repeated-stack-banner.accent":"Representation was the system.","oss-bitweave-repeated-stack-banner.paragraph.one":"Search, retrieval-augmented generation, duplicate detection, agent context, routing, recommendations, local application features and analytics often begin from the same organisational material. In a fragmented stack, each project chooses another model, another vector space, another metadata copy, another index and another update job. The source is shared. The computational form is not.","oss-bitweave-repeated-stack-banner.paragraph.two":"BitWeave is built so one declared semantic state can support several of those operations, while still allowing different encoders where a task needs different preserved structure. What changes is that equivalent layers stop being rebuilt by accident, because one bounded domain and one explicit representation already serve them together.","oss-bitweave-repeated-stack-banner.panel.header":"The repeated stack","oss-bitweave-repeated-stack-banner.panel.tag":"seven projects","oss-bitweave-repeated-stack-banner.panel.compare.repeated":"rebuilt per project","oss-bitweave-repeated-stack-banner.panel.compare.shared":"shared by contract","oss-bitweave-repeated-stack-banner.panel.item.repeatedContract.label":"another representation contract","oss-bitweave-repeated-stack-banner.panel.item.repeatedContract.detail":"normaliser, encoder and vector space","oss-bitweave-repeated-stack-banner.panel.item.repeatedState.label":"another operational copy","oss-bitweave-repeated-stack-banner.panel.item.repeatedState.detail":"metadata, index and service boundary","oss-bitweave-repeated-stack-banner.panel.item.repeatedExit.label":"another exit path","oss-bitweave-repeated-stack-banner.panel.item.repeatedExit.detail":"migration planned and maintained separately","oss-bitweave-repeated-stack-banner.panel.item.sharedContract.label":"one declared encoder contract","oss-bitweave-repeated-stack-banner.panel.item.sharedContract.detail":"named codebook, dimension and release identity","oss-bitweave-repeated-stack-banner.panel.item.sharedState.label":"one compatible binary state","oss-bitweave-repeated-stack-banner.panel.item.sharedState.detail":"shared where the task contract honestly fits","oss-bitweave-repeated-stack-banner.panel.item.sharedExit.label":"one versioned handover","oss-bitweave-repeated-stack-banner.panel.item.sharedExit.detail":"snapshot, schema and migration path travel together","oss-bitweave-repeated-stack-banner.panel.chip.normaliser":"another normaliser","oss-bitweave-repeated-stack-banner.panel.chip.encoder":"another embedding or encoder","oss-bitweave-repeated-stack-banner.panel.chip.space":"another vector space","oss-bitweave-repeated-stack-banner.panel.chip.metadata":"another metadata copy","oss-bitweave-repeated-stack-banner.panel.chip.index":"another index","oss-bitweave-repeated-stack-banner.panel.chip.service":"another service","oss-bitweave-repeated-stack-banner.panel.chip.migration":"another migration plan","oss-bitweave-repeated-stack-banner.verdict":"the organisation did not build seven meanings; it rebuilt the semantic layer seven times","oss-bitweave-repeated-stack-banner.footline":"the cure is one reusable contract, named and versioned","oss-bitweave-scale-journey.chrome.path":"One collection as it grows","oss-bitweave-scale-journey.chrome.status":"collection id unchanged","oss-bitweave-scale-journey.chrome.meta":"five rungs / illustrative","oss-bitweave-scale-journey.rung.embedded.name":"embedded library","oss-bitweave-scale-journey.rung.embedded.stage":"inside a desktop product","oss-bitweave-scale-journey.rung.embedded.readout":"The collection lives inside the desktop product's own process. The application owns persistence, and there is no network boundary to operate.","oss-bitweave-scale-journey.rung.embedded.node.product":"desktop product","oss-bitweave-scale-journey.rung.embedded.node.productSub":"engine and collection in one process","oss-bitweave-scale-journey.rung.service.name":"internal service","oss-bitweave-scale-journey.rung.service.stage":"a unix socket on one host","oss-bitweave-scale-journey.rung.service.readout":"The same collection moves behind an internal service on a Unix socket. Network, authentication, rate limits and observability become the new operational concerns.","oss-bitweave-scale-journey.rung.service.node.app":"application","oss-bitweave-scale-journey.rung.service.node.service":"internal service","oss-bitweave-scale-journey.rung.service.node.serviceSub":"engine and collection behind the socket","oss-bitweave-scale-journey.rung.service.via":"unix socket","oss-bitweave-scale-journey.rung.mapped.name":"large mapped node","oss-bitweave-scale-journey.rung.mapped.stage":"a mapped read-only state on a larger node","oss-bitweave-scale-journey.rung.mapped.readout":"A larger node opens the state memory-mapped and read-only. Storage locality and page behaviour now decide latency, and the collection is still not re-encoded.","oss-bitweave-scale-journey.rung.mapped.node.readers":"reader applications","oss-bitweave-scale-journey.rung.mapped.node.node":"mapped node","oss-bitweave-scale-journey.rung.mapped.node.nodeSub":"memory-mapped collection","oss-bitweave-scale-journey.rung.mapped.node.badge":"read-only","oss-bitweave-scale-journey.rung.mapped.via":"memory map","oss-bitweave-scale-journey.rung.shards.name":"replicated shard group","oss-bitweave-scale-journey.rung.shards.stage":"three shards with replicas","oss-bitweave-scale-journey.rung.shards.readout":"The collection becomes three shards with replicas. Failover and capacity arrive, and a GPU joins only the shard receiving large batch workloads.","oss-bitweave-scale-journey.rung.shards.flowLabel":"one collection, three shards, each with a replica","oss-bitweave-scale-journey.rung.shards.node.one":"shard one","oss-bitweave-scale-journey.rung.shards.node.two":"shard two","oss-bitweave-scale-journey.rung.shards.node.three":"shard three","oss-bitweave-scale-journey.rung.shards.node.badge":"large batches","oss-bitweave-scale-journey.rung.cluster.name":"distributed cluster","oss-bitweave-scale-journey.rung.cluster.stage":"topology, Raft, fan-out and rebalancing","oss-bitweave-scale-journey.rung.cluster.readout":"The cluster distributes the collection across nodes. Topology, Raft coordination, query fan-out and rebalancing are all visible, and rebalancing traffic is a named cost between nodes.","oss-bitweave-scale-journey.rung.cluster.flowLabel":"raft-coordinated nodes under one collection contract","oss-bitweave-scale-journey.rung.cluster.node.one":"first node","oss-bitweave-scale-journey.rung.cluster.node.two":"second node","oss-bitweave-scale-journey.rung.cluster.node.three":"third node","oss-bitweave-scale-journey.rung.cluster.lane":"rebalancing traffic between nodes","oss-bitweave-scale-journey.replica":"replica","oss-bitweave-scale-journey.constant.collection.key":"collection","oss-bitweave-scale-journey.constant.collection.value":"col-204","oss-bitweave-scale-journey.constant.encoder.key":"encoder","oss-bitweave-scale-journey.constant.encoder.value":"enc-bpe-07","oss-bitweave-scale-journey.constant.dimension.key":"dimension","oss-bitweave-scale-journey.constant.dimension.value":"d4096","oss-bitweave-scale-journey.band.left":"hardware and topology change the posture","oss-bitweave-scale-journey.band.right":"not the identity of the state","oss-bitweave-scale-ladder.kicker.label":"Five rungs","oss-bitweave-scale-ladder.kicker.sub":"same logical contract","oss-bitweave-scale-ladder.tag":"SCALE","oss-bitweave-scale-ladder.rung.embedded.posture":"embedded library","oss-bitweave-scale-ladder.rung.embedded.responsibility":"application process and local persistence","oss-bitweave-scale-ladder.rung.service.posture":"standalone internal service","oss-bitweave-scale-ladder.rung.service.responsibility":"network, auth, rates and observability","oss-bitweave-scale-ladder.rung.mapped.posture":"large mapped node","oss-bitweave-scale-ladder.rung.mapped.responsibility":"storage locality and page behaviour","oss-bitweave-scale-ladder.rung.shards.posture":"replicated shard group","oss-bitweave-scale-ladder.rung.shards.responsibility":"failover and capacity","oss-bitweave-scale-ladder.rung.cluster.posture":"distributed cluster","oss-bitweave-scale-ladder.rung.cluster.responsibility":"topology, Raft, fan-out and rebalancing","oss-bitweave-scale-ladder.footline.left":"start at the lowest rung that fits","oss-bitweave-scale-ladder.footline.right":"grow without re-encoding by default","oss-bitweave-seven-projects-banner.eyebrow":"The repeated project","oss-bitweave-seven-projects-banner.lead":"Seven projects stood apart.","oss-bitweave-seven-projects-banner.accent":"One layer rebuilt seven times.","oss-bitweave-seven-projects-banner.para.one":"Another model produced another space. Another database copied the metadata. Another service built another index. Another team wrote another update job. Each project may have been reasonable in isolation. The cost appears when the organisation has to update, secure, benchmark, migrate and explain all seven at once.","oss-bitweave-seven-projects-banner.para.two":"BitWeave turns the representation into a product decision. One domain receives a named encoder and a reusable semantic state. New operations can use it where the contract fits. Different tasks can still receive different spaces, but the difference becomes intentional and visible rather than the accidental result of another procurement.","oss-bitweave-seven-projects-banner.panel.title":"Seven projects","oss-bitweave-seven-projects-banner.panel.tag":"same source","oss-bitweave-seven-projects-banner.chip.encoderDecisions":"seven encoder decisions","oss-bitweave-seven-projects-banner.chip.metadataCopies":"seven metadata copies","oss-bitweave-seven-projects-banner.chip.updatePaths":"seven update paths","oss-bitweave-seven-projects-banner.chip.serviceBoundaries":"seven service boundaries","oss-bitweave-seven-projects-banner.chip.migrations":"seven migrations","oss-bitweave-seven-projects-banner.chip.similarityVersions":"seven versions of what similarity meant","oss-bitweave-seven-projects-banner.verdict":"the reusable asset is BitWeave’s declared representation, not the seventh search endpoint","oss-bitweave-seven-projects-banner.footline":"begin with one bounded domain and prove which operations can honestly share it","oss-bitweave-seven-stacks.chrome.path":"Seven projects, one shared layer","oss-bitweave-seven-stacks.chrome.status":"one source, seven rebuilds","oss-bitweave-seven-stacks.chrome.meta":"illustrative","oss-bitweave-seven-stacks.sceneA.kicker":"Seven projects over one library","oss-bitweave-seven-stacks.sceneA.note":"every column re-encodes the same documents","oss-bitweave-seven-stacks.source.name":"One policy library","oss-bitweave-seven-stacks.source.note":"the same documents appear seven times","oss-bitweave-seven-stacks.drops.label":"conversion, once per project","oss-bitweave-seven-stacks.col.search":"search","oss-bitweave-seven-stacks.col.duplicates":"duplicate screening","oss-bitweave-seven-stacks.col.routing":"routing","oss-bitweave-seven-stacks.col.agent":"agent context","oss-bitweave-seven-stacks.col.reco":"recommendations","oss-bitweave-seven-stacks.col.local":"local app matching","oss-bitweave-seven-stacks.col.analytics":"analytics","oss-bitweave-seven-stacks.stack.encoder":"own encoder","oss-bitweave-seven-stacks.stack.store":"own vector store","oss-bitweave-seven-stacks.stack.metadata":"own metadata copy","oss-bitweave-seven-stacks.stack.updates":"own update job","oss-bitweave-seven-stacks.sceneB.kicker":"The BitWeave alternative","oss-bitweave-seven-stacks.sceneB.note":"the conversion and coherence lines disappear","oss-bitweave-seven-stacks.alt.title":"One declared semantic state","oss-bitweave-seven-stacks.alt.encoder":"one encoder release, named and versioned","oss-bitweave-seven-stacks.alt.collection":"one collection over the shared vectors","oss-bitweave-seven-stacks.alt.metadata":"one metadata copy, one schema","oss-bitweave-seven-stacks.alt.opsLabel":"operations sharing the contract","oss-bitweave-seven-stacks.branch.task":"a genuinely different task","oss-bitweave-seven-stacks.branch.encoder":"branches into a second named encoder, declared on purpose","oss-bitweave-seven-stacks.band.left":"the saving is the lines that disappear","oss-bitweave-seven-stacks.band.right":"one domain, one contract","oss-bitweave-source-paths.tag":"SOURCES","oss-bitweave-source-paths.kicker.label":"Three roads","oss-bitweave-source-paths.kicker.sub":"one destination type","oss-bitweave-source-paths.road.words.name":"words","oss-bitweave-source-paths.road.words.examined":"pieces of text, vocabulary and position","oss-bitweave-source-paths.road.pictures.name":"pictures","oss-bitweave-source-paths.road.pictures.examined":"patches, texture, edges, colour and scale","oss-bitweave-source-paths.road.sounds.name":"sounds","oss-bitweave-source-paths.road.sounds.examined":"short time windows, spectrum and order","oss-bitweave-source-paths.road.custom.name":"custom data","oss-bitweave-source-paths.road.custom.examined":"features the product names and versions itself","oss-bitweave-source-paths.foot.left":"different evidence on the way in","oss-bitweave-source-paths.foot.right":"one compact type at the end","oss-bitweave-spokes.chrome.path":"One state, eight operations","oss-bitweave-spokes.chrome.status":"eight spokes, one hub","oss-bitweave-spokes.chrome.meta":"state + scores on every spoke","oss-bitweave-spokes.hub.name":"One hypervector","oss-bitweave-spokes.hub.meta":"D4096, one encoder contract","oss-bitweave-spokes.spoke.end":"state + scores","oss-bitweave-spokes.spoke.nearest.name":"nearest","oss-bitweave-spokes.spoke.nearest.input":"in: vector query, k","oss-bitweave-spokes.spoke.nearest.output":"out: top-k IDs and scores","oss-bitweave-spokes.spoke.nearest.readout":"Nearest applies the same score and representation as every other spoke and returns top-k IDs with their scores. It is the most visible operation here, and it shares the hub with seven others.","oss-bitweave-spokes.spoke.range.name":"range","oss-bitweave-spokes.spoke.range.input":"in: declared threshold","oss-bitweave-spokes.spoke.range.output":"out: every ID inside it","oss-bitweave-spokes.spoke.range.readout":"Range applies a declared distance threshold and returns every ID inside it, turning the same score into a boundary the application can act on.","oss-bitweave-spokes.spoke.duplicate.name":"duplicate","oss-bitweave-spokes.spoke.duplicate.input":"in: one item, the corpus","oss-bitweave-spokes.spoke.duplicate.output":"out: a relation and a distance","oss-bitweave-spokes.spoke.duplicate.readout":"Duplicate compares one item against the corpus and returns a relation and a distance, so near-duplicate screening is a reading of the same state rather than a separate index.","oss-bitweave-spokes.spoke.group.name":"group","oss-bitweave-spokes.spoke.group.input":"in: range edges, cluster policy","oss-bitweave-spokes.spoke.group.output":"out: similarity groups","oss-bitweave-spokes.spoke.group.readout":"Group combines range edges with a clustering policy and returns similarity groups. It is a compositional pattern over the primitive score, and the drawing names it as such.","oss-bitweave-spokes.spoke.prototype.name":"prototype","oss-bitweave-spokes.spoke.prototype.input":"in: bundled example groups","oss-bitweave-spokes.spoke.prototype.output":"out: the closest example group","oss-bitweave-spokes.spoke.prototype.readout":"Prototype bundles examples and compares a new item against those bundles, returning the closest example group as a distance under the current encoder: cheap to run, easy to check.","oss-bitweave-spokes.spoke.filter.name":"filter","oss-bitweave-spokes.spoke.filter.input":"in: metadata predicate, vector plan","oss-bitweave-spokes.spoke.filter.output":"out: filtered candidate scores","oss-bitweave-spokes.spoke.filter.readout":"Filter combines an exact metadata predicate with the vector plan and returns filtered candidate scores, one declared operation rather than a post-processing step.","oss-bitweave-spokes.spoke.route.name":"route","oss-bitweave-spokes.spoke.route.input":"in: one item, declared classes","oss-bitweave-spokes.spoke.route.output":"out: a candidate shortlist","oss-bitweave-spokes.spoke.route.readout":"Route is a shortlist operation: one item in, a candidate shortlist out. The engine provides explicit semantic state and scores; the application owns the final operational meaning.","oss-bitweave-spokes.spoke.retrieve.name":"retrieve","oss-bitweave-spokes.spoke.retrieve.input":"in: hybrid text and vector query","oss-bitweave-spokes.spoke.retrieve.output":"out: context in one order","oss-bitweave-spokes.spoke.retrieve.readout":"Retrieve runs hybrid text and vector retrieval for context selection, returning candidates in one declared order for the application above.","oss-bitweave-spokes.readout.meta":"one reading of one hub","oss-bitweave-spokes.band.left":"nearest is one spoke among eight","oss-bitweave-spokes.band.right":"every spoke ends in state and scores","oss-bitweave-sprawl.kicker.label":"What gets rebuilt","oss-bitweave-sprawl.kicker.sub":"for every new feature","oss-bitweave-sprawl.tag":"DUPLICATION","oss-bitweave-sprawl.row.normalisation.layer":"normalisation","oss-bitweave-sprawl.row.normalisation.cost":"another version of the source","oss-bitweave-sprawl.row.encoder.layer":"encoder","oss-bitweave-sprawl.row.encoder.cost":"another semantic space and migration dependency","oss-bitweave-sprawl.row.metadata.layer":"metadata","oss-bitweave-sprawl.row.metadata.cost":"another copy to keep coherent","oss-bitweave-sprawl.row.index.layer":"index","oss-bitweave-sprawl.row.index.cost":"another build and update job","oss-bitweave-sprawl.row.service.layer":"service","oss-bitweave-sprawl.row.service.cost":"another operational and security boundary","oss-bitweave-sprawl.row.exit.layer":"exit","oss-bitweave-sprawl.row.exit.cost":"another re-encoding plan when a supplier or model changes","oss-bitweave-sprawl.foot.left":"the source stayed the same","oss-bitweave-sprawl.foot.right":"the semantic stack did not","oss-bitweave-state-lifecycle.kicker.label":"State lifecycle","oss-bitweave-state-lifecycle.kicker.sub":"point-in-time and live","oss-bitweave-state-lifecycle.tag":"DURABLE","oss-bitweave-state-lifecycle.state.snapshot.name":"snapshot","oss-bitweave-state-lifecycle.state.snapshot.contains":"versioned typed sections and checksums","oss-bitweave-state-lifecycle.state.live.name":"live","oss-bitweave-state-lifecycle.state.live.contains":"snapshot plus WAL, tombstones and current configuration","oss-bitweave-state-lifecycle.state.checkpoint.name":"checkpoint","oss-bitweave-state-lifecycle.state.checkpoint.contains":"stable sequence from which replay continues","oss-bitweave-state-lifecycle.state.compacted.name":"compacted","oss-bitweave-state-lifecycle.state.compacted.contains":"new base with physical dead weight removed","oss-bitweave-state-lifecycle.state.mapped.name":"mapped","oss-bitweave-state-lifecycle.state.mapped.contains":"file-backed pages directly addressable by compatible readers","oss-bitweave-state-lifecycle.foot.left":"one snapshot is an artefact","oss-bitweave-state-lifecycle.foot.right":"live state includes what changed after it","oss-bitweave-surface-parity.chrome.path":"One state across six surfaces","oss-bitweave-surface-parity.chrome.status":"one state, six routes","oss-bitweave-surface-parity.chrome.meta":"VERBS SCOPED PER ROUTE","oss-bitweave-surface-parity.state.name":"one compatible state","oss-bitweave-surface-parity.state.fact.encoder":"encoder ID attached","oss-bitweave-surface-parity.state.fact.version":"state version attached","oss-bitweave-surface-parity.state.fact.reduced":"a reduced compatible state opens in the browser build","oss-bitweave-surface-parity.verb.encode":"encode","oss-bitweave-surface-parity.verb.compose":"compose","oss-bitweave-surface-parity.verb.insert":"insert","oss-bitweave-surface-parity.verb.filter":"filter","oss-bitweave-surface-parity.verb.range":"range","oss-bitweave-surface-parity.verb.query":"query","oss-bitweave-surface-parity.verb.save":"save","oss-bitweave-surface-parity.verb.load":"load","oss-bitweave-surface-parity.verb.inspect":"inspect","oss-bitweave-surface-parity.route.rust.name":"Rust SDK","oss-bitweave-surface-parity.route.rust.note":"owns the full in-process lifecycle","oss-bitweave-surface-parity.route.cli.name":"CLI","oss-bitweave-surface-parity.route.cli.note":"reproducible in automation","oss-bitweave-surface-parity.route.server.name":"server","oss-bitweave-surface-parity.route.server.note":"auth, roles and rates at the boundary","oss-bitweave-surface-parity.route.cabi.name":"C ABI","oss-bitweave-surface-parity.route.cabi.note":"stable core operations over the same native engine","oss-bitweave-surface-parity.route.python.name":"Python","oss-bitweave-surface-parity.route.python.note":"the same native engine, copy semantics explicit","oss-bitweave-surface-parity.route.wasm.name":"WASM","oss-bitweave-surface-parity.route.wasm.note":"read-only compatible subset, smaller state","oss-bitweave-surface-parity.receipt.label":"on every receipt","oss-bitweave-surface-parity.receipt.encoder":"encoder ID","oss-bitweave-surface-parity.receipt.version":"state version","oss-bitweave-surface-parity.receipt.operation":"operation","oss-bitweave-surface-parity.receipt.ordering":"ordering rule","oss-bitweave-surface-parity.receipt.note":"identical across the routes that execute it","oss-bitweave-surface-parity.band.left":"each route runs exactly the verbs it lists","oss-bitweave-surface-parity.band.right":"SAME RECEIPT ON EVERY ROUTE","oss-bitweave-surfaces.kicker.label":"Six boundaries","oss-bitweave-surfaces.kicker.sub":"one logical contract","oss-bitweave-surfaces.tag":"SURFACES","oss-bitweave-surfaces.surface.rust.name":"Rust SDK","oss-bitweave-surfaces.surface.rust.posture":"inside an application","oss-bitweave-surfaces.surface.rust.concern":"application owns process security and lifecycle","oss-bitweave-surfaces.surface.cli.name":"CLI","oss-bitweave-surfaces.surface.cli.posture":"pipeline and operator work","oss-bitweave-surfaces.surface.cli.concern":"scriptable, version-pinned operations","oss-bitweave-surfaces.surface.server.name":"server","oss-bitweave-surfaces.surface.server.posture":"shared internal service","oss-bitweave-surfaces.surface.server.concern":"auth, roles, rates, health and observability","oss-bitweave-surfaces.surface.cabi.name":"C ABI","oss-bitweave-surfaces.surface.cabi.posture":"other native runtimes","oss-bitweave-surfaces.surface.cabi.concern":"stable boundary over supported operations","oss-bitweave-surfaces.surface.python.name":"Python","oss-bitweave-surfaces.surface.python.posture":"analysis and integration","oss-bitweave-surfaces.surface.python.concern":"binding feature set and copy semantics explicit","oss-bitweave-surfaces.surface.wasm.name":"WASM","oss-bitweave-surfaces.surface.wasm.posture":"small local browser/edge use","oss-bitweave-surfaces.surface.wasm.concern":"state size and feature subset explicit","oss-bitweave-surfaces.foot.left":"interfaces differ","oss-bitweave-surfaces.foot.right":"the compatible vector and state contract remains shared","oss-bitweave-text-modes.kicker.label":"Four output forms","oss-bitweave-text-modes.kicker.sub":"one encoder contract","oss-bitweave-text-modes.console.title":"Text output inspector","oss-bitweave-text-modes.console.subtitle":"Four declared output forms under one encoder contract.","oss-bitweave-text-modes.tag":"TEXT","oss-bitweave-text-modes.mode.document.name":"document","oss-bitweave-text-modes.mode.document.output":"One bundled hypervector","oss-bitweave-text-modes.mode.document.fit":"Compact broad retrieval, grouping and prototype comparison.","oss-bitweave-text-modes.mode.token.name":"token","oss-bitweave-text-modes.mode.token.output":"A sequence or set of token vectors","oss-bitweave-text-modes.mode.token.fit":"Fine-grained late interaction and local alignment.","oss-bitweave-text-modes.mode.streaming.name":"streaming","oss-bitweave-text-modes.mode.streaming.output":"Bounded incremental state","oss-bitweave-text-modes.mode.streaming.fit":"Long material without one unbounded temporary buffer.","oss-bitweave-text-modes.mode.fallback.name":"fallback","oss-bitweave-text-modes.mode.fallback.output":"Character-derived tokens","oss-bitweave-text-modes.mode.fallback.fit":"Unseen words without rejecting the input.","oss-bitweave-text-modes.foot.left":"same vocabulary and codebook","oss-bitweave-text-modes.foot.right":"different retained detail","oss-bitweave-text-pipeline.chrome.path":"Two text routes, one contract","oss-bitweave-text-pipeline.chrome.status":"one manifest, two lanes","oss-bitweave-text-pipeline.chrome.meta":"illustrative","oss-bitweave-text-pipeline.sentence.label":"source sentence","oss-bitweave-text-pipeline.sentence.text":"The treaty still shapes the harbour trade.","oss-bitweave-text-pipeline.stage.normalise":"normalisation","oss-bitweave-text-pipeline.stage.bpe":"BPE tokenise","oss-bitweave-text-pipeline.stage.codebook":"codebook lookup","oss-bitweave-text-pipeline.stage.roles":"position roles","oss-bitweave-text-pipeline.tokens.aria":"eight position-bound token vectors","oss-bitweave-text-pipeline.token.t1.form":"The","oss-bitweave-text-pipeline.token.t2.form":"treat","oss-bitweave-text-pipeline.token.t3.form":"y","oss-bitweave-text-pipeline.token.t4.form":"still","oss-bitweave-text-pipeline.token.t5.form":"shapes","oss-bitweave-text-pipeline.token.t6.form":"the","oss-bitweave-text-pipeline.token.t7.form":"harbour","oss-bitweave-text-pipeline.token.t8.form":"trade","oss-bitweave-text-pipeline.readout.t1":" sits at position p1. The document lane bundles it into the one D4096 vector with all eight tokens; the token lane retains its own vector, which no query facet selects in this MaxSim run.","oss-bitweave-text-pipeline.readout.t2":" sits at position p2. The document lane bundles it into the one D4096 vector, where it adds to the whole; the token lane retains its own vector, and the query facet treaty selects it as its best document token.","oss-bitweave-text-pipeline.readout.t3":" sits at position p3. The byte-pair split keeps it attached to treat at p2 in the sentence; the token lane retains its own vector, which no query facet selects in this run.","oss-bitweave-text-pipeline.readout.t4":" sits at position p4. In the document lane it is one contributor inside the bundle; in the token lane its vector is retained and available, though no query facet selects it here.","oss-bitweave-text-pipeline.readout.t5":" sits at position p5. Bundled, it shapes the document vector along with every other token; retained, it stands as its own vector for any facet that needs it.","oss-bitweave-text-pipeline.readout.t6":" sits at position p6. The document lane folds it into the bundle; the token lane keeps its vector addressable on its own.","oss-bitweave-text-pipeline.readout.t7":" sits at position p7. Bundled, it is one of eight contributors; retained, the query facet harbour selects it as its best document token.","oss-bitweave-text-pipeline.readout.t8":" sits at position p8. Bundled, it adds to the whole-document vector; retained, the query facet trade selects it as its best document token.","oss-bitweave-text-pipeline.lane.document.title":"document lane","oss-bitweave-text-pipeline.lane.document.bundle":"one D4096 bundle","oss-bitweave-text-pipeline.lane.document.note":"One compact object for fast broad matching; a decisive small passage stays inside the superposition.","oss-bitweave-text-pipeline.lane.token.title":"token lane","oss-bitweave-text-pipeline.lane.token.note":"Eight vectors per sentence, so each query facet can select its best local match.","oss-bitweave-text-pipeline.maxsim.title":"MaxSim, three query vectors","oss-bitweave-text-pipeline.maxsim.q1":"treaty","oss-bitweave-text-pipeline.maxsim.q2":"harbour","oss-bitweave-text-pipeline.maxsim.q3":"trade","oss-bitweave-text-pipeline.manifest.value":"manifest mf-bpe-d4096","oss-bitweave-text-pipeline.band.left":"the document lane is compact; the token lane keeps the passage that matched","oss-bitweave-text-pipeline.band.right":"same manifest ID on both lanes","oss-bitweave-three-roads.chrome.path":"Different routes, one form","oss-bitweave-three-roads.chrome.status":"three roads, one width","oss-bitweave-three-roads.chrome.meta":"manifest labels differ","oss-bitweave-three-roads.road.text.name":"the text road","oss-bitweave-three-roads.road.text.evidence":"tokens","oss-bitweave-three-roads.road.text.manifest":"manifest: words","oss-bitweave-three-roads.road.image.name":"the image road","oss-bitweave-three-roads.road.image.evidence":"patches","oss-bitweave-three-roads.road.image.manifest":"manifest: pictures","oss-bitweave-three-roads.road.audio.name":"the audio road","oss-bitweave-three-roads.road.audio.evidence":"waveform windows","oss-bitweave-three-roads.road.audio.manifest":"manifest: sounds","oss-bitweave-three-roads.bridge.drawn.title":"a bridge that is allowed","oss-bitweave-three-roads.bridge.drawn.spaceA":"alignment label: shared","oss-bitweave-three-roads.bridge.drawn.spaceB":"alignment label: shared","oss-bitweave-three-roads.bridge.drawn.note":"a cross-source bridge is drawn only between two spaces carrying the same alignment label","oss-bitweave-three-roads.bridge.stopped.title":"a bridge that is stopped","oss-bitweave-three-roads.bridge.stopped.spaceA":"manifest: words","oss-bitweave-three-roads.bridge.stopped.spaceB":"manifest: pictures","oss-bitweave-three-roads.bridge.stopped.note":"same width is not the same contract","oss-bitweave-three-roads.band.text":"each road keeps the evidence its source needs","oss-bitweave-three-roads.band.meta":"one width, named contracts","oss-bitweave-transpose.chrome.path":"A layout for comparison","oss-bitweave-transpose.chrome.status":"one query word, eight documents","oss-bitweave-transpose.chrome.meta":"BLOCKED SOA","oss-bitweave-transpose.rowmajor.label":"eight row-major document vectors","oss-bitweave-transpose.rowmajor.caption":"the compared word sits inside each row","oss-bitweave-transpose.transpose.label":"transpose","oss-bitweave-transpose.soa.label":"one blocked SoA block","oss-bitweave-transpose.soa.query":"one query word","oss-bitweave-transpose.soa.caption":"loaded once, broadcast across all eight","oss-bitweave-transpose.reads.before.value":"8","oss-bitweave-transpose.reads.before.label":"word reads for one position, row-major","oss-bitweave-transpose.reads.after.value":"1","oss-bitweave-transpose.reads.after.label":"load, reused across the block","oss-bitweave-transpose.dispatch.label":"runtime dispatch","oss-bitweave-transpose.kernel.scalar":"SCALAR","oss-bitweave-transpose.kernel.scalar.note":"reference","oss-bitweave-transpose.kernel.avx2":"AVX2","oss-bitweave-transpose.kernel.avx512":"AVX-512","oss-bitweave-transpose.kernel.neon":"NEON","oss-bitweave-transpose.score.label":"one score array","oss-bitweave-transpose.lane.cuda.title":"CUDA batch lane","oss-bitweave-transpose.lane.cuda.body":"a contiguous corpus goes up, only result state comes down","oss-bitweave-transpose.lane.cpu.title":"small query","oss-bitweave-transpose.lane.cpu.body":"stays on CPU: the transfer lane is wider than the compute saved","oss-bitweave-transpose.band.left":"every kernel converges on the same scores","oss-bitweave-transpose.band.right":"SCALAR IS THE REFERENCE","oss-bitweave-two-cluster-paths.chrome.path":"Two clusters, one merge","oss-bitweave-two-cluster-paths.chrome.status":"one deterministic global merge","oss-bitweave-two-cluster-paths.chrome.meta":"TOPOLOGY NAMED ON RECEIPT","oss-bitweave-two-cluster-paths.gates.request":"API request","oss-bitweave-two-cluster-paths.gate.auth":"auth","oss-bitweave-two-cluster-paths.gate.role":"role","oss-bitweave-two-cluster-paths.gate.rate":"rate limit","oss-bitweave-two-cluster-paths.gate.trace":"trace","oss-bitweave-two-cluster-paths.gates.coordinator":"coordinator","oss-bitweave-two-cluster-paths.mutation.label":"mutation lane","oss-bitweave-two-cluster-paths.mutation.write.name":"client write","oss-bitweave-two-cluster-paths.mutation.write.sub":"enters the declared primary path","oss-bitweave-two-cluster-paths.mutation.leader.name":"Raft leader","oss-bitweave-two-cluster-paths.mutation.leader.sub":"appended under the current term","oss-bitweave-two-cluster-paths.mutation.commit.name":"committed","oss-bitweave-two-cluster-paths.mutation.commit.sub":"ordered cluster state","oss-bitweave-two-cluster-paths.mutation.primary.name":"shard primary","oss-bitweave-two-cluster-paths.mutation.primary.sub":"applied to the local collection","oss-bitweave-two-cluster-paths.mutation.replicas.name":"replicas acknowledge","oss-bitweave-two-cluster-paths.mutation.replicas.sub":"according to the configured policy","oss-bitweave-two-cluster-paths.query.label":"query lane","oss-bitweave-two-cluster-paths.query.shard.one.name":"shard one","oss-bitweave-two-cluster-paths.query.shard.one.sub":"local top results with scores","oss-bitweave-two-cluster-paths.query.shard.two.name":"shard two","oss-bitweave-two-cluster-paths.query.shard.two.sub":"local top results with scores","oss-bitweave-two-cluster-paths.query.shard.three.name":"shard three","oss-bitweave-two-cluster-paths.query.shard.three.sub":"local top results with scores","oss-bitweave-two-cluster-paths.query.merge.name":"global merge","oss-bitweave-two-cluster-paths.query.merge.sub":"one deterministic ordering rule","oss-bitweave-two-cluster-paths.rebalance.label":"rebalance lane","oss-bitweave-two-cluster-paths.rebalance.leave":"a node leaves","oss-bitweave-two-cluster-paths.rebalance.text":"consistent hashing moves only the affected ranges","oss-bitweave-two-cluster-paths.rebalance.bandwidth":"rebalancing bandwidth","oss-bitweave-two-cluster-paths.band.left":"every receipt names its epoch and shard set","oss-bitweave-two-cluster-paths.band.right":"ONE GLOBAL ORDERING RULE","oss-bitweave-two-estates.chrome.path":"Two routes, one decision","oss-bitweave-two-estates.chrome.status":"one metric, three conversions","oss-bitweave-two-estates.chrome.meta":"decision sheet","oss-bitweave-two-estates.estate.native.title":"Support library","oss-bitweave-two-estates.estate.native.tag":"native binary","oss-bitweave-two-estates.estate.native.path":"a local hash-based text encoder","oss-bitweave-two-estates.estate.native.local":"the estate remains entirely local","oss-bitweave-two-estates.estate.native.note":"Native bits carry the direct HDC algebra and the native score contract.","oss-bitweave-two-estates.estate.imported.title":"Scientific literature","oss-bitweave-two-estates.estate.imported.tag":"external source, outside BitWeave","oss-bitweave-two-estates.estate.imported.source":"an existing specialised embedding on the source side","oss-bitweave-two-estates.estate.imported.conversion":"crosses a one-way measured quantisation boundary","oss-bitweave-two-estates.paths.label":"conversion paths","oss-bitweave-two-estates.path.int8.name":"INT8","oss-bitweave-two-estates.path.int8.quality":"Preserves more numeric state than the one-bit route; ordering stays closest to the source space.","oss-bitweave-two-estates.path.int8.storage":"The largest quantised state of the three, eight bits per dimension kept.","oss-bitweave-two-estates.path.int8.dependency":"The embedding, the quantiser training state and the error metrics stay named parts of the release.","oss-bitweave-two-estates.path.int8.migration":"A change of source space is re-measured and re-indexed before promotion.","oss-bitweave-two-estates.path.int8.readout":"keeps the most numeric state of the three conversions and prices it in storage; the route to pick when ordering fidelity carries the task metric.","oss-bitweave-two-estates.path.ternary.name":"ternary","oss-bitweave-two-estates.path.ternary.quality":"A middle contract: three levels per dimension, judged on the same retrieval metric.","oss-bitweave-two-estates.path.ternary.storage":"Between the INT8 and the one-bit storage contracts.","oss-bitweave-two-estates.path.ternary.dependency":"The embedding, the quantiser and the measured error contract travel with the release.","oss-bitweave-two-estates.path.ternary.migration":"A new source space means a new conversion, measured again before promotion.","oss-bitweave-two-estates.path.ternary.readout":"trades a little ordering fidelity for a smaller state; the middle route, chosen when the measured error still meets the task.","oss-bitweave-two-estates.path.binary.name":"binary","oss-bitweave-two-estates.path.binary.quality":"The usual route to binary embeddings: smaller and more lossy, with the ordering error measured and attached.","oss-bitweave-two-estates.path.binary.storage":"The smallest state of the three; the full operational system around BitWeave applies.","oss-bitweave-two-estates.path.binary.dependency":"The source model, the sign conversion and its error metrics stay explicit in the release.","oss-bitweave-two-estates.path.binary.migration":"Re-index when the source space changes; the release names what moved.","oss-bitweave-two-estates.path.binary.readout":"the smallest and most lossy conversion; it earns its place when the measured ordering error still serves the retrieval task.","oss-bitweave-two-estates.metric.label":"ordering preserved on the intended retrieval metric","oss-bitweave-two-estates.metric.caption":"Three conversions on one metric; the measured error contract decides the route.","oss-bitweave-two-estates.sheet.title":"decision sheet","oss-bitweave-two-estates.sheet.quality":"quality","oss-bitweave-two-estates.sheet.storage":"storage","oss-bitweave-two-estates.sheet.dependency":"dependency","oss-bitweave-two-estates.sheet.migration":"migration","oss-bitweave-two-estates.band.left":"each domain picks on its own evidence","oss-bitweave-two-estates.band.right":"external source, declared quantised state inside","oss-bitweave-two-manifests.chrome.path":"Two encodings, side by side","oss-bitweave-two-manifests.chrome.status":"one source, three runs","oss-bitweave-two-manifests.chrome.meta":"illustrative","oss-bitweave-two-manifests.source.kicker":"one source paragraph","oss-bitweave-two-manifests.source.text":"The supplier ships machine parts from Rotterdam to three Baltic ports, and every shipment carries the same inspection certificate.","oss-bitweave-two-manifests.field.vocab":"vocabulary","oss-bitweave-two-manifests.field.codebook":"codebook","oss-bitweave-two-manifests.field.dimension":"dimension","oss-bitweave-two-manifests.field.mode":"mode","oss-bitweave-two-manifests.run.a.name":"Run one","oss-bitweave-two-manifests.run.a.machine":"machine one","oss-bitweave-two-manifests.run.a.vocab":"v7","oss-bitweave-two-manifests.run.a.codebook":"checksum a","oss-bitweave-two-manifests.run.a.dimension":"d4096","oss-bitweave-two-manifests.run.a.mode":"document","oss-bitweave-two-manifests.run.a.action":"Show run one","oss-bitweave-two-manifests.run.a.readout":"Run one encodes the paragraph under vocabulary v7, codebook checksum A, D4096 and document mode. This vector is the reference for the other two runs.","oss-bitweave-two-manifests.run.b.name":"Run two","oss-bitweave-two-manifests.run.b.machine":"machine one","oss-bitweave-two-manifests.run.b.vocab":"v7","oss-bitweave-two-manifests.run.b.codebook":"checksum b","oss-bitweave-two-manifests.run.b.dimension":"d4096","oss-bitweave-two-manifests.run.b.mode":"document","oss-bitweave-two-manifests.run.b.action":"Show run two","oss-bitweave-two-manifests.run.b.readout":"Run two changes only the codebook. The source text is identical, yet the output is a visibly unrelated vector: the manifest, not the source, decides what the bits mean.","oss-bitweave-two-manifests.run.c.name":"Run three","oss-bitweave-two-manifests.run.c.machine":"machine two","oss-bitweave-two-manifests.run.c.vocab":"v7","oss-bitweave-two-manifests.run.c.codebook":"checksum a","oss-bitweave-two-manifests.run.c.dimension":"d4096","oss-bitweave-two-manifests.run.c.mode":"document","oss-bitweave-two-manifests.run.c.action":"Show run three","oss-bitweave-two-manifests.run.c.readout":"Run three repeats the first manifest on another machine and reproduces the first vector bit for bit. Same source plus same manifest gives the same vector under the supported contract.","oss-bitweave-two-manifests.run.output":"output vector","oss-bitweave-two-manifests.compare.same":"run one equals run three, bit for bit","oss-bitweave-two-manifests.compare.different":"run two is visibly unrelated","oss-bitweave-two-manifests.band.text":"The cause of agreement and disagreement sits beside each output.","oss-bitweave-two-manifests.band.meta":"manifest is data","oss-bitweave-use-cases.027ec6f663":"On your servers","oss-bitweave-use-cases.afacd94496":"Wherever a fast, repeatable answer matters, and the data should stay on your own machines.","oss-bitweave-use-cases.e1b95eec06":"same ordered result","oss-bitweave-use-cases.9fbe8ce1e2":"where retrieval helps","oss-bitweave-use-cases.01e0e0cef6":"Symbol and snippet similarity across a codebase. Runs in-process or in the browser over a portable index.","oss-bitweave-use-cases.2a0f298771":"Find the function or snippet you half remember.","oss-bitweave-use-cases.d5952dc5dc":"Code search","oss-bitweave-use-cases.0fed323750":"Per-transaction lookup against a large reference set. Deterministic results make the decision auditable after the fact.","oss-bitweave-use-cases.c0447b3123":"Check each transaction against known patterns as it happens.","oss-bitweave-use-cases.c2a6187595":"Fraud screening","oss-bitweave-use-cases.7d395a1387":"Retrieval-augmented generation. BitWeave fetches the supporting passages so the model answers from your material, not from guesswork.","oss-bitweave-use-cases.df0078cb03":"Give an AI the right context before it writes a reply.","oss-bitweave-use-cases.2b92ad2870":"Grounded answers","oss-bitweave-use-cases.0ca1d3f4fa":"Internal handbooks, policies, and product docs. An assistant that retrieves the same passage for the same question, never a different one next week.","oss-bitweave-use-cases.9d305f0794":"Build products that connect a question with related documents quickly, on machines you control.","oss-bitweave-use-cases.70cd2e748f":"Knowledge base","oss-bitweave-use-cases.e069f3e45f":"Why retrieval fits here","oss-bitweave-use-cases.4cc96855f7":"Fast on your own hardware","oss-bitweave-use-cases.34e5fa45f5":"A pinned meaning, reproduced","oss-bitweave-use-cases.5d9c27cc15":"Nothing leaves your own servers","oss-bitweave-vector-rail.chrome.path":"Six layers, one vector","oss-bitweave-vector-rail.chrome.status":"one logical id throughout","oss-bitweave-vector-rail.chrome.meta":"no second semantic type","oss-bitweave-vector-rail.source.label":"one source item","oss-bitweave-vector-rail.source.note":"enters at the top floor","oss-bitweave-vector-rail.floor.encoding.name":"Encoding","oss-bitweave-vector-rail.floor.encoding.body":"The source becomes a 4,096-bit logical vector and the manifest clips beside it.","oss-bitweave-vector-rail.floor.encoding.chip.manifest":"manifest attached","oss-bitweave-vector-rail.floor.algebra.name":"Algebra","oss-bitweave-vector-rail.floor.algebra.body":"Bound and bundled with two other vectors while retaining the dimension and the logical ID.","oss-bitweave-vector-rail.floor.algebra.chip.bind":"bind","oss-bitweave-vector-rail.floor.algebra.chip.bundle":"bundle","oss-bitweave-vector-rail.floor.operations.name":"Operations","oss-bitweave-vector-rail.floor.operations.body":"Nearest, range, duplicate and prototype calls touch the same rail.","oss-bitweave-vector-rail.floor.operations.chip.nearest":"nearest","oss-bitweave-vector-rail.floor.operations.chip.range":"range","oss-bitweave-vector-rail.floor.operations.chip.duplicate":"duplicate","oss-bitweave-vector-rail.floor.operations.chip.prototype":"prototype","oss-bitweave-vector-rail.floor.storage.name":"Collection and storage","oss-bitweave-vector-rail.floor.storage.body":"Metadata and a .bwks section attach without changing the vector.","oss-bitweave-vector-rail.floor.storage.chip.schema":"schema","oss-bitweave-vector-rail.floor.storage.chip.snapshot":".bwks section","oss-bitweave-vector-rail.floor.execution.name":"Physical execution","oss-bitweave-vector-rail.floor.execution.body":"Row-major, blocked SoA, memory-mapped and GPU-resident placements of the same identified object.","oss-bitweave-vector-rail.floor.execution.chip.row":"row-major","oss-bitweave-vector-rail.floor.execution.chip.soa":"blocked soa","oss-bitweave-vector-rail.floor.execution.chip.mmap":"memory-mapped","oss-bitweave-vector-rail.floor.execution.chip.gpu":"gpu-resident","oss-bitweave-vector-rail.floor.shards.name":"Shard group","oss-bitweave-vector-rail.floor.shards.body":"The group distributes the same identified vector. Nothing forks into a second semantic type.","oss-bitweave-vector-rail.floor.shards.chip.group":"shard group","oss-bitweave-vector-rail.identity.id":"id unchanged","oss-bitweave-vector-rail.identity.dim":"D4096","oss-bitweave-vector-rail.band.text":"Every floor sees the same identified vector.","oss-bitweave-vector-rail.band.meta":"nothing forks","oss-bitweave-word-count.chrome.path":"Fixed-point scores from words","oss-bitweave-word-count.chrome.status":"64 words, one count","oss-bitweave-word-count.chrome.meta":"512 bytes, packed u64","oss-bitweave-word-count.grid.kicker":"one d4096 vector, sixty-four words","oss-bitweave-word-count.grid.aria":"A D4096 vector drawn as sixty-four packed words across eight rows.","oss-bitweave-word-count.grid.note":"Word w07 is pulled out for the comparison beside it. Every other word counts the same way.","oss-bitweave-word-count.count.kicker":"one word compared and counted","oss-bitweave-word-count.count.query":"query","oss-bitweave-word-count.count.document":"document","oss-bitweave-word-count.count.operator":"xor","oss-bitweave-word-count.count.result":"count","oss-bitweave-word-count.count.popcount":"popcount","oss-bitweave-word-count.count.accumulator":"one accumulator, sixty-four counts","oss-bitweave-word-count.count.score":"q16.16 fixed point, no float step","oss-bitweave-word-count.slice.name":"BitSlice over mapped storage","oss-bitweave-word-count.slice.tag":"slice","oss-bitweave-word-count.slice.store":"memory-mapped section","oss-bitweave-word-count.slice.body":"The same vector read as an immutable zero-copy view into a memory-mapped section, with no owning allocation.","oss-bitweave-word-count.stop.name":"A cross-dimension comparison","oss-bitweave-word-count.stop.badge":"stopped","oss-bitweave-word-count.stop.body":"D4096 against D8192 stops before the first word is touched. Dimension validation happens before any operation combines or compares vectors.","oss-bitweave-word-count.band.text":"Packed words make memory accounting direct.","oss-bitweave-word-count.band.meta":"xor, popcount, q16.16","page-breadcrumb.c766e66518":"Breadcrumb","page-toc.7e439c353e":"On this page","section_st_a1_display-split.7c9a7c0610":"Detail","section_st_f1_cta-dark.90e40d5043":"Get started","toc-rail.f5cbdf6bfb":"Contents"}