FP16-weight package of d1-browser-decision-fp32 (FP32 arithmetic)

.gitattributes

@@ -33,3 +33,6 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 *.zip filter=lfs diff=lfs merge=lfs -text
 *.zst filter=lfs diff=lfs merge=lfs -text
 *tfevents* filter=lfs diff=lfs merge=lfs -text
+onnx/decision.data filter=lfs diff=lfs merge=lfs -text
+onnx/projector.data filter=lfs diff=lfs merge=lfs -text
+onnx/vision.data filter=lfs diff=lfs merge=lfs -text

LICENSE

@@ -0,0 +1,69 @@
+LFM Open License v1.0 
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by this document.
+
+"Licensor" shall mean Liquid AI, Inc.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work.
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
+
+"Commercial Use" shall mean any use of the Work for direct or indirect commercial advantage or monetary compensation.
+
+"Qualified Non-Profit Organization" shall mean a Legal Entity that is organized and operated exclusively for religious, charitable, scientific, testing for public safety, literary, or educational purposes, and which is exempt from federal income tax under Section 501(c)(3) of the United States Internal Revenue Code of 1986, as amended, or any equivalent non-profit or charitable organization in a foreign jurisdiction.
+"Non-Commercial or Research Purposes" shall mean purposes that do not involve any use of the Work or a Derivative Work for Commercial Use.
+
+"Threshold" shall mean annual revenue of 10 million United States dollars ($10,000,000) or more.
+
+2. Grant of Copyright License. Subject to the terms and conditions of this License, including the Commercial Use limitation set forth in Section 5, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of this License, including the Commercial Use limitation set forth in Section 5, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
+
+(a) You must give any other recipients of the Work or Derivative Works a copy of this License; and
+
+(b) You must cause any modified files to carry prominent notices stating that You changed the files; and
+
+(c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
+
+(d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License.
+
+You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
+
+5. Commercial Use Limitation.
+
+(a) The rights granted under this License for Commercial Use are conditioned upon You or Your Legal Entity not exceeding the Threshold.
+
+(b) Any Commercial Use of the Work or a Derivative Work by a Legal Entity that exceeds the Threshold is not licensed under this Agreement.
+
+(c) The Threshold shall not apply to a Qualified Non-Profit Organization's use of the Work or a Derivative Work for Non-Commercial or Research Purposes.
+
+6. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
+
+7. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except for the reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
+
+8. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
+
+9. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
+
+10. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
+
+11. Termination. This License will terminate automatically and immediately if You fail to comply with any of its terms and conditions. Upon termination, You must cease all use of the Work and any Derivative Works and delete all copies in Your possession.
+
+END OF TERMS AND CONDITIONS

NOTICE

@@ -0,0 +1,34 @@
+d1 FP16-weight browser-decision derivative
+
+Original model and model implementation: Liquid AI, LiquidAI/d1-omni-600M,
+revision 02b55d7076f15129e59ab3f94783f32c4b088674.
+Original license: LFM Open License v1.0. The exact upstream license is retained
+as LICENSE. Liquid AI does not endorse this experimental derivative.
+
+MODIFIED MATERIALS NOTICE
+This package is derived from the WebBrain FP32 release
+webbrain-one/d1-browser-decision-fp32 (revision 71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8), whose
+notice describes the earlier changes: audio components removed, decision head
+and vision projector adapted, one rank-4 LoRA merged into four encoder Q/V
+weights.
+
+For this package, every FP32 weight tensor with at least 4,096 elements in the
+three ONNX graphs was rounded once to FP16 and is cast back to FP32 where it is
+used (scripts/models/d1/convert_fp16.py in the WebBrain repository, copied to
+provenance/). The token-embedding table is gathered in FP16 and only the
+gathered rows are cast. Activations, attention, softmax and accumulation stay
+FP32. No training, merge, selection or re-export from PyTorch was performed.
+onnx/decision.onnx, onnx/decision.data, onnx/vision.onnx, onnx/vision.data,
+onnx/projector.onnx and onnx/projector.data are modified derivatives.
+
+The immutable config.json retains a legacy dtype=float16 label from the
+upstream source; package-manifest.json is authoritative (FP16 weights, FP32
+arithmetic). Tokenizer, calibration temperatures and answer semantics are
+unchanged.
+
+This derivative is experimental. Synthetic labels/results and finite runtime
+parity do not establish reliability on real independently developed websites.
+No blanket commercial permission is granted here; consult LICENSE, including
+its annual-revenue threshold terms.
+
+Third-party runtime code retains its separate upstream notices under licenses/.

README.md

@@ -0,0 +1,60 @@
+---
+license: other
+license_name: lfm1.0
+license_link: LICENSE
+base_model: webbrain-one/d1-browser-decision-fp32
+tags:
+- decision
+- webgpu
+- onnx
+- fp16
+- experimental
+- image-text-to-decision
+---
+
+# d1 Browser Decision FP16
+
+The FP16-weight version of [webbrain-one/d1-browser-decision-fp32](https://huggingface.co/webbrain-one/d1-browser-decision-fp32) (revision `71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8`), an experimental, audio-free derivative of [LiquidAI/d1-omni-600M](https://huggingface.co/LiquidAI/d1-omni-600M/tree/02b55d7076f15129e59ab3f94783f32c4b088674). It scores named options for `choice`, `noul` and ordinal `score` questions using text/JSON state and optional screenshots. It does **not** generate text or tokens.
+
+This is the decision model the [WebBrain](https://github.com/webbrain-one/webbrain) extension downloads for its optional on-device decision provider.
+
+## What changed from the FP32 release
+
+- Every FP32 weight tensor with at least 4,096 elements in the three ONNX graphs is stored as FP16 and cast back to FP32 where it is used. The token-embedding table is gathered in FP16 and only the gathered rows are cast.
+- Activations, attention, softmax and accumulation stay FP32. Tokenizer, calibration temperatures, preprocessing and the answer semantics are unchanged.
+- No training, merge, selection or PyTorch re-export: the graphs are the published FP32 graphs with their weights rounded once ([`provenance/convert_fp16.py`](provenance/convert_fp16.py)).
+
+| | FP32 release | This package |
+|---|---:|---:|
+| Graphs and external data | 1,900,356,386 bytes | 950,872,204 bytes |
+| Largest single buffer (token embedding) | 256 MiB | 128 MiB |
+
+ONNX Runtime constant-folds the other weight casts when it creates the sessions, so expect GPU memory for those weights to stay close to the FP32 package. The download and the browser cache halve.
+
+## Parity with the FP32 release
+
+The same runtime code (WebBrain's `src/chrome/src/providers/d1-runtime.js` and its preprocessing, CPU tensor path, onnxruntime-node 1.24.1) ran both packages on the balanced-V3 held-out test (72 screenshots, 144 questions).
+
+| Comparison | Decision agreement | Max probability difference | Max expected-score difference |
+|---|---:|---:|---:|
+| CPU (onnxruntime-node), FP32 vs FP16 | 144/144 | 0.0102 (median 5.6e-7, 95th percentile 0.0020) | 0.0178 |
+| Chrome WebGPU through the WebBrain extension, RTX 5090 | pending | | |
+
+Quality on that test is the same as the FP32 release:
+
+| Package | Categorical | Completion found | False completions | Score MAE |
+|---|---:|---:|---:|---:|
+| FP32 release (CPU) | 92/126 | 22/24 | 1/48 | 0.5742 |
+| This package (CPU) | 92/126 | 22/24 | 1/48 | 0.5728 |
+
+These are synthetic, AI-labelled screens, not an independent real-site benchmark. See the FP32 model card for the training history, data limitations and the old test suite on which every stage missed all seven positive completion examples.
+
+## Runtime notes
+
+- The encoder's full-attention layers are dense: each one materializes a 16 × length × length FP32 score tensor per row. WebBrain bounds batches by that tensor (256 MiB, and never more than the adapter's storage-binding limit) and caps text-only rows at 2,048 tokens on WebGPU, truncating the state as the source does at its context limit.
+- Vision and projector outputs can stay on the GPU between graphs (`preferredOutputLocation: 'gpu-buffer'`), see [`runtime/d1-runtime.js`](runtime/d1-runtime.js).
+- CPU/WASM control and shape operators run as in the FP32 release; this is not a pure-GPU claim.
+
+## License and notices
+
+The model is governed by the exact upstream [LFM Open License v1.0](LICENSE), not Apache/MIT. Its commercial-use provisions include annual-revenue threshold terms; determine eligibility and obtain any required separate license before commercial deployment. This card is not legal approval or an endorsement by Liquid AI. [NOTICE](NOTICE) and the per-file sidecars describe the modifications. The copied runtime source carries the WebBrain project license in [licenses/webbrain/LICENSE](licenses/webbrain/LICENSE).

SHA256SUMS

@@ -0,0 +1,32 @@
+9953509cbd8c1c6ce7b06ddf74fcc204a892692316201dd8f7400a84790d4120  LICENSE
+a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef  NOTICE
+f801dd8537f2b6023a13435dfce59b4541d33ac7cc2e4172046f24fe719e3985  README.md
+68ddf4bd4f3e489455211f80836b36281115cb9206b8e8d47858d062bdb6508d  config.json
+4d28ca14dedc0b3d0fcc2b3339f0e79931faa33874f3d24f522183a8fc70068c  licenses/LFM2.5-Encoder-350M/LICENSE
+2f07c72751aed99790b8a4869cf2311df85a860b22ded05fa22803587a48922c  licenses/onnxruntime/LICENSE
+143764b952fdb1a7c69ce653bfba74a7744d6a8a573bfb73e235fba356c83de3  licenses/onnxruntime/ThirdPartyNotices.txt
+cfc7749b96f63bd31c3c42b5c471bf756814053e847c10f3eb003417bc523d30  licenses/transformers/LICENSE
+a759b37ffc07280716156c7f128257e2f61af3cbb95edbfcfd2e3a85d190a25f  licenses/webbrain/LICENSE
+467b109c425541363ac5304fc06b3ee7aba75521cd774507c2a4a3a1772e2dd6  onnx/decision.data
+a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef  onnx/decision.data.NOTICE.txt
+5ee0babc64f03d36557bbaecca506408feb1c8f59c0cdf93f7f42f716dd2565c  onnx/decision.onnx
+a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef  onnx/decision.onnx.NOTICE.txt
+30399cd25a12bc526bf0fef2b36e4ba940d44b68a0fe5e0c358e1907f16d2e51  onnx/projector.data
+a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef  onnx/projector.data.NOTICE.txt
+d63ae03e5daacabad20f2a9fdcd0f311a6a1bc8b23556aaf06633184d79c8766  onnx/projector.onnx
+a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef  onnx/projector.onnx.NOTICE.txt
+96fc0f19ded54cf124a6d21a56ef98d9c35af42cb4259a5d5e7ccb88c98aaa8d  onnx/vision.data
+a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef  onnx/vision.data.NOTICE.txt
+8cc9570bddc1b42c0fa1407936f53b076a11b630d47a50ca2bbe3401f4262231  onnx/vision.onnx
+a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef  onnx/vision.onnx.NOTICE.txt
+2e61fec2b5c4e84a1790df148b5283693665ece9a82cc51cf00504ebf6070763  provenance/conversion-report.json
+6e8eba124020ac7cd5d20c41661a08032d1ba7bceae8a9ef7c610d7964768539  provenance/convert_fp16.py
+2c611f8b2ee7e6b13b323c1363e724f3d2adc394cca08dd58f6bb4b2aa8dbc43  provenance/decision-metrics.mjs
+47a44175844ef5b5b5e68b994075eec92390fc8ae7527b43708acebc70012519  provenance/parity-cpu.json
+2988eb3d2e3905e496dcc2c24aa82324d8fc317874706197f07540c16291caa5  provenance/parity-cpu.mjs
+935a3e3baabc3103d8584204f22ab982bacf78edc1ccc36997ddb83418a1e9a9  provenance/source-package.json
+00569ab7cae839e0e3b54b92a319aa0b5591a87c5dec67dac48cabe2d1464d9e  runtime/d1-preprocess.js
+6d30dc1c2566a4098b6ff3d50fc22260bbc93b2128c9e1dd7eb078801e61bb18  runtime/d1-runtime.js
+256b18bf3b533c9aaa34099b049e688893282341fb078b772b3ecb7b59ab43b6  tiling-ratios.json
+1efc3a6609abf6b63b1f47188d139f3b59973a6a434dffe970a7261a51ed2711  tokenizer.json
+03efc74b752b899b6292ff7e607738be59e6f206fec9aca32bbc05e9184090fc  tokenizer_config.json

config.json

@@ -0,0 +1,72 @@
+{
+  "architectures": [
+    "NoAudioModel"
+  ],
+  "model_type": "d1_omni",
+  "dtype": "float16",
+  "max_length": 16384,
+  "image_text_length": 896,
+  "head_layers": 2,
+  "projector_hidden_size": 2048,
+  "temperatures": {
+    "choice:11+": 1.372515082359314,
+    "choice:2": 1.7465145587921143,
+    "choice:3-5": 1.3998981714248657,
+    "choice:6-10": 1.1751071214675903,
+    "noul:2": 1.6663223505020142,
+    "score:3-5": 1.7301132678985596,
+    "score:6-10": 1.0,
+    "choice": 1.0,
+    "score": 1.0,
+    "noul": 1.0
+  },
+  "bos_token_id": 1,
+  "pad_token_id": 0,
+  "text_config": {
+    "vocab_size": 65536,
+    "hidden_size": 1024,
+    "intermediate_size": 6656,
+    "num_hidden_layers": 16,
+    "num_attention_heads": 16,
+    "num_key_value_heads": 8,
+    "layer_types": [
+      "conv",
+      "conv",
+      "full_attention",
+      "conv",
+      "conv",
+      "full_attention",
+      "conv",
+      "conv",
+      "full_attention",
+      "conv",
+      "full_attention",
+      "conv",
+      "full_attention",
+      "conv",
+      "full_attention",
+      "conv"
+    ],
+    "norm_eps": 1e-05,
+    "conv_L_cache": 3,
+    "block_ffn_dim_multiplier": 1.0,
+    "block_multiple_of": 256,
+    "max_position_embeddings": 128000,
+    "rope_theta": 1000000.0
+  },
+  "vision_config": {
+    "attention_dropout": 0.0,
+    "hidden_act": "gelu_pytorch_tanh",
+    "hidden_size": 768,
+    "intermediate_size": 3072,
+    "layer_norm_eps": 1e-06,
+    "model_type": "siglip2_vision_model",
+    "num_attention_heads": 12,
+    "num_channels": 3,
+    "num_hidden_layers": 12,
+    "num_patches": 256,
+    "patch_size": 16,
+    "vision_use_head": false
+  },
+  "source_revision": "02b55d7076f15129e59ab3f94783f32c4b088674"
+}

licenses/LFM2.5-Encoder-350M/LICENSE

@@ -0,0 +1,71 @@
+LFM Open License v1.0 
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by this document.
+
+"Licensor" shall mean Liquid AI, Inc.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work.
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work.
+
+"Commercial Use" shall mean any use of the Work for direct or indirect commercial advantage or monetary compensation.
+
+"Qualified Non-Profit Organization" shall mean a Legal Entity that is organized and operated exclusively for religious, charitable, scientific, testing for public safety, literary, or educational purposes, and which is exempt from federal income tax under Section 501(c)(3) of the United States Internal Revenue Code of 1986, as amended, or any equivalent non-profit or charitable organization in a foreign jurisdiction.
+
+"Non-Commercial or Research Purposes" shall mean purposes that do not involve any use of the Work or a Derivative Work for Commercial Use.
+
+"Threshold" shall mean annual revenue of 10 million United States dollars ($10,000,000) or more.
+
+2. Grant of Copyright License. Subject to the terms and conditions of this License, including the Commercial Use limitation set forth in Section 5, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of this License, including the Commercial Use limitation set forth in Section 5, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions:
+
+(a) You must give any other recipients of the Work or Derivative Works a copy of this License; and
+
+(b) You must cause any modified files to carry prominent notices stating that You changed the files; and
+
+(c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and
+
+(d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License.
+
+You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License.
+
+5. Commercial Use Limitation.
+
+(a) The rights granted under this License for Commercial Use are conditioned upon You or Your Legal Entity not exceeding the Threshold.
+
+(b) Any Commercial Use of the Work or a Derivative Work by a Legal Entity that exceeds the Threshold is not licensed under this Agreement.
+
+(c) The Threshold shall not apply to a Qualified Non-Profit Organization's use of the Work or a Derivative Work for Non-Commercial or Research Purposes.
+
+6. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions.
+
+7. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except for the reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file.
+
+8. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License.
+
+9. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
+
+10. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability.
+
+11. Termination. This License will terminate automatically and immediately if You fail to comply with any of its terms and conditions. Upon termination, You must cease all use of the Work and any Derivative Works and delete all copies in Your possession.
+
+END OF TERMS AND CONDITIONS

licenses/onnxruntime/LICENSE

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

licenses/transformers/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

licenses/webbrain/LICENSE

@@ -0,0 +1,685 @@
+WebBrain project license notice
+
+Copyright (c) 2026 Emre Sokullu
+
+WebBrain 33.0.0 and later is free software: you may redistribute it and/or
+modify it under the terms of the GNU General Public License as published by
+the Free Software Foundation, either version 3 of the License, or (at your
+option) any later version.
+
+The unmodified GNU GPL version 3 license text follows.
+
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.

onnx/decision.data

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:467b109c425541363ac5304fc06b3ee7aba75521cd774507c2a4a3a1772e2dd6
+size 761643008

onnx/decision.data.NOTICE.txt

@@ -0,0 +1,34 @@
+d1 FP16-weight browser-decision derivative
+
+Original model and model implementation: Liquid AI, LiquidAI/d1-omni-600M,
+revision 02b55d7076f15129e59ab3f94783f32c4b088674.
+Original license: LFM Open License v1.0. The exact upstream license is retained
+as LICENSE. Liquid AI does not endorse this experimental derivative.
+
+MODIFIED MATERIALS NOTICE
+This package is derived from the WebBrain FP32 release
+webbrain-one/d1-browser-decision-fp32 (revision 71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8), whose
+notice describes the earlier changes: audio components removed, decision head
+and vision projector adapted, one rank-4 LoRA merged into four encoder Q/V
+weights.
+
+For this package, every FP32 weight tensor with at least 4,096 elements in the
+three ONNX graphs was rounded once to FP16 and is cast back to FP32 where it is
+used (scripts/models/d1/convert_fp16.py in the WebBrain repository, copied to
+provenance/). The token-embedding table is gathered in FP16 and only the
+gathered rows are cast. Activations, attention, softmax and accumulation stay
+FP32. No training, merge, selection or re-export from PyTorch was performed.
+onnx/decision.onnx, onnx/decision.data, onnx/vision.onnx, onnx/vision.data,
+onnx/projector.onnx and onnx/projector.data are modified derivatives.
+
+The immutable config.json retains a legacy dtype=float16 label from the
+upstream source; package-manifest.json is authoritative (FP16 weights, FP32
+arithmetic). Tokenizer, calibration temperatures and answer semantics are
+unchanged.
+
+This derivative is experimental. Synthetic labels/results and finite runtime
+parity do not establish reliability on real independently developed websites.
+No blanket commercial permission is granted here; consult LICENSE, including
+its annual-revenue threshold terms.
+
+Third-party runtime code retains its separate upstream notices under licenses/.

onnx/decision.onnx

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:5ee0babc64f03d36557bbaecca506408feb1c8f59c0cdf93f7f42f716dd2565c
+size 376683

onnx/decision.onnx.NOTICE.txt

@@ -0,0 +1,34 @@
+d1 FP16-weight browser-decision derivative
+
+Original model and model implementation: Liquid AI, LiquidAI/d1-omni-600M,
+revision 02b55d7076f15129e59ab3f94783f32c4b088674.
+Original license: LFM Open License v1.0. The exact upstream license is retained
+as LICENSE. Liquid AI does not endorse this experimental derivative.
+
+MODIFIED MATERIALS NOTICE
+This package is derived from the WebBrain FP32 release
+webbrain-one/d1-browser-decision-fp32 (revision 71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8), whose
+notice describes the earlier changes: audio components removed, decision head
+and vision projector adapted, one rank-4 LoRA merged into four encoder Q/V
+weights.
+
+For this package, every FP32 weight tensor with at least 4,096 elements in the
+three ONNX graphs was rounded once to FP16 and is cast back to FP32 where it is
+used (scripts/models/d1/convert_fp16.py in the WebBrain repository, copied to
+provenance/). The token-embedding table is gathered in FP16 and only the
+gathered rows are cast. Activations, attention, softmax and accumulation stay
+FP32. No training, merge, selection or re-export from PyTorch was performed.
+onnx/decision.onnx, onnx/decision.data, onnx/vision.onnx, onnx/vision.data,
+onnx/projector.onnx and onnx/projector.data are modified derivatives.
+
+The immutable config.json retains a legacy dtype=float16 label from the
+upstream source; package-manifest.json is authoritative (FP16 weights, FP32
+arithmetic). Tokenizer, calibration temperatures and answer semantics are
+unchanged.
+
+This derivative is experimental. Synthetic labels/results and finite runtime
+parity do not establish reliability on real independently developed websites.
+No blanket commercial permission is granted here; consult LICENSE, including
+its annual-revenue threshold terms.
+
+Third-party runtime code retains its separate upstream notices under licenses/.

onnx/projector.data

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:30399cd25a12bc526bf0fef2b36e4ba940d44b68a0fe5e0c358e1907f16d2e51
+size 16789504

onnx/projector.data.NOTICE.txt

@@ -0,0 +1,34 @@
+d1 FP16-weight browser-decision derivative
+
+Original model and model implementation: Liquid AI, LiquidAI/d1-omni-600M,
+revision 02b55d7076f15129e59ab3f94783f32c4b088674.
+Original license: LFM Open License v1.0. The exact upstream license is retained
+as LICENSE. Liquid AI does not endorse this experimental derivative.
+
+MODIFIED MATERIALS NOTICE
+This package is derived from the WebBrain FP32 release
+webbrain-one/d1-browser-decision-fp32 (revision 71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8), whose
+notice describes the earlier changes: audio components removed, decision head
+and vision projector adapted, one rank-4 LoRA merged into four encoder Q/V
+weights.
+
+For this package, every FP32 weight tensor with at least 4,096 elements in the
+three ONNX graphs was rounded once to FP16 and is cast back to FP32 where it is
+used (scripts/models/d1/convert_fp16.py in the WebBrain repository, copied to
+provenance/). The token-embedding table is gathered in FP16 and only the
+gathered rows are cast. Activations, attention, softmax and accumulation stay
+FP32. No training, merge, selection or re-export from PyTorch was performed.
+onnx/decision.onnx, onnx/decision.data, onnx/vision.onnx, onnx/vision.data,
+onnx/projector.onnx and onnx/projector.data are modified derivatives.
+
+The immutable config.json retains a legacy dtype=float16 label from the
+upstream source; package-manifest.json is authoritative (FP16 weights, FP32
+arithmetic). Tokenizer, calibration temperatures and answer semantics are
+unchanged.
+
+This derivative is experimental. Synthetic labels/results and finite runtime
+parity do not establish reliability on real independently developed websites.
+No blanket commercial permission is granted here; consult LICENSE, including
+its annual-revenue threshold terms.
+
+Third-party runtime code retains its separate upstream notices under licenses/.

onnx/projector.onnx

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:d63ae03e5daacabad20f2a9fdcd0f311a6a1bc8b23556aaf06633184d79c8766
+size 5898

onnx/projector.onnx.NOTICE.txt

@@ -0,0 +1,34 @@
+d1 FP16-weight browser-decision derivative
+
+Original model and model implementation: Liquid AI, LiquidAI/d1-omni-600M,
+revision 02b55d7076f15129e59ab3f94783f32c4b088674.
+Original license: LFM Open License v1.0. The exact upstream license is retained
+as LICENSE. Liquid AI does not endorse this experimental derivative.
+
+MODIFIED MATERIALS NOTICE
+This package is derived from the WebBrain FP32 release
+webbrain-one/d1-browser-decision-fp32 (revision 71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8), whose
+notice describes the earlier changes: audio components removed, decision head
+and vision projector adapted, one rank-4 LoRA merged into four encoder Q/V
+weights.
+
+For this package, every FP32 weight tensor with at least 4,096 elements in the
+three ONNX graphs was rounded once to FP16 and is cast back to FP32 where it is
+used (scripts/models/d1/convert_fp16.py in the WebBrain repository, copied to
+provenance/). The token-embedding table is gathered in FP16 and only the
+gathered rows are cast. Activations, attention, softmax and accumulation stay
+FP32. No training, merge, selection or re-export from PyTorch was performed.
+onnx/decision.onnx, onnx/decision.data, onnx/vision.onnx, onnx/vision.data,
+onnx/projector.onnx and onnx/projector.data are modified derivatives.
+
+The immutable config.json retains a legacy dtype=float16 label from the
+upstream source; package-manifest.json is authoritative (FP16 weights, FP32
+arithmetic). Tokenizer, calibration temperatures and answer semantics are
+unchanged.
+
+This derivative is experimental. Synthetic labels/results and finite runtime
+parity do not establish reliability on real independently developed websites.
+No blanket commercial permission is granted here; consult LICENSE, including
+its annual-revenue threshold terms.
+
+Third-party runtime code retains its separate upstream notices under licenses/.

onnx/vision.data

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:96fc0f19ded54cf124a6d21a56ef98d9c35af42cb4259a5d5e7ccb88c98aaa8d
+size 171930624

onnx/vision.data.NOTICE.txt

@@ -0,0 +1,34 @@
+d1 FP16-weight browser-decision derivative
+
+Original model and model implementation: Liquid AI, LiquidAI/d1-omni-600M,
+revision 02b55d7076f15129e59ab3f94783f32c4b088674.
+Original license: LFM Open License v1.0. The exact upstream license is retained
+as LICENSE. Liquid AI does not endorse this experimental derivative.
+
+MODIFIED MATERIALS NOTICE
+This package is derived from the WebBrain FP32 release
+webbrain-one/d1-browser-decision-fp32 (revision 71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8), whose
+notice describes the earlier changes: audio components removed, decision head
+and vision projector adapted, one rank-4 LoRA merged into four encoder Q/V
+weights.
+
+For this package, every FP32 weight tensor with at least 4,096 elements in the
+three ONNX graphs was rounded once to FP16 and is cast back to FP32 where it is
+used (scripts/models/d1/convert_fp16.py in the WebBrain repository, copied to
+provenance/). The token-embedding table is gathered in FP16 and only the
+gathered rows are cast. Activations, attention, softmax and accumulation stay
+FP32. No training, merge, selection or re-export from PyTorch was performed.
+onnx/decision.onnx, onnx/decision.data, onnx/vision.onnx, onnx/vision.data,
+onnx/projector.onnx and onnx/projector.data are modified derivatives.
+
+The immutable config.json retains a legacy dtype=float16 label from the
+upstream source; package-manifest.json is authoritative (FP16 weights, FP32
+arithmetic). Tokenizer, calibration temperatures and answer semantics are
+unchanged.
+
+This derivative is experimental. Synthetic labels/results and finite runtime
+parity do not establish reliability on real independently developed websites.
+No blanket commercial permission is granted here; consult LICENSE, including
+its annual-revenue threshold terms.
+
+Third-party runtime code retains its separate upstream notices under licenses/.

onnx/vision.onnx

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8cc9570bddc1b42c0fa1407936f53b076a11b630d47a50ca2bbe3401f4262231
+size 126487

onnx/vision.onnx.NOTICE.txt

@@ -0,0 +1,34 @@
+d1 FP16-weight browser-decision derivative
+
+Original model and model implementation: Liquid AI, LiquidAI/d1-omni-600M,
+revision 02b55d7076f15129e59ab3f94783f32c4b088674.
+Original license: LFM Open License v1.0. The exact upstream license is retained
+as LICENSE. Liquid AI does not endorse this experimental derivative.
+
+MODIFIED MATERIALS NOTICE
+This package is derived from the WebBrain FP32 release
+webbrain-one/d1-browser-decision-fp32 (revision 71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8), whose
+notice describes the earlier changes: audio components removed, decision head
+and vision projector adapted, one rank-4 LoRA merged into four encoder Q/V
+weights.
+
+For this package, every FP32 weight tensor with at least 4,096 elements in the
+three ONNX graphs was rounded once to FP16 and is cast back to FP32 where it is
+used (scripts/models/d1/convert_fp16.py in the WebBrain repository, copied to
+provenance/). The token-embedding table is gathered in FP16 and only the
+gathered rows are cast. Activations, attention, softmax and accumulation stay
+FP32. No training, merge, selection or re-export from PyTorch was performed.
+onnx/decision.onnx, onnx/decision.data, onnx/vision.onnx, onnx/vision.data,
+onnx/projector.onnx and onnx/projector.data are modified derivatives.
+
+The immutable config.json retains a legacy dtype=float16 label from the
+upstream source; package-manifest.json is authoritative (FP16 weights, FP32
+arithmetic). Tokenizer, calibration temperatures and answer semantics are
+unchanged.
+
+This derivative is experimental. Synthetic labels/results and finite runtime
+parity do not establish reliability on real independently developed websites.
+No blanket commercial permission is granted here; consult LICENSE, including
+its annual-revenue threshold terms.
+
+Third-party runtime code retains its separate upstream notices under licenses/.

package-manifest.json

@@ -0,0 +1,1401 @@
+{
+  "schema_version": 1,
+  "complete": true,
+  "model_id": "webbrain-one/d1-browser-decision-fp16",
+  "variant": "projector_head_text_lora",
+  "selected_epoch": 6,
+  "dtype": "float16",
+  "weights_dtype": "float16",
+  "compute_dtype": "float32",
+  "audio": false,
+  "audio_included": false,
+  "quantization": false,
+  "generates_tokens": false,
+  "output_tokens": 0,
+  "source_package": {
+    "model_id": "webbrain-one/d1-browser-decision-fp32",
+    "revision": "71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8",
+    "package_manifest_sha256": "47b3a9efa02ce2cacf6da8c19607cc1179a8a2b7a339aebf3db05f2237151dbb"
+  },
+  "conversion": {
+    "script": "provenance/convert_fp16.py",
+    "report": {
+      "decision": {
+        "fp16_gather_tables": 1,
+        "fp16_elements": 380641280,
+        "kept_small_fp32": 99,
+        "fp16_weights": 103,
+        "initializer_types": {
+          "FLOAT16": 104,
+          "FLOAT": 99
+        },
+        "graph_bytes": 376683,
+        "data_bytes": 761643008
+      },
+      "vision": {
+        "kept_small_fp32": 123,
+        "fp16_weights": 74,
+        "fp16_elements": 85721088,
+        "initializer_types": {
+          "FLOAT": 123,
+          "FLOAT16": 74
+        },
+        "graph_bytes": 126487,
+        "data_bytes": 171930624
+      },
+      "projector": {
+        "kept_small_fp32": 2,
+        "fp16_weights": 2,
+        "fp16_elements": 8388608,
+        "initializer_types": {
+          "FLOAT": 2,
+          "FLOAT16": 2
+        },
+        "graph_bytes": 5898,
+        "data_bytes": 16789504
+      }
+    }
+  },
+  "graph_and_external_data_bytes": 950872204,
+  "parity": {
+    "comparison": {
+      "questions": 144,
+      "decisionAgreement": "144/144",
+      "maxProbabilityDifference": 0.010175764560699463,
+      "maxExpectedScoreDifference": 0.017800092697143555,
+      "worstQuestion": "final_test-compliance_notice-desktop-completed/auxiliary"
+    }
+  },
+  "license": {
+    "model": "LFM Open License v1.0",
+    "file": "LICENSE"
+  },
+  "synthetic_quality_only": true,
+  "real_site_generalization_verified": false,
+  "checksum_scope": "All package payload files; package-manifest.json and SHA256SUMS excluded to avoid self-hash recursion",
+  "created_at_utc": "2026-10-17T16:54:50.956469+00:00",
+  "files": [
+    {
+      "path": "LICENSE",
+      "bytes": 10572,
+      "sha256": "9953509cbd8c1c6ce7b06ddf74fcc204a892692316201dd8f7400a84790d4120"
+    },
+    {
+      "path": "NOTICE",
+      "bytes": 1856,
+      "sha256": "a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef"
+    },
+    {
+      "path": "README.md",
+      "bytes": 4102,
+      "sha256": "f801dd8537f2b6023a13435dfce59b4541d33ac7cc2e4172046f24fe719e3985"
+    },
+    {
+      "path": "config.json",
+      "bytes": 1765,
+      "sha256": "68ddf4bd4f3e489455211f80836b36281115cb9206b8e8d47858d062bdb6508d"
+    },
+    {
+      "path": "licenses/LFM2.5-Encoder-350M/LICENSE",
+      "bytes": 10574,
+      "sha256": "4d28ca14dedc0b3d0fcc2b3339f0e79931faa33874f3d24f522183a8fc70068c"
+    },
+    {
+      "path": "licenses/onnxruntime/LICENSE",
+      "bytes": 1073,
+      "sha256": "2f07c72751aed99790b8a4869cf2311df85a860b22ded05fa22803587a48922c"
+    },
+    {
+      "path": "licenses/onnxruntime/ThirdPartyNotices.txt",
+      "bytes": 338088,
+      "sha256": "143764b952fdb1a7c69ce653bfba74a7744d6a8a573bfb73e235fba356c83de3"
+    },
+    {
+      "path": "licenses/transformers/LICENSE",
+      "bytes": 11358,
+      "sha256": "cfc7749b96f63bd31c3c42b5c471bf756814053e847c10f3eb003417bc523d30"
+    },
+    {
+      "path": "licenses/webbrain/LICENSE",
+      "bytes": 35523,
+      "sha256": "a759b37ffc07280716156c7f128257e2f61af3cbb95edbfcfd2e3a85d190a25f"
+    },
+    {
+      "path": "onnx/decision.data",
+      "bytes": 761643008,
+      "sha256": "467b109c425541363ac5304fc06b3ee7aba75521cd774507c2a4a3a1772e2dd6",
+      "chunk_bytes": 4194304,
+      "chunks": [
+        {
+          "offset": 0,
+          "bytes": 4194304,
+          "sha256": "072c7e6217b42722d58289249dbb74f094f6e8531787a54806c6ba43448c730c"
+        },
+        {
+          "offset": 4194304,
+          "bytes": 4194304,
+          "sha256": "23d004fd8d962a212359969645516a7ee8d5bbd79626efc3676e1110e61043b3"
+        },
+        {
+          "offset": 8388608,
+          "bytes": 4194304,
+          "sha256": "77eac378bbaea368c9fcb371541e540b0a42b5aa1d382ea39ec3ef61920f8cb7"
+        },
+        {
+          "offset": 12582912,
+          "bytes": 4194304,
+          "sha256": "1da840911a2a588be0244a80516d2303fca38acb7bd527ac89ad9a72b7128a18"
+        },
+        {
+          "offset": 16777216,
+          "bytes": 4194304,
+          "sha256": "eb9a09beb4bb2a9fb49aa7ccc58dbc261e1f3ea0cde775460ea02aebf0f0c284"
+        },
+        {
+          "offset": 20971520,
+          "bytes": 4194304,
+          "sha256": "6381d809c195ac82fb77dd071df1be4d54192ec6b7c090f5c42393d7c9214461"
+        },
+        {
+          "offset": 25165824,
+          "bytes": 4194304,
+          "sha256": "dae2124c5b1f4309756f04849bb48ea50fd28a8d43b0a493b37f785ba744b5c6"
+        },
+        {
+          "offset": 29360128,
+          "bytes": 4194304,
+          "sha256": "a0df9084cf9bab0f2a0427771c57ef44a33be822a580d0cfc3d073068ca8f67f"
+        },
+        {
+          "offset": 33554432,
+          "bytes": 4194304,
+          "sha256": "60f2e764f91c5a6cf6d074f8726b16d69094a9d702bcd0244fb7641c11938d1a"
+        },
+        {
+          "offset": 37748736,
+          "bytes": 4194304,
+          "sha256": "54ec339eeec4de9bab0d2d88323ea0eb021940f4347e32971d11a5a3fac6cf7e"
+        },
+        {
+          "offset": 41943040,
+          "bytes": 4194304,
+          "sha256": "5b3863e1eccd70b8d121fbc357248bad6c96d30dfd94caca37ad896f16ab1900"
+        },
+        {
+          "offset": 46137344,
+          "bytes": 4194304,
+          "sha256": "149798bc89d9ef1620bf6631a4ebce244c3cab8f80221eb0423d7f8d605c961d"
+        },
+        {
+          "offset": 50331648,
+          "bytes": 4194304,
+          "sha256": "1a1f4fa1ab605f683fe5fd0f44d96a3108e8f84898cd41380b2ea2c752fb5226"
+        },
+        {
+          "offset": 54525952,
+          "bytes": 4194304,
+          "sha256": "7aeace3e235f48c1c66704a37e23aa4179a4a01cb1ea00ecfafb9da5c003dde4"
+        },
+        {
+          "offset": 58720256,
+          "bytes": 4194304,
+          "sha256": "e7010bc8de107db0adc1f0a78a05cc9f4fee8ce2c44d595cf07f0530c25d5539"
+        },
+        {
+          "offset": 62914560,
+          "bytes": 4194304,
+          "sha256": "3cf5c89f1ed4d6e133baaf9f05697d8dbd2719449d17eddcf9ff657598190d62"
+        },
+        {
+          "offset": 67108864,
+          "bytes": 4194304,
+          "sha256": "15dd43da2acd50f279f0b0102c37180cfeeb9556628d60d92b7b7a9a1635f0b1"
+        },
+        {
+          "offset": 71303168,
+          "bytes": 4194304,
+          "sha256": "c9dcf749683caaf17dcccb66db84b1c271e8c6d521362753225a3f82ead3fd31"
+        },
+        {
+          "offset": 75497472,
+          "bytes": 4194304,
+          "sha256": "df454941a29d300b934950a1f4b78f0a05f997f318584655d4d237e9c546a866"
+        },
+        {
+          "offset": 79691776,
+          "bytes": 4194304,
+          "sha256": "db41ae6578a21a1dc9f7e7818de4a10871fa91c04e3637ad13f39802ff2e9af2"
+        },
+        {
+          "offset": 83886080,
+          "bytes": 4194304,
+          "sha256": "f7e53df7ccc02fa5fa7e6d557f042a2ffaa2ebfba6bf2648473a76104eed9421"
+        },
+        {
+          "offset": 88080384,
+          "bytes": 4194304,
+          "sha256": "c5899d3597f12ab2e307be596f7e90a7a443b061d949591692b53dcc88bfec63"
+        },
+        {
+          "offset": 92274688,
+          "bytes": 4194304,
+          "sha256": "04aa91203e083c4fdcf9de292908e9dfa54cd1d23a0b7fffe526d94f7ec32b3b"
+        },
+        {
+          "offset": 96468992,
+          "bytes": 4194304,
+          "sha256": "751d5fdaeaca0b784579bc707aac66a3eb5d643c6081d7f34c801f8cb3d773e0"
+        },
+        {
+          "offset": 100663296,
+          "bytes": 4194304,
+          "sha256": "c02421029c0ddc4e2746c3fa3d6d09948ca627be6923f2aded9c2bf102f954ec"
+        },
+        {
+          "offset": 104857600,
+          "bytes": 4194304,
+          "sha256": "9f1876c28425578b1bbba681225f5d085620510e6a7f77b26120026442f63ec2"
+        },
+        {
+          "offset": 109051904,
+          "bytes": 4194304,
+          "sha256": "17b6d6f96dbba88c7e2553d989ad29984787ad40f5b89d8eb21394d2969bde5a"
+        },
+        {
+          "offset": 113246208,
+          "bytes": 4194304,
+          "sha256": "b544fdbbfd22d6f4dadb7095370cb8ac36e914fdee3955e305b566da662f0787"
+        },
+        {
+          "offset": 117440512,
+          "bytes": 4194304,
+          "sha256": "d289cc42ce56e9010fcc475ab813a7af56e9961158241516ce915442afab8821"
+        },
+        {
+          "offset": 121634816,
+          "bytes": 4194304,
+          "sha256": "cc212f77c2405c72d1382ce7ad088c6fec1c1ac267e68d0bff9a6e066925be8f"
+        },
+        {
+          "offset": 125829120,
+          "bytes": 4194304,
+          "sha256": "efecee6c933f4f0cd5aee1585bf40ae65429320d7ba6d0422e291570862c94d2"
+        },
+        {
+          "offset": 130023424,
+          "bytes": 4194304,
+          "sha256": "2512f21bb940ab2eb2bc535e1785aeb64dc6dfc6889c3ee0bcff5c3e9bab817d"
+        },
+        {
+          "offset": 134217728,
+          "bytes": 4194304,
+          "sha256": "e54142af60d6de9bc8d8fe73bc6d4c9c019f0af75cb34bec62cac693aa8fe8a1"
+        },
+        {
+          "offset": 138412032,
+          "bytes": 4194304,
+          "sha256": "9b8f6dc613c0e3400d18da45555f3283688a3976a9b7875d38341c0a1c8fc3b3"
+        },
+        {
+          "offset": 142606336,
+          "bytes": 4194304,
+          "sha256": "cd6fc7c1655766962c1b76dc8d26b5b248fe037b3f530444e51a0aba174e7614"
+        },
+        {
+          "offset": 146800640,
+          "bytes": 4194304,
+          "sha256": "c3b10b99e2ec53595c51b6e37812ab107e3e52dbc88c96d27079cae85d6811ec"
+        },
+        {
+          "offset": 150994944,
+          "bytes": 4194304,
+          "sha256": "52932c0fd8da4cb1c48bc89b6a272a7d1f5429a66261471f0c00ddb7dd863b9d"
+        },
+        {
+          "offset": 155189248,
+          "bytes": 4194304,
+          "sha256": "1a69d69cb68e1e24668d96d3ec8d2512706ef8a69434c0f1c31d5e544ea271aa"
+        },
+        {
+          "offset": 159383552,
+          "bytes": 4194304,
+          "sha256": "5d84deadb725626cf4e4d21a255d491c4fd48b77d300847c35b2513f9166281d"
+        },
+        {
+          "offset": 163577856,
+          "bytes": 4194304,
+          "sha256": "1565b004d7e84b35baaa1cbc85eb7753ddd384ad535bf6d8fbbd1234b1085ff6"
+        },
+        {
+          "offset": 167772160,
+          "bytes": 4194304,
+          "sha256": "56e7d46b64ed71a5fc0c0daf02bef162bd5f429d534f6a640856e24bef99debc"
+        },
+        {
+          "offset": 171966464,
+          "bytes": 4194304,
+          "sha256": "b3f2ca4a64878130b5332bffb6392b8b37209a670a3829723d22ca13ab09dee0"
+        },
+        {
+          "offset": 176160768,
+          "bytes": 4194304,
+          "sha256": "38b104c2e39f51b1100788305d09a3263be419770d86964708b94e5f5463b69c"
+        },
+        {
+          "offset": 180355072,
+          "bytes": 4194304,
+          "sha256": "599576278c0667646f3e1ae2b1867d8341fcae00fb0aad3651c5b344667cb80b"
+        },
+        {
+          "offset": 184549376,
+          "bytes": 4194304,
+          "sha256": "5bbba131c0a6bb0e08a8f45226ff2693395cd8bbe8f2a35c3d23cb86f1e8a6ba"
+        },
+        {
+          "offset": 188743680,
+          "bytes": 4194304,
+          "sha256": "f5225f057b06235408ad6df63b4cee9d467b3fbbff927c5ade10349f60d9f711"
+        },
+        {
+          "offset": 192937984,
+          "bytes": 4194304,
+          "sha256": "e1d319f402929a76285b39fc92654e59afa4c279fdcdccbc538780d14944b98a"
+        },
+        {
+          "offset": 197132288,
+          "bytes": 4194304,
+          "sha256": "486ac845176f9e92133f30d3dada367e89b14631fa836c0a1e55ca1e9c4c7961"
+        },
+        {
+          "offset": 201326592,
+          "bytes": 4194304,
+          "sha256": "0f7eaf84c77795d9226b0fc809e05da100d1e2d43701d1a2a17c9defb5ae39bc"
+        },
+        {
+          "offset": 205520896,
+          "bytes": 4194304,
+          "sha256": "645e926c370ca56a7ae8e2cb2bd2e391d880526fba8852cc0af5f89386c1f1aa"
+        },
+        {
+          "offset": 209715200,
+          "bytes": 4194304,
+          "sha256": "935581a6ba68876c42cf482de2572a88bbba9b8392ed06cf8234be3d6fa3233b"
+        },
+        {
+          "offset": 213909504,
+          "bytes": 4194304,
+          "sha256": "862cadbe691d055cd6ab1c1d706d517ea594ce87855284e02ed8b5d6c34c4421"
+        },
+        {
+          "offset": 218103808,
+          "bytes": 4194304,
+          "sha256": "a382c95291c796e79cda14555877fd948407151d06daac3666a4809593c9b7c8"
+        },
+        {
+          "offset": 222298112,
+          "bytes": 4194304,
+          "sha256": "b051c6f578146aff7803488be9e2679589c3c729ae74ab4b41271bf3f08a5a92"
+        },
+        {
+          "offset": 226492416,
+          "bytes": 4194304,
+          "sha256": "b856b828b55463e68f2b6fad23d1dacc38bb773ccef52120ccb54431db6fdce1"
+        },
+        {
+          "offset": 230686720,
+          "bytes": 4194304,
+          "sha256": "149107a248476dd7b6acf15ada9d1d16f4d084edb9edeadd2e5078ede03f242f"
+        },
+        {
+          "offset": 234881024,
+          "bytes": 4194304,
+          "sha256": "7fde5b0565c5021d22681d02a87e8401db41e9970f08bf461b5a3c0ad4507c45"
+        },
+        {
+          "offset": 239075328,
+          "bytes": 4194304,
+          "sha256": "cb6f1c97600b1c9df3ba2fee2bcfa02b5b56e857ff4fe51a28d5802f88cad755"
+        },
+        {
+          "offset": 243269632,
+          "bytes": 4194304,
+          "sha256": "17fd1f4b180e19d55f5a1609b33b84f11d94af17c892b27485ae43f5a82f382c"
+        },
+        {
+          "offset": 247463936,
+          "bytes": 4194304,
+          "sha256": "4a51eb71607bf3f054b4178f5c0608ed65ce8ede663a1649081c795b938e84aa"
+        },
+        {
+          "offset": 251658240,
+          "bytes": 4194304,
+          "sha256": "7b66170ffcce04b901218b2f0bbe8fa27600ffa7cd44476742de0f5c13460c29"
+        },
+        {
+          "offset": 255852544,
+          "bytes": 4194304,
+          "sha256": "fe6a7bdeb620542ef8d6cdbe66b3f6c1f131ef3a5426d1627a2fe97b0af7bc74"
+        },
+        {
+          "offset": 260046848,
+          "bytes": 4194304,
+          "sha256": "1535e08422e92eef41f917c725aa67ae83c431e8cc8e19620b965ba5375642c2"
+        },
+        {
+          "offset": 264241152,
+          "bytes": 4194304,
+          "sha256": "20a6e2491842ac2109757568b40512b06c0b4765900febf1949b968e80491c29"
+        },
+        {
+          "offset": 268435456,
+          "bytes": 4194304,
+          "sha256": "5c51b066c3a9af30600474650a72162f1ee12fc4778c889f0c122254a005eede"
+        },
+        {
+          "offset": 272629760,
+          "bytes": 4194304,
+          "sha256": "8ad50c258002a180d8b7424dcd4a4e00d4591b0fe31222ac2c34c39a457fd1b7"
+        },
+        {
+          "offset": 276824064,
+          "bytes": 4194304,
+          "sha256": "e103ce9b5dbd6643669d9f3b0a70ca35c15c7a52e7e17bd3e9117fe3f4d96879"
+        },
+        {
+          "offset": 281018368,
+          "bytes": 4194304,
+          "sha256": "5043be91ef84677cea4c4b5c39a7510dff6d4a77a542854c1b6990a73d4f4cf9"
+        },
+        {
+          "offset": 285212672,
+          "bytes": 4194304,
+          "sha256": "11f9a4dd512ef3feab1b3e5ff670d72adee861a36cce6dc50e351f3fde25ad88"
+        },
+        {
+          "offset": 289406976,
+          "bytes": 4194304,
+          "sha256": "1307a319f8750b0ba014dd5ee05659c81c9737808720bb781466849dcedacc0a"
+        },
+        {
+          "offset": 293601280,
+          "bytes": 4194304,
+          "sha256": "86ceeb4e804f19208bb248c5f588f80961b7d54717613e9bb386a709b576ab71"
+        },
+        {
+          "offset": 297795584,
+          "bytes": 4194304,
+          "sha256": "79c7833b93d48740c6431fb7c03102c2d9b8de8fd44ab0901e215893e6bd6337"
+        },
+        {
+          "offset": 301989888,
+          "bytes": 4194304,
+          "sha256": "25f10be47c26a79ef872d6ea097997650d5cc03f238caca21d743e7a5598cc75"
+        },
+        {
+          "offset": 306184192,
+          "bytes": 4194304,
+          "sha256": "94957841024f0cf59b69a23c31e5b9e5f8159b1eddf0c75dc17194db27e06342"
+        },
+        {
+          "offset": 310378496,
+          "bytes": 4194304,
+          "sha256": "b8b799efe0b69d354b96dc0dec4cd18c74b32005a3e60bf2f6602f372103f0ce"
+        },
+        {
+          "offset": 314572800,
+          "bytes": 4194304,
+          "sha256": "678761b2aae546ca38083431299d1ec6ea5d5cb7696fa1105337eb9790ecaf7a"
+        },
+        {
+          "offset": 318767104,
+          "bytes": 4194304,
+          "sha256": "6e53ba8ea07314a530a77773c720b91474a5377488322c06eb92b94d3dfde3d4"
+        },
+        {
+          "offset": 322961408,
+          "bytes": 4194304,
+          "sha256": "9f173f6ae097c1ed0fa426c90d563d8a6eb3fd4a276de896d7793a2ead54f94e"
+        },
+        {
+          "offset": 327155712,
+          "bytes": 4194304,
+          "sha256": "6f2e88a4f44c7afdfeaf8c29634710888a93c7838eec237d3bc516d66749a21c"
+        },
+        {
+          "offset": 331350016,
+          "bytes": 4194304,
+          "sha256": "eddea702046f2e7d43d9ad857338a8d37e4adc72ac2b084a15f0cc9c194938c3"
+        },
+        {
+          "offset": 335544320,
+          "bytes": 4194304,
+          "sha256": "14e26e2728b3631d0893c2d2b796a8f7886ee505c65d3e031cb7594a9316b46c"
+        },
+        {
+          "offset": 339738624,
+          "bytes": 4194304,
+          "sha256": "a0e0f5b3bf7a4c6837da07fbe1fcee2e3d0e080f33001a4860e212612c9b3ee4"
+        },
+        {
+          "offset": 343932928,
+          "bytes": 4194304,
+          "sha256": "52ee606c982098017644dec68abd1752b44b566c4e1637874e20378692c542d1"
+        },
+        {
+          "offset": 348127232,
+          "bytes": 4194304,
+          "sha256": "2e6a7d47d98251a96b54463d26c7dabfe8f49b1fc5c3d21a6e99c3b41572c337"
+        },
+        {
+          "offset": 352321536,
+          "bytes": 4194304,
+          "sha256": "e055be72b66b5114ffcb3234ed69d321265c18f56ea97a78aef85ac4bbb5ccfa"
+        },
+        {
+          "offset": 356515840,
+          "bytes": 4194304,
+          "sha256": "85d2e7ce06330b55fd9dfab66747fd5046a8575dd94e03e1a098f732ce8d31bd"
+        },
+        {
+          "offset": 360710144,
+          "bytes": 4194304,
+          "sha256": "a0906af590b410e67a627777eacc647dec4d1664d8e5252d195879ee1df1b2f0"
+        },
+        {
+          "offset": 364904448,
+          "bytes": 4194304,
+          "sha256": "414342bd4153ffdc192b4fabaf1167b32e175c8172be4385aef3f72fd5d23488"
+        },
+        {
+          "offset": 369098752,
+          "bytes": 4194304,
+          "sha256": "c447b43af9b102140b638e74bd1ac1be0e4c67b49001e426f7fe670712b053e0"
+        },
+        {
+          "offset": 373293056,
+          "bytes": 4194304,
+          "sha256": "77e0b66008d7b1e3b9c6d5a8ef684316ef83850b4cae6e55d2dc10567b3f4f14"
+        },
+        {
+          "offset": 377487360,
+          "bytes": 4194304,
+          "sha256": "af8e6678d3425c1ec0a7225b4f9ed08d80ccb80d847149925d50f7af217298d7"
+        },
+        {
+          "offset": 381681664,
+          "bytes": 4194304,
+          "sha256": "27c728655d3d3643837e2410e214045bcd07c02bbfe9e41cb7a281779ec9a3a5"
+        },
+        {
+          "offset": 385875968,
+          "bytes": 4194304,
+          "sha256": "346452c0051b9e6e90d1a9003a01fe7f6480dff330cb1cf54ec57f4afe790b6f"
+        },
+        {
+          "offset": 390070272,
+          "bytes": 4194304,
+          "sha256": "cdfa2988fd3f2840fc59f807eeb124e040b7bd3789768a4075404423c491a020"
+        },
+        {
+          "offset": 394264576,
+          "bytes": 4194304,
+          "sha256": "0283c62e470ee48611a2e14ac4eb730fcd45913fb68d976bdd40275f8393d6ce"
+        },
+        {
+          "offset": 398458880,
+          "bytes": 4194304,
+          "sha256": "2babf9eb8c0a6e418a5685a007ef8aac39d629d1b044e710514522f23a4dd381"
+        },
+        {
+          "offset": 402653184,
+          "bytes": 4194304,
+          "sha256": "13eda4275d3b8589c1966390209a74418f8839edc7a1908b3277702847e6273b"
+        },
+        {
+          "offset": 406847488,
+          "bytes": 4194304,
+          "sha256": "f8af671c7e7e178c17c24f54c1f2d1ee6a0fcea99645d3116d74091c96f8921d"
+        },
+        {
+          "offset": 411041792,
+          "bytes": 4194304,
+          "sha256": "5bb2465a14f9ff5b8dc0a0737738501e61c48e4c5ad38a826bb94de89cc0b49e"
+        },
+        {
+          "offset": 415236096,
+          "bytes": 4194304,
+          "sha256": "317b3a56564b75d9f801c68ecbb5f06311606940cd0fee8b29d6ae88e54d3314"
+        },
+        {
+          "offset": 419430400,
+          "bytes": 4194304,
+          "sha256": "c5a6ab802b848c54013291bfba6810336cbcc5e8fedb86376ebfdb0bf99720e6"
+        },
+        {
+          "offset": 423624704,
+          "bytes": 4194304,
+          "sha256": "c83859e709644d5d4b660b81c37c01fc0ed775acf0ae7480d433060930bc819c"
+        },
+        {
+          "offset": 427819008,
+          "bytes": 4194304,
+          "sha256": "5b18a95f2c86b1650a123b2362aa89c24d85f6e2695752c95780de5c64dedb92"
+        },
+        {
+          "offset": 432013312,
+          "bytes": 4194304,
+          "sha256": "83de68cd6bf9e55b1f0e5111aad5e3b0994ebe7ce54a3dc5db37c45f90761357"
+        },
+        {
+          "offset": 436207616,
+          "bytes": 4194304,
+          "sha256": "173fef8ba5208ecd3e1e937f7fc13bb12a1f54aab5ba9dc8504ed0efdc781ba9"
+        },
+        {
+          "offset": 440401920,
+          "bytes": 4194304,
+          "sha256": "8397010c5ae524d8847b12f9413fedfbeed722c9d63a94884bb3509315a70e27"
+        },
+        {
+          "offset": 444596224,
+          "bytes": 4194304,
+          "sha256": "2f8be054664e8a2a11b7d93499be7ccb246bd0a4ccca0eaf04722de82328e05f"
+        },
+        {
+          "offset": 448790528,
+          "bytes": 4194304,
+          "sha256": "8abce76b0f3c6080f26eece904cba276ff20887582f12ed00dcd7ff754f1a200"
+        },
+        {
+          "offset": 452984832,
+          "bytes": 4194304,
+          "sha256": "0ef27e5303fdcdc27d06b3836ced446d7347fa69bbd774976d2427c40f488137"
+        },
+        {
+          "offset": 457179136,
+          "bytes": 4194304,
+          "sha256": "7d9e12905b965022720724d107d1684b19f5e630207ff3029931d9af76e1dd8c"
+        },
+        {
+          "offset": 461373440,
+          "bytes": 4194304,
+          "sha256": "bf200f4aa15ab2b9c15c8bcb3833b19f1b90fd28aaced602bdf022ace5dd5ef3"
+        },
+        {
+          "offset": 465567744,
+          "bytes": 4194304,
+          "sha256": "f13af8dd709df5f21c9fdb675653af065a8c115db9b52202e6c2a2293ff9fea4"
+        },
+        {
+          "offset": 469762048,
+          "bytes": 4194304,
+          "sha256": "480c3d519c7b0152a1179bcca406dc6f5c321a442ee753bb1b1b01a5112f9913"
+        },
+        {
+          "offset": 473956352,
+          "bytes": 4194304,
+          "sha256": "698a917f255e4b44913911c400d522ad0dcd05b17916471214470bce007e0052"
+        },
+        {
+          "offset": 478150656,
+          "bytes": 4194304,
+          "sha256": "fbfd7888f52464ca9fdeace0b5cce905f19c3136b8a5c5de7f71572f4e71a5fc"
+        },
+        {
+          "offset": 482344960,
+          "bytes": 4194304,
+          "sha256": "a36f3a56335a4d9291662175d585807108656ee3e6c05fcae4f749467a66e814"
+        },
+        {
+          "offset": 486539264,
+          "bytes": 4194304,
+          "sha256": "ef36c083ddb87b1aeb56cd3d126d53b56936ebe85a830b55ae7db59af7ec671d"
+        },
+        {
+          "offset": 490733568,
+          "bytes": 4194304,
+          "sha256": "f7ba0e5158b481641abff23b8729899759b72c57d8ddd8964c5746ccf935ee77"
+        },
+        {
+          "offset": 494927872,
+          "bytes": 4194304,
+          "sha256": "bcfbd2177765eb0028f2c8cf38cd7aad56f67ee0a54b304f9378b0b0e4318803"
+        },
+        {
+          "offset": 499122176,
+          "bytes": 4194304,
+          "sha256": "01793ec86b73692a00b25f2614a2c745563cc006610cec664362bc20bff50d88"
+        },
+        {
+          "offset": 503316480,
+          "bytes": 4194304,
+          "sha256": "aaf40e660bdb571a87c6e7765e7672ad0b0241953edb8607e65cfe897bf236da"
+        },
+        {
+          "offset": 507510784,
+          "bytes": 4194304,
+          "sha256": "4b0f4c1bc2aba84b1a6931a0dcdd225453dbacb48960efb90a3984edc37aa3f5"
+        },
+        {
+          "offset": 511705088,
+          "bytes": 4194304,
+          "sha256": "3de691e37264d06f579404f0a599e321ecb71b023fd492bde78234596bb6309e"
+        },
+        {
+          "offset": 515899392,
+          "bytes": 4194304,
+          "sha256": "79334124769aecfbbdf4a7b4b01eebb0d81e5e93aed39fcb3c49976c1297e9cd"
+        },
+        {
+          "offset": 520093696,
+          "bytes": 4194304,
+          "sha256": "0fb5fe138955e7fd4c57fbdcd9945cb158a18e349fe9f7a836842407073a3b8d"
+        },
+        {
+          "offset": 524288000,
+          "bytes": 4194304,
+          "sha256": "88990aeda1facc0fd36e145e74e0d42fb6654560b67c0376a36ba6ca69faec70"
+        },
+        {
+          "offset": 528482304,
+          "bytes": 4194304,
+          "sha256": "99f5781f766c85511470758917d4c915d0115f560482f75298a5c946bb36ac64"
+        },
+        {
+          "offset": 532676608,
+          "bytes": 4194304,
+          "sha256": "1b0310aa8cc7f075ec1a8621478a533dcdd39e79250d48c04b5b6d2e99941648"
+        },
+        {
+          "offset": 536870912,
+          "bytes": 4194304,
+          "sha256": "f771e7819d6a2d2ea6400d0cb53b225e2b0ac9969353e5e659c94dfa5d3f80c7"
+        },
+        {
+          "offset": 541065216,
+          "bytes": 4194304,
+          "sha256": "adaf5ae6397566547cfa77cc44f6906f006dd736f32dac473fc724572974a15a"
+        },
+        {
+          "offset": 545259520,
+          "bytes": 4194304,
+          "sha256": "1c477faaf5ef4cc9556ffe1c6350b6111e557e6cd3316b37e0bc163a6d5dfa3e"
+        },
+        {
+          "offset": 549453824,
+          "bytes": 4194304,
+          "sha256": "b7506e3aaca5b12af7b4beb895de2035c8cac5120dcd4199017ca5b5b1591f57"
+        },
+        {
+          "offset": 553648128,
+          "bytes": 4194304,
+          "sha256": "712c294a8d4d969086a10897e60cbbf9b302727b7b3ebbff10b966d26c64e793"
+        },
+        {
+          "offset": 557842432,
+          "bytes": 4194304,
+          "sha256": "07d8b03d8f2f7ca186fac5ef946ba4797cf95a232316d0342b2dd3d2920fb501"
+        },
+        {
+          "offset": 562036736,
+          "bytes": 4194304,
+          "sha256": "c67062dd34b88a965af53ff9e403f084832efd70d8c6ac34da47fc3aec9d75ca"
+        },
+        {
+          "offset": 566231040,
+          "bytes": 4194304,
+          "sha256": "ba07f5964af06ab8113bd1a3bce14ae806ad46415cbaf60828a69f588872e36f"
+        },
+        {
+          "offset": 570425344,
+          "bytes": 4194304,
+          "sha256": "787a20802eec0be79d0347b4778bda6fab04a5b2404ad7b23aa0c1dd07307bc1"
+        },
+        {
+          "offset": 574619648,
+          "bytes": 4194304,
+          "sha256": "16bf65e2271fa5c3a41909362eb7220930660e301394bb2b7d91bfa4089ccd87"
+        },
+        {
+          "offset": 578813952,
+          "bytes": 4194304,
+          "sha256": "1a682ff6146a406f3590fcc4ec8a4badb596646a6a3130395d7412f56c6209b8"
+        },
+        {
+          "offset": 583008256,
+          "bytes": 4194304,
+          "sha256": "d52101a87626f12da6c19bc16ed2503a4484605d5c4b62f86d30df6f30281630"
+        },
+        {
+          "offset": 587202560,
+          "bytes": 4194304,
+          "sha256": "c6fc9a8548500aeb824e306f45c98f988b06fce702d18a8ce4060a2215a8537e"
+        },
+        {
+          "offset": 591396864,
+          "bytes": 4194304,
+          "sha256": "d02be6a76677e88a5950d7caae442cf3469e724724fa5f1b880109d57ab14bb4"
+        },
+        {
+          "offset": 595591168,
+          "bytes": 4194304,
+          "sha256": "6b53e64bc6bce427466f5f84e7e7b80cc50767bc2850ce7be0bdc039822e1e9a"
+        },
+        {
+          "offset": 599785472,
+          "bytes": 4194304,
+          "sha256": "b77eb048f85da3c8274ed8608370db340def99f71982f3974d50f59b1c7b7331"
+        },
+        {
+          "offset": 603979776,
+          "bytes": 4194304,
+          "sha256": "059cc15d055fc794c8cd9761760b924054d0ba07333a33a40b183f1e13b5b1c8"
+        },
+        {
+          "offset": 608174080,
+          "bytes": 4194304,
+          "sha256": "9790a3518330e7bddc2fffe059fc98255aef382480581da2720a90bab4fb0648"
+        },
+        {
+          "offset": 612368384,
+          "bytes": 4194304,
+          "sha256": "3e7e6b70bb081c469a0c072750c2099d981aa4298f7856039016c5fb3fe14f50"
+        },
+        {
+          "offset": 616562688,
+          "bytes": 4194304,
+          "sha256": "b09acb742353584573876b024562ba02ff84330c705b3b01b1e6903e690677d2"
+        },
+        {
+          "offset": 620756992,
+          "bytes": 4194304,
+          "sha256": "1c000a4a9fe96ee952df6201cd9cdf4fb6765613a9c330cf39815274c3ac5976"
+        },
+        {
+          "offset": 624951296,
+          "bytes": 4194304,
+          "sha256": "54dd4c2d1b99c41f4f42f6cd6c77aa51ef0a5633179598d40a28d80bd63bf40c"
+        },
+        {
+          "offset": 629145600,
+          "bytes": 4194304,
+          "sha256": "ec2e366c7dbe5bf99ba97e7bc93a2d012a446be59ab434ef0c05362e73cfefd7"
+        },
+        {
+          "offset": 633339904,
+          "bytes": 4194304,
+          "sha256": "f95e46760ddb1cdfd5da47de24282c0e6f00b9ec0383b7edc9096b14236c1124"
+        },
+        {
+          "offset": 637534208,
+          "bytes": 4194304,
+          "sha256": "e058925a20bf1e6bf6795c09e6da2dc759a01f59b89e0b9e1c4a604b96b5854f"
+        },
+        {
+          "offset": 641728512,
+          "bytes": 4194304,
+          "sha256": "7a9c3d76f9916663ece3b73ef3431a41711d0eb7ad44efabae0500a65488ca7d"
+        },
+        {
+          "offset": 645922816,
+          "bytes": 4194304,
+          "sha256": "81098b0af7a9c8eaecaf432e81a38f59addbf88a06fc2589a28ff3bdbb40faa5"
+        },
+        {
+          "offset": 650117120,
+          "bytes": 4194304,
+          "sha256": "6d389b096e003538b401b22bed3174eeef456b54a81d563b9fe96cd124bedaf0"
+        },
+        {
+          "offset": 654311424,
+          "bytes": 4194304,
+          "sha256": "694e7f5387f4c8c56ff19caf9ffc3a70662cbe403adb435a6ec86d6b27b1773f"
+        },
+        {
+          "offset": 658505728,
+          "bytes": 4194304,
+          "sha256": "37e9435d4cff49433758a182ec06dca4743a5176ff451888d35fa54007f06efd"
+        },
+        {
+          "offset": 662700032,
+          "bytes": 4194304,
+          "sha256": "6ba0c117cd4da833b273bcbba3d7d6641dcfea1c24996399652d39738cb19054"
+        },
+        {
+          "offset": 666894336,
+          "bytes": 4194304,
+          "sha256": "2306ad33b2f629669703fad70e4841d1dfb9e5411a8eb549033e2eb53259057b"
+        },
+        {
+          "offset": 671088640,
+          "bytes": 4194304,
+          "sha256": "49d20d274aa186c8ff0cde3ab3cc69d07cda345054ebde70e1e4bca962110268"
+        },
+        {
+          "offset": 675282944,
+          "bytes": 4194304,
+          "sha256": "e554cf9d0d462d8c6a3fce703b7353b7eb97d5e600a5ef8046c3701fb433b720"
+        },
+        {
+          "offset": 679477248,
+          "bytes": 4194304,
+          "sha256": "fc69a6163fd512cd47a3be17d0caf314fe3bed2e4f9381c05bb1188f3b974810"
+        },
+        {
+          "offset": 683671552,
+          "bytes": 4194304,
+          "sha256": "dbb092d4fc6dc03a7d9495216219643aa153c86565b760e53d1bf32090a5a660"
+        },
+        {
+          "offset": 687865856,
+          "bytes": 4194304,
+          "sha256": "399933cb8c0787c17ae108abfe45d804694c66f41420953b5259a9857bf43d16"
+        },
+        {
+          "offset": 692060160,
+          "bytes": 4194304,
+          "sha256": "e6fdc6d4ee81f5979d3a0213a05e8c02e4b65b915db7b2a6e7dd9cde56c8b7b8"
+        },
+        {
+          "offset": 696254464,
+          "bytes": 4194304,
+          "sha256": "465dc4987e83eed8c8fce5d166e1c15cffb01e1fdc9af2b0e21fe30f2420c939"
+        },
+        {
+          "offset": 700448768,
+          "bytes": 4194304,
+          "sha256": "a830dc749cc91e8fe25a7afd2c2f21aa51e2d2a44857f213f7cc40c1621e0ac0"
+        },
+        {
+          "offset": 704643072,
+          "bytes": 4194304,
+          "sha256": "485744366278a73e3c79126038e8141e11737f60d7a3c6bc9b83c8a979230c43"
+        },
+        {
+          "offset": 708837376,
+          "bytes": 4194304,
+          "sha256": "dfcba68d65549c8681a8173a2c32c4b10f1972c14addb0bcb1625c29050731d1"
+        },
+        {
+          "offset": 713031680,
+          "bytes": 4194304,
+          "sha256": "9f24fef0405c468ed044e77c6383aa581e6d217cc6ec5b5f8d31110451f7d49a"
+        },
+        {
+          "offset": 717225984,
+          "bytes": 4194304,
+          "sha256": "de4a04f477290007c0a40750713a977507af23aa9b4d14868726456c1a8a8bdb"
+        },
+        {
+          "offset": 721420288,
+          "bytes": 4194304,
+          "sha256": "380141fa05510429b114689209d4f77fc81195b767d0f4e5b46b09cbf8e8a11b"
+        },
+        {
+          "offset": 725614592,
+          "bytes": 4194304,
+          "sha256": "ba0e08f79fece5b76026f4c3edd217f6295a94be599897650b0fbc3ac0de5de0"
+        },
+        {
+          "offset": 729808896,
+          "bytes": 4194304,
+          "sha256": "55c906c9f9d789ff2488aa1d6e765e78aa9ccf22fa75b922b96fd8544b66e182"
+        },
+        {
+          "offset": 734003200,
+          "bytes": 4194304,
+          "sha256": "8f8f607080f4e3e2b0e25543a644ee73e1e8b7e627fd28b16e786e4ccd43ae5f"
+        },
+        {
+          "offset": 738197504,
+          "bytes": 4194304,
+          "sha256": "ef745c25675f476dc7219bd0eb827030125224290e9147296fe08c6362580306"
+        },
+        {
+          "offset": 742391808,
+          "bytes": 4194304,
+          "sha256": "a53244151c8946838fe5289fe89052d123b95cd8280db504d4ee252c34c01277"
+        },
+        {
+          "offset": 746586112,
+          "bytes": 4194304,
+          "sha256": "fcb471c6e59f6d38495f49dfae41bff136f47667b8ca4eadbe7fda88e0323ae7"
+        },
+        {
+          "offset": 750780416,
+          "bytes": 4194304,
+          "sha256": "3fbf539b88b9478ba766f581e3f89344fdbaa41a71aba1ad93f347bf40f745bc"
+        },
+        {
+          "offset": 754974720,
+          "bytes": 4194304,
+          "sha256": "7a0b276382cf58ad5f301d91d067468ac6df418b1a65e5135dcb2f80ff0e6490"
+        },
+        {
+          "offset": 759169024,
+          "bytes": 2473984,
+          "sha256": "0c03a86c6a04f3e256401c23fe428a5db7456180918150814f29eafd2c72f936"
+        }
+      ]
+    },
+    {
+      "path": "onnx/decision.data.NOTICE.txt",
+      "bytes": 1856,
+      "sha256": "a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef"
+    },
+    {
+      "path": "onnx/decision.onnx",
+      "bytes": 376683,
+      "sha256": "5ee0babc64f03d36557bbaecca506408feb1c8f59c0cdf93f7f42f716dd2565c"
+    },
+    {
+      "path": "onnx/decision.onnx.NOTICE.txt",
+      "bytes": 1856,
+      "sha256": "a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef"
+    },
+    {
+      "path": "onnx/projector.data",
+      "bytes": 16789504,
+      "sha256": "30399cd25a12bc526bf0fef2b36e4ba940d44b68a0fe5e0c358e1907f16d2e51",
+      "chunk_bytes": 4194304,
+      "chunks": [
+        {
+          "offset": 0,
+          "bytes": 4194304,
+          "sha256": "924e76e7ca836542c67b13a54bd60847a392ac930582eed5c77ec16e2869214e"
+        },
+        {
+          "offset": 4194304,
+          "bytes": 4194304,
+          "sha256": "c0652401094688e801f0c10471e5bde161c86a08d9b5724c9746967608c7ee97"
+        },
+        {
+          "offset": 8388608,
+          "bytes": 4194304,
+          "sha256": "a448dff95f8c00c124547273ce5521a9ce3ab09dfb93b9b08810c6b40851d09a"
+        },
+        {
+          "offset": 12582912,
+          "bytes": 4194304,
+          "sha256": "4e407787c98099a3a43556438a3c5fb704c54948080aafa8063f5960fc9308a3"
+        },
+        {
+          "offset": 16777216,
+          "bytes": 12288,
+          "sha256": "d7b7d065dbf5213a90212830258bd776ace45acd0d17ce64bd78e85c01056662"
+        }
+      ]
+    },
+    {
+      "path": "onnx/projector.data.NOTICE.txt",
+      "bytes": 1856,
+      "sha256": "a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef"
+    },
+    {
+      "path": "onnx/projector.onnx",
+      "bytes": 5898,
+      "sha256": "d63ae03e5daacabad20f2a9fdcd0f311a6a1bc8b23556aaf06633184d79c8766"
+    },
+    {
+      "path": "onnx/projector.onnx.NOTICE.txt",
+      "bytes": 1856,
+      "sha256": "a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef"
+    },
+    {
+      "path": "onnx/vision.data",
+      "bytes": 171930624,
+      "sha256": "96fc0f19ded54cf124a6d21a56ef98d9c35af42cb4259a5d5e7ccb88c98aaa8d",
+      "chunk_bytes": 4194304,
+      "chunks": [
+        {
+          "offset": 0,
+          "bytes": 4194304,
+          "sha256": "10f9fa685270332ec4dacd71516e6be316194f47b815a3ec164551cfa1daee9f"
+        },
+        {
+          "offset": 4194304,
+          "bytes": 4194304,
+          "sha256": "5fe30f88fa4cd5c99ead55ecd7e406ca7854918941fd0f669a9bd5649f8ff686"
+        },
+        {
+          "offset": 8388608,
+          "bytes": 4194304,
+          "sha256": "14251304e81ace11dbb31d8fcecd16b9de1bda22271cb77b8f536df4aaf69134"
+        },
+        {
+          "offset": 12582912,
+          "bytes": 4194304,
+          "sha256": "2cc113946f01c677ae69f75a24195184ffe1cffdf41d434e75231a187a4ae23e"
+        },
+        {
+          "offset": 16777216,
+          "bytes": 4194304,
+          "sha256": "b87276f32e79200a7df6a3bab37c3a08410577a0118b07f66b4fe19d0a660741"
+        },
+        {
+          "offset": 20971520,
+          "bytes": 4194304,
+          "sha256": "6347793c135a210d0980cdaf078817a06d35b772f5d0176f9894a46a3393055e"
+        },
+        {
+          "offset": 25165824,
+          "bytes": 4194304,
+          "sha256": "cc5b73c745b8e06077a2691d1c338cbc2b30b8b8c578196ad1b0bc2cad6cd1b6"
+        },
+        {
+          "offset": 29360128,
+          "bytes": 4194304,
+          "sha256": "9ceea43a41ec79d4e99cb0449e1d63f6aefcf8c44404490dd3b6032afee6b818"
+        },
+        {
+          "offset": 33554432,
+          "bytes": 4194304,
+          "sha256": "5cf40a53f03d49921f22f100a11637ee009428d414a75473cb1895283ca64672"
+        },
+        {
+          "offset": 37748736,
+          "bytes": 4194304,
+          "sha256": "07e11e812478989c87cc68ae5e19e90f60e65565348860b2ee123fcf9429e487"
+        },
+        {
+          "offset": 41943040,
+          "bytes": 4194304,
+          "sha256": "904556bff55ae80bd1b35db230ce78a0a19d77997977bf2f980be656bd82ff90"
+        },
+        {
+          "offset": 46137344,
+          "bytes": 4194304,
+          "sha256": "450047c379ca5c5ae2ab56a6de0c1394caaff1885e4f8ce8c687cde8e5378b3e"
+        },
+        {
+          "offset": 50331648,
+          "bytes": 4194304,
+          "sha256": "91a2a40a809a39dd1ad43c9951303bd853d664a75034d1838ec83f8f425f1835"
+        },
+        {
+          "offset": 54525952,
+          "bytes": 4194304,
+          "sha256": "cff1a29b4e749e9696a086464b9c06a5e851eae78e3788d4950975aefd32b430"
+        },
+        {
+          "offset": 58720256,
+          "bytes": 4194304,
+          "sha256": "fa46776fb7edb2584d2797d45b346ae1f906754fbc2ce882a161ef30efb372dd"
+        },
+        {
+          "offset": 62914560,
+          "bytes": 4194304,
+          "sha256": "a1a18dd3d3d25d2cf21b7bafd7726de3c79f657dc8e34e8d597b8eacd77a40cc"
+        },
+        {
+          "offset": 67108864,
+          "bytes": 4194304,
+          "sha256": "09c09e1b2fa95188460ab6cd6c74ddd35e138607962c38dd76ca008231d48a2e"
+        },
+        {
+          "offset": 71303168,
+          "bytes": 4194304,
+          "sha256": "1b5742b2e9197f826330d45d7bdeb1740ff8c39ff9411f9fb3fe8025a44eabf6"
+        },
+        {
+          "offset": 75497472,
+          "bytes": 4194304,
+          "sha256": "bddab63ac1fdb52a57b73a20222d1ecb2ae2f362fa3772c255f0c5188a704c71"
+        },
+        {
+          "offset": 79691776,
+          "bytes": 4194304,
+          "sha256": "53c10a933960877185eba1c10db71f294892530b30e0c8c0e6e8ffc062a9279e"
+        },
+        {
+          "offset": 83886080,
+          "bytes": 4194304,
+          "sha256": "24b1ef0a285057aec5af2e6ab9ac643a785191a18c5665531edf18924fb5b8d5"
+        },
+        {
+          "offset": 88080384,
+          "bytes": 4194304,
+          "sha256": "2d2e99948e692ba053f75127bf5fac7fcb5f97b9c1139a1f843852c22b332661"
+        },
+        {
+          "offset": 92274688,
+          "bytes": 4194304,
+          "sha256": "b1c90559374a20513ed84be641ed9d91bd5dbf58bd39cb0cedfef6ed15ad005d"
+        },
+        {
+          "offset": 96468992,
+          "bytes": 4194304,
+          "sha256": "455d612f5ae4d0183a22cf86458f379048fc901c54cffe5401fbd7d24dba2000"
+        },
+        {
+          "offset": 100663296,
+          "bytes": 4194304,
+          "sha256": "b81a67442d5c1f2ea469dfeb1b72423f33e29696207c2a632b3fe606b7af1c3c"
+        },
+        {
+          "offset": 104857600,
+          "bytes": 4194304,
+          "sha256": "6f2d5815780625d3ae1bdebde8f538065f8acc6986ed4960dfd4131752790a3c"
+        },
+        {
+          "offset": 109051904,
+          "bytes": 4194304,
+          "sha256": "34854e3c464bdb093aa2cbb9aeeadce6f62244a1d5e38a81c483892f6c2cecfa"
+        },
+        {
+          "offset": 113246208,
+          "bytes": 4194304,
+          "sha256": "9025bafab45f04e2de57f70f6831c7abca2bbd175c92812160aa156230721620"
+        },
+        {
+          "offset": 117440512,
+          "bytes": 4194304,
+          "sha256": "0bf15120eb9ba399947831df1cdc75b51a9682211e545050f005434125c5ccbf"
+        },
+        {
+          "offset": 121634816,
+          "bytes": 4194304,
+          "sha256": "8e597296fa9a46c0ded5f947dfe9d14a2612cd0a8f6efbbe471914e28ff7e795"
+        },
+        {
+          "offset": 125829120,
+          "bytes": 4194304,
+          "sha256": "ea2f0f61679fae39c419ad3bcffd1a309c4c30e2338221d5e1bb559fc05822b5"
+        },
+        {
+          "offset": 130023424,
+          "bytes": 4194304,
+          "sha256": "87f52b7d587085610d2011e67d8ebbe017ec30e64f249ffb8a5b547502f2d064"
+        },
+        {
+          "offset": 134217728,
+          "bytes": 4194304,
+          "sha256": "3c8dc9cfed15c57f7f0effe34f0fe370f47239b895d9f7ffb4518eb04a2dbbd2"
+        },
+        {
+          "offset": 138412032,
+          "bytes": 4194304,
+          "sha256": "87b8754d8cb4887099195e9620db51db912d652d5dec887437b17d286397b954"
+        },
+        {
+          "offset": 142606336,
+          "bytes": 4194304,
+          "sha256": "7bd49134f24770238c564b81f0856ab02aa0c181eec404cb6aa7e263045e144a"
+        },
+        {
+          "offset": 146800640,
+          "bytes": 4194304,
+          "sha256": "a1cba64dea08f4a6f3ea170cc97f1fa072bcd639adc68fcce4f6a85bc8a90876"
+        },
+        {
+          "offset": 150994944,
+          "bytes": 4194304,
+          "sha256": "2a5894232f6deadeb4483b43392a9e8935c4d902e4a6ba9c30fd351edca05a1d"
+        },
+        {
+          "offset": 155189248,
+          "bytes": 4194304,
+          "sha256": "de62ce2f7106560892f031a885f317d7fcee0abf5d1159f5bd4f9854d9ee0cec"
+        },
+        {
+          "offset": 159383552,
+          "bytes": 4194304,
+          "sha256": "0572abf2fa956f4ccf84ef05bec8ae62749375b4de30c3665fd454daebda12f3"
+        },
+        {
+          "offset": 163577856,
+          "bytes": 4194304,
+          "sha256": "3fd042b14f53045cdac8bdc28c075f52129c5097914991824e6b3c6ca4c6ff30"
+        },
+        {
+          "offset": 167772160,
+          "bytes": 4158464,
+          "sha256": "f6ea932b93bb2144651d902bc265ebf3e49e5636710f8db4d33deff9abdebda2"
+        }
+      ]
+    },
+    {
+      "path": "onnx/vision.data.NOTICE.txt",
+      "bytes": 1856,
+      "sha256": "a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef"
+    },
+    {
+      "path": "onnx/vision.onnx",
+      "bytes": 126487,
+      "sha256": "8cc9570bddc1b42c0fa1407936f53b076a11b630d47a50ca2bbe3401f4262231"
+    },
+    {
+      "path": "onnx/vision.onnx.NOTICE.txt",
+      "bytes": 1856,
+      "sha256": "a8423631317893541a2b0a14876e75e9e692a0accde363ba7e64b20aecb222ef"
+    },
+    {
+      "path": "provenance/conversion-report.json",
+      "bytes": 721,
+      "sha256": "2e61fec2b5c4e84a1790df148b5283693665ece9a82cc51cf00504ebf6070763"
+    },
+    {
+      "path": "provenance/convert_fp16.py",
+      "bytes": 4660,
+      "sha256": "6e8eba124020ac7cd5d20c41661a08032d1ba7bceae8a9ef7c610d7964768539"
+    },
+    {
+      "path": "provenance/decision-metrics.mjs",
+      "bytes": 4664,
+      "sha256": "2c611f8b2ee7e6b13b323c1363e724f3d2adc394cca08dd58f6bb4b2aa8dbc43"
+    },
+    {
+      "path": "provenance/parity-cpu.json",
+      "bytes": 1986,
+      "sha256": "47a44175844ef5b5b5e68b994075eec92390fc8ae7527b43708acebc70012519"
+    },
+    {
+      "path": "provenance/parity-cpu.mjs",
+      "bytes": 4044,
+      "sha256": "2988eb3d2e3905e496dcc2c24aa82324d8fc317874706197f07540c16291caa5"
+    },
+    {
+      "path": "provenance/source-package.json",
+      "bytes": 313,
+      "sha256": "935a3e3baabc3103d8584204f22ab982bacf78edc1ccc36997ddb83418a1e9a9"
+    },
+    {
+      "path": "runtime/d1-preprocess.js",
+      "bytes": 9407,
+      "sha256": "00569ab7cae839e0e3b54b92a319aa0b5591a87c5dec67dac48cabe2d1464d9e"
+    },
+    {
+      "path": "runtime/d1-runtime.js",
+      "bytes": 13809,
+      "sha256": "6d30dc1c2566a4098b6ff3d50fc22260bbc93b2128c9e1dd7eb078801e61bb18"
+    },
+    {
+      "path": "tiling-ratios.json",
+      "bytes": 681,
+      "sha256": "256b18bf3b533c9aaa34099b049e688893282341fb078b772b3ecb7b59ab43b6"
+    },
+    {
+      "path": "tokenizer.json",
+      "bytes": 4733371,
+      "sha256": "1efc3a6609abf6b63b1f47188d139f3b59973a6a434dffe970a7261a51ed2711",
+      "chunk_bytes": 4194304,
+      "chunks": [
+        {
+          "offset": 0,
+          "bytes": 4194304,
+          "sha256": "e0810cb790311d9043e2f7f66216fffc708fddbe1893375df488c910ee74202c"
+        },
+        {
+          "offset": 4194304,
+          "bytes": 539067,
+          "sha256": "eb61da1da6e97af2d014bf9c301bbb1689e777e05fd43bbdbc9e6481eb6df853"
+        }
+      ]
+    },
+    {
+      "path": "tokenizer_config.json",
+      "bytes": 259,
+      "sha256": "03efc74b752b899b6292ff7e607738be59e6f206fec9aca32bbc05e9184090fc"
+    }
+  ]
+}

provenance/conversion-report.json

@@ -0,0 +1,36 @@
+{
+  "decision": {
+    "fp16_gather_tables": 1,
+    "fp16_elements": 380641280,
+    "kept_small_fp32": 99,
+    "fp16_weights": 103,
+    "initializer_types": {
+      "FLOAT16": 104,
+      "FLOAT": 99
+    },
+    "graph_bytes": 376683,
+    "data_bytes": 761643008
+  },
+  "vision": {
+    "kept_small_fp32": 123,
+    "fp16_weights": 74,
+    "fp16_elements": 85721088,
+    "initializer_types": {
+      "FLOAT": 123,
+      "FLOAT16": 74
+    },
+    "graph_bytes": 126487,
+    "data_bytes": 171930624
+  },
+  "projector": {
+    "kept_small_fp32": 2,
+    "fp16_weights": 2,
+    "fp16_elements": 8388608,
+    "initializer_types": {
+      "FLOAT": 2,
+      "FLOAT16": 2
+    },
+    "graph_bytes": 5898,
+    "data_bytes": 16789504
+  }
+}

provenance/convert_fp16.py

@@ -0,0 +1,105 @@
+"""Store the d1 browser-decision graphs with FP16 weights and FP32 arithmetic.
+
+Input is the published FP32 package (decision, vision and projector graphs with
+external data). Every large FP32 initializer is rounded to FP16 once and cast
+back to FP32 where it is used, so the graphs compute exactly as before except
+for that one rounding of the weights. Activations, attention scores, softmax
+and accumulation stay FP32. The token-embedding table is the exception: its
+Gather reads the FP16 table and casts only the gathered rows, so the 256 MiB
+FP32 table becomes a 128 MiB buffer on the GPU.
+
+ONNX Runtime folds the other weight casts at session creation, so GPU memory
+for those weights is unchanged; the download and the browser cache halve.
+
+    python scripts/models/d1/convert_fp16.py <fp32-package-dir> <out-dir>
+"""
+import argparse
+import json
+import sys
+from collections import Counter
+from pathlib import Path
+
+import numpy as np
+import onnx
+from onnx import TensorProto, helper, numpy_helper
+
+GRAPHS = ("decision", "vision", "projector")
+# Small tensors (norm scales, biases, position tables) stay FP32: they are a
+# negligible share of the bytes and the most sensitive to rounding.
+MIN_ELEMENTS = 4096
+FP16_MAX = 65504.0
+
+
+def convert(source: Path, target: Path):
+    model = onnx.load(str(source), load_external_data=True)
+    graph = model.graph
+    if any(node.op_type in ("If", "Loop", "Scan") for node in graph.node) or model.functions:
+        raise SystemExit(f"{source.name}: nested graphs are not expected in the d1 package")
+    consumers = {}
+    for node in graph.node:
+        for index, name in enumerate(node.input):
+            consumers.setdefault(name, []).append((node, index))
+    casts, gather_casts, report = [], {}, Counter()
+    for initializer in graph.initializer:
+        if initializer.data_type != TensorProto.FLOAT:
+            continue
+        values = numpy_helper.to_array(initializer)
+        if values.size < MIN_ELEMENTS:
+            report["kept_small_fp32"] += 1
+            continue
+        if not np.isfinite(values).all() or np.abs(values).max() >= FP16_MAX:
+            report["kept_out_of_range_fp32"] += 1
+            continue
+        half = values.astype(np.float16)
+        uses = consumers.get(initializer.name, [])
+        name = initializer.name
+        if uses and all(node.op_type == "Gather" and index == 0 for node, index in uses):
+            # Gather the FP16 rows, then cast just those rows.
+            initializer.CopyFrom(numpy_helper.from_array(half, name))
+            for node, _ in uses:
+                gathered = node.output[0]
+                node.output[0] = gathered + "__fp16"
+                gather_casts[node.name] = helper.make_node(
+                    "Cast", [node.output[0]], [gathered], name=node.name + "/FP32", to=TensorProto.FLOAT)
+            report["fp16_gather_tables"] += 1
+        else:
+            stored = name + "__fp16"
+            initializer.CopyFrom(numpy_helper.from_array(half, stored))
+            casts.append(helper.make_node("Cast", [stored], [name], name=stored + "/FP32", to=TensorProto.FLOAT))
+            report["fp16_weights"] += 1
+        report["fp16_elements"] += int(values.size)
+    nodes = list(casts)
+    for node in graph.node:
+        nodes.append(node)
+        if node.name in gather_casts:
+            nodes.append(gather_casts[node.name])
+    del graph.node[:]
+    graph.node.extend(nodes)
+    del graph.value_info[:]
+    data = target.with_suffix(".data")
+    if data.exists():
+        data.unlink()
+    onnx.save_model(model, str(target), save_as_external_data=True, all_tensors_to_one_file=True,
+                    location=data.name, size_threshold=1024, convert_attribute=False)
+    onnx.checker.check_model(str(target))
+    stored_types = Counter(TensorProto.DataType.Name(t.data_type)
+                           for t in onnx.load(str(target), load_external_data=False).graph.initializer)
+    return dict(report, initializer_types=dict(stored_types),
+                graph_bytes=target.stat().st_size, data_bytes=data.stat().st_size)
+
+
+def main():
+    parser = argparse.ArgumentParser()
+    parser.add_argument("source", type=Path)
+    parser.add_argument("target", type=Path)
+    args = parser.parse_args()
+    (args.target / "onnx").mkdir(parents=True, exist_ok=True)
+    reports = {}
+    for role in GRAPHS:
+        reports[role] = convert(args.source / "onnx" / f"{role}.onnx", args.target / "onnx" / f"{role}.onnx")
+        print(role, json.dumps(reports[role]), flush=True)
+    (args.target / "conversion-report.json").write_text(json.dumps(reports, indent=2) + "\n")
+
+
+if __name__ == "__main__":
+    sys.exit(main())

provenance/decision-metrics.mjs

@@ -0,0 +1,89 @@
+// Scoring for decision answers in the d1 answer shape ({ type, choice,
+// probabilities } / { type, noul } / { type, score, probabilities }) against
+// the balanced-V3 test labels. Used by the CPU parity check and the hardware
+// eval so both report the same numbers as the d1 model card.
+
+export function questionsOf(request) {
+  return Object.fromEntries(request.questions.map(entry => [entry.id, entry.question]));
+}
+
+function optionProbabilities(answer, question) {
+  if (question.type === 'noul') return { yes: answer.noul, no: 1 - answer.noul };
+  return answer.probabilities || {};
+}
+
+export function predicted(answer, question) {
+  if (question.type === 'noul') return answer.noul >= 0.5 ? 'yes' : 'no';
+  if (question.type === 'choice') return answer.choice;
+  return String(Math.round(answer.score));
+}
+
+export function scoreAnswers(requests, answersById) {
+  const totals = { categorical: 0, correct: 0, completionPositives: 0, completionNegatives: 0, tp: 0, fp: 0, unknownTotal: 0, unknownCorrect: 0, scoreCount: 0, scoreAbsError: 0, truthProbability: 0, labelled: 0, missing: 0 };
+  const byType = {};
+  for (const request of requests) {
+    for (const entry of request.questions) {
+      const answer = answersById[entry.id];
+      const question = entry.question;
+      if (!answer) { totals.missing += 1; continue; }
+      totals.labelled += 1;
+      const label = entry.label;
+      const type = byType[question.type] ||= { total: 0, correct: 0 };
+      type.total += 1;
+      const probabilities = optionProbabilities(answer, question);
+      if (question.type === 'score') {
+        totals.scoreCount += 1;
+        totals.scoreAbsError += Math.abs(answer.score - label.expected_level);
+        totals.truthProbability += Number(probabilities[String(label.selected_index)] ?? 0);
+        if (Math.round(answer.score) === label.expected_level) type.correct += 1;
+        continue;
+      }
+      totals.categorical += 1;
+      const guess = predicted(answer, question);
+      const right = guess === label.selected_option;
+      if (right) { totals.correct += 1; type.correct += 1; }
+      totals.truthProbability += Number(probabilities[label.selected_option] ?? 0);
+      if (entry.is_completion_claim) {
+        const positive = (entry.completion_positive_options || []).includes(label.selected_option);
+        const claimed = (entry.completion_positive_options || []).includes(guess);
+        if (positive) { totals.completionPositives += 1; if (claimed) totals.tp += 1; }
+        else { totals.completionNegatives += 1; if (claimed) totals.fp += 1; }
+        const unknown = entry.uncertainty_metadata?.unknown_option;
+        if (unknown && label.selected_option === unknown) { totals.unknownTotal += 1; if (right) totals.unknownCorrect += 1; }
+      }
+    }
+  }
+  return {
+    categorical: `${totals.correct}/${totals.categorical}`,
+    categoricalAccuracy: totals.categorical ? totals.correct / totals.categorical : null,
+    completion: { tp: totals.tp, positives: totals.completionPositives, fp: totals.fp, negatives: totals.completionNegatives,
+      precision: totals.tp + totals.fp ? totals.tp / (totals.tp + totals.fp) : null,
+      recall: totals.completionPositives ? totals.tp / totals.completionPositives : null },
+    unknown: `${totals.unknownCorrect}/${totals.unknownTotal}`,
+    scoreMae: totals.scoreCount ? totals.scoreAbsError / totals.scoreCount : null,
+    meanTruthProbability: totals.labelled ? totals.truthProbability / totals.labelled : null,
+    byType,
+    missing: totals.missing,
+  };
+}
+
+// Largest per-option probability difference and decision agreement between two
+// answer sets for the same questions.
+export function compareAnswers(requests, left, right) {
+  let maxProbability = 0, maxScore = 0, agree = 0, total = 0, worst = null;
+  for (const request of requests) {
+    for (const entry of request.questions) {
+      const a = left[entry.id], b = right[entry.id];
+      if (!a || !b) continue;
+      total += 1;
+      const pa = optionProbabilities(a, entry.question), pb = optionProbabilities(b, entry.question);
+      for (const key of Object.keys(pa)) {
+        const difference = Math.abs(Number(pa[key]) - Number(pb[key]));
+        if (difference > maxProbability) { maxProbability = difference; worst = entry.id; }
+      }
+      if (entry.question.type === 'score') maxScore = Math.max(maxScore, Math.abs(a.score - b.score));
+      if (predicted(a, entry.question) === predicted(b, entry.question)) agree += 1;
+    }
+  }
+  return { questions: total, decisionAgreement: `${agree}/${total}`, maxProbabilityDifference: maxProbability, maxExpectedScoreDifference: maxScore, worstQuestion: worst };
+}

provenance/parity-cpu.json

@@ -0,0 +1,77 @@
+{
+  "startedAt": "2026-10-17T16:10:58.602Z",
+  "requests": 72,
+  "packages": {
+    "left": {
+      "dir": "/tmp/claude-0/-home-claude/90a37dde-3bb4-5598-a15b-321beb1e27f7/scratchpad/d1pkg/fp32",
+      "seconds": 1292.726,
+      "categorical": "92/126",
+      "categoricalAccuracy": 0.7301587301587301,
+      "completion": {
+        "tp": 22,
+        "positives": 24,
+        "fp": 1,
+        "negatives": 48,
+        "precision": 0.9565217391304348,
+        "recall": 0.9166666666666666
+      },
+      "unknown": "23/24",
+      "scoreMae": 0.5742397139717748,
+      "meanTruthProbability": 0.6952328595141978,
+      "byType": {
+        "choice": {
+          "total": 108,
+          "correct": 79
+        },
+        "noul": {
+          "total": 18,
+          "correct": 13
+        },
+        "score": {
+          "total": 18,
+          "correct": 10
+        }
+      },
+      "missing": 0
+    },
+    "right": {
+      "dir": "/tmp/claude-0/-home-claude/90a37dde-3bb4-5598-a15b-321beb1e27f7/scratchpad/d1pkg/fp16",
+      "seconds": 1249.803,
+      "categorical": "92/126",
+      "categoricalAccuracy": 0.7301587301587301,
+      "completion": {
+        "tp": 22,
+        "positives": 24,
+        "fp": 1,
+        "negatives": 48,
+        "precision": 0.9565217391304348,
+        "recall": 0.9166666666666666
+      },
+      "unknown": "23/24",
+      "scoreMae": 0.5727678203696358,
+      "meanTruthProbability": 0.6951776640168207,
+      "byType": {
+        "choice": {
+          "total": 108,
+          "correct": 79
+        },
+        "noul": {
+          "total": 18,
+          "correct": 13
+        },
+        "score": {
+          "total": 18,
+          "correct": 10
+        }
+      },
+      "missing": 0
+    }
+  },
+  "comparison": {
+    "questions": 144,
+    "decisionAgreement": "144/144",
+    "maxProbabilityDifference": 0.010175764560699463,
+    "maxExpectedScoreDifference": 0.017800092697143555,
+    "worstQuestion": "final_test-compliance_notice-desktop-completed/auxiliary"
+  }
+}

provenance/parity-cpu.mjs

@@ -0,0 +1,75 @@
+// CPU parity for two d1 packages through the extension's own runtime
+// (src/chrome/src/providers/d1-runtime.js, CPU tensor path) and preprocessing,
+// with onnxruntime-node. Runs the balanced-V3 final test (72 screenshots, 144
+// questions), scores both packages against the labels and reports the largest
+// per-option probability difference between them.
+//
+//   npm install --no-save onnxruntime-node@1.24.1 pngjs@7.0.0   (outside the repo is fine)
+//   node scripts/models/d1/parity-cpu.mjs --left <fp32-package> --right <fp16-package> \
+//     --test <final_test.json> --images <images dir> --modules <dir with node_modules> --output parity.json
+import fs from 'node:fs/promises';
+import path from 'node:path';
+import { createRequire } from 'node:module';
+import { fileURLToPath } from 'node:url';
+import { scoreAnswers, compareAnswers, questionsOf } from './decision-metrics.mjs';
+
+const root = path.resolve(path.dirname(fileURLToPath(import.meta.url)), '../../..');
+const args = process.argv.slice(2);
+const option = (name, fallback) => { const i = args.indexOf(name); return i < 0 ? fallback : args[i + 1]; };
+const require = createRequire(path.join(path.resolve(option('--modules', '.')), 'node_modules', 'x.js'));
+const ort = require('onnxruntime-node');
+const { PNG } = require('pngjs');
+
+// The preprocessing decodes screenshots with browser APIs; give it the same
+// RGBA pixels from a PNG decoder.
+globalThis.createImageBitmap = async blob => {
+  const png = PNG.sync.read(Buffer.from(await blob.arrayBuffer()));
+  return { width: png.width, height: png.height, data: png.data, close() {} };
+};
+globalThis.OffscreenCanvas = class {
+  getContext() {
+    let bitmap;
+    return { drawImage: image => { bitmap = image; }, getImageData: () => ({ data: bitmap.data }) };
+  }
+};
+
+const { createD1Runtime } = await import(path.join(root, 'src/chrome/src/providers/d1-runtime.js'));
+const { PreTrainedTokenizer } = await import(path.join(root, 'src/chrome/vendor/d1/transformers.web.js'));
+
+async function load(dir) {
+  const json = async name => JSON.parse(await fs.readFile(path.join(dir, name), 'utf8'));
+  const tokenizer = new PreTrainedTokenizer(await json('tokenizer.json'), await json('tokenizer_config.json'));
+  const sessions = {};
+  for (const role of ['decision', 'vision', 'projector']) {
+    sessions[role] = await ort.InferenceSession.create(path.join(dir, 'onnx', `${role}.onnx`), { graphOptimizationLevel: 'basic', intraOpNumThreads: Number(option('--threads', 8)) });
+  }
+  return createD1Runtime({ ort, tokenizer, config: await json('config.json'), ratios: await json('tiling-ratios.json'), sessions, model: dir });
+}
+
+const test = JSON.parse(await fs.readFile(option('--test'), 'utf8'));
+const limit = Number(option('--limit', test.requests.length));
+const requests = test.requests.slice(0, limit);
+const images = option('--images');
+const result = { startedAt: new Date().toISOString(), requests: requests.length, packages: {} };
+const answers = {};
+for (const [label, dir] of [['left', option('--left')], ['right', option('--right')]]) {
+  const runtime = await load(path.resolve(dir));
+  answers[label] = {};
+  const started = Date.now();
+  for (const request of requests) {
+    const urls = [];
+    for (const image of request.images) {
+      const bytes = await fs.readFile(path.join(images, path.basename(image)));
+      urls.push(`data:image/png;base64,${bytes.toString('base64')}`);
+    }
+    const output = await runtime.evaluate({ state: request.state, images: urls, questions: questionsOf(request) });
+    Object.assign(answers[label], output.answers);
+  }
+  await runtime.dispose();
+  result.packages[label] = { dir, seconds: (Date.now() - started) / 1000, ...scoreAnswers(requests, answers[label]) };
+  console.log(label, JSON.stringify(result.packages[label]));
+}
+result.comparison = compareAnswers(requests, answers.left, answers.right);
+result.answers = answers;
+console.log(JSON.stringify(result.comparison));
+await fs.writeFile(option('--output', 'parity.json'), JSON.stringify(result, null, 2));

provenance/source-package.json

@@ -0,0 +1,10 @@
+{
+  "model_id": "webbrain-one/d1-browser-decision-fp32",
+  "revision": "71866f0ccab0b9fa92c6df64d1c34eacf2a7b2b8",
+  "package_manifest_sha256": "47b3a9efa02ce2cacf6da8c19607cc1179a8a2b7a339aebf3db05f2237151dbb",
+  "graphs_from": [
+    "onnx/decision.onnx",
+    "onnx/vision.onnx",
+    "onnx/projector.onnx"
+  ]
+}

runtime/d1-preprocess.js

@@ -0,0 +1,169 @@
+export const f32=Math.fround;
+export function pyJSON(value) {
+  if(Array.isArray(value)) return '['+value.map(pyJSON).join(', ')+']';
+  if(value!==null && typeof value==='object') return '{'+Object.entries(value).map(([k,v])=>JSON.stringify(k)+': '+pyJSON(v)).join(', ')+'}';
+  if(typeof value==='number') {
+    if(!Number.isFinite(value)) throw new Error('D1 JSON numbers must be finite');
+    if(!Number.isInteger(value)&&Math.abs(value)<1e-4) return value.toExponential().replace(/e([+-])(\d+)$/,(all,sign,digits)=>'e'+sign+digits.padStart(2,'0'));
+  }
+  return JSON.stringify(value);
+}
+export function roundEven(x) {
+  const n=Math.floor(x),r=x-n;
+  return r===0.5 ? n+(n%2) : Math.round(x);
+}
+const escape=s=>s.replace(/<\|([A-Za-z0-9_]+)\|>/g,'<\u00a6$1\u00a6>');
+const criterion=v=>typeof v==='string'?v:pyJSON(v);
+export function renderOptions(q,image=false) {
+  if(q.type==='choice') return Object.entries(q.criteria).map(([k,v])=>v==null||v===''?k:`${k}: ${criterion(v)}`);
+  if(q.type==='score') return q.criteria.map((c,i)=>`level ${i}: ${criterion(c)}`);
+  const c=q.criteria&&Object.keys(q.criteria).length?q.criteria:(image?{false:'no',true:'yes'}:{});
+  const no=Object.hasOwn(c,'false')?c.false:c.no,yes=Object.hasOwn(c,'true')?c.true:c.yes;
+  return ['false: '+(no!=null&&no!==''?criterion(no):'no, the statement does not hold'),'true: '+(yes!=null&&yes!==''?criterion(yes):'yes, the statement holds')];
+}
+export function encode(tokenizer,state,q,maxLen,image=false) {
+  if(!['choice','noul','score'].includes(q.type)||typeof q.instructions!=='string')throw new Error('Invalid question type or instructions');
+  if(q.type==='choice'&&(!q.criteria||Array.isArray(q.criteria)||Object.keys(q.criteria).length<2))throw new Error('A choice requires at least two named criteria');
+  if(q.type==='score'&&(!Array.isArray(q.criteria)||q.criteria.length<2||q.criteria.length>10))throw new Error('A score requires 2 to 10 levels');
+  if(q.type==='noul'&&q.criteria!=null&&(Array.isArray(q.criteria)||typeof q.criteria!=='object'))throw new Error('noul criteria must be an object');
+  const id=s=>tokenizer.convert_tokens_to_ids(s);
+  const enc=s=>Array.from(tokenizer.encode(escape(s),{add_special_tokens:false}));
+  const options=renderOptions(q,image);
+  const budget=Math.max(96,Math.min(options.length*24+32,Math.floor(maxLen/2)));
+  const per=Math.max(2,Math.floor((budget-3*options.length)/options.length));
+  const question=[id('<|reserved_8|>'),...enc(q.instructions)].slice(0,Math.max(16,budget));
+  const markers=[];
+  for(const option of options) {
+    markers.push(question.length+1);
+    question.push(id('<|reserved_9|>'),id('<|mask|>'),...enc(' '+option).slice(0,per),id('<|reserved_10|>'));
+  }
+  question.push(id('<|reserved_11|>'));
+  const room=Math.max(0,maxLen-question.length-2);
+  const stateIds=[id('<|reserved_7|>'),...enc(typeof state==='string'?state:pyJSON(state)).slice(0,room)];
+  const ids=[tokenizer.bos_token_id,...stateIds,...question].slice(0,maxLen);
+  const positions=markers.map(m=>m+1+stateIds.length);
+  if(positions.at(-1)>=maxLen) throw new Error('Options do not fit in context');
+  return {input_ids:ids,markers:positions};
+}
+export function temperature(q,config,image=false) {
+  if(image) return 1;
+  const n=q.type==='noul'?2:Object.keys(q.criteria).length;
+  const key=q.type+':'+(n<=2?'2':n<=5?'3-5':n<=10?'6-10':'11+');
+  return config.temperatures[key] ?? config.temperatures[q.type] ?? 1;
+}
+export function layout(width,height,ratios) {
+  if(Math.min(width,height)<1) throw new Error('Empty image');
+  let h=Math.max(32,roundEven(height/32)*32),w=Math.max(32,roundEven(width/32)*32);
+  if(h*w>262144) {const beta=Math.sqrt(height*width/262144);h=Math.max(32,Math.floor(height/beta/32)*32);w=Math.max(32,Math.floor(width/beta/32)*32);}
+  else if(h*w<65536) {const beta=Math.sqrt(65536/(height*width));h=Math.ceil(height*beta/32)*32;w=Math.ceil(width*beta/32)*32;}
+  const tiled=Math.max(16,roundEven(height/32)*32)*Math.max(16,roundEven(width/32)*32)>524288;
+  let grid=[1,1];
+  if(tiled) {let best=Infinity;for(const r of ratios) {const diff=Math.abs(width/height-r[0]/r[1]);if(diff<best || (diff===best && width*height>0.5*512*512*r[0]*r[1])) {grid=r;best=diff;}}}
+  return {grid,thumbnail:[h,w],tiled};
+}
+function resizeWeights(input,output) {
+  const scale=input/output,support=Math.max(1,scale),rows=[];
+  let largest=0;
+  for(let i=0;i<output;i++) {
+    const center=scale*(i+0.5);
+    const start=Math.max(0,Math.trunc(center-support+0.5));
+    const end=Math.min(input,Math.trunc(center+support+0.5));
+    let weights=Array.from({length:end-start},(_,j)=>Math.max(0,1-Math.abs((j+start-center+0.5)/support)));
+    const total=weights.reduce((a,b)=>a+b,0);
+    weights=weights.map(w=>w/total);
+    largest=Math.max(largest,...weights);
+    rows.push({start,weights});
+  }
+  let precision=0;
+  for(;precision<22;precision++) if(Math.trunc(0.5+largest*2**(precision+1))>=32768) break;
+  const unit=2**precision;
+  for(const row of rows) row.weights=row.weights.map(w=>Math.trunc(0.5+w*unit));
+  return {rows,unit};
+}
+// Torch's uint8 antialias path rounds fixed-point horizontal and vertical passes.
+export function resizeRGB(rgb,width,height,newWidth,newHeight) {
+  let temp=rgb;
+  if(width!==newWidth) {
+    const {rows,unit}=resizeWeights(width,newWidth);
+    temp=new Uint8Array(newWidth*height*3);
+    for(let y=0;y<height;y++) for(let x=0;x<newWidth;x++) for(let c=0;c<3;c++) {
+      const row=rows[x];let sum=unit/2;
+      for(let j=0;j<row.weights.length;j++) sum+=rgb[(y*width+row.start+j)*3+c]*row.weights[j];
+      temp[(y*newWidth+x)*3+c]=Math.max(0,Math.min(255,Math.floor(sum/unit)));
+    }
+  }
+  if(height===newHeight) return temp;
+  const {rows,unit}=resizeWeights(height,newHeight),out=new Uint8Array(newWidth*newHeight*3);
+  for(let y=0;y<newHeight;y++) for(let x=0;x<newWidth;x++) for(let c=0;c<3;c++) {
+    const row=rows[y];let sum=unit/2;
+    for(let j=0;j<row.weights.length;j++) sum+=temp[((row.start+j)*newWidth+x)*3+c]*row.weights[j];
+    out[(y*newWidth+x)*3+c]=Math.max(0,Math.min(255,Math.floor(sum/unit)));
+  }
+  return out;
+}
+export async function imageInputs(url,ratios) {
+  const blob=await (await fetch(url)).blob(),bitmap=await createImageBitmap(blob,{colorSpaceConversion:'none'});
+  const {width,height}=bitmap;
+  const canvas=new OffscreenCanvas(width,height),ctx=canvas.getContext('2d',{willReadFrequently:true});
+  ctx.drawImage(bitmap,0,0);
+  const rgba=ctx.getImageData(0,0,width,height).data,rgb=new Uint8Array(width*height*3);
+  for(let i=0;i<width*height;i++) rgb.set(rgba.subarray(i*4,i*4+3),i*3);
+  bitmap.close();
+  const plan=layout(width,height,ratios),crops=[];
+  if(plan.tiled) {
+    const [gw,gh]=plan.grid,big=resizeRGB(rgb,width,height,gw*512,gh*512);
+    for(let r=0;r<gh;r++) for(let c=0;c<gw;c++) {
+      const pixels=new Uint8Array(512*512*3);
+      for(let y=0;y<512;y++) pixels.set(big.subarray(((r*512+y)*gw*512+c*512)*3,((r*512+y)*gw*512+c*512+512)*3),y*512*3);
+      crops.push({rgb:pixels,h:512,w:512});
+    }
+  }
+  const [h,w]=plan.thumbnail;
+  crops.push({rgb:resizeRGB(rgb,width,height,w,h),h,w});
+  const pixels=new Float32Array(crops.length*1024*768),mask=new Int32Array(crops.length*1024),shapes=[];
+  crops.forEach((crop,i)=>{
+    const ph=crop.h/16,pw=crop.w/16;
+    shapes.push([ph,pw]);mask.fill(1,i*1024,i*1024+ph*pw);
+    for(let r=0;r<ph;r++) for(let c=0;c<pw;c++) for(let y=0;y<16;y++) for(let x=0;x<16;x++) for(let ch=0;ch<3;ch++) {
+      const v=crop.rgb[((r*16+y)*crop.w+c*16+x)*3+ch];
+      pixels[(i*1024+r*pw+c)*768+(y*16+x)*3+ch]=f32(f32(v-127.5)/127.5);
+    }
+  });
+  return {plan,pixels,mask,shapes};
+}
+export function positionMatrix(h,w) {
+  const matrix=new Float32Array(1024*256);
+  const weights=(input,output)=>Array.from({length:output},(_,i)=>{
+    const scale=f32(input/output),support=Math.max(1,scale),center=f32(scale*f32(i+0.5));
+    const start=Math.max(0,Math.trunc(f32(f32(center-support)+0.5))),end=Math.min(input,Math.trunc(f32(f32(center+support)+0.5)));
+    const inv=scale>=1?f32(1/scale):1;
+    const a=[];let sum=0;
+    for(let j=start;j<end;j++){const v=f32(Math.max(0,f32(1-Math.abs(f32(f32(f32(j-center)+0.5)*inv)))));a.push([j,v]);sum=f32(sum+v);}
+    return a.map(([j,v])=>[j,f32(v/sum)]);
+  });
+  const wy=weights(16,h),wx=weights(16,w);
+  for(let y=0;y<h;y++) for(let x=0;x<w;x++) {
+    const row=(y*w+x)*256;
+    for(const [iy,vy] of wy[y]) for(const [ix,vx] of wx[x]) matrix[row+iy*16+ix]=f32(vy*vx);
+  }
+  for(let i=h*w;i<1024;i++) matrix.set(matrix.subarray(0,256),i*256);
+  return matrix;
+}
+const bits=new DataView(new ArrayBuffer(4));
+export function toHalf(v) {
+  bits.setFloat32(0,v,true);const x=bits.getUint32(0,true),sign=(x>>>16)&0x8000,exponent=(x>>>23)&255,mantissa=x&0x7fffff;
+  if(exponent===255) return sign|0x7c00|(mantissa?0x200:0);
+  const e=exponent-127;
+  if(e>15) return sign|0x7c00;
+  if(e < -25) return sign;
+  const shift=e < -14 ? -e-1 : 13;
+  const m=e < -14 ? mantissa|0x800000 : mantissa;
+  const base=m>>>shift,rem=m&(2**shift-1),half=2**(shift-1);
+  const rounded=base+(rem>half || (rem===half && (base&1))?1:0);
+  return sign | (e < -14 ? rounded : ((e+15)<<10)+rounded);
+}
+export function fromHalf(x) {
+  const sign=x&0x8000?-1:1,e=(x>>10)&31,m=x&1023;
+  return e===0?sign*m*2**-24:e===31?(m?NaN:sign*Infinity):sign*(1+m/1024)*2**(e-15);
+}
+export const halfArray=a=>Uint16Array.from(a,toHalf);

runtime/d1-runtime.js

@@ -0,0 +1,189 @@
+import { encode, temperature, imageInputs, positionMatrix, pyJSON } from './d1-preprocess.js';
+
+export const D1_PROVIDER = 'webgpu_d1';
+const record = value => value && typeof value === 'object' && !Array.isArray(value);
+const checkAbort = signal => { if (signal?.aborted) throw signal.reason || new Error('D1 request cancelled.'); };
+const dispose = values => { for (const value of Object.values(values || {})) value.dispose?.(); };
+
+// Media blocks are data, never fetched from a page-chosen network URL.
+export function splitD1State(state, images = []) {
+  const media = [...images];
+  let text = state == null ? '' : state;
+  if (Array.isArray(state)) {
+    text = state.filter(part => {
+      if (part?.type !== 'image_url') return true;
+      media.push(part.image_url?.url); return false;
+    });
+    if (!text.length) text = '';
+  }
+  if (media.length > 4 || media.some(url => typeof url !== 'string' || !/^data:image\/(png|jpeg|webp);base64,[A-Za-z0-9+/=]+$/.test(url))) {
+    throw new Error('D1 accepts at most four inline PNG/JPEG/WebP screenshots; remote image URLs are not allowed.');
+  }
+  if (new TextEncoder().encode(JSON.stringify([text, media])).length > 8 * 1024 * 1024) throw new Error('D1 input exceeds 8 MiB.');
+  return { state: text, images: media };
+}
+
+export function d1Answers(questions, probabilities, width) {
+  const answers = Object.create(null);
+  const entries = Array.isArray(questions) ? questions : Object.entries(questions);
+  entries.forEach(([id, question], row) => {
+    const names = question.type === 'noul' ? ['no', 'yes'] : question.type === 'score' ? question.criteria.map((_, i) => String(i)) : Object.keys(question.criteria);
+    const values = Array.from(probabilities.slice(row * width, row * width + names.length), Number);
+    if (values.length !== names.length || values.some(value => !Number.isFinite(value) || value < 0 || value > 1) || Math.abs(values.reduce((a, b) => a + b, 0) - 1) > .001) throw new Error('Invalid D1 probability output.');
+    const selected = values.indexOf(Math.max(...values));
+    if (question.type === 'noul') answers[id] = { type: 'noul', noul: values[1] };
+    else {
+      const common = { type: question.type, confidence: values[selected], probabilities: Object.fromEntries(names.map((name, i) => [name, values[i]])) };
+      answers[id] = question.type === 'choice' ? { ...common, choice: names[selected] } : { ...common, score: values.reduce((sum, p, i) => sum + p * i, 0), legend: Object.fromEntries(names.map((name, i) => [name, typeof question.criteria[i] === 'string' ? question.criteria[i] : pyJSON(question.criteria[i])])) };
+    }
+  });
+  return answers;
+}
+
+// The encoder's six full-attention layers are dense: each one materializes a
+// heads × length × length FP32 score tensor per row (plus elementwise copies
+// of it), so memory grows with the square of the row length, not with the
+// token count. Batches are bounded by that tensor, and text-only rows are
+// capped on WebGPU; the source truncates the state, never the question, when
+// a row is over the cap.
+export const D1_ATTENTION_HEADS = 16;
+export const D1_ATTENTION_BUDGET_BYTES = 256 * 1024 * 1024;
+export const D1_WEBGPU_MAX_TEXT_TOKENS = 2048;
+export const d1AttentionBytes = (rows, length) => rows * D1_ATTENTION_HEADS * length * length * 4;
+
+export function d1RowBatches(rows, mediaLength, { maxTokens = 65536, budgetBytes = D1_ATTENTION_BUDGET_BYTES } = {}) {
+  const order = rows.map((_, i) => i).sort((a, b) => rows[b].input_ids.length - rows[a].input_ids.length), batches = [];
+  while (order.length) {
+    const longest = rows[order[0]].input_ids.length + mediaLength;
+    let size = 1;
+    while (size < order.length && (size + 1) * longest <= maxTokens && d1AttentionBytes(size + 1, longest) <= budgetBytes) size++;
+    batches.push(order.splice(0, size));
+  }
+  return batches;
+}
+
+const HIDDEN = 768, PATCHES = 1024, WIDTH = 1024, FLOAT_BYTES = 4, VISION_HEADS = 12;
+
+export function createD1Runtime({ ort, tokenizer, config, ratios, sessions, device, model, dtype = 'float32' }) {
+  if (!sessions?.decision || !sessions?.vision || !sessions?.projector) throw new Error('D1 requires all three sessions.');
+  const tensor = (type, data, shape) => new ort.Tensor(type, data, shape);
+  // One score tensor must fit a single storage binding on this adapter.
+  const rowLimit = Number(device?.limits?.maxStorageBufferBindingSize) || Infinity;
+  const budgetBytes = Math.min(D1_ATTENTION_BUDGET_BYTES, rowLimit);
+  const usage = globalThis.GPUBufferUsage ? GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC | GPUBufferUsage.COPY_DST : 0;
+  const gpuTensor = (bytes, dims) => {
+    const buffer = device.createBuffer({ size: Math.max(16, Math.ceil(bytes / 16) * 16), usage });
+    return { buffer, tensor: ort.Tensor.fromGpuBuffer(buffer, { dataType: 'float32', dims, dispose: () => buffer.destroy() }) };
+  };
+  const copy = (pairs) => {
+    const encoder = device.createCommandEncoder();
+    for (const [source, sourceOffset, target, targetOffset, bytes] of pairs) encoder.copyBufferToBuffer(source, sourceOffset, target, targetOffset, bytes);
+    device.queue.submit([encoder.finish()]);
+  };
+  // Vision and projector outputs stay on the GPU when the sessions return
+  // gpu-buffer tensors: each crop is copied into the projector input and each
+  // projected chunk into every row of the decision input, without a readback.
+  async function mediaPrefix(images, signal) {
+    const chunks = [], layouts = [];
+    try {
+      for (const url of images) {
+        checkAbort(signal);
+        const image = await imageInputs(url, ratios), crops = image.shapes.length;
+        // The vision tower's attention is dense too (12 heads × 1024² per crop),
+        // so a tiled screenshot runs in crop groups that fit the same budget.
+        const group = Math.max(1, Math.floor(budgetBytes / (VISION_HEADS * PATCHES * PATCHES * FLOAT_BYTES)));
+        for (let first = 0; first < crops; first += group) {
+          const count = Math.min(group, crops - first);
+          const positions = new Float32Array(count * PATCHES * 256);
+          for (let i = 0; i < count; i++) positions.set(positionMatrix(...image.shapes[first + i]), i * PATCHES * 256);
+          const feeds = {
+            pixel_values: tensor('float32', image.pixels.slice(first * PATCHES * HIDDEN, (first + count) * PATCHES * HIDDEN), [count, PATCHES, HIDDEN]),
+            pixel_mask: tensor('bool', Uint8Array.from(image.mask.slice(first * PATCHES, (first + count) * PATCHES)), [count, PATCHES]),
+            position_matrix: tensor('float32', positions, [count, PATCHES, 256]),
+          };
+          let output;
+          try {
+            output = await sessions.vision.run(feeds); checkAbort(signal);
+            const gpu = output.hidden.location === 'gpu-buffer' && !!device;
+            const hidden = gpu ? null : await output.hidden.getData();
+            for (let crop = 0; crop < count; crop++) {
+              const [h, w] = image.shapes[first + crop], bytes = h * w * HIDDEN * FLOAT_BYTES;
+              let input, buffer, projected;
+              if (gpu) ({ tensor: input, buffer } = gpuTensor(bytes, [1, h, w, HIDDEN]));
+              else input = tensor('float32', hidden.slice(crop * PATCHES * HIDDEN, crop * PATCHES * HIDDEN + h * w * HIDDEN), [1, h, w, HIDDEN]);
+              try {
+                if (gpu) copy([[output.hidden.gpuBuffer, crop * PATCHES * HIDDEN * FLOAT_BYTES, buffer, 0, bytes]]);
+                projected = await sessions.projector.run({ hidden: input }); checkAbort(signal);
+                if (gpu && projected.prefix.location === 'gpu-buffer') { chunks.push({ tensor: projected.prefix, rows: projected.prefix.dims[1] }); projected = null; }
+                else { const data = new Float32Array(await projected.prefix.getData()); chunks.push({ data, rows: data.length / WIDTH }); }
+              } finally { input.dispose?.(); dispose(projected); }
+            }
+          } finally { dispose(feeds); dispose(output); }
+        }
+        layouts.push({ ...image.plan, shapes: image.shapes });
+      }
+    } catch (error) { for (const chunk of chunks) chunk.tensor?.dispose?.(); throw error; }
+    return { chunks, layouts, mediaLength: chunks.reduce((n, chunk) => n + chunk.rows, 0) };
+  }
+  function mediaFeed(chunks, mediaLength, batch) {
+    if (!mediaLength || !chunks.some(chunk => chunk.tensor)) {
+      const prefix = new Float32Array(mediaLength * WIDTH);
+      let offset = 0; for (const chunk of chunks) { prefix.set(chunk.data, offset); offset += chunk.data.length; }
+      const media = new Float32Array(batch * prefix.length);
+      for (let row = 0; row < batch; row++) media.set(prefix, row * prefix.length);
+      return tensor('float32', media, [batch, mediaLength, WIDTH]);
+    }
+    const rowBytes = mediaLength * WIDTH * FLOAT_BYTES, { tensor: media, buffer } = gpuTensor(batch * rowBytes, [batch, mediaLength, WIDTH]), pairs = [];
+    for (let row = 0; row < batch; row++) {
+      let offset = row * rowBytes;
+      for (const chunk of chunks) {
+        const bytes = chunk.rows * WIDTH * FLOAT_BYTES;
+        if (chunk.tensor) pairs.push([chunk.tensor.gpuBuffer, 0, buffer, offset, bytes]);
+        else device.queue.writeBuffer(buffer, offset, chunk.data);
+        offset += bytes;
+      }
+    }
+    copy(pairs);
+    return media;
+  }
+  return {
+    async evaluate({ state = '', images = [], questions, signal } = {}) {
+      checkAbort(signal);
+      if (!record(questions) || !Object.keys(questions).length || Object.keys(questions).length > 32) throw new Error('D1 requires 1 to 32 named questions.');
+      const input = splitD1State(state, images);
+      const { chunks, layouts, mediaLength } = await mediaPrefix(input.images, signal);
+      try {
+        // The longest row whose score tensor still fits one storage binding.
+        const maxRow = Math.floor(Math.sqrt(rowLimit / (D1_ATTENTION_HEADS * FLOAT_BYTES)));
+        const textCap = input.images.length ? config.image_text_length : Math.min(config.max_length, D1_WEBGPU_MAX_TEXT_TOKENS);
+        const limit = Math.min(textCap, config.max_length - mediaLength, maxRow - mediaLength);
+        if (!Number.isInteger(mediaLength) || config.max_length - mediaLength < 64) throw new Error('D1 media exceed the source context budget.');
+        if (limit < 64) throw new Error(`D1 input is too large for this GPU: ${mediaLength} screenshot positions. Send fewer or smaller screenshots.`);
+        const entries = Object.entries(questions), rows = entries.map(([, q]) => encode(tokenizer, input.state, q, limit, input.images.length > 0));
+        const longest = Math.max(...rows.map(row => row.input_ids.length)) + mediaLength;
+        if (d1AttentionBytes(1, longest) > rowLimit) throw new Error(`D1 input is too large for this GPU: ${longest} tokens including screenshots. Send fewer or smaller screenshots.`);
+        const answers = Object.create(null), batches = [];
+        for (const indices of d1RowBatches(rows, mediaLength, { budgetBytes })) {
+          const selectedRows = indices.map(i => rows[i]), selectedEntries = indices.map(i => entries[i]);
+          const batch = selectedRows.length, length = Math.max(...selectedRows.map(row => row.input_ids.length)), width = Math.max(...selectedRows.map(row => row.markers.length));
+          const ids = new BigInt64Array(batch * length), mask = new Uint8Array(batch * length), markers = new BigInt64Array(batch * width), markerMask = new Uint8Array(batch * width);
+          ids.fill(BigInt(tokenizer.pad_token_id ?? 0));
+          selectedRows.forEach((row, i) => {
+            ids.set(row.input_ids.map(BigInt), i * length); mask.fill(1, i * length, i * length + row.input_ids.length);
+            markers.set(row.markers.map(BigInt), i * width); markerMask.fill(1, i * width, i * width + row.markers.length);
+          });
+          const feeds = { input_ids: tensor('int64', ids, [batch, length]), text_mask: tensor('bool', mask, [batch, length]), marker_pos: tensor('int64', markers, [batch, width]), marker_mask: tensor('bool', markerMask, [batch, width]), qtype: tensor('int64', BigInt64Array.from(selectedEntries, ([, q]) => BigInt({ choice: 0, score: 1, noul: 2 }[q.type])), [batch]), temperature: tensor('float32', Float32Array.from(selectedEntries, ([, q]) => temperature(q, config, input.images.length > 0)), [batch]), media_prefix: mediaFeed(chunks, mediaLength, batch) };
+          let output;
+          try {
+            checkAbort(signal); output = await sessions.decision.run(feeds);
+            const probabilities = await output.probabilities.getData(); await device?.queue.onSubmittedWorkDone(); checkAbort(signal);
+            Object.assign(answers, d1Answers(selectedEntries, probabilities, width));
+            batches.push({ question_ids: selectedEntries.map(([id]) => id), batch, text_length: length, options: width, attention_bytes: d1AttentionBytes(batch, length + mediaLength) });
+          } finally { dispose(feeds); dispose(output); }
+        }
+        return { model, provider: D1_PROVIDER, answers: Object.fromEntries(entries.map(([id]) => [id, answers[id]])), usage: { input_tokens: rows.reduce((sum, row) => sum + row.input_ids.length + mediaLength, 0), output_tokens: 0 }, diagnostics: { dtype, generated_tokens: 0, batch: rows.length, text_length: Math.max(...rows.map(row => row.input_ids.length)), media_length: mediaLength, media_on_gpu: chunks.some(chunk => chunk.tensor), layouts, batches, attention_budget_bytes: budgetBytes, cpu_fallback_policy: 'CPU/WASM control/shape operators allowed; actual placement requires a separate profile.' } };
+      } finally { for (const chunk of chunks) chunk.tensor?.dispose?.(); }
+    },
+    async dispose() { for (const session of Object.values(sessions)) await session.release(); device?.destroy(); },
+  };
+}

tiling-ratios.json

@@ -0,0 +1,106 @@
+[
+  [
+    1,
+    2
+  ],
+  [
+    2,
+    1
+  ],
+  [
+    3,
+    1
+  ],
+  [
+    1,
+    3
+  ],
+  [
+    2,
+    2
+  ],
+  [
+    4,
+    1
+  ],
+  [
+    1,
+    4
+  ],
+  [
+    5,
+    1
+  ],
+  [
+    1,
+    5
+  ],
+  [
+    1,
+    6
+  ],
+  [
+    6,
+    1
+  ],
+  [
+    3,
+    2
+  ],
+  [
+    2,
+    3
+  ],
+  [
+    7,
+    1
+  ],
+  [
+    1,
+    7
+  ],
+  [
+    4,
+    2
+  ],
+  [
+    2,
+    4
+  ],
+  [
+    1,
+    8
+  ],
+  [
+    8,
+    1
+  ],
+  [
+    1,
+    9
+  ],
+  [
+    3,
+    3
+  ],
+  [
+    9,
+    1
+  ],
+  [
+    2,
+    5
+  ],
+  [
+    5,
+    2
+  ],
+  [
+    10,
+    1
+  ],
+  [
+    1,
+    10
+  ]
+]

tokenizer_config.json

@@ -0,0 +1,10 @@
+{
+  "backend": "tokenizers",
+  "bos_token": "<|startoftext|>",
+  "eos_token": "<|im_end|>",
+  "pad_token": "<|pad|>",
+  "mask_token": "<|mask|>",
+  "clean_up_tokenization_spaces": false,
+  "model_max_length": 16384,
+  "tokenizer_class": "TokenizersBackend"
+}