Publish Ling-3.0-tiny RKNN engine and model

Includes the final RK3588 model, verified portable runtime, canonical C++ source, conversion tooling, evaluation docs, and third-party notices.

.gitattributes

@@ -1,35 +1,5 @@
-*.7z filter=lfs diff=lfs merge=lfs -text
-*.arrow filter=lfs diff=lfs merge=lfs -text
-*.bin filter=lfs diff=lfs merge=lfs -text
-*.bz2 filter=lfs diff=lfs merge=lfs -text
-*.ckpt filter=lfs diff=lfs merge=lfs -text
-*.ftz filter=lfs diff=lfs merge=lfs -text
-*.gz filter=lfs diff=lfs merge=lfs -text
-*.h5 filter=lfs diff=lfs merge=lfs -text
-*.joblib filter=lfs diff=lfs merge=lfs -text
-*.lfs.* filter=lfs diff=lfs merge=lfs -text
-*.mlmodel filter=lfs diff=lfs merge=lfs -text
-*.model filter=lfs diff=lfs merge=lfs -text
-*.msgpack filter=lfs diff=lfs merge=lfs -text
-*.npy filter=lfs diff=lfs merge=lfs -text
-*.npz filter=lfs diff=lfs merge=lfs -text
-*.onnx filter=lfs diff=lfs merge=lfs -text
-*.ot filter=lfs diff=lfs merge=lfs -text
-*.parquet filter=lfs diff=lfs merge=lfs -text
-*.pb filter=lfs diff=lfs merge=lfs -text
-*.pickle filter=lfs diff=lfs merge=lfs -text
-*.pkl filter=lfs diff=lfs merge=lfs -text
-*.pt filter=lfs diff=lfs merge=lfs -text
-*.pth filter=lfs diff=lfs merge=lfs -text
-*.rar filter=lfs diff=lfs merge=lfs -text
-*.safetensors filter=lfs diff=lfs merge=lfs -text
-saved_model/**/* filter=lfs diff=lfs merge=lfs -text
-*.tar.* filter=lfs diff=lfs merge=lfs -text
-*.tar filter=lfs diff=lfs merge=lfs -text
-*.tflite filter=lfs diff=lfs merge=lfs -text
-*.tgz filter=lfs diff=lfs merge=lfs -text
-*.wasm filter=lfs diff=lfs merge=lfs -text
-*.xz 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
+*.l3r filter=lfs diff=lfs merge=lfs -text
+docs/measurements/16k-profile-20260922/decode.png filter=lfs diff=lfs merge=lfs -text
+docs/measurements/16k-profile-20260922/timeline.png filter=lfs diff=lfs merge=lfs -text
+docs/measurements/long-decode-20260922/run/long-decode.png filter=lfs diff=lfs merge=lfs -text
+models/local-final/v6-board-test/mindnano-infer filter=lfs diff=lfs merge=lfs -text

CMakeLists.txt

@@ -0,0 +1,138 @@
+cmake_minimum_required(VERSION 3.20)
+
+project(ling3_rknn VERSION 0.1.0 LANGUAGES CXX)
+
+option(LING3_WITH_RKNN "Build the direct RKNN backend" OFF)
+option(LING3_TUNE_A76 "Tune release builds for Cortex-A76" ON)
+option(LING3_WITH_ICU "Use ICU for exact tokenizer normalization and splitting" ON)
+set(RKNN_ROOT "" CACHE PATH "Local RKNPU2 root from https://github.com/airockchip/rknpu2 (contains include/ and lib/)")
+
+add_library(ling3_core STATIC
+    src/core_workers.cpp
+    src/cpu_kernels.cpp
+    src/decoder.cpp
+    src/decoder_state.cpp
+    src/execution_plan.cpp
+    src/gdn_step.cpp
+    src/layer0.cpp
+    src/linear.cpp
+    src/model_package.cpp
+    src/mla_npu.cpp
+    src/quantization.cpp
+    src/rknn_backend.cpp
+    src/router.cpp
+    src/tokenizer.cpp
+    src/w4_linear.cpp
+)
+target_include_directories(ling3_core PUBLIC include)
+target_compile_features(ling3_core PUBLIC cxx_std_20)
+target_compile_options(ling3_core PRIVATE -Wall -Wextra -Wpedantic)
+target_compile_definitions(ling3_core PUBLIC LING3_WITH_RKNN=$<BOOL:${LING3_WITH_RKNN}>)
+
+if(LING3_WITH_ICU)
+    find_package(ICU COMPONENTS uc i18n QUIET)
+endif()
+if(ICU_FOUND)
+    target_compile_definitions(ling3_core PUBLIC LING3_WITH_ICU=1)
+    target_link_libraries(ling3_core PUBLIC ICU::uc ICU::i18n)
+else()
+    target_compile_definitions(ling3_core PUBLIC LING3_WITH_ICU=0)
+    message(STATUS "ICU development files not found; tokenizer uses a non-production fallback")
+endif()
+
+if(CMAKE_SYSTEM_PROCESSOR MATCHES "^(aarch64|arm64)$" AND LING3_TUNE_A76)
+    target_compile_options(ling3_core PRIVATE $<$<CONFIG:Release>:-mcpu=cortex-a76>)
+endif()
+
+if(CMAKE_SYSTEM_PROCESSOR MATCHES "^(aarch64|arm64)$")
+    include(CheckLibraryExists)
+    check_library_exists(mvec _ZGVnN4v_expf "" LING3_HAS_VECTOR_EXP)
+    if(LING3_HAS_VECTOR_EXP)
+        target_compile_definitions(ling3_core PRIVATE LING3_WITH_VECTOR_EXP=1)
+        target_link_libraries(ling3_core PUBLIC mvec)
+    endif()
+endif()
+
+if(LING3_WITH_RKNN)
+    # Support both a flattened SDK tree and the official rknpu2 checkout:
+    # runtime/Linux/librknn_api/{include,aarch64}.
+    find_path(RKNN_INCLUDE_DIR rknn_api.h
+        HINTS "${RKNN_ROOT}"
+        PATH_SUFFIXES include runtime/Linux/librknn_api/include
+        REQUIRED)
+    find_library(RKNN_LIBRARY rknnrt
+        HINTS "${RKNN_ROOT}"
+        PATH_SUFFIXES lib aarch64 runtime/Linux/librknn_api/aarch64
+        REQUIRED)
+    target_include_directories(ling3_core PRIVATE "${RKNN_INCLUDE_DIR}")
+    target_link_libraries(ling3_core PUBLIC "${RKNN_LIBRARY}" pthread)
+    if(CMAKE_SYSTEM_PROCESSOR MATCHES "^(aarch64|arm64)$")
+        add_executable(ling3-quant-loss-probe EXCLUDE_FROM_ALL tools/quant_loss_probe.cpp)
+        add_executable(ling3-linear-bridge-check EXCLUDE_FROM_ALL tools/linear_bridge_check.cpp)
+        target_link_libraries(ling3-linear-bridge-check PRIVATE ling3_core)
+        target_include_directories(ling3-quant-loss-probe PRIVATE third_party/nlohmann)
+        target_link_libraries(ling3-quant-loss-probe PRIVATE ling3_core)
+        add_executable(ling3-mla-npu-probe EXCLUDE_FROM_ALL tools/mla_npu_probe.cpp)
+        target_include_directories(ling3-mla-npu-probe PRIVATE src third_party/nlohmann "${RKNN_INCLUDE_DIR}")
+        target_compile_options(ling3-mla-npu-probe PRIVATE -O3 -mcpu=cortex-a76 -Wall -Wextra)
+        target_link_libraries(ling3-mla-npu-probe PRIVATE ling3_core)
+    endif()
+endif()
+
+set_target_properties(ling3_core PROPERTIES INTERPROCEDURAL_OPTIMIZATION_RELEASE ON)
+
+add_executable(ling3-rknn
+    src/main.cpp
+    src/service.cpp
+)
+target_link_libraries(ling3-rknn PRIVATE ling3_core)
+
+add_executable(mindnano-infer src/portable_main.cpp)
+target_include_directories(mindnano-infer PRIVATE third_party/nlohmann)
+target_link_libraries(mindnano-infer PRIVATE ling3_core)
+
+include(CTest)
+if(BUILD_TESTING)
+    add_executable(ling3-decoder-state-test tests/decoder_state_test.cpp)
+    target_link_libraries(ling3-decoder-state-test PRIVATE ling3_core)
+    add_test(NAME ling3-decoder-state-test COMMAND ling3-decoder-state-test)
+    add_executable(ling3-generation-control-test tests/generation_control_test.cpp)
+    target_compile_features(ling3-generation-control-test PRIVATE cxx_std_20)
+    target_include_directories(ling3-generation-control-test PRIVATE include third_party/nlohmann)
+    target_link_libraries(ling3-generation-control-test PRIVATE pthread)
+    add_test(NAME ling3-generation-control-test COMMAND ling3-generation-control-test)
+    add_executable(ling3-precision-policy-test tests/precision_policy_test.cpp)
+    target_link_libraries(ling3-precision-policy-test PRIVATE ling3_core)
+    add_test(NAME ling3-precision-policy-test COMMAND ling3-precision-policy-test)
+    if(LING3_WITH_RKNN)
+        # Explicit model-backed test: run with MODEL.l3r, one model process at a time.
+        add_executable(ling3-checkpoint-model-test tests/checkpoint_model_test.cpp)
+        target_link_libraries(ling3-checkpoint-model-test PRIVATE ling3_core)
+        add_executable(ling3-w4-workspace-test tests/w4_workspace_test.cpp)
+        target_link_libraries(ling3-w4-workspace-test PRIVATE ling3_core)
+        add_test(NAME ling3-w4-workspace-test COMMAND ling3-w4-workspace-test)
+        set_tests_properties(ling3-w4-workspace-test PROPERTIES LABELS rknn_hardware)
+    endif()
+    add_executable(ling3-model-reclaim-test tests/model_reclaim_test.cpp)
+    target_link_libraries(ling3-model-reclaim-test PRIVATE ling3_core)
+    add_test(NAME ling3-model-reclaim-test COMMAND ling3-model-reclaim-test)
+    add_executable(ling3-chat-protocol-test tests/chat_protocol_test.cpp)
+    target_compile_features(ling3-chat-protocol-test PRIVATE cxx_std_20)
+    target_include_directories(ling3-chat-protocol-test PRIVATE include third_party/nlohmann)
+    add_test(NAME ling3-chat-protocol-test COMMAND ling3-chat-protocol-test)
+    add_executable(ling3-router-test tests/router_test.cpp)
+    target_link_libraries(ling3-router-test PRIVATE ling3_core)
+    add_test(NAME ling3-router-test COMMAND ling3-router-test)
+
+    add_executable(ling3-quantization-test tests/quantization_test.cpp)
+    target_link_libraries(ling3-quantization-test PRIVATE ling3_core)
+    add_test(NAME ling3-quantization-test COMMAND ling3-quantization-test)
+
+    add_executable(ling3-activation-test tests/activation_test.cpp)
+    target_link_libraries(ling3-activation-test PRIVATE ling3_core)
+    add_test(NAME ling3-activation-test COMMAND ling3-activation-test)
+    if(LING3_HAS_VECTOR_EXP)
+        add_test(NAME ling3-vector-activation-test COMMAND ling3-activation-test)
+        set_tests_properties(ling3-vector-activation-test PROPERTIES ENVIRONMENT "LING3_VECTOR_MATH=1")
+    endif()
+endif()

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.md

@@ -0,0 +1,15 @@
+# 许可边界
+
+本仓库包含两类独立资产：
+
+## 代码
+
+根目录 `src/`、`include/`、`tools/`、`tests/`、`calibration/`、`docs/` 以及相关构建脚本（第三方组件除外）采用 [Apache License 2.0](LICENSE) 许可。
+
+## 转换模型资产
+
+本项目发布的 `ling3-tiny-w4.l3r` 及其转换/打包成果标注为 [CC BY-NC 4.0 International](https://creativecommons.org/licenses/by-nc/4.0/)，仅限非商业、学术研究和教育用途。使用时须保留基模型署名，并说明本项目进行了 RK3588 W4A8/W8A8 转换和 `.l3r` 打包。本标注不改变上游基模型原有权利或许可边界；商业使用或商业集成请先取得相应授权。
+
+## 第三方组件
+
+Rockchip RKNN SDK/runtime、ICU、nlohmann JSON、glibc、GCC runtime 等组件不适用上述项目许可，分别遵守其原始许可证和再分发条款。来源与说明见 [`deployment/notices/`](deployment/notices/)。

README.md

@@ -0,0 +1,232 @@
+---
+license: other
+license_name: apache-2.0-source-cc-by-nc-4.0-model
+license_link: https://creativecommons.org/licenses/by-nc/4.0/
+base_model: inclusionAI/Ling-3.0-tiny
+pipeline_tag: text-generation
+library_name: ling3rknn
+tags:
+- rk3588
+- rknn
+- edge-inference
+- custom-format
+language:
+- zh
+---
+
+# Ling-3.0-tiny-RKNN
+
+这是面向 RK3588/RK3588S 的 Ling-3.0-tiny 专用推理引擎和 W4A8/W8A8 转换模型。
+本仓库同时提供 C++ 源码、转换工具、校准数据、测试报告和可选的 `.l3r` 部署模型。
+
+Ling-3.0-rknn 是在 RK3588/RK3588S 上的专用 C++ 推理工程。
+
+引擎使用 A76 CPU 和三核 RKNPU，提供终端对话与 OpenAI 兼容的 Chat Completions 接口。
+
+支持 KV cache 命中；非连续缓存命中仍属于实验功能。
+
+端侧知识库方案另见 [mindnano-ling3-compass](https://huggingface.co/Sariel00/mindnano-ling3-compass)，该项目仍在实验阶段。
+
+推理不依赖 RKLLM、llama.cpp 或 Python 服务。模型为纯文本 MoE，约 7.9B 总参数、每 token 约 1.3B 激活参数，当前未启用 MTP。
+
+在16K以内上下文在可用范畴内，32K~256K均为测试，目前由于是专用推理引擎所以速度会随着上下文的增大而降低。
+
+如果您有这方面的经验，或者可以优化这些请与我联系，非常感谢。
+
+## 项目简介
+
+本项目把 Ling-3.0-tiny 转换为 RK3588/RK3588S 可运行的专用 C++ 推理程序。模型是纯文本 MoE；权重采用 W4A8/W8A8 混合量化，推理由 A76 CPU 与 RKNPU 协同完成。程序提供终端模式和 OpenAI 风格的 Chat Completions HTTP 接口。公开源码使用设备上从 Rockchip 官方仓库安装的 RKNPU2 runtime，不需要 Python、RKLLM 或 llama.cpp 才能运行。
+
+这是面向单板验证和端侧优化的工程。当前默认路径是单请求、无鉴权、无 TLS；部分 NPU MLA、FP8/INT8 KV 和非连续缓存仍属于实验功能。性能、内存和质量会随 RKNPU 驱动、频率、散热、后台服务及上下文长度变化。
+
+## 目录与文件
+
+| 路径 | 作用 |
+| --- | --- |
+| `src/`、`include/` | canonical public C++ decoder, MoE, MLA/KDA, KV manager, service and RKNN backend |
+| `engine/source/` | historical experimental snapshot; it is not included in this public repository and must not be mixed with the root build |
+| `CMakeLists.txt` | 根构建入口 |
+| `tools/` | 量化、打包、部署和 benchmark 脚本 |
+| `tests/` | 单元测试、模型测试和 API 测试 |
+| `models/local-final/v6-board-test/` | v6 发布包：最终模型、板端验证的便携二进制、manifest、许可声明和校验文件 |
+| `calibration/` | 权重/激活量化使用的校准输入，不是运行时必需文件 |
+| `docs/` | [文档索引](docs/README.md)：性能、KV 与数值误差报告；`measurements/` 保留结果摘要、曲线和校验信息 |
+| `deployment/notices/` | 第三方许可、来源链接和模型许可摘要 |
+
+原始 BF16 模型不随本工作区保存。转换前请从上游仓库下载指定 revision；RKNN SDK/runtime 请从 Rockchip 官方仓库获取。发布模型时应同时提供 `MODEL.json`、`SHA256SUMS.PUBLIC` 和许可说明。
+
+`engine/source/` 是历史实验快照，不是第二个稳定入口；它包含板端探针和维护脚本，不能与根目录 `src/` 混合编译，因此本公开仓库不包含该目录。部分历史性能报告引用当时使用的实验脚本；公开构建和测试入口以根目录 `CMakeLists.txt`、`tools/` 和 `tests/` 为准。
+
+## 当前功能与限制
+
+已实现的主要功能：
+
+- 终端对话和 OpenAI 风格 `POST /v1/chat/completions`；
+- 流式输出、thinking 开关、请求取消、暂停/恢复和流控；
+- `session_id` 会话缓存、完整前缀命中和已生成状态复用；恢复 checkpoint 时可保留未覆盖的 NPU KV tile；
+- `--mla-backend auto|cpu|npu`、性能指标日志和设备检查；
+- `--kv-cache bf16|fp16|fp8|int8`。BF16 是默认且验证最充分的格式；FP8/INT8 只改变 MLA K/V 缓存，仍需按场景验证；
+- 可选的 NPU MLA 预填充/解码路径和混合 W4A8/W8A8 权重。
+
+当前限制：一次只执行一个推理请求，忙时可能返回 429；接口没有用户鉴权和 TLS；KV 缓存是进程内资源，不是跨重启的持久聊天记录；128K/256K 只提供容量选项，尚未完成完整板端质量和性能认证；MTP 未启用。
+
+## 板端性能
+
+下表来自 NanoPi M6（RK3588、16GB）2026-09-22 实测。CPU、NPU、DMC 测试期间固定最高频率；模型为 `ling3-tiny-w4.l3r`，BF16 KV，32K 初始化，关闭 thinking，temperature=0，每次冷启动会话输入后生成 64 tokens，未命中 KV 缓存。TTFT 不包括服务启动时间。
+
+| 输入/输出 | TTFT | Prefill tok/s | 解码计算 tok/s | 峰值 RSS |
+| ---: | ---: | ---: | ---: | ---: |
+| 128 / 64 | 753 ms | 170.69 | 19.98 | 7197 MiB |
+| 512 / 64 | 2.759 s | 185.75 | 18.26 | 7230 MiB |
+| 1024 / 64 | 5.691 s | 180.03 | 16.86 | 7258 MiB |
+| 2048 / 64 | 12.754 s | 160.64 | 13.85 | 7322 MiB |
+| 4096 / 64 | 29.043 s | 141.06 | 11.21 | 7429 MiB |
+| 8192 / 64 | 76.447 s | 107.17 | 8.37 | 7661 MiB |
+| 16384 / 64 | 226.045 s | 72.49 | 6.06 | 8162 MiB |
+
+TTFT 随输入长度增加，解码速度也会因每个新 token 需要访问更长的历史 KV 而下降；因此 128/64 的结果不能代表长上下文表现。完整原始结果和测试环境见 [BOARD_BENCHMARK_AND_INT4_20260922.md](docs/BOARD_BENCHMARK_AND_INT4_20260922.md)。频率、散热和后台负载改变时应重新测量。
+
+## 量化与数值损失
+
+当前发布模型不是全 W4：部分线性层和专家使用 W4A8，其他指定投影使用 W8A8。默认 KV 为 BF16，KDA 状态保留 FP32。量化存在损失，以下是固定 teacher-forcing 序列、4,322 个预测位置、完整 157,184 词表，以 BF16 为参考的 logits 分布指标：
+
+| 路径 | Logits MAE | RMSE | 最大绝对差 | 平均 TV | 平均 KL | Top1 一致率 |
+| --- | ---: | ---: | ---: | ---: | ---: | ---: |
+| 官方 INT4（桌面重建） | 0.281598 | 0.371417 | 8.390625 | 5.7605% | 0.026054 | 92.6886% |
+| 板端 W4A8/W8A8 + NPU MLA | 0.421164 | 0.549502 | 12.022694 | 8.9992% | 0.061127 | 89.5187% |
+
+官方 INT4 一行是 group32 INT4 权重在桌面 CUDA BF16 参考实现中的重建计算，不是 RK3588 原生 INT4 速度测试。板端当前 MAE 约为官方 INT4 的 1.50 倍，RMSE 约 1.48 倍，Top1 一致率低 3.1699 个百分点。上述指标衡量 logits/概率分布保真，不等于问答正确率；完整口径见 [INT4_BOARD_ACCURACY_20260922.md](docs/INT4_BOARD_ACCURACY_20260922.md)。
+
+FP8 和 INT8 KV 选项仍是实验实现：它们可以降低缓存容量或改变 MLA 的 NPU 计算路径，但当前样本不足以证明长期生成质量优于默认 BF16。需要复现实验时，应记录 KV 格式、上下文长度、频率和 `metrics.jsonl`，不要只比较单条回复。
+
+## 模型转换
+
+转换前需要自行获取原始模型。上游仓库为 [inclusionAI/Ling-3.0-tiny](https://huggingface.co/inclusionAI/Ling-3.0-tiny)，本项目量化脚本固定的来源 revision 为 `e3a47d5b986e7141b6efd62597d598ebb392060d`。推荐使用 Hugging Face CLI 下载完整 BF16 权重、配置和 tokenizer：
+
+```bash
+hf download inclusionAI/Ling-3.0-tiny \
+  --revision e3a47d5b986e7141b6efd62597d598ebb392060d \
+  --local-dir ./work/Ling-3.0-tiny
+```
+
+转换需要该目录包含 `model.safetensors.index.json`、全部 safetensors 分片、`config.json` 和 tokenizer，还需要 Python、PyTorch、safetensors 以及对应的 RKNN 工具链。校准输入位于 `calibration/dataset/calibration_v1.json`；可选的激活校准 scale 由 `--calibration-scales` 提供。
+
+示例流程如下，路径请替换为实际目录：
+
+```bash
+# 1. 从原始 BF16 模型生成 RKNN 资产和 manifest
+python3 tools/quantize_model.py \
+  --source ./work/Ling-3.0-tiny \
+  --output build/ling3-assets \
+  --max-context 32768 \
+  --calibration-scales ./work/calibration-scales.safetensors
+
+# 2. 将 manifest 和资产打包为运行时模型
+python3 tools/pack_model.py \
+  build/ling3-assets/manifest.json \
+  build/ling3-tiny-w4.l3r
+```
+
+`quantize_model.py` 的默认布局对应本项目运行时的混合 W4A8/W8A8 方案；改变层范围、校准 scale 或上下文上限都应重新做数值和板端回归。完整部署包还需要把 `.l3r`、二进制、`MANIFEST.json`、`MODEL.json` 和校验文件放入独立目录；不要把中间 `assets/` 当作板端模型。
+
+## 编译与部署包
+
+在 ARM64 构建机上安装 C++20 编译器、CMake、ICU 开发文件，以及 Rockchip 官方 [rknn-toolkit2](https://github.com/airockchip/rknn-toolkit2) 和 [rknpu2](https://github.com/airockchip/rknpu2)。`RKNN_ROOT` 应指向本地下载的 RKNPU2 目录，该目录需要包含 `include/rknn_api.h` 和目标平台的 `librknnrt`：
+
+```bash
+cmake -S . -B build \
+  -DCMAKE_BUILD_TYPE=Release \
+  -DLING3_WITH_RKNN=ON \
+  -DRKNN_ROOT=./vendor/rknpu2
+cmake --build build -j4 --target mindnano-infer ling3-rknn
+```
+
+RKNN 头文件和运行库来自 Rockchip 官方仓库；`RKNN_ROOT` 既可以指向整理为 `include/` 与 `lib/` 的 SDK 目录，也可以直接指向官方 `rknpu2` checkout，CMake 会搜索其 `runtime/Linux/librknn_api/include` 和 `runtime/Linux/librknn_api/aarch64`。构建时使用本地 SDK，便携打包时可按其许可随包转发匹配版本的 runtime。请按照 Rockchip 仓库中的许可、版本和硬件兼容性要求使用对应文件。
+
+不带 RKNN SDK 时可以用 `-DLING3_WITH_RKNN=OFF` 构建主机检查和部分单元测试，但该二进制不能在 RK3588 上执行真实 NPU 推理。使用 `tools/build_portable.py` 可把引擎及其用户态依赖封装进便携启动器；模型文件仍单独放在发布目录：
+
+```bash
+python3 tools/build_portable.py \
+  --engine build/mindnano-infer \
+  --output release/mindnano-infer \
+  --notices deployment/notices
+
+# 将转换后的模型复制为 release/ling3-tiny-w4.l3r，
+# 再生成 MANIFEST、MODEL.json、SHA256SUMS 等发布元数据。
+python3 tools/finalize_release.py \
+  --directory release \
+  --model-source build/ling3-tiny-w4.l3r
+```
+
+`build_portable.py` 默认会把匹配版本的 `librknnrt.so` 和其他动态依赖写入启动器，并同时嵌入
+`deployment/notices/` 中的声明。若目标环境必须使用设备已有 runtime，可使用
+`--without-rknn-runtime`；公开转发时仍须遵守 Rockchip [rknpu2](https://github.com/airockchip/rknpu2)
+仓库的许可、版本和硬件兼容性要求。
+
+`finalize_release.py` 还会读取发布用 README 模板；如果源码包中没有该模板，需要先补齐模板或手动生成 `MODEL.json`、`SHA256SUMS`，不要把失败的中间目录当作发布包。
+
+公开源码构建使用从 Rockchip 官方仓库获取的 RKNN 用户态库；便携启动器可将匹配版本的 `librknnrt.so` 一并分发。运行时仍要求 64 位 RK3588/RK3588S Linux 和可访问的 RKNPU 驱动（已按 0.9.8 版本验证）。公开发布前必须检查 `MANIFEST.json`、`SHA256SUMS` 和所有第三方 notices。
+当前目录中的 v6 二进制已按当前源码和 NOTICE 在 ARM64 RK3588 板端重新构建，并通过 `--check`；重新构建任何变体后都必须同步生成新的 `MANIFEST.json` 和校验文件。
+
+## 使用
+
+进入部署包目录后先做设备检查，再选择上下文长度：
+
+```bash
+cd models/local-final/v6-board-test
+sha256sum --ignore-missing -c SHA256SUMS
+./mindnano-infer --check
+./mindnano-infer --context 8K
+```
+
+支持的上下文选项为 `4K`、`8K`、`16K`、`32K`、`64K`、`128K` 和 `256K`。程序会输出内存估算和不足提示，但当前是告警模式，不会替用户做内存保证；256K 超出原生 128K 位置范围，属于未经验证的外推。`--list-contexts` 可查看估算值。
+
+启动 HTTP 服务（仅在可信局域网使用）：
+
+```bash
+./mindnano-infer --context 8K --host 0.0.0.0 --port 9092 \
+  --no-console --log metrics.jsonl
+```
+
+发送 OpenAI 风格请求：
+
+```bash
+curl --noproxy '*' -N http://127.0.0.1:9092/v1/chat/completions \
+  -H 'Content-Type: application/json' \
+  -d '{"model":"mindnano-ling3-tiny","session_id":"demo","messages":[{"role":"user","content":"你好"}],"stream":true,"max_tokens":128,"enable_thinking":false}'
+```
+
+常用接口为 `GET /health`、`GET /v1/models`、`POST /v1/chat/completions` 和 `POST /v1/cancel`。响应中的 `request_id` 可用于取消请求，流式事件中的 `mindnano_metrics` 包含 TTFT、解码速度和缓存状态。终端模式下 `/reset` 清空当前会话，`/quit` 退出；模型加载和预热只在进程启动时进行。
+
+可选运行参数：
+
+```text
+--mla-backend auto|cpu|npu
+--kv-cache bf16|fp16|fp8|int8
+--session-cache-mib N
+--prefix-checkpoints N
+```
+
+`--kv-cache bf16` 是默认推荐值；`fp8` 和 `int8` 需要重新测量精度和性能。`session_id` 只用于进程内缓存复用，客户端仍应在每轮发送完整 `messages`；缓存不等于持久化聊天记录。服务未提供鉴权、TLS 或稳定并发保证。
+
+## 性能测试
+
+部署包内的 `benchmark.py` 会启动本机服务、预热并测量短请求；端口冲突时使用其他端口：
+
+```bash
+python3 benchmark.py --port 19092 --output board-test-result.json
+```
+
+测试指标中，TTFT 是首 token 前的时间，Prefill tok/s 是输入处理速度，解码计算 tok/s 是模型生成阶段速度，RSS 是进程峰值常驻内存。长上下文专项和 KV 容量测试见 [KV_CACHE_BENCHMARK_20260922.md](docs/KV_CACHE_BENCHMARK_20260922.md)；NPU/CPU 占用分析见 [KV_UTILIZATION_16K_20260922.md](docs/KV_UTILIZATION_16K_20260922.md)。数值损失复现入口和数据说明见 [INT4_BOARD_ACCURACY_20260922.md](docs/INT4_BOARD_ACCURACY_20260922.md)。
+
+## Hugging Face 发布边界
+
+当前工作区的模型、元数据和已通过板端检查的便携二进制保存在 `models/local-final/v6-board-test/`；发布独立 Hugging Face 模型仓库时，可将其中的 `ling3-tiny-w4.l3r`、`MODEL.json`、`SHA256SUMS.PUBLIC` 和部署用 README 平铺到模型仓库根目录。`SHA256SUMS` 是包含当前二进制的部署包清单；如果公开上传 `mindnano-infer`，应同时保留匹配的 `MANIFEST.json` 和全部第三方 notices。
+
+## 来源与许可
+
+本仓库中的 C++ 源码、转换脚本、测试工具和文档（第三方组件除外）采用 [Apache-2.0](LICENSE) 许可，完整资产边界见 [LICENSES.md](LICENSES.md)。
+本项目发布的转换/打包模型资产 `ling3-tiny-w4.l3r` 标注为 [CC BY-NC 4.0](https://creativecommons.org/licenses/by-nc/4.0)，仅限非商业、学术研究和教育用途；该标注不改变上游基模型的权利或许可边界。商业使用或商业集成请先取得相应授权。
+文件顶部的 Hugging Face 自定义许可元数据以转换模型资产为主，许可链接指向模型 CC BY-NC 4.0；本仓库源码仍按根目录 [LICENSE](LICENSE) 使用 Apache-2.0，完整资产边界见 [LICENSES.md](LICENSES.md)。
+
+转换模型的基模型为 [inclusionAI/Ling-3.0-tiny](https://huggingface.co/inclusionAI/Ling-3.0-tiny)，来源 revision 为 `e3a47d5b986e7141b6efd62597d598ebb392060d`。原始 BF16 权重和完整上游模型卡不随本仓库分发；使用者仍须遵守上游模型条款。Rockchip RKNN SDK/runtime 是独立的第三方组件，来源和许可链接见 `deployment/notices/BUILD-AND-LICENSES.md`。

calibration/dataset/calibration_v1.json

@@ -0,0 +1,26 @@
+[
+  {"prompt":"写一封预约图书馆讨论室的邮件，说明人数、用途和时间，并询问是否有白板。","reasoning":"预约邮件需要明确日期、时段和资源需求，措辞礼貌，避免把尚未确认的预约当作已经成功。","answer":"老师您好：我们小组共有六人，希望预约下周三下午两点至四点的讨论室，用于讨论读书报告。请问该时段是否有空闲房间，房间内是否配有白板和白板笔？如果需要提前提交申请表，也请告知办理方式。感谢您的帮助，期待回复。"},
+  {"prompt":"为一家小面包店拟一个减少浪费的办法，不降低食品安全标准。","reasoning":"应先从需求预测和生产批次入手，再考虑临期信息提示。过期食品不能通过促销继续出售。","answer":"连续记录两周各时段的销量、天气和剩余数量，按工作日与周末分别预测需求。早晨先生产基础数量，下午根据销售情况补烤。对仍在保质期内的商品可以清楚标注制作时间并适当优惠，过期或储存不当的食品必须按规定处理。每天闭店后复盘报损原因，避免仅凭印象扩大产量。"},
+  {"prompt":"解释为什么冬天室内窗户上容易出现水珠。","reasoning":"现象取决于水蒸气遇冷凝结，需区分空气中看不见的水蒸气和可见的小水滴。","answer":"室内空气通常含有水蒸气，做饭、洗澡和呼吸都会增加湿度。冬天玻璃温度较低，靠近玻璃的空气被冷却，当温度降到露点以下时，一部分水蒸气会凝结成水滴。适度通风、降低湿度和改善窗户保温都有帮助。水珠多并不意味着玻璃在向室内漏水。"},
+  {"prompt":"一个水箱有180升水，每分钟放出12升，同时流入3升，多久排空？请列算式。","reasoning":"流入和流出同时发生，净减少速度是每分钟九升。用总量除以净减少速度即可。","answer":"每分钟净减少的水量为12－3＝9升，因此排空时间是180÷9＝20分钟。这里假设流入和流出的速度一直保持不变，并且水箱排空之前两个过程都持续进行。"},
+  {"prompt":"将这条公告改得清楚些：周五系统要维护，可能用不了，大家提前弄。","reasoning":"原文缺失具体时间和受影响服务，不能编造为已经确定的事实。可使用待填写项并提示保存工作。","answer":"维护通知：本周五【开始时间】至【结束时间】，我们将对【服务名称】进行维护。期间该服务可能暂时无法访问，请提前保存正在编辑的内容并安排相关工作。维护完成后将另行通知。如有紧急需求，请联系【联系人及联系方式】。发布前请补齐括号中的信息。"},
+  {"prompt":"写一段温和的短故事，主角是第一次学做饭的孩子和奶奶。","reasoning":"采用简单生活场景，保持人物关系一致，用具体动作表达鼓励，不突然引入无关人物。","answer":"小禾第一次拿起锅铲，紧张得把盐罐推到了桌子边。奶奶伸手扶住它，笑着说，先尝一口，再决定放多少。番茄在锅里慢慢变软，厨房里升起暖暖的香气。小禾端着做好的面条走到桌前，发现两只碗里的面都少了一点。原来奶奶早已偷偷尝过。她认真地点点头：下次换你教我。小禾知道这是鼓励，却还是开心了很久。"},
+  {"prompt":"Python里统计字符串中各字符的出现次数，返回普通字典，并说明空串的结果。","reasoning":"可以逐字符遍历并累加，不能用单词切分替代字符统计。空输入不进入循环，所以结果为空字典。","answer":"可以这样写：\n```python\ndef count_chars(text):\n    result = {}\n    for char in text:\n        result[char] = result.get(char, 0) + 1\n    return result\n\nassert count_chars('aba') == {'a': 2, 'b': 1}\nassert count_chars('') == {}\n```\n空格、标点也会作为字符计数。这个实现按Python字符串的码点遍历，复杂表情的显示单位不一定只对应一个码点。"},
+  {"prompt":"解释SQL中WHERE与HAVING的区别，给出销售额分组例子。","reasoning":"WHERE在分组前过滤记录，HAVING在聚合之后筛选分组。示例应避免引用不存在的别名。","answer":"WHERE筛选参与计算的行，HAVING筛选已经聚合的组。例如统计今年销售额超过一万元的部门：\n```sql\nSELECT department, SUM(amount) AS total\nFROM sales\nWHERE sold_at >= '2026-01-01' AND sold_at < '2027-01-01'\nGROUP BY department\nHAVING SUM(amount) > 10000;\n```\n日期条件先减少参与分组的记录，然后对每个部门求和，最后用HAVING筛选满足金额条件的部门。"},
+  {"prompt":"Translate into English: 请在提交报销申请前核对发票金额，并保留原始凭证。","reasoning":"翻译需要保留先后顺序、报销申请和原始凭证三个信息点，使用自然的商务英语。","answer":"Please verify the invoice amount before submitting your reimbursement request, and retain the original supporting documents.\n其中 reimbursement request 对应报销申请，supporting documents 指用于证明支出的相关凭证。"},
+  {"prompt":"Explain to a beginner what a retry with exponential backoff does. Mention one limitation.","reasoning":"Describe delays increasing after failures, use a small numerical example, and mention that retrying a non-idempotent operation can duplicate effects.","answer":"After a temporary failure, the client waits before trying again. With exponential backoff, the delay grows, for example from one second to two seconds, then four seconds. A maximum delay and a retry limit prevent endless waiting. Random jitter helps avoid many clients retrying at the same instant. Retries must be designed carefully for operations such as payments, because a repeated request can create a duplicate unless the service provides an idempotency mechanism."},
+  {"prompt":"一件商品原价240元，先打八折，再减20元，最后价格多少？和直接减40元相同吗？","reasoning":"百分比折扣先计算，固定金额后扣除。比较方案需分别算最终价格。","answer":"先打八折得到240×0.8＝192元，再减20元，最终价格为172元。直接在原价上减40元则是200元。两者不相同，前一种方案比后一种便宜28元。"},
+  {"prompt":"如何向刚入职的同事解释备份和文件同步不是一回事？","reasoning":"区别在于历史版本、删除传播和恢复目标，不能保证所有备份产品都拥有相同功能。","answer":"文件同步的目标是让多个位置保持一致。如果一个文件被误删，删除操作也可能同步到其他设备。备份的目标是保留可恢复的副本，通常还需要明确版本、保留期限和恢复流程。选择工具时要确认是否保留历史版本，并实际演练恢复。仅看到另一台电脑里也有同名文件，并不足以证明已经具备可靠备份。"},
+  {"prompt":"把这些事实整理成摘要：公交线路增加两班早班车；从下月开始试行；一个月后评估；票价不变。","reasoning":"摘要必须保留试行时间、增班数量、评估节点和票价，不能推断夜班或线路走向变化。","answer":"该公交线路将从下月起试行增加两班早班车，票价保持不变。试行一个月后，将根据运行情况进行评估。公告尚未给出新增班次的具体发车时间，乘客可关注后续时刻表。"},
+  {"prompt":"为刚开始跑步的人设计一周安排，不追求成绩。","reasoning":"建议需要循序渐进并保留休息日，避免把一般性安排当成针对疾病的专业处方。","answer":"周一快走二十分钟，周二休息。周三采用走跑交替：慢跑一分钟、步行两分钟，重复六次。周四轻松散步，周五休息，周六根据感受重复周三的安排，周日做轻柔拉伸。以能正常说话的强度为宜，疼痛或明显不适时停止运动。已有相关疾病或伤病的人，应先向医生咨询适合自己的运动方式。"},
+  {"prompt":"JavaScript中如何用async和await读取JSON响应并处理HTTP错误？","reasoning":"fetch遇到HTTP错误状态不一定抛异常，因此要显式检查response.ok，再解析JSON。","answer":"```javascript\nasync function loadJson(url) {\n  const response = await fetch(url);\n  if (!response.ok) {\n    throw new Error(`HTTP ${response.status}`);\n  }\n  return await response.json();\n}\n```\n调用方使用try/catch处理网络错误、HTTP错误和JSON解析错误。实际应用还可以加入超时或取消机制，但不要无限重试所有错误。"},
+  {"prompt":"比较地铁和骑自行车通勤各自适合什么情况。","reasoning":"按照距离、天气、可达性和时间稳定性比较，给出条件化结论，不假设用户居住地。","answer":"地铁适合距离较长、沿线站点方便的通勤，通常受道路拥堵影响较小，但需要考虑步行到站和换乘时间。自行车适合距离较短、有安全骑行路线的通勤，时间灵活，也能顺便运动，但更受天气和体力影响。可以分别记录一周的门到门耗时和舒适度，再决定日常方式，也可以把骑车与地铁组合起来。"},
+  {"prompt":"温度计读数上午为负3摄氏度，中午升高8度，傍晚下降4度，傍晚是多少？","reasoning":"按照时间顺序计算带符号的温度变化，中午是五度，傍晚再减四度。","answer":"中午温度为－3＋8＝5摄氏度；傍晚温度为5－4＝1摄氏度。因此傍晚的读数是1摄氏度，比上午高4度。"},
+  {"prompt":"解释月相为什么会变化，它是否主要由地球的影子造成？","reasoning":"普通月相由观察几何和日照方向决定，地球阴影遮挡对应月食，应明确区分。","answer":"月球本身不发光，我们看到的是它反射的太阳光。月球绕地球运动时，我们看见的受光部分比例发生变化，于是出现新月、上弦月、满月等月相。普通月相变化不是主要由地球影子造成的。当地球恰好挡住照向月球的阳���时，才可能发生月食。"},
+  {"prompt":"帮我回复客户：包裹比预计晚了一天，目前只能确认已经离开发货仓。","reasoning":"应承认延迟并说明已知信息，不捏造送达时间或虚构已经联系物流。","answer":"您好，很抱歉包裹未能按原预计时间送达。目前可以确认包裹已离开发货仓，但我们暂时还不能确定准确送达时间。我们会继续核实运输进度，并在获得可靠信息后及时向您反馈。感谢您的耐心，也请您保留订单信息，便于后续查询。"},
+  {"prompt":"把会议议程写成三个项目：回顾上周完成情况，讨论本周风险，确认负责人。","reasoning":"使用清晰项目顺序，不添加已经做出的决定。议程和会议纪要的时态应区分。","answer":"1. 回顾上周任务的完成情况，说明尚未完成事项及原因。\n2. 讨论本周可能影响进度或质量的风险，收集应对建议。\n3. 确认后续事项的负责人和预计完成时间，并在会后整理记录。\n这是一份待执行的会议议程，具体结论需要在讨论后填写。"},
+  {"prompt":"写一个Python函数，只保留列表中第一次出现的元素，假设元素可哈希。","reasoning":"用集合检查是否见过，同时用列表保存顺序。不使用set直接返回，因为它不能表达首次出现的列表顺序要求。","answer":"```python\ndef unique_first(items):\n    seen = set()\n    result = []\n    for item in items:\n        if item not in seen:\n            seen.add(item)\n            result.append(item)\n    return result\n\nassert unique_first([3, 1, 3, 2, 1]) == [3, 1, 2]\nassert unique_first([]) == []\n```\n函数不会修改输入列表。由于使用集合，输入元素需要可哈希；平均时间复杂度为O(n)。"},
+  {"prompt":"用中文解释precision和recall的区别，场景是垃圾邮件识别。","reasoning":"精确率关注判为垃圾的邮件中有多少真的垃圾，召回率关注全部垃圾邮件中找到了多少。两个分母必须区分。","answer":"Precision通常译为精确率：被系统判为垃圾邮件的邮件中，真正垃圾邮件所占的比例。Recall通常译为召回率：所有真正垃圾邮件中，被系统成功识别出来的比例。例如系统标记了十封邮件，其中八封确实是垃圾，而实际一共有二十封垃圾邮件，那么精确率为8/10＝80%，召回率为8/20＝40%。"},
+  {"prompt":"给小学生解释植物为什么需要光，也需要水。","reasoning":"用简单语言介绍光合作用，说明光是能量来源而水是原料之一，避免把肥料等同于食物。","answer":"植物像一个小小的工厂。叶片可以利用阳光提供的能量，把水和空气中的二氧化碳变成糖等物质，这个过程叫光合作用。水还帮助植物运输养分、保持形态。不过不同植物需要的光照和水量不同，水太多可能让根部缺氧，阳光太强也可能损伤叶片。照顾植物要看它的具体需要。"},
+  {"prompt":"写一个简短结尾，让两位许久未见的朋友告别后仍期待再次相见。","reasoning":"保留温柔克制的叙事，使用一个具体物件或动作连接下一次见面，不改变人物数量。","answer":"车站的钟响了，两个人终于把聊不完的话暂时收好。阿宁将那本旧书递回去，书页里多了一张写着地址的纸。等桂花开了，你来找我。朋友点点头，登上车后还隔着窗挥手。车子离开的时候，阿宁没有急着转身。她第一次觉得，告别也可以是一种有日期的约定。"}
+]

calibration/dataset/deployment.txt

@@ -0,0 +1,7 @@
+本地设备部署与维护说明
+设备首次安装时，应当先检查电源、网络和存储空间。管理人员需要确认系统时间正确，并为设备设置固定的内部地址。完成配置后，可以使用浏览器访问管理页面，检查模型服务、文档检索服务和音频服务是否启动成功。如果某个服务无法连接，应先查看该服务的状态和日志，不要直接重装整个系统。
+模型文件加载完成后，可以保留在内存中供多个请求复用。没有用户访问时，系统可以根据内存压力和空闲时间决定是否释放模型。释放之前必须确认当前没有正在执行的任务，也没有尚未发送完毕的音频。下一次请求到来时，应当重新初始化必要的运行资源，并在界面上显示准备状态。
+维护人员需要区分三类问题。第一类是网络连接中断，通常表现为页面无法打开或者连接超时。第二类是服务进程异常退出，通常能在日志中找到退出原因。第三类是模型推理失败，例如输入长度超过支持范围、文件损坏或者设备内存不足。这些问题需要分别处理，不能用同一种重启策略覆盖所有情况。
+升级软件时，应保留旧版程序和配置文件，并记录新旧版本的文件校验值。先在测试目录中运行新版本，确认基本功能正常，再切换正式服务。如果新版本出现问题，应当能够恢复到旧版本。恢复操作不能删除用户已经上传的文档、注册的音色或者已有的对话记录。
+性能测试应使用固定的输入和输出长度，同时记录处理器频率、内存占用和温度。测试前需要确认没有其他大型任务同时运行。对于需要持续服务的设备，还应安排混合负载测试，例如在生成回答时同时进行语音识别和文档检索，以判断这些功能之间是否会相互影响。
+数据备份应当定期执行，并验证备份文件是否能够恢复。只保存文件而不检查恢复过程，并不能保证数据安全。管理员可以先恢复一份小规模样本，确认文档数量、用户权限和索引状态一致，再决定是否进行完整恢复。涉及真实用户数据的操作必须遵循公司的管理制度。

calibration/dataset/meeting.txt

@@ -0,0 +1,7 @@
+项目会议纪要
+本次会议围绕本地办公助手的试运行展开。产品负责人介绍了三个主要场景：整理会议记录、查询内部文档，以及根据客户问题生成回复草稿。参会人员一致认为，系统首先需要准确保留人名、日期和数字，不能为了让表达流畅而补充没有依据的信息。如果材料中存在矛盾，助手应当指出矛盾，并请用户核实。
+研发组说明，目前已经完成语音输入、文字检索和语音播放的基本连接。下一阶段将集中测试连续对话，特别是用户在助手发言时插话的情况。测试人员需要记录开始讲话、识别文字出现、旧回复停止以及新回复开始播放的时间。对于偶尔出现的延迟，不能只看平均值，还需要保留最慢的样本和当时的设备负载。
+文档组提出，知识库中的旧版本说明容易造成误导。上传文件时应当记录文档所属部门、发布日期、有效期和访问范围。如果检索结果来自已经废止的制度，回答中必须明确说明，不能直接作为当前规则使用。涉及财务和人事的资料，只能由具有相应权限的用户查询。
+会议确定了以下安排。小林负责在周三之前整理二十条常见问题，覆盖请假流程、设备报修和项目交付。小周负责检查模型服务的错误日志，并为每一次请求补充统一的编号。陈经理负责联系试用部门，选择五名员工参与为期一周的测试。所有问题都记录在同一份表格中，包含复现步骤、预期结果、实际结果和处理人。
+对于性能目标，大家同意在相同输入长度和相同设备设置下进行比较。第一次加载模型的耗时与模型已经驻留内存之后的响应时间应当分别报告。任何优化都必须先经过准确性检查，尤其不能通过省略文本、缩短回答或跳过必要的权限判断来获得更漂亮的数据。
+会议最后讨论了验收方式。试用员工需要分别评价回答是否正确、是否容易理解，以及是否节省了实际工作时间。技术人员则负责检查服务能否稳定运行、发生错误后能否恢复，并确认日志中没有泄露不应该记录的个人信息。下周一将根据这些材料决定是否扩大试用范围。

calibration/dataset/support.txt

@@ -0,0 +1,13 @@
+客户支持问答整理
+问题：上传资料之后为什么暂时搜索不到内容？
+回答：上传文件和建立检索索引是两个步骤。文件上传完成后，系统还需要提取文字、切分段落并计算向量。在处理结束之前，新内容可能不会出现在搜索结果中。您可以先查看处理状态。如果显示失败，请检查文件是否有密码、是否损坏，以及是否属于支持的格式。
+问题：助手回答中引用的内容与我看到的文档不同，应该怎么办？
+回答：请先核对引用的文档名称和版本。不同日期发布的文件可能包含不同规定。也有可能是原始文件中的表格或图片没有被正确识别。建议打开引用片段，查看其上下文，并将有问题的位置反馈给管理员。在确认之前，不应把存在疑问的内容作为正式依据。
+问题：是否可以让普通员工使用对话页面，但不允许他们修改工作流？
+回答：可以通过区分管理入口和使用入口来实现。管理员负责配置工作流、连接模型和维护知识库，普通员工只访问指定的对话应用。不过，页面入口的区分不等于数据权限已经完整实现。还需要确认不同员工能够访问哪些文档，以及检索时是否执行了相应的权限检查。
+问题：当设备没有连接显示器时，语音和对话功能还能工作吗？
+回答：如果相关服务按照后台运行方式部署，它们可以在没有显示器的情况下继续工作。依赖桌面会话的组件则需要单独检查。例如画面采集、窗口显示和某些音频设备可能受到桌面登录状态影响。验收时应实际拔掉显示器，并重新连接客户端验证，而不是只根据配置推断。
+问题：为什么第一次回答比后续回答慢？
+回答：首次请求可能包含模型加载、内存分配和运行资源准备。后续请求通常能够复用已经准备好的资源，所以等待时间会减少。报告性能时，应分别说明首次加载时间、预热后的首字延迟和持续输出速度。如果每一轮对话都重新加载模型，就需要检查服务是否正确保留了运行实例。
+问题：系统遇到不确定的问题时应该怎样回复？
+回答：应明确指出当前资料不足，并说明需要补充什么信息。对于涉及合同、费用和责任归属的问题，最好提供可核对的原文引用，必要时请相应负责人确认。助手可以帮助整理信息，但不能通过编造细节来填补缺失的证据。

calibration/dataset/think_loss_cases.json

@@ -0,0 +1,23 @@
+[
+  {
+    "id": "office_zh",
+    "domain": "中文办公与事实约束",
+    "prompt": "请根据以下记录编写一份可直接发给项目组的中文部署说明，覆盖结论、职责、验收、异常处理和限制。不要补造事实。记录：公司部署一台本地推理设备，管理员陈敏负责模型更新，李舟负责知识库整理，周宁负责验收。第一阶段只处理内部制度与会议记录，不允许访问公网。周一整理资料，周二建立知识库，周三执行验收；周三未通过则顺延，不承诺周四上线。检索结果必须带出处；证据不足时明确说明，不猜测。允许更换模型，但需先保存旧版本和配置，故障时恢复。访问分为管理员和普通员工；员工只使用对话页面。会议纪要有草稿与已确认两种状态，草稿不能作为制度依据。验收问题覆盖检索、引用、权限与重启恢复；具体响应时间暂未设定。",
+    "reasoning": "我需要把记录中的明确事实转换为一份部署说明，并保留所有尚未确定的事项。人员职责已经指定，不能交换姓名或额外增加负责人。时间表只约定周一至周三的工作，没有给出周四一定上线的承诺，因此应采用条件式表述。第一阶段资料类型有限，不能扩大到客户数据、互联网资料或外部工具。权限只有管理员和普通员工两类，不能自行增加第三类角色或编造审批步骤。检索必须给出处，证据不足时承认不足；草稿会议纪要虽然可以保存，却不能作为有效制度依据。模型可以更新，但是必须保存旧版本和配置，并提供恢复路径。验收范围包括检索、引用、权限与重启恢复，不应自行写入毫秒数、吞吐量或准确率。说明可以分为目的、职责、日程、使用规则、验收与回退几个部分。各段可以解释操作意义，但不能把建议写成已经实施的事实。尤其要区分访问公网的禁止条件与本地知识库的可用范围，也要区分已确认纪要和制度文件的效力。最后应明确上线以周三验收结果为依据，未通过时顺延，响应时间指标仍待确定。\n",
+    "answer": "本地推理设备第一阶段部署说明\n\n一、范围与结论\n本阶段使用一台本地推理设备处理公司内部制度与会议记录，不访问公网。系统的回答应以已经整理并允许使用的资料为依据。当前安排包括资料整理、知识库建立和验收，上线时间以验收结果为准，不承诺周四上线。\n\n二、人员职责\n陈敏负责模型更新，更新前保存旧版本和相关配置。李舟负责知识库资料整理，区分制度文件、已确认会议纪要和草稿会议纪要。周宁负责验收，检查检索、引用、权限以及重启恢复情况。各项问题应记录对应现象和检查结果，避免只凭一次成功回答判断整个流程已经通过。\n\n三、实施日程\n周一整理资料，检查资料类别与确认状态；周二建立知识库；周三执行验收。如果周三验收未通过，后续安排顺延。不能把预定验收日期等同于实际通过日期，也不能向使用人员保证尚未确认的上线时间。\n\n四、访问与回答规则\n系统区分管理员和普通员工。普通员工只使用对话页面，后台管理由管理员处理。检索结果必须附带出处，便于使用人员核对原文。遇到证据不足、资料冲突或无法确定的问题，应明确说明已有证据的范围，不通过猜测补齐答案。草稿会议纪要不能作为制度依据；引用会议内容时，应先确认其状态，不能将未确认内容当作正式规定。\n\n五、验收内容\n验收应覆盖资料能否被正确检索、引用能否对应原文、普通员工能否按规定使用对话页面，以及设备重启后能否恢复预期功能。响应时间指标目前尚未设定，应如实记录实际情况，不自行认定已有具体时限。单个问题回答正确不能替代对其他验收项目的检查。发现问题时，应保留输入、输出及相关出处，方便区分资料问题与系统问题。\n\n六、异常与恢复\n更换模型前保存旧版本和配置，发生故障时恢复旧版本。恢复后仍需核对检索、引用、权限与重启恢复功能，不能仅凭进程启动就认定恢复完成。模型更新、资料整理和业务验收是不同环节，应按各自职责跟进。对于尚未设定的响应时间和未确认的上线日期，本说明保持未定状态，不补造承诺。"
+  },
+  {
+    "id": "math_probability",
+    "domain": "数学与多步推理",
+    "prompt": "袋中有5个红球、4个蓝球和3个绿球，球除颜色外没有区别。等概率不放回抽取4个球。求恰好抽到两种颜色的概率，以及在恰好抽到两种颜色的条件下至少有一个红球的概率。请给出组合计数、避免重复的方法、约分结果，并解释为什么不是把各颜色独立抽取概率直接相乘��",
+    "reasoning": "总数是十二个球，抽四个球且不放回，所以等可能样本空间可以用十二选四计数，总计四百九十五种。恰好两种颜色可以按照红蓝、红绿、蓝绿三个互斥事件分别计算。每组先从这两色的全部球中抽四个，再减去仅有单色的情况。红蓝共有九个球，九选四是一百二十六，减去五红选四的五种和四蓝选四的一种，得到一百二十。红绿共有八个球，八选四是七十，减去五红选四的五种，三个绿球不足以单独抽四个，因此得到六十五。蓝绿共有七个球，七选四是三十五，减去四蓝选四的一种，得到三十四。这三组相加是二百一十九，除以四百九十五，可以同时除以三，得到一百六十五分之七十三，即73/165。条件事件至少有一个红球，只包含红蓝和红绿两组，一共一百八十五种。条件概率分母应使用恰好两色的二百一十九，而不是全部四百九十五。185与219的最大公约数是1，所以185/219已经最简。为避免分数语言颠倒，最后直接用数学符号表示。也可以做补集检查：恰好两色但没有红球只有蓝绿三十四种，因此一减去34/219等于185/219。抽样不放回会改变后续的球数和颜色比例，不满足独立条件。\n",
+    "answer": "设A表示抽到的4个球恰好有两种颜色，R表示至少抽到1个红球。\n\n一、等可能样本空间\n袋中共有12个球。将每个实体球作为一个可区分的抽样对象，所有4球组合等可能，因此总组合数为C(12,4)=495。颜色相同不影响使用组合计数，因为最后只按颜色条件筛选这些等可能组合。\n\n二、计算恰好两种颜色\n把A分成红蓝、红绿、蓝绿三个互斥情况。各情况要求两种颜色都出现，而且不能出现第三种颜色。先选取该颜色对所包含的球，再扣除只有一种颜色的组合，可以避免把单色情况误算进去。\n\n红蓝：C(9,4)-C(5,4)-C(4,4)=126-5-1=120。\n红绿：C(8,4)-C(5,4)-C(3,4)=70-5-0=65。\n蓝绿：C(7,4)-C(4,4)-C(3,4)=35-1-0=34。这里C(3,4)=0，因为3个球无法组成4球组合。\n\n上述三个事件没有交集：一个恰好两色的组合具有唯一的颜色对。因此不需要再做交集修正，直接相加得到120+65+34=219。于是P(A)=219/495=73/165，约为0.4424。\n\n三、条件概率\n在已经知道恰好抽到两种颜色的条件下，样本空间应缩小为这219个符合条件的组合。至少有一个红球，意味着颜色对只能是红蓝或红绿，符合条件的组合数为120+65=185。因此P(R|A)=185/219，约为0.8447。这个分数已经不能继续约分。\n\n可以用补集核对结果：在A成立时，没有红球的情况只有蓝绿，对应34个组合。因此P(R|A)=1-34/219=185/219，与直接计数相同。\n\n四、为什么不能直接相乘\n不放回抽样不是独立抽样。每抽走一个球，袋中总球数会减少，相关颜色的球数也可能减少，后续抽取的概率随前面的结果变化。如果按抽取顺序计算，需要使用条件概率连乘，并把符合要求的颜色排列全部计入；不能把始终不变的初始颜色比例直接相乘。组合方法一次性计算无序抽样结果，避免了枚举所有排列，但仍然正确体现不放回条件。\n\n答案：恰好两种颜色的概率为73/165；在此条件下至少有一个红球的概率为185/219。"
+  },
+  {
+    "id": "code_python",
+    "domain": "代码与边界条件",
+    "prompt": "用Python编写一个函数merge_intervals，输入为整数闭区间的列表，输出合并重叠区间后的列表。不得修改输入，负数合法，空列表返回空列表；端点相等算重叠，例如[1,3]与[3,5]合并，但[1,3]与[4,5]不合并。每个区间必须恰有两个整数且起点不大于终点，布尔值不当作整数，非法数据抛出ValueError。请给出实现、边界测试，并解释排序与时间空间复杂度。",
+    "reasoning": "需要先确定输入验证和合并语义。Python中bool是int的子类，所以isinstance(value,int)会误收True或False，可以使用type(value) is int进行严格判断。输入要求列表，我会检查外层是list，并允许每个区间使用list或tuple，长度必须为2。端点必须是严格整数，且start不能大于end。先验证全部区间并复制到新的二元组列表，再排序，因此即使遇到非法输入，也不会改动原来的列表或内部区间。排序以起点为第一关键字、终点为第二关键字，默认元组排序即可满足。合并时维护输出列表最后一个区间。当前起点小于等于最后区间终点就重叠，应把终点更新为两者最大值；否则创建新输出区间。输入已经排序后，尚未处理区间的起点不会小于当前起点，所以只需与输出中最后一个区间比较。闭区间端点相同应合并，但相差1并不代表实数区间重叠，不能用end+1作为判断条件。负数和单点区间不需要特殊分支。复杂��方面，验证与复制是线性，排序为O(n log n)，扫描为O(n)，额外保存副本和输出最多O(n)。测试应包含空输入、无序重叠、共享端点、不相交相邻整数、包含关系、负数、单点以及非法布尔值和反向区间。还需要保存一份输入快照，验证调用后没有改变原始嵌套列表。\n",
+    "answer": "下面的实现会先验证并复制数据，再排序和合并，不修改输入。\n\n```python\ndef merge_intervals(intervals):\n    if not isinstance(intervals, list):\n        raise ValueError('intervals must be a list')\n\n    copied = []\n    for interval in intervals:\n        if not isinstance(interval, (list, tuple)) or len(interval) != 2:\n            raise ValueError('each interval must have two endpoints')\n        start, end = interval\n        if type(start) is not int or type(end) is not int:\n            raise ValueError('endpoints must be integers, excluding bool')\n        if start > end:\n            raise ValueError('start must not exceed end')\n        copied.append((start, end))\n\n    copied.sort()\n    merged = []\n    for start, end in copied:\n        if not merged or start > merged[-1][1]:\n            merged.append([start, end])\n        else:\n            merged[-1][1] = max(merged[-1][1], end)\n    return merged\n```\n\n边界测试：\n\n```python\nassert merge_intervals([]) == []\nassert merge_intervals([[3, 5], [1, 3]]) == [[1, 5]]\nassert merge_intervals([[1, 3], [4, 5]]) == [[1, 3], [4, 5]]\nassert merge_intervals([[1, 10], [2, 3]]) == [[1, 10]]\nassert merge_intervals([[-4, -1], [-2, 2]]) == [[-4, 2]]\nassert merge_intervals([[2, 2], [2, 4]]) == [[2, 4]]\n\nsource = [[5, 8], [1, 3], [3, 6]]\nsnapshot = [interval[:] for interval in source]\nassert merge_intervals(source) == [[1, 8]]\nassert source == snapshot\n\nfor bad in ([[True, 2]], [[1, False]], [[3, 1]],\n            [[1, 2, 3]], [[1.0, 2]], [None]):\n    try:\n        merge_intervals(bad)\n    except ValueError:\n        pass\n    else:\n        raise AssertionError('invalid input was accepted')\n```\n\n排序使区间按起点递增排列。扫描时，已经输出的区间彼此不重叠；当前区间只可能与最后一个输出区间发生新的合并。如果当前起点大于最后终点，两者不相交，可以直接追加。否则它们存在公共点，合并后的终点取较大值。\n\n判断使用start <= end的重叠语义，而不是把终点加一，因此[1,3]与[3,5]会合并，[1,3]与[4,5]保持分离。每个输出区间都是新建列表，后续修改返回结果也不会改变原输入。\n\n设输入有n个区间。验证和复制耗时O(n)，排序耗时O(n log n)，扫描耗时O(n)，总体时间复杂度为O(n log n)。副本、排序辅助空间和输出都至多为O(n)，额外空间复杂度为O(n)。"
+  }
+]

deployment/notices/BUILD-AND-LICENSES.md

@@ -0,0 +1,11 @@
+# 构建与组件说明
+
+本项目是面向 RK3588/RK3588S 的 C++ Ling3RKNN 推理引擎，不包含 llama.cpp、RKLLM、Python 推理服务或远端模型调用。
+
+构建时请从官方 [rknn-toolkit2](https://github.com/airockchip/rknn-toolkit2) 和 [rknpu2](https://github.com/airockchip/rknpu2) 获取 `rknn_api.h` 与 `librknnrt.so`。官方 `rknpu2` checkout 中通常位于 `runtime/Linux/librknn_api/include` 和 `runtime/Linux/librknn_api/aarch64`；CMake 也支持整理后的 `include/` 与 `lib/` 布局。请遵守 Rockchip 的许可、版本和再分发限制。经许可的便携部署包可以包含匹配版本的 runtime；各组件的许可证和来源见同目录 NOTICE 文件。
+
+本项目代码和 C++ 推理引擎采用 [Apache-2.0](../../LICENSE) 许可；本项目发布的转换/打包模型资产标注为 [CC BY-NC 4.0](https://creativecommons.org/licenses/by-nc/4.0/) 非商业许可，不改变上游基模型的权利或许可边界。完整上游模型和原始权重请从 [inclusionAI/Ling-3.0-tiny](https://huggingface.co/inclusionAI/Ling-3.0-tiny) 获取。
+
+nlohmann JSON 3.10.5 使用 MIT 许可，完整声明保留在随源码提供的 `third_party/nlohmann/nlohmann/json.hpp` 中。
+
+源码和构建入口：`CMakeLists.txt`、`src/portable_main.cpp`、`tools/portable_launcher.c` 和 `tools/build_portable.py`。使用 CMake Release 编译 `mindnano-infer`，将 `RKNN_ROOT` 指向本地 RKNPU2 目录。便携包发布前应重新生成二进制、MANIFEST、NOTICE 和 SHA256SUMS，并保留所有第三方条款。

deployment/notices/GCC.txt

@@ -0,0 +1,1641 @@
+This is the Debian GNU/Linux prepackaged version of the GNU compiler
+collection, containing Ada, C, C++, D, Fortran 95, Go, Objective-C,
+Objective-C++, and Modula-2 compilers, documentation, and support
+libraries.  In addition, Debian provides the gm2 compiler, either in
+the same source package, or built from a separate same source package.
+Packaging is done by the Debian GCC Maintainers
+<debian-gcc@lists.debian.org>, with sources obtained from:
+
+  ftp://gcc.gnu.org/pub/gcc/releases/            (for full releases)
+  https://gcc.gnu.org/git/gitweb.cgi?p=gcc.git   (for prereleases)
+  ftp://sourceware.org/pub/newlib/               (for newlib)
+
+The current gcc-16 source package is taken from the git gcc-16-branch.
+
+Changes: See changelog.Debian.gz
+
+Debian splits the GNU Compiler Collection into packages for each language,
+library, and documentation as follows:
+
+Language       Compiler package  Library package    Documentation
+---------------------------------------------------------------------------
+Ada            gnat-16          libgnat-16          gnat-16-doc
+Algol-68       ga68-16          libga68-1          libga68-16-doc
+C              gcc-16                              gcc-16-doc
+C++            g++-16           libstdc++6         libstdc++6-16-doc
+COBOL          gcobol-16        libgcobol1
+D              gdc-16           libgphobos6
+Fortran 95     gfortran-16      libgfortran5       gfortran-16-doc
+Go             gccgo-16         libgo0
+Objective C    gobjc-16         libobjc4
+Objective C++  gobjc++-16
+Modula-2       gm2-16           libgm2             libgm2-16-doc
+Rust           gccrs-16
+
+For some language run-time libraries, Debian provides source files,
+development files, debugging symbols and libraries containing position-
+independent code in separate packages:
+
+Language  Sources      Development   Debugging            Position-Independent
+------------------------------------------------------------------------------
+C++                                  libstdc++6-16-dbg  libstdc++6-16-pic
+D         libphobos-16-dev
+
+Additional packages include:
+
+All languages:
+libgcc1, libgcc2, libgcc4       GCC intrinsics (platform-dependent)
+gcc-16-base                    Base files common to all compilers
+gcc-16-soft-float              Software floating point (ARM only)
+gcc-16-source                  The sources with patches
+
+Ada:
+libgnat-util16-dev, libgnat-util16   GNAT version library
+
+C:
+cpp-16, cpp-16-doc            GNU C Preprocessor
+libssp0-dev, libssp0            GCC stack smashing protection library
+libquadmath0                    Math routines for the __float128 type
+fixincludes                     Fix non-ANSI header files
+
+C, C++ and Fortran 95:
+libgomp1-dev, libgomp1		GCC OpenMP (GOMP) support library
+libitm1-dev, libitm1		GNU Transactional Memory Library
+
+Biarch support: On some 64-bit platforms which can also run 32-bit code,
+Debian provides additional packages containing 32-bit versions of some
+libraries.  These packages have names beginning with 'lib32' instead of
+'lib', for example lib32stdc++6.  Similarly, on some 32-bit platforms which
+can also run 64-bit code, Debian provides additional packages with names
+beginning with 'lib64' instead of 'lib'.  These packages contain 64-bit
+versions of the libraries.  (At this time, not all platforms and not all
+libraries support biarch.)  The license terms for these lib32 or lib64
+packages are identical to the ones for the lib packages.
+
+
+COPYRIGHT STATEMENTS AND LICENSING TERMS
+
+
+GCC is Copyright (C) 1986-2025 Free Software Foundation, Inc.
+
+GCC 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, or (at your option) any later
+version.
+
+GCC 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.
+
+Files that have exception clauses are licensed under the terms of the
+GNU General Public License; either version 3, or (at your option) any
+later version.
+
+On Debian GNU/Linux systems, the complete text of the GNU General
+Public License is in `/usr/share/common-licenses/GPL', version 3 of this
+license in `/usr/share/common-licenses/GPL-3'.
+
+The following runtime libraries are licensed under the terms of the
+GNU General Public License (v3 or later) with version 3.1 of the GCC
+Runtime Library Exception (included in this file):
+
+ - libgcc (libgcc/, gcc/libgcc2.[ch], gcc/unwind*, gcc/gthr*,
+   gcc/coretypes.h, gcc/crtstuff.c, gcc/defaults.h, gcc/dwarf2.h,
+   gcc/emults.c, gcc/gbl-ctors.h, gcc/gcov-io.h, gcc/libgcov.c,
+   gcc/tsystem.h, gcc/typeclass.h).
+ - libatomic
+ - libdecnumber
+ - libgm2
+ - libgomp
+ - libgrust
+ - libitm
+ - libssp
+ - libstdc++-v3
+ - libobjc
+ - libgfortran
+ - The libgnat-16 Ada support library and libgnat-util16 library.
+ - Various config files in gcc/config/ used in runtime libraries.
+ - libvtv
+
+The libbacktrace library is licensed under the following terms:
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+    (1) Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer. 
+
+    (2) Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in
+    the documentation and/or other materials provided with the
+    distribution.  
+    
+    (3) The name of the author may not be used to
+    endorse or promote products derived from this software without
+    specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
+INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
+STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
+IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+
+
+The libsanitizer libraries (libasan, liblsan, libtsan, libubsan) are
+licensed under the following terms:
+
+Copyright (c) 2009-2019 by the LLVM contributors.
+
+All rights reserved.
+
+Developed by:
+
+    LLVM Team
+
+    University of Illinois at Urbana-Champaign
+
+    http://llvm.org
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal with
+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:
+
+    * Redistributions of source code must retain the above copyright notice,
+      this list of conditions and the following disclaimers.
+
+    * Redistributions in binary form must reproduce the above copyright notice,
+      this list of conditions and the following disclaimers in the
+      documentation and/or other materials provided with the distribution.
+
+    * Neither the names of the LLVM Team, University of Illinois at
+      Urbana-Champaign, nor the names of its contributors may be used to
+      endorse or promote products derived from this Software without specific
+      prior written permission.
+
+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
+CONTRIBUTORS 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 WITH THE
+SOFTWARE.
+
+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.
+
+
+The libffi library is licensed under the following terms:
+
+    libffi - Copyright (c) 1996-2011  Red Hat, Inc.
+
+    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 CYGNUS SOLUTIONS 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.
+
+
+The documentation is licensed under the GNU Free Documentation License (v1.2).
+On Debian GNU/Linux systems, the complete text of this license is in
+`/usr/share/common-licenses/GFDL-1.2'.
+
+
+GCC RUNTIME LIBRARY EXCEPTION
+
+Version 3.1, 31 March 2009
+
+Copyright (C) 2009 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.
+
+This GCC Runtime Library Exception ("Exception") is an additional
+permission under section 7 of the GNU General Public License, version
+3 ("GPLv3"). It applies to a given file (the "Runtime Library") that
+bears a notice placed by the copyright holder of the file stating that
+the file is governed by GPLv3 along with this Exception.
+
+When you use GCC to compile a program, GCC may combine portions of
+certain GCC header files and runtime libraries with the compiled
+program. The purpose of this Exception is to allow compilation of
+non-GPL (including proprietary) programs to use, in this way, the
+header files and runtime libraries covered by this Exception.
+
+0. Definitions.
+
+A file is an "Independent Module" if it either requires the Runtime
+Library for execution after a Compilation Process, or makes use of an
+interface provided by the Runtime Library, but is not otherwise based
+on the Runtime Library.
+
+"GCC" means a version of the GNU Compiler Collection, with or without
+modifications, governed by version 3 (or a specified later version) of
+the GNU General Public License (GPL) with the option of using any
+subsequent versions published by the FSF.
+
+"GPL-compatible Software" is software whose conditions of propagation,
+modification and use would permit combination with GCC in accord with
+the license of GCC.
+
+"Target Code" refers to output from any compiler for a real or virtual
+target processor architecture, in executable form or suitable for
+input to an assembler, loader, linker and/or execution
+phase. Notwithstanding that, Target Code does not include data in any
+format that is used as a compiler intermediate representation, or used
+for producing a compiler intermediate representation.
+
+The "Compilation Process" transforms code entirely represented in
+non-intermediate languages designed for human-written code, and/or in
+Java Virtual Machine byte code, into Target Code. Thus, for example,
+use of source code generators and preprocessors need not be considered
+part of the Compilation Process, since the Compilation Process can be
+understood as starting with the output of the generators or
+preprocessors.
+
+A Compilation Process is "Eligible" if it is done using GCC, alone or
+with other GPL-compatible software, or if it is done without using any
+work based on GCC. For example, using non-GPL-compatible Software to
+optimize any GCC intermediate representations would not qualify as an
+Eligible Compilation Process.
+
+1. Grant of Additional Permission.
+
+You have permission to propagate a work of Target Code formed by
+combining the Runtime Library with Independent Modules, even if such
+propagation would otherwise violate the terms of GPLv3, provided that
+all Target Code was generated by Eligible Compilation Processes. You
+may then convey such a combination under terms of your choice,
+consistent with the licensing of the Independent Modules.
+
+2. No Weakening of GCC Copyleft.
+
+The availability of this Exception does not imply any general
+presumption that third-party software is unaffected by the copyleft
+requirements of the license of GCC.
+
+
+libquadmath/
+  Copyright (C) 1992-2018 Free Software Foundation, Inc.
+
+  Written by Francois-Xavier Coudert  <fxcoudert@gcc.gnu.org>
+  Written by Tobias Burnus  <burnus@net-b.de>
+  Contributions by Ulrich Drepper <drepper@gnu.ai.mit.edu>
+  Conversion to long double by Jakub Jelinek <jj@ultra.linux.cz>
+
+  This file is part of the libquadmath library.
+  Libquadmath is free software; you can redistribute it and/or
+  modify it under the terms of the GNU Library General Public
+  License as published by the Free Software Foundation; either
+  version 2 of the License, or (at your option) any later version.
+
+  Libiberty 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
+  Library General Public License for more details.
+
+libquadmath/math:
+
+atanq.c, expm1q.c, j0q.c, j1q.c, log1pq.c, logq.c:
+    Copyright 2001 by Stephen L. Moshier <moshier@na-net.ornl.gov> 
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library 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
+    Lesser General Public License for more details.
+
+coshq.c, erfq.c, jnq.c, lgammaq.c, powq.c, roundq.c:
+  Changes for 128-bit __float128 are
+  Copyright (C) 2001 Stephen L. Moshier <moshier@na-net.ornl.gov>
+  and are incorporated herein by permission of the author.  The author
+  reserves the right to distribute this material elsewhere under different
+  copying permissions.  These modifications are distributed here under
+  the following terms:
+
+  This library is free software; you can redistribute it and/or
+  modify it under the terms of the GNU Lesser General Public
+  License as published by the Free Software Foundation; either
+  version 2.1 of the License, or (at your option) any later version.
+
+  This library 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
+  Lesser General Public License for more details.
+
+libquadmath/math/
+
+cosq_kernel.c, expq.c, sincos_table.c, sincosq.c, sincosq_kernel.c,
+sinq_kernel.c, truncq.c:
+  Copyright (C) 1997, 1999 Free Software Foundation, Inc.
+
+  The GNU C Library is free software; you can redistribute it and/or
+  modify it under the terms of the GNU Lesser General Public
+  License as published by the Free Software Foundation; either
+  version 2.1 of the License, or (at your option) any later version.
+
+  The GNU C Library 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
+  Lesser General Public License for more details.
+
+libquadmath/math/isinfq.c:
+  Written by J.T. Conklin <jtc@netbsd.org>.
+  Change for long double by Jakub Jelinek <jj@ultra.linux.cz>
+  Public domain.
+
+libquadmath/math/
+  llroundq.c, lroundq.c, tgammaq.c:
+
+  Copyright (C) 1997, 1999, 2002, 2004 Free Software Foundation, Inc.
+  This file is part of the GNU C Library.
+  Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997 and
+                 Jakub Jelinek <jj@ultra.linux.cz>, 1999.
+
+  The GNU C Library is free software; you can redistribute it and/or
+  modify it under the terms of the GNU Lesser General Public
+  License as published by the Free Software Foundation; either
+  version 2.1 of the License, or (at your option) any later version.
+
+  The GNU C Library 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
+  Lesser General Public License for more details.
+
+libquadmath/math/log10q.c:
+  Cephes Math Library Release 2.2:  January, 1991
+  Copyright 1984, 1991 by Stephen L. Moshier
+  Adapted for glibc November, 2001
+
+  This library is free software; you can redistribute it and/or
+  modify it under the terms of the GNU Lesser General Public
+  License as published by the Free Software Foundation; either
+  version 2.1 of the License, or (at your option) any later version.
+
+  This library 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
+  Lesser General Public License for more details.
+
+libquadmath/math/
+  acoshq.c, acosq.c, asinhq.c, asinq.c, atan2q.c, atanhq.c, ceilq.c,
+  copysignq.c, coshq.c, cosq.c, erfq.c, fabsq.c, finiteq.c, floorq.c,
+  fmodq.c, frexpq.c, hypotq.c, ilogbq.c, isnanq.c, jnq.c, ldexpq.c,
+  logbq.c, modfq.c, nearbyintq.c, nextafterq.c, powq.c, remainderq.c,
+  rem_pio2q.c, rintq.c, scalblnq.c, scalbnq.c, sinhq.c, sinq.c,
+  tanhq.c, tanq.c, tanq_kernel.c:
+
+  Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
+  .
+  Developed at SunPro, a Sun Microsystems, Inc. business.
+  Permission to use, copy, modify, and distribute this
+  software is freely granted, provided that this notice
+  is preserved.
+
+libquadmath/math/
+  acosq.c, asinq.c, coshq.c, erfq.c, jnq.c, powq.c, sinhq.c, tanq_kernel.c:
+  
+  In addition to the Sun Microsystems copyright:
+
+  Long double expansions are
+  Copyright (C) 2001 Stephen L. Moshier <moshier@na-net.ornl.gov>
+  and are incorporated herein by permission of the author.  The author
+  reserves the right to distribute this material elsewhere under different
+  copying permissions.  These modifications are distributed here under
+  the LGPL 2.1 or later.
+   
+
+gcc/go/gofrontend, libgo:
+
+Copyright (c) 2009-2023 The Go Authors. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+   * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+   * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+   * Neither the name of Google Inc. nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+D:
+gdc-16                         GNU D Compiler
+libphobos-16-dev               D standard runtime library
+
+The D source package is made up of the following components.
+
+The D front-end for GCC:
+ - d/*
+
+Copyright (C) 2004-2007 David Friedman
+Modified by Vincenzo Ampolo, Michael Parrot, Iain Buclaw, (C) 2009, 2010
+Copyright (C) 2015-2024 Free Software Foundation, Inc.
+
+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.
+
+On Debian GNU/Linux systems, the complete text of the GNU General
+Public License is in `/usr/share/common-licenses/GPL', version 2 of this
+license in `/usr/share/common-licenses/GPL-3'.
+
+The DMD Compiler implementation of the D programming language:
+ - d/dmd/*
+
+Copyright (C) 1999-2023 by The D Language Foundation, All Rights Reserved
+All Rights Reserved
+written by Walter Bright
+http://www.digitalmars.com
+License for redistribution is by either the Artistic License or
+the GNU General Public License (v1).
+
+On Debian GNU/Linux systems, the complete text of the GNU General
+Public License is in `/usr/share/common-licenses/GPL', the Artistic
+license in `/usr/share/common-licenses/Artistic'.
+
+
+The Zlib data compression library:
+ - zlib/*
+
+ (C) 1995-2016 Jean-loup Gailly and Mark Adler
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the authors be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+
+The Phobos standard runtime library:
+ - libphobos/*
+
+Unless otherwise marked within the file, each file in the source
+is under the following licenses:
+
+Copyright (C) 2004-2022 by Digital Mars, www.digitalmars.com
+Written by Walter Bright
+Copyright (C) 2018-2023, The D Language Foundation
+
+This software is provided 'as-is', without any express or implied
+warranty. In no event will the authors be held liable for any damages
+arising from the use of this software.
+
+Permission is granted to anyone to use this software for any purpose,
+including commercial applications, and to alter it and redistribute it
+freely, in both source and binary form, subject to the following
+restrictions:
+
+ o  The origin of this software must not be misrepresented; you must not
+    claim that you wrote the original software. If you use this software
+    in a product, an acknowledgment in the product documentation would be
+    appreciated but is not required.
+ o  Altered source versions must be plainly marked as such, and must not
+    be misrepresented as being the original software.
+ o  This notice may not be removed or altered from any source
+    distribution.
+
+By plainly marking modifications, something along the lines of adding to each
+file that has been changed a "Modified by Foo Bar" line
+underneath the "Written by" line would be adequate.
+
+gcc/m2:
+gcc/m2/gm2-libiberty:
+gcc/m2/mc-boot/:
+gcc/m2/mc-boot-ch/:
+Copyright (C) 2001-2019 Free Software Foundation, Inc.
+Contributed by Gaius Mulley <gaius@glam.ac.uk>.
+
+This file is part of GNU Modula-2.
+
+GNU Modula-2 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, or (at your option)
+any later version.
+
+GNU Modula-2 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.
+
+gcc/m2/**/*.texi:
+Copyright (C) 2000-2024 Free Software Foundation, Inc.
+
+Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
+
+gcc/m2/gm2-coroutines:
+gcc/m2/gm2-libs:
+gcc/m2/gm2-libs-min:
+gcc/m2/gm2-libs-pim:
+gcc/m2/gm2-libs-ch:
+Copyright (C) 2002-2024 Free Software Foundation, Inc.
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2.1 of the License, or (at your option) any later version.
+
+This library 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
+Lesser General Public License for more details.
+
+Under Section 7 of GPL version 3, you are granted additional
+permissions described in the GCC Runtime Library Exception, version
+3.1, as published by the Free Software Foundation.
+
+gcc/m2/gm2-libs-iso/:
+This has a mix of licenses, most as GPL-3+ plus GCC Runtime Library
+Exception, version 3.1.
+
+gcc/m2/gm2-libs-iso/*.def:
+Library module defined by the International Standard
+Information technology - programming languages
+BS ISO/IEC 10514-1:1996E Part 1: Modula-2, Base Language.
+
+Copyright ISO/IEC (International Organization for Standardization
+and International Electrotechnical Commission) 1996, 1997, 1998,
+1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010
+
+Copyright (C) 2001-2024 Free Software Foundation, Inc.
+mix of GPL-3.0 and LGPL-2.1/3
+
+Copyright (C) 2001-2024 Free Software Foundation, Inc.
+mix of GPL-3.0 and LGPL-2.1/3
+
+gcc/m2/examples:
+Copyright (C) 2005-2024 Free Software Foundation, Inc.
+Mix of LGPL-2.1 and GPL-3.0.
+
+gcc/m2/images:
+GPL-3+
+
+gcc/m2/el/gm2-mode.el:
+;; Everyone is granted permission to copy, modify and redistribute
+;; GNU Emacs, but only under the conditions described in the
+;; GNU Emacs General Public License.   A copy of this license is
+;; supposed to have been given to you along with GNU Emacs so you
+;; can know your rights and responsibilities.  It should be in a
+;; file named COPYING.  Among other things, the copyright notice
+;; and this notice must be preserved on all copies.
+
+Copyright (C) 2001-2024 Free Software Foundation, Inc.
+Contributed by Gaius Mulley <gaius@glam.ac.uk>.
+Mix of GPL-3 and LGPL-2.1.
+
+gcc/testsuite/gm2/:
+Copyright (C) 2001-2019 Free Software Foundation, Inc.
+Mix of GPL-2+ and GPL-3+
+
+libgm2:
+
+libgm2/libiso/:
+libgm2/libpim/:
+libgm2/liblog/:
+libgm2/libcor/:
+libgm2/libmin/:
+Copyright (C) 2002-2024 Free Software Foundation, Inc.
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2.1 of the License, or (at your option) any later version.
+
+This library 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
+Lesser General Public License for more details.
+
+Under Section 7 of GPL version 3, you are granted additional
+permissions described in the GCC Runtime Library Exception, version
+3.1, as published by the Free Software Foundation.
+
+newlib-X.Y.Z/ (only for the offload compilers):
+
+Upstream Authors:
+newlib@sources.redhat.com
+Jeff Johnston <jjohnstn@redhat.com>
+Tom Fitzsimmons <fitzsim@redhat.com>
+
+The newlib subdirectory is a collection of software from several sources.
+Each file may have its own copyright/license that is embedded in the source 
+file.
+
+This list documents those licenses which are more restrictive than
+a BSD-like license or require the copyright notice
+to be duplicated in documentation and/or other materials associated with
+the distribution.  Certain licenses documented here only apply to
+specific targets.  Certain clauses only apply if you are building the
+code as part of your binary.
+
+Note that this list may omit certain licenses that
+only pertain to the copying/modifying of the individual source code. 
+If you are distributing the source code, then you do not need to
+worry about these omitted licenses, so long as you do not modify the
+copyright information already in place.
+
+Parts of this work are licensed under the terms of the GNU General
+Public License. On Debian systems, the complete text of this license
+can be found in /usr/share/common-licenses/GPL.
+
+Parts of this work are licensed under the terms of the GNU Library
+General Public License. On Debian systems, the complete text of this
+license be found in /usr/share/common-licenses/LGPL.
+
+(1) University of California, Berkeley
+
+[1a]
+
+Copyright (c) 1990 The Regents of the University of California.
+All rights reserved.
+
+Redistribution and use in source and binary forms are permitted
+provided that the above copyright notice and this paragraph are
+duplicated in all such forms and that any documentation,
+and other materials related to such distribution and use 
+acknowledge that the software was developed
+by the University of California, Berkeley.  The name of the
+University may not be used to endorse or promote products derived
+from this software without specific prior written permission.
+THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
+IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+
+[1b]
+
+Copyright (c) 1990 The Regents of the University of California.
+All rights reserved.
+
+Redistribution and use in source and binary forms are permitted
+provided that the above copyright notice and this paragraph are
+duplicated in all such forms and that any documentation,
+advertising materials, and other materials related to such
+distribution and use acknowledge that the software was developed
+by the University of California, Berkeley.  The name of the
+University may not be used to endorse or promote products derived
+from this software without specific prior written permission.
+THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
+IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+
+[1c]
+
+Copyright (c) 1981, 1983, 1986, 1988, 1989, 1991, 1992, 1993, 1994 
+The Regents of the University of California.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+3. All advertising materials mentioning features or use of this software
+   must display the following acknowledgement:
+     This product includes software developed by the University of
+     California, Berkeley and its contributors.
+4. Neither the name of the University nor the names of its contributors
+   may be used to endorse or promote products derived from this software
+   without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+[1d]
+
+Copyright (c) 1988, 1990, 1993 Regents of the University of California.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+3. Neither the name of the University nor the names of its contributors
+   may be used to endorse or promote products derived from this software
+   without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+[1e]
+
+Copyright (c) 1982, 1986, 1989, 1991, 1993, 1994
+The Regents of the University of California.  All rights reserved.
+(c) UNIX System Laboratories, Inc.
+All or some portions of this file are derived from material licensed
+to the University of California by American Telephone and Telegraph
+Co. or Unix System Laboratories, Inc. and are reproduced herein with
+the permission of UNIX System Laboratories, Inc.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+3. All advertising materials mentioning features or use of this software
+   must display the following acknowledgement:
+     This product includes software developed by the University of
+     California, Berkeley and its contributors.
+4. Neither the name of the University nor the names of its contributors
+   may be used to endorse or promote products derived from this software
+   without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+[1f]
+
+Copyright (c) 1987, 1988, 2000 Regents of the University of California.
+All rights reserved.
+
+Redistribution and use in source and binary forms are permitted
+provided that: (1) source distributions retain this entire copyright
+notice and comment, and (2) distributions including binaries display
+the following acknowledgement:  ``This product includes software
+developed by the University of California, Berkeley and its contributors''
+in the documentation or other materials provided with the distribution
+and in all advertising materials mentioning features or use of this
+software. Neither the name of the University nor the names of its
+contributors may be used to endorse or promote products derived
+from this software without specific prior written permission.
+THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
+IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+
+-------------------------------------------------------------
+ Please note that in some of the above alternate licenses, there is a
+ statement regarding that acknowledgement must be made in any
+ advertising materials for products using the code.  This restriction
+ no longer applies due to the following license change:
+
+  ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change
+
+ In some cases the defunct clause has been removed in modified newlib code and
+ in some cases, the clause has been left as-is.
+-------------------------------------------------------------
+
+(2) Cygwin (cygwin targets only)
+
+Copyright 2001 Red Hat, Inc.
+
+This software is a copyrighted work licensed under the terms of the
+Cygwin license.  Please consult the file "CYGWIN_LICENSE" for
+details.
+
+(3) David M. Gay at AT&T
+
+The author of this software is David M. Gay.
+
+Copyright (c) 1991 by AT&T.
+
+Permission to use, copy, modify, and distribute this software for any
+purpose without fee is hereby granted, provided that this entire notice
+is included in all copies of any software which is or includes a copy
+or modification of this software and in all copies of the supporting
+documentation for such software.
+
+THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
+WARRANTY.  IN PARTICULAR, NEITHER THE AUTHOR NOR AT&T MAKES ANY
+REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
+OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
+
+(4) Advanced Micro Devices
+
+Copyright 1989, 1990 Advanced Micro Devices, Inc.
+
+This software is the property of Advanced Micro Devices, Inc  (AMD)  which
+specifically  grants the user the right to modify, use and distribute this
+software provided this notice is not removed or altered.  All other rights
+are reserved by AMD.
+
+AMD MAKES NO WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, WITH REGARD TO THIS
+SOFTWARE.  IN NO EVENT SHALL AMD BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL
+DAMAGES IN CONNECTION WITH OR ARISING FROM THE FURNISHING, PERFORMANCE, OR
+USE OF THIS SOFTWARE.
+
+So that all may benefit from your experience, please report  any  problems
+or  suggestions about this software to the 29K Technical Support Center at
+800-29-29-AMD (800-292-9263) in the USA, or 0800-89-1131  in  the  UK,  or
+0031-11-1129 in Japan, toll free.  The direct dial number is 512-462-4118.
+
+Advanced Micro Devices, Inc.
+29K Support Products
+Mail Stop 573
+5900 E. Ben White Blvd.
+Austin, TX 78741
+800-292-9263
+
+(5) C.W. Sandmann
+
+Copyright (C) 1993 C.W. Sandmann
+
+This file may be freely distributed as long as the author's name remains.
+
+(6) Eric Backus
+
+(C) Copyright 1992 Eric Backus
+
+This software may be used freely so long as this copyright notice is
+left intact.  There is no warrantee on this software.
+
+(7) Sun Microsystems
+
+Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
+
+Developed at SunPro, a Sun Microsystems, Inc. business.
+Permission to use, copy, modify, and distribute this
+software is freely granted, provided that this notice 
+is preserved.
+
+(8) Hewlett Packard
+
+(c) Copyright 1986 HEWLETT-PACKARD COMPANY
+
+To anyone who acknowledges that this file is provided "AS IS"
+without any express or implied warranty:
+    permission to use, copy, modify, and distribute this file
+for any purpose is hereby granted without fee, provided that
+the above copyright notice and this notice appears in all
+copies, and that the name of Hewlett-Packard Company not be
+used in advertising or publicity pertaining to distribution
+of the software without specific, written prior permission.
+Hewlett-Packard Company makes no representations about the
+suitability of this software for any purpose.
+
+(9) Hans-Peter Nilsson
+
+Copyright (C) 2001 Hans-Peter Nilsson
+
+Permission to use, copy, modify, and distribute this software is
+freely granted, provided that the above copyright notice, this notice
+and the following disclaimer are preserved with no changes.
+
+THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
+IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.
+
+(10) Stephane Carrez (m68hc11-elf/m68hc12-elf targets only)
+
+Copyright (C) 1999, 2000, 2001, 2002 Stephane Carrez (stcarrez@nerim.fr)
+
+The authors hereby grant permission to use, copy, modify, distribute,
+and license this software and its documentation for any purpose, provided
+that existing copyright notices are retained in all copies and that this
+notice is included verbatim in any distributions. No written agreement,
+license, or royalty fee is required for any of the authorized uses.
+Modifications to this software may be copyrighted by their authors
+and need not follow the licensing terms described here, provided that
+the new terms are clearly indicated on the first page of each file where
+they apply.
+
+(11) Christopher G. Demetriou
+
+Copyright (c) 2001 Christopher G. Demetriou
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+3. The name of the author may not be used to endorse or promote products
+   derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+(12) SuperH, Inc.
+
+Copyright 2002 SuperH, Inc. All rights reserved
+
+This software is the property of SuperH, Inc (SuperH) which specifically
+grants the user the right to modify, use and distribute this software
+provided this notice is not removed or altered.  All other rights are
+reserved by SuperH.
+
+SUPERH MAKES NO WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, WITH REGARD TO
+THIS SOFTWARE.  IN NO EVENT SHALL SUPERH BE LIABLE FOR INDIRECT, SPECIAL, 
+INCIDENTAL OR CONSEQUENTIAL DAMAGES IN CONNECTION WITH OR ARISING FROM
+THE FURNISHING, PERFORMANCE, OR USE OF THIS SOFTWARE.
+
+So that all may benefit from your experience, please report any problems
+or suggestions about this software to the SuperH Support Center via
+e-mail at softwaresupport@superh.com .
+
+SuperH, Inc.
+405 River Oaks Parkway
+San Jose
+CA 95134
+USA
+
+(13) Royal Institute of Technology
+
+Copyright (c) 1999 Kungliga Tekniska Hgskolan
+(Royal Institute of Technology, Stockholm, Sweden).
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+3. Neither the name of KTH nor the names of its contributors may be
+   used to endorse or promote products derived from this software without
+   specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY
+EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
+BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+(14) Alexey Zelkin
+
+Copyright (c) 2000, 2001 Alexey Zelkin <phantom@FreeBSD.org>
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+(15) Andrey A. Chernov
+
+Copyright (C) 1997 by Andrey A. Chernov, Moscow, Russia.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+(16) FreeBSD
+
+Copyright (c) 1997-2002 FreeBSD Project.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+(17) S. L. Moshier
+
+Author:  S. L. Moshier.
+
+Copyright (c) 1984,2000 S.L. Moshier
+
+Permission to use, copy, modify, and distribute this software for any
+purpose without fee is hereby granted, provided that this entire notice
+is included in all copies of any software which is or includes a copy
+or modification of this software and in all copies of the supporting
+documentation for such software.
+
+THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
+WARRANTY.  IN PARTICULAR,  THE AUTHOR MAKES NO REPRESENTATION
+OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY OF THIS
+SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
+
+(18) Citrus Project
+
+Copyright (c)1999 Citrus Project,
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+(19) Todd C. Miller
+
+Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+3. The name of the author may not be used to endorse or promote products
+   derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
+INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL
+THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
+OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+(20) DJ Delorie (i386) 
+
+Copyright (C) 1991 DJ Delorie
+All rights reserved.
+
+Redistribution and use in source and binary forms is permitted
+provided that the above copyright notice and following paragraph are
+duplicated in all such forms.
+
+This file is distributed WITHOUT ANY WARRANTY; without even the implied
+warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+
+(21) Free Software Foundation LGPL License (*-linux* targets only)
+
+   Copyright (C) 1990-1999, 2000, 2001 
+   Free Software Foundation, Inc.
+   This file is part of the GNU C Library.
+   Contributed by Mark Kettenis <kettenis@phys.uva.nl>, 1997.
+
+   The GNU C Library is free software; you can redistribute it and/or
+   modify it under the terms of the GNU Lesser General Public
+   License as published by the Free Software Foundation; either
+   version 2.1 of the License, or (at your option) any later version.
+
+   The GNU C Library 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
+   Lesser General Public License for more details.
+
+   You should have received a copy of the GNU Lesser General Public
+   License along with the GNU C Library; if not, write to the Free
+   Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+   02110-1301 USA
+
+(22) Xavier Leroy LGPL License (i[3456]86-*-linux* targets only)
+
+Copyright (C) 1996 Xavier Leroy (Xavier.Leroy@inria.fr)
+
+This program is free software; you can redistribute it and/or
+modify it under the terms of the GNU Library General Public License
+as published by the Free Software Foundation; either version 2
+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 Library General Public License for more details.
+
+(23) Intel (i960)
+
+Copyright (c) 1993 Intel Corporation
+
+Intel hereby grants you permission to copy, modify, and distribute this
+software and its documentation.  Intel grants this permission provided
+that the above copyright notice appears in all copies and that both the
+copyright notice and this permission notice appear in supporting
+documentation.  In addition, Intel grants this permission provided that
+you prominently mark as "not part of the original" any modifications
+made to this software or documentation, and that the name of Intel
+Corporation not be used in advertising or publicity pertaining to
+distribution of the software or the documentation without specific,
+written prior permission.
+
+Intel Corporation provides this AS IS, WITHOUT ANY WARRANTY, EXPRESS OR
+IMPLIED, INCLUDING, WITHOUT LIMITATION, ANY WARRANTY OF MERCHANTABILITY
+OR FITNESS FOR A PARTICULAR PURPOSE.  Intel makes no guarantee or
+representations regarding the use of, or the results of the use of,
+the software and documentation in terms of correctness, accuracy,
+reliability, currentness, or otherwise; and you rely on the software,
+documentation and results solely at your own risk.
+
+IN NO EVENT SHALL INTEL BE LIABLE FOR ANY LOSS OF USE, LOSS OF BUSINESS,
+LOSS OF PROFITS, INDIRECT, INCIDENTAL, SPECIAL OR CONSEQUENTIAL DAMAGES
+OF ANY KIND.  IN NO EVENT SHALL INTEL'S TOTAL LIABILITY EXCEED THE SUM
+PAID TO INTEL FOR THE PRODUCT LICENSED HEREUNDER.
+
+(24) Hewlett-Packard  (hppa targets only)
+
+(c) Copyright 1986 HEWLETT-PACKARD COMPANY
+
+To anyone who acknowledges that this file is provided "AS IS"
+without any express or implied warranty:
+    permission to use, copy, modify, and distribute this file
+for any purpose is hereby granted without fee, provided that
+the above copyright notice and this notice appears in all
+copies, and that the name of Hewlett-Packard Company not be
+used in advertising or publicity pertaining to distribution
+of the software without specific, written prior permission.
+Hewlett-Packard Company makes no representations about the
+suitability of this software for any purpose.
+
+(25) Henry Spencer (only *-linux targets)
+
+Copyright 1992, 1993, 1994 Henry Spencer.  All rights reserved.
+This software is not subject to any license of the American Telephone
+and Telegraph Company or of the Regents of the University of California.
+
+Permission is granted to anyone to use this software for any purpose on
+any computer system, and to alter it and redistribute it, subject
+to the following restrictions:
+
+1. The author is not responsible for the consequences of use of this
+   software, no matter how awful, even if they arise from flaws in it.
+
+2. The origin of this software must not be misrepresented, either by
+   explicit claim or by omission.  Since few users ever read sources,
+   credits must appear in the documentation.
+
+3. Altered versions must be plainly marked as such, and must not be
+   misrepresented as being the original software.  Since few users
+   ever read sources, credits must appear in the documentation.
+
+4. This notice may not be removed or altered.
+
+(26) Mike Barcroft
+
+Copyright (c) 2001 Mike Barcroft <mike@FreeBSD.org>
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+(27) Konstantin Chuguev (--enable-newlib-iconv)
+
+Copyright (c) 1999, 2000
+   Konstantin Chuguev.  All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+   iconv (Charset Conversion Library) v2.0
+
+(27) Artem Bityuckiy (--enable-newlib-iconv)
+
+Copyright (c) 2003, Artem B. Bityuckiy, SoftMine Corporation.
+Rights transferred to Franklin Electronic Publishers.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGE.
+
+(28) Red Hat Incorporated
+
+Unless otherwise stated in each remaining newlib file, the remaining
+files in the newlib subdirectory default to the following copyright.
+It should be noted that Red Hat Incorporated now owns copyrights
+belonging to Cygnus Solutions and Cygnus Support.
+
+Copyright (c) 1994, 1997, 2001, 2002, 2003, 2004 Red Hat Incorporated.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without 
+modification, are permitted provided that the following conditions are met: 
+
+    Redistributions of source code must retain the above copyright 
+    notice, this list of conditions and the following disclaimer.
+
+    Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+
+    The name of Red Hat Incorporated may not be used to endorse 
+    or promote products derived from this software without specific 
+    prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED.  IN NO EVENT SHALL RED HAT INCORPORATED BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 
+
+
+contrib/unicode:
+
+UNICODE, INC. LICENSE AGREEMENT - DATA FILES AND SOFTWARE
+
+    Unicode Data Files include all data files under the directories
+http://www.unicode.org/Public/, http://www.unicode.org/reports/, and
+http://www.unicode.org/cldr/data/. Unicode Data Files do not include PDF
+online code charts under the directory http://www.unicode.org/Public/.
+Software includes any source code published in the Unicode Standard or under
+the directories http://www.unicode.org/Public/,
+http://www.unicode.org/reports/, and http://www.unicode.org/cldr/data/.
+
+    NOTICE TO USER: Carefully read the following legal agreement. BY
+DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING UNICODE INC.'S DATA FILES
+("DATA FILES"), AND/OR SOFTWARE ("SOFTWARE"), YOU UNEQUIVOCALLY ACCEPT, AND
+AGREE TO BE BOUND BY, ALL OF THE TERMS AND CONDITIONS OF THIS AGREEMENT. IF
+YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA
+FILES OR SOFTWARE.
+
+    COPYRIGHT AND PERMISSION NOTICE
+
+    Copyright © 1991-2013 Unicode, Inc. All rights reserved. Distributed under
+the Terms of Use in http://www.unicode.org/copyright.html.
+
+    Permission is hereby granted, free of charge, to any person obtaining a
+copy of the Unicode data files and any associated documentation (the "Data
+Files") or Unicode software and any associated documentation (the "Software")
+to deal in the Data Files or Software without restriction, including without
+limitation the rights to use, copy, modify, merge, publish, distribute, and/or
+sell copies of the Data Files or Software, and to permit persons to whom the
+Data Files or Software are furnished to do so, provided that (a) the above
+copyright notice(s) and this permission notice appear with all copies of the
+Data Files or Software, (b) both the above copyright notice(s) and this
+permission notice appear in associated documentation, and (c) there is clear
+notice in each modified Data File or in the Software as well as in the
+documentation associated with the Data File(s) or Software that the data or
+software has been modified.
+
+    THE DATA FILES AND SOFTWARE ARE 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 OF THIRD
+PARTY RIGHTS. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN
+THIS NOTICE BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL
+DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
+PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
+ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE
+DATA FILES OR SOFTWARE.
+
+    Except as contained in this notice, the name of a copyright holder shall
+not be used in advertising or otherwise to promote the sale, use or other
+dealings in these Data Files or Software without prior written authorization
+of the copyright holder.
+
+contrib/unicode/from_glibc:
+
+# Copyright (C) 2014-2019 Free Software Foundation, Inc.
+# This file is part of the GNU C Library.
+#
+# The GNU C Library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# The GNU C Library 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
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with the GNU C Library; if not, see
+# <https://www.gnu.org/licenses/>.
+
+gcc/cobol, libgcobol:
+
+ * Copyright (c) 2021-2024 Symas Corporation
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are
+ * met:
+ *
+ * * Redistributions of source code must retain the above copyright
+ *   notice, this list of conditions and the following disclaimer.
+ * * Redistributions in binary form must reproduce the above
+ *   copyright notice, this list of conditions and the following disclaimer
+ *   in the documentation and/or other materials provided with the
+ *   distribution.
+ * * Neither the name of the Symas Corporation nor the names of its
+ *   contributors may be used to endorse or promote products derived from
+ *   this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+gcc/algol68
+
+   Copyright (C) 2025 Jose E. Marchesi.
+
+   This file is NOT part of GCC.
+
+   GCC 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, or (at your option) any later version.
+
+   GCC 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
+   GCC; see the file COPYING3.  If not see <http://www.gnu.org/licenses/>.
+
+libga68:
+
+   Copyright (C) 2025 Jose E. Marchesi.
+
+   This file is NOT part of GCC.
+
+   GCC 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, or (at your option) any later version.
+
+   GCC 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.
+
+   Under Section 7 of GPL version 3, you are granted additional permissions
+   described in the GCC Runtime Library Exception, version 3.1, as published by
+   the Free Software Foundation.
+
+   You should have received a copy of the GNU General Public License and a copy
+   of the GCC Runtime Library Exception along with this program; see the files
+   COPYING3 and COPYING.RUNTIME respectively.  If not, see
+   <http://www.gnu.org/licenses/>.
+
+gcc/rust/checks/errors/borrowck/ffi-polonius/vendor/
+libgrust/libformat_parser/vendor/
+libgrust/rustc-lib
+
+   Vendored crates are authored by "The Rust Project Developers",
+   licensed under the Apache-2.0/MIT licenses.
+
+   MIT License:
+   
+   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.
+
+On Debian GNU/Linux systems, the complete text of Apache 2.0 License
+is in `/usr/share/common-licenses/Apache-2.0'.

deployment/notices/GLIBC.txt

@@ -0,0 +1,1418 @@
+Format: https://www.debian.org/doc/packaging-manuals/copyright-format/1.0/
+Upstream-Name: GNU C Library
+Source: https://sourceware.org/git/glibc.git
+
+Files: *
+Copyright: 1991-2026 Free Software Foundation, Inc.
+License: LGPL-2.1+
+
+Files: manual/*
+License: GFDL-1.3
+ Copyright (C) 1993-2017 Free Software Foundation, Inc.
+ .
+ Permission is granted to copy, distribute and/or modify this document
+ under the terms of the GNU Free Documentation License, Version 1.3 or
+ any later version published by the Free Software Foundation; with the
+ Invariant Sections being "Free Software Needs Free Documentation" and
+ "GNU Lesser General Public License", the Front-Cover texts being "A
+ GNU Manual", and with the Back-Cover Texts as in (a) below. A copy of
+ the license is included in the section entitled "GNU Free
+ Documentation License".
+ .
+ (a) The FSF’s Back-Cover Text is: "You have the freedom to copy and
+ modify this GNU manual. Buying copies from the FSF supports it in
+ developing GNU and promoting software freedom."
+ .
+ On Debian systems, the complete text of the GNU Free Documentation
+ License Version 1.3 can be found in `/usr/share/common-licenses/GFDL-1.3'.
+
+Files:
+ nptl/default-sched.h
+ nss/nss_db/db-initgroups.c
+ sysdeps/powerpc/fpu/round_to_integer.h
+ sysdeps/powerpc/fpu/s_ceil.c
+ sysdeps/powerpc/fpu/s_ceilf.c
+ sysdeps/powerpc/fpu/s_floor.c
+ sysdeps/powerpc/fpu/s_floorf.c
+ sysdeps/powerpc/fpu/s_nearbyint.c
+ sysdeps/powerpc/fpu/s_nearbyintf.c
+ sysdeps/powerpc/fpu/s_round.c
+ sysdeps/powerpc/fpu/s_roundf.c
+ sysdeps/powerpc/fpu/s_trunc.c
+ sysdeps/powerpc/fpu/s_truncf.c
+ sysdeps/powerpc/powerpc32/fpu/s_lrint.c
+ sysdeps/powerpc/powerpc64/dl-machine.c
+ sysdeps/powerpc/powerpc64/dl-machine.h
+ sysdeps/powerpc/powerpc64/fpu/s_llrint.c
+ sysdeps/powerpc/powerpc64/fpu/s_llround.c
+ sysdeps/powerpc/powerpc64/fpu/s_llroundf.c
+ sysdeps/sparc/backtrace.c
+ sysdeps/unix/sysv/linux/alpha/bits/pthread_stack_min.h
+ sysdeps/unix/sysv/linux/default-sched.h
+ sysdeps/unix/sysv/linux/sparc/bits/pthread_stack_min.h
+Copyright: 1995-2026 Free Software Foundation, Inc.
+License: LGPL-2+
+
+Files:
+ soft-fp/*.c
+ soft-fp/*.h
+ sysdeps/ieee754/soft-fp/s_fma*.c
+ sysdeps/powerpc/nofpu/sqrt*f2.c
+ sysdeps/powerpc/powerpc64/le/fpu/e_sqrtf128.c
+ sysdeps/x86/fpu/e_sqrtf128.c
+Copyright: 1997-2026 Free Software Foundation, Inc.
+License: LGPL-2.1+-with-link-exception
+
+Files: sysdeps/htl/raise.c
+Copyright: 2008-2026 Free Software Foundation, Inc.
+License: LGPL-3+
+
+Files:
+ catgets/gencat.c
+ catgets/xopen-msg.awk
+ elf/cache.c
+ elf/chroot_canon.c
+ elf/endswith.h
+ elf/ldconfig.c
+ elf/readlib.c
+ elf/stringtable.c
+ elf/stringtable.h
+ elf/stringtable_free.c
+ elf/tst-stringtable.c
+ iconv/dummy-repertoire.c
+ iconv/iconv_charmap.c
+ iconv/iconv_prog.c
+ iconv/iconvconfig.c
+ iconv/strtab.c
+ include/programs/xasprintf.h
+ include/programs/xmalloc.h
+ intl/locale.alias
+ intl/po2test.awk
+ io/tst-fcntl-lock.c
+ io/tst-lockf.c
+ locale/programs/3level.h
+ locale/programs/charmap-dir.c
+ locale/programs/charmap-dir.h
+ locale/programs/charmap-kw.gperf
+ locale/programs/charmap-kw.h
+ locale/programs/charmap.c
+ locale/programs/charmap.h
+ locale/programs/config.h
+ locale/programs/ld-address.c
+ locale/programs/ld-collate.c
+ locale/programs/ld-ctype.c
+ locale/programs/ld-identification.c
+ locale/programs/ld-measurement.c
+ locale/programs/ld-messages.c
+ locale/programs/ld-monetary.c
+ locale/programs/ld-name.c
+ locale/programs/ld-numeric.c
+ locale/programs/ld-paper.c
+ locale/programs/ld-telephone.c
+ locale/programs/ld-time.c
+ locale/programs/linereader.c
+ locale/programs/linereader.h
+ locale/programs/locale-spec.c
+ locale/programs/locale.c
+ locale/programs/localedef.c
+ locale/programs/localedef.h
+ locale/programs/locarchive.c
+ locale/programs/locfile-kw.gperf
+ locale/programs/locfile-kw.h
+ locale/programs/locfile-token.h
+ locale/programs/locfile.c
+ locale/programs/locfile.h
+ locale/programs/record-status.c
+ locale/programs/record-status.h
+ locale/programs/repertoire.c
+ locale/programs/repertoire.h
+ locale/programs/simple-hash.c
+ locale/programs/simple-hash.h
+ locale/programs/xasprintf.c
+ locale/programs/xmalloc.c
+ locale/programs/xstrdup.c
+ localedata/tst-rpmatch.sh
+ malloc/memusagestat.c
+ nscd/aicache.c
+ nscd/cache.c
+ nscd/cachedumper.c
+ nscd/connections.c
+ nscd/dbg_log.c
+ nscd/getgrgid_r.c
+ nscd/getgrnam_r.c
+ nscd/gethstbyad_r.c
+ nscd/gethstbynm3_r.c
+ nscd/getpwnam_r.c
+ nscd/getpwuid_r.c
+ nscd/getsrvbynm_r.c
+ nscd/getsrvbypt_r.c
+ nscd/grpcache.c
+ nscd/hstcache.c
+ nscd/initgrcache.c
+ nscd/mem.c
+ nscd/netgroupcache.c
+ nscd/nscd.c
+ nscd/nscd_conf.c
+ nscd/nscd_setup_thread.c
+ nscd/pwdcache.c
+ nscd/servicescache.c
+ posix/getconf.c
+ scripts/rellns-sh
+ sysdeps/unix/sysv/linux/nscd_setup_thread.c
+ sysdeps/unix/sysv/linux/tst-ofdlocks-compat.c
+ sysdeps/unix/sysv/linux/tst-ofdlocks.c
+Copyright: 1991-2026 Free Software Foundation, Inc.
+License: GPL-2+
+
+Files: sysdeps/arm/unwind.h
+Copyright: 2003-2026 Free Software Foundation, Inc.
+License: GPL-2+-with-link-exception
+
+Files: sysdeps/unix/sysv/linux/mips/sys/user.h
+Copyright:
+ 1995, 1999 by Ralf Baechle
+ 2002-2026 Free Software Foundation
+License: LGPL-2.1+ and GPL-2
+
+Files: scripts/move-if-change
+Copyright: 2002-2022 Free Software Foundation, Inc.
+License: GPL-3+
+
+Files:
+ libio/tst-fgetc-after-eof.c
+ malloc/tst-malloc-stats-cancellation.c
+ wcsmbs/tst-fgetwc-after-eof.c
+Copyright: 2018 Free Software Foundation
+License: FSFAP
+
+Files:
+ hurd/hurdmalloc.c
+ mach/err_boot.sub
+ mach/err_ipc.sub
+ mach/err_kern.sub
+ mach/err_mach.sub
+ mach/err_server.sub
+ mach/err_us.sub
+ mach/error_compat.c
+ mach/errorlib.h
+ mach/errstring.c
+ mach/mach/error.h
+ mach/mach_error.c
+ mach/mach_error.h
+ mach/msg-destroy.c
+ mach/msg.c
+ sysdeps/mach/sys/reboot.h
+Copyright: 1987-1982 Carnegie Mellon University
+License: Carnegie
+
+Files:
+ mach/msgserver.c
+Copyright:
+ 1991,1990,1989 Carnegie Mellon University
+ 1993-2026 Free Software Foundation, Inc.
+License: Carnegie and LGPL-2.1+
+
+Files:
+ nss/getaddrinfo.c
+ nss/getnameinfo.c
+Copyright:
+ 1996 by Craig Metz
+ 1997-2026 Free Software Foundation, Inc.
+License: Inner-Net and LGPL-2.1+
+
+Files: posix/runtests.c
+Copyright: 1995 by Tom Lord
+License: MIT-like-Lord
+ Permission to use, copy, modify, and distribute this software and its
+ documentation for any purpose and without fee is hereby granted,
+ provided that the above copyright notice appear in all copies and that
+ both that copyright notice and this permission notice appear in
+ supporting documentation, and that the name of the copyright holder not be
+ used in advertising or publicity pertaining to distribution of the
+ software without specific, written prior permission.
+ .
+ Tom Lord DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
+ INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
+ EVENT SHALL TOM LORD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
+ CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
+ USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+ OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+ PERFORMANCE OF THIS SOFTWARE.
+
+Files: posix/rxspencer/*
+Copyright: 1992, 1993, 1994, 1997 Henry Spencer
+License: BSD-like-Spencer
+ This software is not subject to any license of the American Telephone
+ and Telegraph Company or of the Regents of the University of California.
+ .
+ Permission is granted to anyone to use this software for any purpose on
+ any computer system, and to alter it and redistribute it, subject
+ to the following restrictions:
+ .
+ 1. The author is not responsible for the consequences of use of this
+    software, no matter how awful, even if they arise from flaws in it.
+ .
+ 2. The origin of this software must not be misrepresented, either by
+    explicit claim or by omission.  Since few users ever read sources,
+    credits must appear in the documentation.
+ .
+ 3. Altered versions must be plainly marked as such, and must not be
+    misrepresented as being the original software.  Since few users
+    ever read sources, credits must appear in the documentation.
+ .
+ 4. This notice may not be removed or altered.
+
+Files: posix/PCRE.tests
+Copyright: 1997-2003 University of Cambridge
+License: PCRE
+
+Files: sysdeps/unix/sysv/linux/net/if_ppp.h
+Copyright: 1989 Carnegie Mellon University
+License: BSD-3-clause-Carnegie
+
+Files:
+ localedata/unicode-gen/unicode-license.txt
+ localedata/unicode-gen/UnicodeData.txt
+Copyright: 1991-2024 Unicode, Inc.
+License: Unicode-DFS-2016
+
+Files: posix/BOOST.tests
+License: BSL-1.0
+Copyright: 2004 John Maddock
+Comment: Tests taken from BOOST testsuite and adapted to glibc regex.
+
+Files:
+ math/s_ldexp_template.c
+ math/s_nextafter.c
+ math/s_nexttowardf.c
+ math/w_cosh_compat.c
+ math/w_coshf_compat.c
+ math/w_coshl_compat.c
+ math/w_expl_compat.c
+ math/w_hypot_compat.c
+ math/w_hypotf_compat.c
+ math/w_hypotl_compat.c
+ math/w_jnl_compat.c
+ math/w_lgamma_main.c
+ math/w_lgamma_r_compat.c
+ math/w_lgammaf_main.c
+ math/w_lgammaf_r_compat.c
+ math/w_lgammal_main.c
+ math/w_lgammal_r_compat.c
+ math/w_sinh_compat.c
+ math/w_sinhf_compat.c
+ math/w_sinhl_compat.c
+ math/w_tgamma_compat.c
+ math/w_tgammaf_compat.c
+ math/w_tgammal_compat.c
+ sysdeps/generic/math_private.h
+ sysdeps/i386/fpu/s_nextafterl.c
+ sysdeps/i386/fpu/s_nexttoward.c
+ sysdeps/i386/fpu/s_nexttowardf.c
+ sysdeps/ieee754/dbl-64/e_cosh.c
+ sysdeps/ieee754/dbl-64/e_ilogb.c
+ sysdeps/ieee754/dbl-64/e_j0.c
+ sysdeps/ieee754/dbl-64/e_j1.c
+ sysdeps/ieee754/dbl-64/e_jn.c
+ sysdeps/ieee754/dbl-64/e_log10.c
+ sysdeps/ieee754/dbl-64/e_sinh.c
+ sysdeps/ieee754/dbl-64/k_rem_pio2.c
+ sysdeps/ieee754/dbl-64/s_ceil.c
+ sysdeps/ieee754/dbl-64/s_copysign.c
+ sysdeps/ieee754/dbl-64/s_expm1.c
+ sysdeps/ieee754/dbl-64/s_fabs.c
+ sysdeps/ieee754/dbl-64/s_finite.c
+ sysdeps/ieee754/dbl-64/s_isnan.c
+ sysdeps/ieee754/dbl-64/s_log1p.c
+ sysdeps/ieee754/dbl-64/s_modf.c
+ sysdeps/ieee754/dbl-64/s_nearbyint.c
+ sysdeps/ieee754/dbl-64/s_rint.c
+ sysdeps/ieee754/dbl-64/s_scalbln.c
+ sysdeps/ieee754/dbl-64/s_scalbn.c
+ sysdeps/ieee754/dbl-64/s_tanh.c
+ sysdeps/ieee754/flt-32/e_ilogbf.c
+ sysdeps/ieee754/flt-32/e_j0f.c
+ sysdeps/ieee754/flt-32/e_j1f.c
+ sysdeps/ieee754/flt-32/e_jnf.c
+ sysdeps/ieee754/flt-32/e_remainderf.c
+ sysdeps/ieee754/flt-32/e_sqrtf.c
+ sysdeps/ieee754/flt-32/s_ceilf.c
+ sysdeps/ieee754/flt-32/s_copysignf.c
+ sysdeps/ieee754/flt-32/s_fabsf.c
+ sysdeps/ieee754/flt-32/s_finitef.c
+ sysdeps/ieee754/flt-32/s_floorf.c
+ sysdeps/ieee754/flt-32/s_frexpf.c
+ sysdeps/ieee754/flt-32/s_isnanf.c
+ sysdeps/ieee754/flt-32/s_logbf.c
+ sysdeps/ieee754/flt-32/s_modff.c
+ sysdeps/ieee754/flt-32/s_nearbyintf.c
+ sysdeps/ieee754/flt-32/s_nextafterf.c
+ sysdeps/ieee754/flt-32/s_rintf.c
+ sysdeps/ieee754/flt-32/s_scalblnf.c
+ sysdeps/ieee754/flt-32/s_scalbnf.c
+ sysdeps/ieee754/k_standard.c
+ sysdeps/ieee754/ldbl-128/e_atan2l.c
+ sysdeps/ieee754/ldbl-128/e_atanhl.c
+ sysdeps/ieee754/ldbl-128/e_fmodl.c
+ sysdeps/ieee754/ldbl-128/e_ilogbl.c
+ sysdeps/ieee754/ldbl-128/e_remainderl.c
+ sysdeps/ieee754/ldbl-128/s_asinhl.c
+ sysdeps/ieee754/ldbl-128/s_ceill.c
+ sysdeps/ieee754/ldbl-128/s_copysignl.c
+ sysdeps/ieee754/ldbl-128/s_cosl.c
+ sysdeps/ieee754/ldbl-128/s_fabsl.c
+ sysdeps/ieee754/ldbl-128/s_finitel.c
+ sysdeps/ieee754/ldbl-128/s_floorl.c
+ sysdeps/ieee754/ldbl-128/s_frexpl.c
+ sysdeps/ieee754/ldbl-128/s_isnanl.c
+ sysdeps/ieee754/ldbl-128/s_logbl.c
+ sysdeps/ieee754/ldbl-128/s_modfl.c
+ sysdeps/ieee754/ldbl-128/s_nearbyintl.c
+ sysdeps/ieee754/ldbl-128/s_nextafterl.c
+ sysdeps/ieee754/ldbl-128/s_nexttoward.c
+ sysdeps/ieee754/ldbl-128/s_nexttowardf.c
+ sysdeps/ieee754/ldbl-128/s_rintl.c
+ sysdeps/ieee754/ldbl-128/s_scalblnl.c
+ sysdeps/ieee754/ldbl-128/s_scalbnl.c
+ sysdeps/ieee754/ldbl-128/s_sinl.c
+ sysdeps/ieee754/ldbl-128/s_tanhl.c
+ sysdeps/ieee754/ldbl-128/s_tanl.c
+ sysdeps/ieee754/ldbl-128ibm/e_acoshl.c
+ sysdeps/ieee754/ldbl-128ibm/e_atan2l.c
+ sysdeps/ieee754/ldbl-128ibm/e_atanhl.c
+ sysdeps/ieee754/ldbl-128ibm/e_coshl.c
+ sysdeps/ieee754/ldbl-128ibm/e_fmodl.c
+ sysdeps/ieee754/ldbl-128ibm/e_hypotl.c
+ sysdeps/ieee754/ldbl-128ibm/e_ilogbl.c
+ sysdeps/ieee754/ldbl-128ibm/e_remainderl.c
+ sysdeps/ieee754/ldbl-128ibm/e_sinhl.c
+ sysdeps/ieee754/ldbl-128ibm/s_asinhl.c
+ sysdeps/ieee754/ldbl-128ibm/s_copysignl.c
+ sysdeps/ieee754/ldbl-128ibm/s_cosl.c
+ sysdeps/ieee754/ldbl-128ibm/s_fabsl.c
+ sysdeps/ieee754/ldbl-128ibm/s_finitel.c
+ sysdeps/ieee754/ldbl-128ibm/s_frexpl.c
+ sysdeps/ieee754/ldbl-128ibm/s_isnanl.c
+ sysdeps/ieee754/ldbl-128ibm/s_logbl.c
+ sysdeps/ieee754/ldbl-128ibm/s_modfl.c
+ sysdeps/ieee754/ldbl-128ibm/s_nextafterl.c
+ sysdeps/ieee754/ldbl-128ibm/s_nexttoward.c
+ sysdeps/ieee754/ldbl-128ibm/s_nexttowardf.c
+ sysdeps/ieee754/ldbl-128ibm/s_scalblnl.c
+ sysdeps/ieee754/ldbl-128ibm/s_scalbnl.c
+ sysdeps/ieee754/ldbl-128ibm/s_sinl.c
+ sysdeps/ieee754/ldbl-128ibm/s_tanhl.c
+ sysdeps/ieee754/ldbl-128ibm/s_tanl.c
+ sysdeps/ieee754/ldbl-96/e_acoshl.c
+ sysdeps/ieee754/ldbl-96/e_atanhl.c
+ sysdeps/ieee754/ldbl-96/e_coshl.c
+ sysdeps/ieee754/ldbl-96/e_sinhl.c
+ sysdeps/ieee754/ldbl-96/s_asinhl.c
+ sysdeps/ieee754/ldbl-96/s_copysignl.c
+ sysdeps/ieee754/ldbl-96/s_cosl.c
+ sysdeps/ieee754/ldbl-96/s_frexpl.c
+ sysdeps/ieee754/ldbl-96/s_modfl.c
+ sysdeps/ieee754/ldbl-96/s_nexttoward.c
+ sysdeps/ieee754/ldbl-96/s_nexttowardf.c
+ sysdeps/ieee754/ldbl-96/s_scalblnl.c
+ sysdeps/ieee754/ldbl-96/s_sinl.c
+ sysdeps/ieee754/ldbl-96/s_tanhl.c
+ sysdeps/ieee754/ldbl-96/s_tanl.c
+ sysdeps/ieee754/ldbl-opt/s_nexttowardfd.c
+ sysdeps/ieee754/s_lib_version.c
+ sysdeps/ieee754/s_matherr.c
+ sysdeps/m68k/m680x0/fpu/s_logbl.c
+ sysdeps/m68k/m680x0/fpu/s_nextafterl.c
+ sysdeps/x86/fpu/s_isnanl.c
+Copyright: 1993 by Sun Microsystems, Inc.
+License: SunPro
+Comment: Files from Sun fdlibm
+
+Files:
+ sysdeps/ieee754/dbl-64/s_floor.c
+ sysdeps/ieee754/k_standardl.c
+ sysdeps/ieee754/ldbl-128/e_acosl.c
+ sysdeps/ieee754/ldbl-128/e_asinl.c
+ sysdeps/ieee754/ldbl-128/e_coshl.c
+ sysdeps/ieee754/ldbl-128/e_jnl.c
+ sysdeps/ieee754/ldbl-128/e_powl.c
+ sysdeps/ieee754/ldbl-128/e_sinhl.c
+ sysdeps/ieee754/ldbl-128/k_tanl.c
+ sysdeps/ieee754/ldbl-128/s_erfl.c
+ sysdeps/ieee754/ldbl-128ibm/e_acosl.c
+ sysdeps/ieee754/ldbl-128ibm/e_asinl.c
+ sysdeps/ieee754/ldbl-128ibm/e_jnl.c
+ sysdeps/ieee754/ldbl-128ibm/e_powl.c
+ sysdeps/ieee754/ldbl-128ibm/k_tanl.c
+ sysdeps/ieee754/ldbl-128ibm/s_erfl.c
+ sysdeps/ieee754/ldbl-96/e_asinl.c
+ sysdeps/ieee754/ldbl-96/e_j0l.c
+ sysdeps/ieee754/ldbl-96/e_j1l.c
+ sysdeps/ieee754/ldbl-96/e_jnl.c
+ sysdeps/ieee754/ldbl-96/e_lgammal_r.c
+ sysdeps/ieee754/ldbl-96/k_tanl.c
+ sysdeps/ieee754/ldbl-96/s_erfl.c
+Copyright:
+ 1993 by Sun Microsystems, Inc.
+ 1984, 1991, 2001 by Stephen L. Moshier
+ 2011-2026 Free Software Foundation, Inc.
+ 2012-2026 Free Software Foundation, Inc.
+License: LGPL-2.1+ and SunPro
+
+Files:
+ sysdeps/ieee754/dbl-64/ddcoremath.h
+ sysdeps/ieee754/dbl-64/e_acosh.c
+ sysdeps/ieee754/dbl-64/e_atanh.c
+ sysdeps/ieee754/dbl-64/e_gamma_r.c
+ sysdeps/ieee754/dbl-64/e_lgamma_r.c
+ sysdeps/ieee754/dbl-64/s_asincosh_data.c
+ sysdeps/ieee754/dbl-64/s_asincosh_data.h
+ sysdeps/ieee754/dbl-64/s_asinh.c
+ sysdeps/ieee754/dbl-64/s_atanh_data.c
+ sysdeps/ieee754/dbl-64/s_atanh_data.h
+ sysdeps/ieee754/dbl-64/s_erf.c
+ sysdeps/ieee754/dbl-64/s_erf_common.c
+ sysdeps/ieee754/dbl-64/s_erf_common.h
+ sysdeps/ieee754/dbl-64/s_erf_data.c
+ sysdeps/ieee754/dbl-64/s_erf_data.h
+ sysdeps/ieee754/dbl-64/s_erfc.c
+ sysdeps/ieee754/dbl-64/s_erfc_data.c
+ sysdeps/ieee754/dbl-64/s_erfc_data.h
+ sysdeps/ieee754/flt-32/e_acosf.c
+ sysdeps/ieee754/flt-32/e_acoshf.c
+ sysdeps/ieee754/flt-32/e_asinf.c
+ sysdeps/ieee754/flt-32/e_atan2f.c
+ sysdeps/ieee754/flt-32/e_atanhf.c
+ sysdeps/ieee754/flt-32/e_coshf.c
+ sysdeps/ieee754/flt-32/e_gammaf_r.c
+ sysdeps/ieee754/flt-32/e_lgammaf_r.c
+ sysdeps/ieee754/flt-32/e_log10f.c
+ sysdeps/ieee754/flt-32/e_sincoshf_data.c
+ sysdeps/ieee754/flt-32/e_sincoshf_data.h
+ sysdeps/ieee754/flt-32/e_sinhf.c
+ sysdeps/ieee754/flt-32/s_acospif.c
+ sysdeps/ieee754/flt-32/s_asincosf_data.c
+ sysdeps/ieee754/flt-32/s_asincosf_data.h
+ sysdeps/ieee754/flt-32/s_asincoshf_data.c
+ sysdeps/ieee754/flt-32/s_asincoshf_data.h
+ sysdeps/ieee754/flt-32/s_asincospif_data.c
+ sysdeps/ieee754/flt-32/s_asincospif_data.h
+ sysdeps/ieee754/flt-32/s_asinhf.c
+ sysdeps/ieee754/flt-32/s_asinpif.c
+ sysdeps/ieee754/flt-32/s_atan2pif.c
+ sysdeps/ieee754/flt-32/s_atanf.c
+ sysdeps/ieee754/flt-32/s_atanpif.c
+ sysdeps/ieee754/flt-32/s_cbrtf.c
+ sysdeps/ieee754/flt-32/s_cospif.c
+ sysdeps/ieee754/flt-32/s_erfcf.c
+ sysdeps/ieee754/flt-32/s_erff.c
+ sysdeps/ieee754/flt-32/s_exp10m1f.c
+ sysdeps/ieee754/flt-32/s_exp2m1f.c
+ sysdeps/ieee754/flt-32/s_expm1f.c
+ sysdeps/ieee754/flt-32/s_log10p1f.c
+ sysdeps/ieee754/flt-32/s_log1pf.c
+ sysdeps/ieee754/flt-32/s_log2p1f.c
+ sysdeps/ieee754/flt-32/s_sincospif_data.c
+ sysdeps/ieee754/flt-32/s_sincospif_data.h
+ sysdeps/ieee754/flt-32/s_sinpif.c
+ sysdeps/ieee754/flt-32/s_tanf.c
+ sysdeps/ieee754/flt-32/s_tanhf.c
+ sysdeps/ieee754/flt-32/s_tanpif.c
+Copyright: 2022-2026 Alexei Sibidanov and Paul Zimmermann
+License: CORE-MATH
+
+Files:
+ gmon/gmon.c
+ gmon/mcount.c
+ gmon/prof-freq.c
+ gmon/sys/gmon.h
+ inet/arpa/ftp.h
+ inet/arpa/telnet.h
+ inet/arpa/tftp.h
+ inet/inet_lnaof.c
+ inet/inet_mkadr.c
+ inet/inet_netof.c
+ inet/protocols/routed.h
+ inet/protocols/rwhod.h
+ inet/protocols/talkd.h
+ inet/protocols/timed.h
+ inet/rexec.c
+ inet/ruserpass.c
+ login/login_tty.c
+ misc/daemon.c
+ misc/fstab.h
+ misc/getttyent.c
+ misc/getusershell.c
+ misc/sys/queue.h
+ misc/sys/syslog.h
+ misc/sysexits.h
+ misc/syslog.c
+ misc/ttyent.h
+ misc/ttyslot.c
+ resolv/arpa/nameser_compat.h
+ sysdeps/generic/netinet/tcp.h
+ sysdeps/generic/paths.h
+ sysdeps/generic/sys/ttydefaults.h
+ sysdeps/gnu/netinet/tcp.h
+ sysdeps/unix/sysv/linux/paths.h
+ sysdeps/unix/sysv/linux/sys/ttydefaults.h
+ termios/sys/ttychars.h
+Copyright: 1980-2011 Regents of the University of California
+License: BSD-3-clause-Berkeley
+Comment: Code incorporated from 4.4 BSD
+
+Files: inet/rcmd.c
+Copyright:
+ 1998 WIDE Project
+ 1983, 1993, 1994 The Regents of the University of California
+License: BSD-3-clause-Berkeley and BSD-3-clause-WIDE
+
+Files:
+ inet/inet_net.c
+ inet/netinet/igmp.h
+ io/fts.c
+ io/fts.h
+ libio/filedoalloc.c
+ libio/wfiledoalloc.c
+ stdlib/div.c
+ stdlib/random.c
+ stdlib/random_r.c
+ sysdeps/gnu/netinet/udp.h
+ sysdeps/mach/hurd/bits/param.h
+ sysdeps/unix/sysv/linux/netinet/if_ether.h
+ sysdeps/unix/sysv/linux/sys/quota.h
+Copyright:
+ 1982-1994 Regents of the University of California
+ 1991-2026 Free Software Foundation, Inc.
+ 1988 Stephen Deering
+License: BSD-3-clause-Berkeley and LGPL-2.1+
+Comment: Code incorporated from 4.4 BSD
+
+Files: support/bundled/linux/include/uapi/linux/fuse.h
+Copyright: 2001-2007 Miklos Szeredi
+License: BSD-2-clause or GPL-2
+
+Files:
+ inet/bindresvport.c
+ inet/rpc/netdb.h
+ nis/rpcsvc/nis.h
+ nis/rpcsvc/nis_callback.h
+ nis/rpcsvc/nis_tags.h
+ nis/rpcsvc/yp.h
+ nis/rpcsvc/ypupd.h
+ nis/yp_xdr.c
+ nis/ypupdate_xdr.c
+ sunrpc/auth_des.c
+ sunrpc/auth_none.c
+ sunrpc/auth_unix.c
+ sunrpc/authdes_prot.c
+ sunrpc/authuxprot.c
+ sunrpc/clnt_gen.c
+ sunrpc/clnt_perr.c
+ sunrpc/clnt_raw.c
+ sunrpc/clnt_simp.c
+ sunrpc/clnt_tcp.c
+ sunrpc/clnt_udp.c
+ sunrpc/clnt_unix.c
+ sunrpc/des_crypt.c
+ sunrpc/des_soft.c
+ sunrpc/get_myaddr.c
+ sunrpc/getrpcport.c
+ sunrpc/key_call.c
+ sunrpc/key_prot.c
+ sunrpc/openchild.c
+ sunrpc/pm_getmaps.c
+ sunrpc/pm_getport.c
+ sunrpc/pmap_clnt.c
+ sunrpc/pmap_prot.c
+ sunrpc/pmap_prot2.c
+ sunrpc/pmap_rmt.c
+ sunrpc/rpc/auth.h
+ sunrpc/rpc/auth_unix.h
+ sunrpc/rpc/clnt.h
+ sunrpc/rpc/des_crypt.h
+ sunrpc/rpc/key_prot.h
+ sunrpc/rpc/pmap_clnt.h
+ sunrpc/rpc/pmap_prot.h
+ sunrpc/rpc/pmap_rmt.h
+ sunrpc/rpc/rpc.h
+ sunrpc/rpc/rpc_des.h
+ sunrpc/rpc/rpc_msg.h
+ sunrpc/rpc/svc.h
+ sunrpc/rpc/svc_auth.h
+ sunrpc/rpc/types.h
+ sunrpc/rpc/xdr.h
+ sunrpc/rpc_cmsg.c
+ sunrpc/rpc_common.c
+ sunrpc/rpc_dtable.c
+ sunrpc/rpc_prot.c
+ sunrpc/rtime.c
+ sunrpc/svc.c
+ sunrpc/svc_auth.c
+ sunrpc/svc_authux.c
+ sunrpc/svc_raw.c
+ sunrpc/svc_run.c
+ sunrpc/svc_simple.c
+ sunrpc/svc_tcp.c
+ sunrpc/svc_udp.c
+ sunrpc/svc_unix.c
+ sunrpc/svcauth_des.c
+ sunrpc/xcrypt.c
+ sunrpc/xdr.c
+ sunrpc/xdr_array.c
+ sunrpc/xdr_float.c
+ sunrpc/xdr_mem.c
+ sunrpc/xdr_rec.c
+ sunrpc/xdr_ref.c
+ sunrpc/xdr_sizeof.c
+ sunrpc/xdr_stdio.c
+Copyright: 2010, Oracle America, Inc.
+License: BSD-3-clause-Oracle
+Comment: Sun RPC support (from rpcsrc-4.0)
+
+Files:
+ resolv/compat-gethnamaddr.c
+ resolv/mapv4v6addr.h
+Copyright:
+ 1985, 1988, 1993 The Regents of the University of California
+ 1993 by Digital Equipment Corporation
+License: BSD-3-clause-Berkeley and DEC
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files: resolv/res_debug.c
+Copyright:
+ 1985 The Regents of the University of California
+ 1993 by Digital Equipment Corporation
+ 1995 IBM Corporation
+ 1996-1999 by Internet Software Consortium
+License: BSD-3-clause-Berkeley and DEC and IBM and ISC
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files: resolv/res_query.c
+Copyright:
+ 1988, 1993 The Regents of the University of California
+ 1993 by Digital Equipment Corporation
+ 1996-1999 by Internet Software Consortium
+License: BSD-3-clause-Berkeley and DEC and ISC
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files:
+ resolv/dn_comp.c
+ resolv/dn_expand.c
+ resolv/dn_skipname.c
+ resolv/inet_addr.c
+ resolv/res-close.c
+ resolv/res-name-checking.c
+ resolv/res-putget.c
+ resolv/res_context_hostalias.c
+ resolv/res_init.c
+ resolv/res_isourserver.c
+ resolv/res_mkquery.c
+ resolv/res_nameinquery.c
+ resolv/res_queriesmatch.c
+ resolv/res_randomid.c
+ resolv/res_send.c
+Copyright:
+ 1983, 1985, 1988, 1989, 1990, 1993 The Regents of the University of California
+ 1993 by Digital Equipment Corporation.
+ 1995-2026 Free Software Foundation, Inc.
+ 1996-1999 by Internet Software Consortium.
+License: BSD-3-clause-Berkeley and DEC and ISC and LGPL-2.1+
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files: resolv/nss_dns/dns-host.c
+Copyright:
+ 1996-2026 Free Software Foundation, Inc.
+ 1985, 1988, 1993 The Regents of the University of California
+ 1993 by Digital Equipment Corporation
+License: BSD-3-clause-Berkeley and DEC and LGPL-2.1+
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files:
+ resolv/arpa/nameser.h
+ resolv/herror.c
+ resolv/resolv.h
+Copyright:
+ 1983, 1987, 1989, 1993 The Regents of the University of California
+ 1996-1999 by Internet Software Consortium.
+ 2004 by Internet Systems Consortium, Inc. ("ISC")
+License: BSD-3-clause-Berkeley and ISC
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files: resolv/nss_dns/dns-network.c
+Copyright:
+ 1993 Carlos Leandro and Rui Salgueiro Dep. Matematica Universidade de Coimbra, Portugal, Europe
+ 1983, 1993 The Regents of the University of California
+ 1996-2026 Free Software Foundation, Inc.
+License: BSD-3-clause-Berkeley and LGPL-2.1+ and Univ-Coimbra
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files: resolv/base64.c
+Copyright:
+ 1995 IBM Corporation
+ 1996-1999 by Internet Software Consortium
+License: IBM and ISC
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files:
+ resolv/inet_net_ntop.c
+ resolv/inet_net_pton.c
+ resolv/inet_neta.c
+ resolv/inet_ntop.c
+ resolv/ns_date.c
+ resolv/ns_makecanon.c
+ resolv/ns_name.c
+ resolv/ns_name_compress.c
+ resolv/ns_name_ntop.c
+ resolv/ns_name_pack.c
+ resolv/ns_name_pton.c
+ resolv/ns_name_skip.c
+ resolv/ns_name_uncompress.c
+ resolv/ns_name_unpack.c
+ resolv/ns_netint.c
+ resolv/ns_parse.c
+ resolv/ns_print.c
+ resolv/ns_samedomain.c
+ resolv/ns_samename.c
+ resolv/ns_ttl.c
+ resolv/nsap_addr.c
+Copyright:
+ 1995-1999 by Internet Software Consortium.
+ 2004 by Internet Systems Consortium, Inc. ("ISC")
+License: ISC
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files:
+ hesiod/hesiod.c
+ hesiod/hesiod.h
+ hesiod/hesiod_p.h
+ resolv/compat-hooks.c
+ resolv/inet_pton.c
+ resolv/res_data.c
+ resolv/res_libc.c
+Copyright:
+ 1996-2026 Free Software Foundation, Inc.
+ 1995-1999 by Internet Software Consortium
+License: ISC and LGPL-2.1+
+Comment: DNS resolver code, taken from BIND 4.9.5
+
+Files:
+ localedata/locales/eo
+ localedata/locales/kk_KZ
+ localedata/locales/syr
+ localedata/locales/tok
+Copyright: None
+License: public-domain
+ These files are in Public Domain.
+
+Files:
+ timezone/africa
+ timezone/antarctica
+ timezone/asia
+ timezone/australasia
+ timezone/backward
+ timezone/etcetera
+ timezone/europe
+ timezone/factory
+ timezone/iso3166.tab
+ timezone/leapseconds
+ timezone/northamerica
+ timezone/pacificnew
+ timezone/private.h
+ timezone/simplebackw
+ timezone/solar87
+ timezone/solar88
+ timezone/solar89
+ timezone/southamerica
+ timezone/systemv
+ timezone/tzfile.h
+ timezone/tzselect.ksh
+ timezone/yearistype
+ timezone/zdump.c
+ timezone/zic.c
+ timezone/zone.tab
+Copyright: The Internet Assigned Numbers Authority (IANA)
+Comment: tzcode and tzdata packages by Arthur David Olson et.al.
+License: public-domain
+ This database is in the public domain.
+
+Files: debian/*
+Copyright:
+ 2000-2004 Ben Collins <bcollins@debian.org>
+ 2002-2004 Jeff Bailey <jbailey@debian.org>
+ 2002-2005 Philip Blundell <pb@debian.org>
+ 2002-2006 Daniel Jacobowitz <dan@debian.org>
+ 2002-2006 GOTO Masanori <gotom@debian.org>
+ 2006 Denis Barbier <barbier@debian.org>
+ 2006-2026 Aurelien Jarno <aurel32@debian.org>
+ 2007-2008 Pierre Habouzit <madcoder@debian.org>
+ 2010-2013 Clint Adams <clint@debian.org>
+ 2012-2019 Adam Conrad <adconrad@0c3.net>
+ 2016-2026 Samuel Thibault <sthibault@debian.org>
+License: GPL-2+
+
+License: BSD-2-clause
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions
+ are met:
+ 1. Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+ 2. Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+ .
+ THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
+ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ ARE DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ SUCH DAMAGE.
+
+License: BSD-3-clause-Berkeley
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions
+ are met:
+ .
+ 1. Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+ 2. Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+ 3. [This condition was removed.]
+ 4. Neither the name of the University nor the names of its contributors
+    may be used to endorse or promote products derived from this software
+    without specific prior written permission.
+ .
+ THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ SUCH DAMAGE.
+
+License: BSD-3-clause-Carnegie
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions
+ are met:
+ 1. Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+ 2. Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+ 3. Neither the name of the University nor the names of its contributors
+    may be used to endorse or promote products derived from this software
+    without specific prior written permission.
+ .
+ THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY AND
+ CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
+ INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+ MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ IN NO EVENT SHALL THE UNIVERSITY OR CONTRIBUTORS BE LIABLE FOR ANY
+ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+ GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
+ IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
+ IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+License: BSD-3-clause-Oracle
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are
+ met:
+ .
+     * Redistributions of source code must retain the above copyright
+       notice, this list of conditions and the following disclaimer.
+     * Redistributions in binary form must reproduce the above
+       copyright notice, this list of conditions and the following
+       disclaimer in the documentation and/or other materials
+       provided with the distribution.
+     * Neither the name of the "Oracle America, Inc." nor the names of its
+       contributors may be used to endorse or promote products derived
+       from this software without specific prior written permission.
+ .
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+   FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+   COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
+   INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+   DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+   GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+   INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+   WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+License: BSD-3-clause-WIDE
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions
+ are met:
+ 1. Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+ 2. Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+ 3. Neither the name of the project nor the names of its contributors
+    may be used to endorse or promote products derived from this software
+    without specific prior written permission.
+ .
+ THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
+ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ ARE DISCLAIMED.  IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ SUCH DAMAGE.
+
+License: BSL-1.0
+ Boost Software License - Version 1.0 - August 17th, 2003
+ .
+ Permission is hereby granted, free of charge, to any person or organization
+ obtaining a copy of the software and accompanying documentation covered by
+ this license (the "Software") to use, reproduce, display, distribute,
+ execute, and transmit the Software, and to prepare derivative works of the
+ Software, and to permit third-parties to whom the Software is furnished to
+ do so, all subject to the following:
+ .
+ The copyright notices in the Software and this entire statement, including
+ the above license grant, this restriction and the following disclaimer,
+ must be included in all copies of the Software, in whole or in part, and
+ all derivative works of the Software, unless such copies or derivative
+ works are solely in the form of machine-executable object code generated by
+ a source language processor.
+ .
+ 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, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+ SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+ FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+ DEALINGS IN THE SOFTWARE.
+
+License: Carnegie
+ Permission to use, copy, modify and distribute this software and its
+ documentation is hereby granted, provided that both the copyright
+ notice and this permission notice appear in all copies of the
+ software, derivative works or modified versions, and any portions
+ thereof, and that both notices appear in supporting documentation.
+ .
+ CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
+ CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
+ ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
+ .
+ Carnegie Mellon requests users of this software to return to
+ .
+  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
+  School of Computer Science
+  Carnegie Mellon University
+  Pittsburgh PA 15213-3890
+ .
+ any improvements or extensions that they make and grant Carnegie Mellon
+ the rights to redistribute these changes.
+
+License: Univ-Coimbra
+ Permission to use, copy, modify, and distribute this software for any
+ purpose with or without fee is hereby granted, provided that the above
+ copyright notice and this permission notice appear in all copies.
+
+License: CORE-MATH
+ This file is part of the CORE-MATH project
+ .
+ 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.
+
+License: DEC
+ Permission to use, copy, modify, and distribute this software for any
+ purpose with or without fee is hereby granted, provided that the above
+ copyright notice and this permission notice appear in all copies, and
+ that the name of Digital Equipment Corporation not be used in
+ advertising or publicity pertaining to distribution of the document or
+ software without specific, written prior permission.
+ .
+ THE SOFTWARE IS PROVIDED ``AS IS'' AND DIGITAL EQUIPMENT CORP.
+ DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.  IN NO EVENT SHALL
+ DIGITAL EQUIPMENT CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT,
+ INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING
+ FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
+ NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
+ WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+License: FSFAP
+ Copying and distribution of this file, with or without modification,
+ are permitted in any medium without royalty provided the copyright
+ notice and this notice are preserved. This file is offered as-is,
+ without any warranty.
+
+License: GPL-2
+ This file is free software; you can redistribute it and/or modify it
+ under the terms of the GNU General Public License version 2 as published
+ by the Free Software Foundation.
+ .
+ This file 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 Lesser General Public
+ License along with the GNU C Library; if not, see
+ <https://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU General Public License
+ version 2 can be found in `/usr/share/common-licenses/GPL-2'.
+
+License: GPL-2+
+ This file is part of the GNU C Library.
+ .
+ This file 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 2, or (at your option) any
+ later version.
+ .
+ The GNU C Library 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
+ Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public
+ License along with the GNU C Library; if not, see
+ <https://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU General Public License
+ version 2 can be found in `/usr/share/common-licenses/GPL-2'.
+
+License: GPL-2+-with-link-exception
+ This file 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 2, or (at your option) any
+ later version.
+ .
+ In addition to the permissions in the GNU General Public License, the
+ Free Software Foundation gives you unlimited permission to link the
+ compiled version of this file into combinations with other programs,
+ and to distribute those combinations without any restriction coming
+ from the use of this file.  (The General Public License restrictions
+ do apply in other respects; for example, they cover modification of
+ the file, and distribution when not linked into a combine
+ executable.)
+ .
+ This file 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
+ <https://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU General Public License
+ version 2 can be found in `/usr/share/common-licenses/GPL-2'.
+
+License: GPL-3+
+ 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 <https://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU General Public License
+ version 2 can be found in `/usr/share/common-licenses/GPL-3'.
+
+License: IBM
+ 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.
+
+License: Inner-Net
+ The Inner Net License, Version 2.00
+ .
+   The author(s) grant permission for redistribution and use in source and
+ binary forms, with or without modification, of the software and documentation
+ provided that the following conditions are met:
+ .
+ 0. If you receive a version of the software that is specifically labelled
+    as not being for redistribution (check the version message and/or README),
+    you are not permitted to redistribute that version of the software in any
+    way or form.
+ 1. All terms of the all other applicable copyrights and licenses must be
+    followed.
+ 2. Redistributions of source code must retain the authors' copyright
+    notice(s), this list of conditions, and the following disclaimer.
+ 3. Redistributions in binary form must reproduce the authors' copyright
+    notice(s), this list of conditions, and the following disclaimer in the
+    documentation and/or other materials provided with the distribution.
+ 4. [The copyright holder has authorized the removal of this clause.]
+ 5. Neither the name(s) of the author(s) nor the names of its contributors
+    may be used to endorse or promote products derived from this software
+    without specific prior written permission.
+ .
+ THIS SOFTWARE IS PROVIDED BY ITS AUTHORS AND CONTRIBUTORS ``AS IS'' AND ANY
+ EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR ANY
+ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ .
+   If these license terms cause you a real problem, contact the author.
+
+License: ISC
+ Permission to use, copy, modify, and distribute this software for any
+ purpose with or without fee is hereby granted, provided that the above
+ copyright notice and this permission notice appear in all copies.
+ .
+ THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
+ ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
+ OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
+ CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
+ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
+ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
+ ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
+ SOFTWARE.
+
+License: LGPL-2+
+ This file is part of the GNU C Library.
+ .
+ The GNU C Library is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Library General Public License as
+ published by the Free Software Foundation; either version 2 of the
+ License, or (at your option) any later version.
+ .
+ The GNU C Library 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
+ Library General Public License for more details.
+ .
+ You should have received a copy of the GNU Library General Public
+ License along with the GNU C Library.  If not, see
+ <https://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Library General Public
+ License version 2 can be found in `/usr/share/common-licenses/LGPL-2'.
+
+License: LGPL-2.1+
+ This file is part of the GNU C Library.
+ .
+ The GNU C Library is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Lesser General Public
+ License as published by the Free Software Foundation; either
+ version 2.1 of the License, or (at your option) any later version.
+ .
+ The GNU C Library 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
+ Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public
+ License along with the GNU C Library; if not, see
+ <https://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Library General Public
+ License version 2.1 can be found in `/usr/share/common-licenses/LGPL-2.1'.
+
+License: LGPL-2.1+-with-link-exception
+ This file is part of the GNU C Library.
+ .
+ The GNU C Library is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Lesser General Public
+ License as published by the Free Software Foundation; either
+ version 2.1 of the License, or (at your option) any later version.
+ .
+ In addition to the permissions in the GNU Lesser General Public
+ License, the Free Software Foundation gives you unlimited
+ permission to link the compiled version of this file into
+ combinations with other programs, and to distribute those
+ combinations without any restriction coming from the use of this
+ file.  (The Lesser General Public License restrictions do apply in
+ other respects; for example, they cover modification of the file,
+ and distribution when not linked into a combine executable.)
+ .
+ The GNU C Library 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
+ Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public
+ License along with the GNU C Library; if not, see
+ <https://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Library General Public
+ License version 2.1 can be found in `/usr/share/common-licenses/LGPL-2.1'.
+
+License: LGPL-3+
+ This file is part of the GNU Hurd.
+ .
+ The GNU Hurd is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Lesser General Public License
+ as published by the Free Software Foundation; either version 3 of
+ the License, or (at your option) any later version.
+ .
+ The GNU Hurd 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
+ Lesser General Public License for more details.
+ .
+ You should have received a copy of the GNU Lesser General Public
+ License along with this program.  If not, see
+ <https://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU Library General Public
+ License version 3 can be found in `/usr/share/common-licenses/LGPL-3'.
+
+License: PCRE
+ PCRE LICENCE
+ ------------
+ .
+ PCRE is a library of functions to support regular expressions whose syntax
+ and semantics are as close as possible to those of the Perl 5 language.
+ .
+ Written by: Philip Hazel <ph10@cam.ac.uk>
+ .
+ University of Cambridge Computing Service,
+ Cambridge, England. Phone: +44 1223 334714.
+ .
+ Copyright (c) 1997-2003 University of Cambridge
+ .
+ Permission is granted to anyone to use this software for any purpose on any
+ computer system, and to redistribute it freely, subject to the following
+ restrictions:
+ .
+ 1. This software 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.
+ .
+ 2. The origin of this software must not be misrepresented, either by
+    explicit claim or by omission. In practice, this means that if you use
+    PCRE in software that you distribute to others, commercially or
+    otherwise, you must put a sentence like this
+ .
+      Regular expression support is provided by the PCRE library package,
+      which is open source software, written by Philip Hazel, and copyright
+      by the University of Cambridge, England.
+ .
+    somewhere reasonably visible in your documentation and in any relevant
+    files or online help data or similar. A reference to the ftp site for
+    the source, that is, to
+ .
+      ftp://ftp.csx.cam.ac.uk/pub/software/programming/pcre/
+ .
+    should also be given in the documentation. However, this condition is not
+    intended to apply to whole chains of software. If package A includes PCRE,
+    it must acknowledge it, but if package B is software that includes package
+    A, the condition is not imposed on package B (unless it uses PCRE
+    independently).
+ .
+ 3. Altered versions must be plainly marked as such, and must not be
+    misrepresented as being the original software.
+ .
+ 4. If PCRE is embedded in any software that is released under the GNU
+   General Purpose Licence (GPL), or Lesser General Purpose Licence (LGPL),
+   then the terms of that licence shall supersede any condition above with
+   which it is incompatible.
+ .
+ The documentation for PCRE, supplied in the "doc" directory, is distributed
+ under the same terms as the software itself.
+ .
+ End
+
+License: SunPro
+ Developed at SunPro, a Sun Microsystems, Inc. business.
+ Permission to use, copy, modify, and distribute this
+ software is freely granted, provided that this notice
+ is preserved.
+
+License: Unicode-DFS-2016
+ UNICODE LICENSE V3
+ .
+ COPYRIGHT AND PERMISSION NOTICE
+ .
+ Copyright © 1991-2024 Unicoe, Inc.
+ .
+ NOTICE TO USER: Carefully read the following legal agreement. BY
+ DOWNLOADING, INSTALLING, COPYING OR OTHERWISE USING DATA FILES, AND/OR
+ SOFTWARE, YOU UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE
+ TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO NOT
+ DOWNLOAD, INSTALL, COPY, DISTRIBUTE OR USE THE DATA FILES OR SOFTWARE.
+ .
+ Permission is hereby granted, free of charge, to any person obtaining a
+ copy of data files and any associated documentation (the "Data Files") or
+ software and any associated documentation (the "Software") to deal in the
+ Data Files or Software without restriction, including without limitation
+ the rights to use, copy, modify, merge, publish, distribute, and/or sell
+ copies of the Data Files or Software, and to permit persons to whom the
+ Data Files or Software are furnished to do so, provided that either (a)
+ this copyright and permission notice appear with all copies of the Data
+ Files or Software, or (b) this copyright and permission notice appear in
+ associated Documentation.
+ .
+ THE DATA FILES AND SOFTWARE ARE 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 OF
+ THIRD PARTY RIGHTS.
+ .
+ IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE
+ BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES,
+ OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
+ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
+ ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA
+ FILES OR SOFTWARE.
+ .
+ Except as contained in this notice, the name of a copyright holder shall
+ not be used in advertising or otherwise to promote the sale, use or other
+ dealings in these Data Files or Software without prior written
+ authorization of the copyright holder.

deployment/notices/GPL-3.txt

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://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 <https://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
+<https://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
+<https://www.gnu.org/licenses/why-not-lgpl.html>.

deployment/notices/ICU.txt

@@ -0,0 +1,49 @@
+Format: https://www.debian.org/doc/packaging-manuals/copyright-format/1.0/
+X-Format: https://dep.debian.net/deps/dep5
+Upstream-Name: ICU
+Upstream-Contact: https://icu.unicode.org/contacts
+Source: https://github.com/unicode-org/icu
+
+Files: *
+Copyright: Copyright © 1991-2022 Unicode, Inc.
+License: MIT
+ 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.
+
+Files: debian/*
+Copyright: 2005-2015 Jay Berkenbilt <qjb@debian.org>,
+           2015-     Laszlo Boszormenyi (GCS) <gcs@debian.org>
+License: GPL-3
+ 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 version 3 of the License.
+ .
+ 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 <https://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the complete text of the GNU General Public
+ License version 3 can be found in `/usr/share/common-licenses/GPL-3'.

deployment/notices/LGPL-2.1.txt

@@ -0,0 +1,501 @@
+                  GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+ <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+  When we speak of free software, we are referring to freedom of use,
+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 this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard.  To achieve this, non-free programs must be
+allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at
+    least three years, to give the same user the materials
+    specified in Subsection 6a, above, for a charge no more
+    than the cost of performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+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
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded.  In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser 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 Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+                            NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "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
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY 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
+LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.  It is
+safest to attach them to the start of each source file to most effectively
+convey 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 library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library 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
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, see <https://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James Random Hacker.
+
+  <signature of Moe Ghoul>, 1 April 1990
+  Moe Ghoul, President of Vice
+
+That's all there is to it!

deployment/notices/MODEL-CARD.md

@@ -0,0 +1,44 @@
+---
+license: cc-by-nc-4.0
+base_model: inclusionAI/Ling-3.0-tiny
+pipeline_tag: text-generation
+library_name: ling3rknn
+tags:
+- rk3588
+- rknn
+- edge-inference
+- custom-format
+language:
+- zh
+---
+
+# Ling3RKNN Ling-3.0-tiny W4
+
+这是面向 Rockchip RK3588/RK3588S 的 Ling-3.0-tiny 专用量化模型，运行格式为
+`ling3-tiny-w4.l3r`，由 Ling3RKNN C++ 推理引擎加载。
+
+## 模型来源与许可
+
+- 基模型：[inclusionAI/Ling-3.0-tiny](https://huggingface.co/inclusionAI/Ling-3.0-tiny)
+- 来源 revision：`e3a47d5b986e7141b6efd62597d598ebb392060d`
+- 本仓库发布的转换/打包模型资产：**CC BY-NC 4.0**，仅限非商业、学术研究和教育用途；该标注不改变上游基模型的权利或许可边界。
+- Ling3RKNN 源码、转换脚本和测试工具：见仓库根目录 [Apache-2.0](../../LICENSE)。
+
+本文件只授权本仓库发布的转换模型资产，不重新发布上游 BF16 权重。使用者仍须遵守上游模型条款并保留基模型署名。商业使用或商业集成请私聊获取授权。
+
+## 使用方式
+
+请使用本仓库的 Ling3RKNN C++ 推理引擎，并按照根目录 README 安装 Rockchip [rknpu2](https://github.com/airockchip/rknpu2) runtime。将模型文件与引擎放在同一目录后运行：
+
+```bash
+./mindnano-infer --model ./ling3-tiny-w4.l3r --context 8K
+```
+
+模型格式不是 GGUF、Safetensors 或 RKLLM，不能直接交给其他推理框架加载。
+
+## 已知限制
+
+- 面向单请求 RK3588/RK3588S 设备验证；不提供鉴权、TLS 或稳定并发保证。
+- 默认 KV cache 为 BF16；FP8/INT8 KV 仍是实验功能。
+- 128K/256K 上下文选项尚未完成完整板端质量和性能认证。
+- 性能会随 RKNPU 驱动、频率、散热和后台负载变化。

deployment/notices/NLOHMANN-JSON.txt

@@ -0,0 +1,20 @@
+JSON for Modern C++ version 3.10.5
+Copyright (c) 2013-2022 Niels Lohmann <http://nlohmann.me>.
+
+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.

deployment/notices/RKNN-2.3.2.txt

@@ -0,0 +1,13 @@
+Rockchip RKNN is an external build and runtime dependency.
+
+Official sources:
+- https://github.com/airockchip/rknn-toolkit2
+- https://github.com/airockchip/rknpu2
+
+The applicable Rockchip SDK terms are reproduced in `RKNN-SDK-LICENSE.txt`
+from the official rknn-toolkit2 checkout. The bundled `librknnrt.so` is an
+unmodified runtime obtained from the official rknpu2 runtime package. Use,
+reproduction, or redistribution is subject to those Rockchip terms and any
+applicable third-party notices. Retain this notice, the original license,
+and runtime version/hash information with the binary. Obtain and accept the
+matching SDK/runtime terms before building or deploying with RKNPU2.

deployment/notices/RKNN-SDK-LICENSE.txt

@@ -0,0 +1,44 @@
+RKNN SDK License
+
+This License Agreement for RKNN Software Development Kit Package (this “Agreement”) is a legally binding agreement between Rockchip Electronics Co., Ltd. (“Rockchip”) and the person or legal entity You represent (“You”).
+
+DO NOT DOWNLOAD, INSTALL OR USE THE RKNN SOFTWARE DEVELOPMENT KIT PACKAGE (THE “SOFTWARE) UNTIL YOU HAVE CAREFULLY READ AND ACCEPTED THIS AGREEMENT. BY DOWNLOADLING, INSTALLING OR USING THE SOFTWARE, YOU ACKNOWLEDGE THAT YOU HAVE READ AND AGREED TO BE BOUND BY THE TERMS AND CONDITIONS OF THIS AGREEMENT. IF YOU DO NOT AGREE TO ALL OF THE TERMS AND CONDITIONS OF THIS AGREEMENT, CANCEL THE DOWNLOADLING, INSTALLING OR USING OF THE SOFTWARE.
+
+1. License Grant
+1.1 Subject to the terms and conditions of this Agreement, Rockchip hereby grants to You a limited, non-exclusive, royalty-free copyright license to use, reproduce, modify, and create derivative works of the Software and redistribute its modifications or derivative works that are made by You solely for the design, development and testing of applications that are compatible with Products (as defined below) of Rockchip or its affiliates.
+1.2 Subject to the terms and conditions of this Agreement, You may reproduce and use, on an internal basis only, a reasonable number of copies of the documentation made available by Rockchip in connection with Software (“Documentation”’), solely in support of the license to the Software.
+1.3 Except as expressly provided in this Agreement, no other license is granted explicitly, by implication, or otherwise under any intellectual property rights, including patent or copyrights.
+
+2. License Restrictions
+2.1 Except as expressively granted in this Agreement or expressively authorized by Rockchip in writing, You may NOT:
+(a)decompile, reverse-engineer, dissemble, or attempt to derive any source code from the Software;
+(b) remove or obscure any copyright, patent, or trademark statement or notice associated with the Software;
+(c) use Third Party Software (as defined below), Open Source Software (as defined below) in any manner other than as permitted in this Agreement.
+2.2 The Software may contain Third Party Software that are proprietary to third parties or subjected to separate licenses and restrictions from third parties for any types of usages. The license terms associated with those software apply to Your use of them, and in some instances such software cannot be used or further distributed without a license from the respective owner of such third party software. You shall be solely responsible to obtain, if necessary, a separate and independent license from such owner with respect to any such use. The delivery of the Software does not convey a license, nor imply any rights, to use Third Party Software. 
+2.3 The Software may contain Open Source Software that is licensed pursuant to the applicable Open Source Software license agreement(s) (such as BSD, GPL, MIT etc.), which are either identified in the Open Source Software comments in the applicable source code file(s) and/or file header(s). With respect to the Open Source Software, nothing in this Agreement limits any rights under, or grants rights that supersede, the terms of any applicable Open Source Software license agreement(s). You must comply with Open Source Software licenses that may prevail over the terms of this Agreement. In no event may You cause any part of the Software that is not Open Source Software to become Open Source Software. 
+
+3. Updates, Upgrades and Support Services
+3.1 Rockchip may, in its sole discretion, release any updates, upgrades, or new versions of the Software and/or Documentation at any time on the website. If You decide to download, intall or use any updates, upgrades, or new versions of the Software and/or Documentation, the terms and conditions of this Agreement will govern such updates, upgrades, or new versions.
+3.2 Rockchip is under no obligation to provide any form of technical support for the Software and/or Documentation.
+
+4. Ownership 
+Rockchip and/or its licensor(s) retain all rights, titles, and interests in and to the Software and/or Documentation and its updates, upgrades. 
+
+5. No Warranties
+YOU EXPRESSLY ACKNOWLEDGE AND AGREE THAT THE USE OF THE SOFTWARE AND DOCUMENTATION IS AT YOUR SOLE RISK. THE SOFTWARE AND DOCUMENTATION 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 ROCKCHIP 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 AND DOCUMENTATION.
+
+6. Indemnifications
+You should indemnify, hold harmless, and defend Rockchip from and against any claims, damages, losses, liabilities, obligations, and costs (including attorney fees) associated with an allegation arising out of Your failure to adhere to the terms and conditions of this Agreement.
+
+7. Feedback
+If You provide Rockchip with any feedback, suggestions, comments, ideas, reviews, bug reports, or any similar or related information (“Feedback”), You agree that: (a) Rockhip will be able to free use and share such Feedback without Your consent; (b) Rockchip will have no obligation to keep confidentiality to such Feedback. If You do not agree with these terms regarding Feedback, Your sole option is to not submit such specific Feedback to Rockchip.
+
+8. Export Controls
+You acknowledge that all hardware, software, source code and technology (collectively, "Products") obtained from Rockchip or its affiliates may be subject to the applicable export control laws and regulations of the U.N., P.R.C., U.S., E.U., and/or other countries, as amended (collectively, the “Export Control and Economic Sanctions Laws and Regulations”). You shall comply with any applicable Export Control and Economic Sanctions Laws and Regulations, when using, exporting, re-exporting, selling, or otherwise disposing of the Products and fulfilling the rights and obligations under this Agreement. You assure that You will not directly or indirectly export, re-export, transfer or release (collectively, "export") any Products to any destination, person, entity or end use prohibited or restricted under Export Control and Economic Sanctions Laws and Regulations in violation of these laws and regulations. You further acknowledge that You are not a person or entity that is listed on any applicable sanctions lists. This section shall survive the termination of this Agreement.
+
+9. Term and Termination
+9.1 This Agreement will come into effect on the date You accept this Agreement and shall continue until terminated. This Agreement terminates immediately and automatically, with or without notice, if You fail to comply with any provision hereof. Additionally, Rockchip may at any time terminate this Agreement, either with or without cause, upon notice to You.
+9.2 Upon termination of this Agreement, You must delete or destroy all copies of the Software and Documentation in Your possession, and the license and other rights granted to You in this Agreement shall terminate.
+
+10. Governing Law and Jurisdiction
+This Agreement will be governed by and construed in accordance with the laws of the People’s Republic of China (“PRC”), without regard to principles of conflict of laws. You agree that any dispute arising out of or in connection with this Agreement will be decided to a court of competent jurisdiction which located in Fuzhou City, PRC.

docs/BOARD_BENCHMARK_AND_INT4_20260922.md

@@ -0,0 +1,56 @@
+# 当前板端性能与官方 INT4 损失对比
+
+日期：2026-09-22。设备为 NanoPi M6 / RK3588 / 16GB，CPU 使用 A76 大核，CPU、NPU、DMC 锁定最高频率；测试时暂停 MindNano、WebUI、Android 流媒体和 redroid，结束后已恢复。模型为 `ling3-tiny-w4.l3r`，BF16 KV，32K 初始化，关闭 thinking，temperature=0，输入后生成 64 tokens，无 KV 命中。
+
+## 当前版本性能
+
+解码速度同时列出模型计算速度和 API 端到端解码速度；前者是 `decode_compute_tokens_per_second`，适合和推理 benchmark 对比。
+
+| 输入/输出 | TTFT | Prefill | Prefill tok/s | 解码计算 tok/s | API 解码 tok/s | 峰值 RSS | NPU MLA 调用 | CPU MLA 调用 |
+| ---: | ---: | ---: | ---: | ---: | ---: | ---: | ---: | ---: |
+| 128 / 64 | 753 ms | 750 ms | 170.69 | **19.98** | 19.66 | 7197 MiB | 0 | 390 |
+| 512 / 64 | 2.759 s | 2.756 s | 185.75 | **18.26** | 18.03 | 7230 MiB | 18 | 390 |
+| 1024 / 64 | 5.691 s | 5.688 s | 180.03 | **16.86** | 16.66 | 7258 MiB | 42 | 390 |
+| 2048 / 64 | 12.754 s | 12.749 s | 160.64 | **13.85** | 13.72 | 7322 MiB | 90 | 390 |
+| 4096 / 64 | 29.043 s | 29.039 s | 141.06 | **11.21** | 11.12 | 7429 MiB | 186 | 390 |
+| 8192 / 64 | 76.447 s | 76.442 s | 107.17 | **8.37** | 8.32 | 7661 MiB | 756 | 12 |
+| 16384 / 64 | 226.045 s | 226.037 s | 72.49 | **6.06** | 6.04 | 8162 MiB | 1140 | 12 |
+
+所有请求均实际生成 64 tokens，`mla_fallbacks=0`。8K 和 16K 的 NPU 调用覆盖长历史 attention；当前 1536 MiB 原生解码副本在这两档仍有足够空间，未出现本次请求内的 CPU 回退。16K 的 960 MiB 是原生预填充副本峰值，不等同于进程 RSS。
+
+原始结果保存在 [`measurements/benchmark-current-20260922/`](measurements/benchmark-current-20260922/)。本轮使用的候选二进制是在加入 KV 局部失效后的版本；这些请求关闭了 prompt cache，因此性能表反映普通冷 prefill/解码路径。
+
+## 官方 INT4 量化损失
+
+本轮性能配置使用 `engine/source/` 中的实验实现；原 v6 部署包和根目录源码不能直接视为同一测试版本。相关开关如下，均须在启动进程前设置：
+
+```bash
+export LING3_MLA_PREFILL_CACHE_MIB=1536
+export LING3_MLA_DECODE_NPU=1
+export LING3_MLA_DECODE_CACHE_MIB=1536
+export LING3_MLA_DECODE_TILE=4096
+export LING3_MOE_COST_SCHEDULE=1
+```
+
+BF16 单 token NPU MLA 默认从 8192 历史长度启用；预填充副本默认关闭。本轮未启用 `LING3_MLA_PREFILL_PAIR`。CPU attention 到 NPU attention 的严格数值门槛尚未通过，新路径仍属实验功能；早期 32 个合成位置的 Top1 为 32/32，但最大 logits 差 2.135、RMSE 0.134、平均 KL 0.000184752，不能据此称为无损。后续完整对比见下表。
+
+更长历史下的预算回退见[长解码报告](LONG_DECODE_16K_16K_20260922.md)，重复请求的缓存行为见[KV 命中报告](KV_HIT_OPTIMIZATION_20260922.md)。已清理被本报告替代的 NPU 阶段实验文档与候选日志，不再保留其全部中间结果。
+
+官方 INT4 是官方 group32 codes/scales 在桌面 CUDA BF16 参考实现中重建后计算，不是 RK3588 原生 INT4 速度测试。以下是在同一固定 token 序列、4,322 个预测位置、完整 157,184 词表上的 BF16 参考对比：
+
+| 路径 | Logits MAE | RMSE | 最大绝对差 | 平均 TV | 平均 KL | Top1 一致率 |
+| --- | ---: | ---: | ---: | ---: | ---: | ---: |
+| 官方 INT4（桌面重建） | 0.281598 | 0.371417 | 8.390625 | 5.7605% | 0.026054 | 92.6886% |
+| 板端当前 W4A8/W8A8 + NPU MLA | 0.421164 | 0.549502 | 12.022694 | 8.9992% | 0.061127 | 89.5187% |
+
+以 BF16 为共同参考，板端当前相对官方 INT4：
+
+- Logits MAE 高 **0.139566**，约为官方误差的 **1.50 倍**；
+- RMSE 高 **0.178085**，约为 **1.48 倍**；
+- 平均 TV 高 **3.2387 个百分点**；
+- 平均 KL 高 **0.035073 nat**；
+- Top1 一致率低 **3.1699 个百分点**。
+
+板端当前与上一版板端基线的直接差异为 TV **2.4451%**、KL **0.004768**、Top1 一致率 **96.9921%**；这部分主要来自 NPU MLA 数值路径，不能和权重量化损失混为一谈。完整 think/no-think、8K 子集和测量口径见[官方 INT4 对照报告](INT4_BOARD_ACCURACY_20260922.md)。
+
+结论是：当前板端性能已经覆盖 128/64 到 16K/64，但长上下文 TTFT 增长快于输入长度，解码速度随历史增长下降；精度方面，官方 INT4 在本组固定 teacher-forcing 测试中明显更接近 BF16，当前板端仍有约 1.5 倍的 logits 误差。官方 INT4 结果不能直接说明板端能达到同样速度或内存占用。

docs/INT4_BOARD_ACCURACY_20260922.md

@@ -0,0 +1,111 @@
+# 官方 INT4 与板端 v6 数值误差对照
+
+日期：2026-09-22。桌面 RTX 5090 与 RK3588 / NanoPi M6。本轮不测试 FP8，不重新量化模型，不修改线上模型或默认 attention 路径。
+
+结论：**官方 INT4 在本组固定前缀上更接近 BF16；板端当前版与基线的总误差接近，但 NPU 路径有可测得的新增偏移，不能称为无损。** 本组结果支持继续定位 NPU 数值差异，同时说明板端与官方 INT4 的主要差距在本轮优化前就已存在。
+
+## 结果
+
+以下统一以原始 BF16 为参考，按 4,322 个预测位置加权，不按题目平均。短输入当前版强制启用 NPU，8K 当前版按默认门槛启用；详见下方测量口径。
+
+| 路径 | logits MAE ↓ | logits RMSE ↓ | 最大绝对差 ↓ | 平均 TV ↓ | 平均 KL ↓ | Top1 一致率 ↑ |
+| --- | ---: | ---: | ---: | ---: | ---: | ---: |
+| 官方 INT4，桌面重建计算 | 0.281598 | 0.371417 | 8.390625 | 5.7605% | 0.026054 | 92.6886% |
+| 板端基线 | 0.420840 | 0.548970 | 11.764828 | 8.9246% | 0.060074 | 89.2642% |
+| 板端当前 NPU 版 | 0.421164 | 0.549502 | 12.022694 | 8.9992% | 0.061127 | 89.5187% |
+
+相对 BF16，当前版 TV 比基线增加约 0.0746 个百分点，KL 增加约 0.001053；Top1 一致率反而增加约 0.2545 个百分点。指标有升有降，不能把所有改变简单归类为改善或退化，也不应把数值接近解释为自由生成结果相同。
+
+直接两两比较如下；每行 KL 的参考方向按第一列指定。
+
+| 参考 → 候选 | logits MAE | logits RMSE | 最大绝对差 | 平均 TV | 平均 KL | Top1 一致率 |
+| --- | ---: | ---: | ---: | ---: | ---: | ---: |
+| 板端基线 → 当前 | 0.121644 | 0.165286 | 7.663408 | 2.4451% | 0.004768 | 96.9921% |
+| 官方 INT4 → 板端基线 | 0.462391 | 0.600889 | 11.749203 | 9.7555% | 0.073287 | 88.6627% |
+| 官方 INT4 → 板端当前 | 0.462421 | 0.600880 | 11.190662 | 9.7997% | 0.074147 | 88.6395% |
+
+当前与基线有 **130 / 4322** 个位置的 Top1 不同。以基线第一名比第二名至少高 1 nat 筛选，2,998 个位置中仅 1 个不同，一致率 99.9666%；说明本批选词变化大多发生在接近的候选之间。这不是事实正确性保证。
+
+新增偏移的 TV P95 为 7.5762%，单位置最大 TV 为 44.1294%，最大 KL 为 0.408940。极端位置不能被均值掩盖。较早 32 个合成位置的最大 logits 差仅 2.135，本轮扩大到真实语言续写后观察到 7.663；样本不同，不能把两者当成同一条件下的退化趋势。仍不满足此前严格数值门槛，新路径保留实验开关。
+
+### Think / No-think
+
+常规输入的完整续写，共 4,217 个位置：
+
+| 路径（BF16 为参考） | No-think TV / KL / Top1 | Think TV / KL / Top1 |
+| --- | --- | --- |
+| 官方 INT4 | 5.2640% / 0.023242 / 93.874% | 6.0769% / 0.027367 / 91.890% |
+| 板端基线 | 8.1693% / 0.054577 / 89.673% | 9.4016% / 0.062229 / 89.093% |
+| 板端当前 | 8.2878% / 0.056439 / 90.082% | 9.4601% / 0.062958 / 89.253% |
+
+直接比较新旧板端，No-think / Think 的 TV 为 2.1454% / 2.6740%，Top1 一致率 97.725% / 96.524%。中文办公 Think 的一致率最低，为 93.563%。各题 256-token 窗口的 TV 有升有降，未见所有题目都随生成长度单调增大的模式。
+
+### 8K 输入
+
+以下单独列出两组长输入的 105 个预测位置，不能由总体中占多数的短输入代替：
+
+| 路径（BF16 为参考） | logits RMSE | 平均 TV | 平均 KL | Top1 一致率 |
+| --- | ---: | ---: | ---: | ---: |
+| 官方 INT4 | 0.44417 | 6.3228% | 0.040650 | 92.381% |
+| 板端基线 | 0.69348 | 9.8851% | 0.098455 | 86.667% |
+| 板端当前 | 0.69724 | 9.6228% | 0.094009 | 86.667% |
+
+新旧板端直接对比：TV 1.8828%、KL 0.003537、RMSE 0.18262、Top1 一致率 96.190%（4 个位置改变），最大 logits 差 2.8247。本组没有表现为 NPU 启用后的整体分布明显恶化；但只包含 33 / 72 个续写位置，不能证明数千 token 自由回复的稳定性。
+
+后续应冻结真实 Q/K/V，比较 QK、概率、PV、输出投影、激活量化编码和首次路由分歧。不要仅凭某项总误差略有改善，就跳过新路径的数值定位或宣布可以替换默认实现。
+
+## 测量口径
+
+所有路径使用同一 token 序列、官方聊天模板和固定参考续写，比较整个 157,184 词表。逐步强制输入相同 token，避免采样分叉干扰比较。这是固定前缀数值保真测试，不是任务正确率，也不是自由生成质量测试。
+
+| 路径 | 权重与计算 |
+| --- | --- |
+| BF16 参考 | 原始 BF16 模型，官方 Transformers 实现、CUDA eager attention；保留模型指定的 FP32 参数 |
+| 官方 INT4 | 官方 group32 INT4 专家 codes × scales 重建至 BF16，在同一 CUDA 实现中计算；未做二次权重量化，没有 A8 激活量化 |
+| 板端基线 | v6 混合 W4A8/W8A8；BF16 KV；单 token MLA 使用 CPU |
+| 板端当前 | 与基线相同的 v6 权重和同一个 C++ 探针��开启 NPU 单 token MLA、双行残差、原生 KV 副本及 MoE 成本调度 |
+
+官方 INT4 一行不是原生 INT4 GPU 内核实测，因此不用于说明桌面 INT4 的速度或内存。它与板端采用不同量化方案，差距不能全部归因于 RKNN 或 NPU。当前与基线的直接对照才隔离本轮路径变更；先前单独验证过 MoE 成本调度的逐值一致性。
+
+桌面 PyTorch 2.12.1+cu130、Transformers 4.57.1；禁用 TF32。为避免投影未评分的长输入位置，使用官方 `model.model` 后，仅对目标位置执行原有 `lm_head`。中文办公 No-think 的 BF16 全词表结果与历史参考逐值一致。
+
+官方 INT4 revision：`65a6d1d71e01f73ba01e572992bbd69ea92c865f`。读取 8,832 个量化矩阵、6,945,767,424 个专家权重元素；非量化张量没有发现值差异。解包与 compressed-tensors 官方 helper 交叉核对。
+
+## 输入与覆盖
+
+| 组别 | 输入 token | 评分位置 | 说明 |
+| --- | ---: | ---: | --- |
+| 中文办公 No-think / Think | 189 / 188 | 447 / 668 | 历史回归题，完整固定续写 |
+| 数学 No-think / Think | 98 / 97 | 581 / 873 | 同上 |
+| Python No-think / Think | 124 / 123 | 686 / 962 | 同上 |
+| 8K 资料 No-think / Think | 8,226 / 8,225 | 33 / 72 | 新增资料与干扰条目，固定目标事实 |
+
+合计 8 组、4,322 个预测位置，其中短输入 4,217 个、8K 输入 105 个。Think 覆盖推理文本和最终答案。短输入对当前版强制设置 `LING3_MLA_DECODE_MIN_HISTORY=1`，以覆盖新路径；这不是实际服务的默认短输入行为。8K 组使用默认门槛 8192，历史跨越两个以上 4096-token 块。8K 续写较短，不能外推到长时间自由生成。
+
+板端容量 8,297 token，BF16 KV，预填充块最大 128；当前版 tile=4096、native cache 预算 1536MiB。两条路径均固定 A76 大核、NPU、DMC 最高频率，暂时停止既有应用服务，测试后恢复。所有位置有限、C++ 与 Python tokenizer 一致、无 attention fallback。当前版每个续写步骤均使用六层 NPU MLA，合计 25,884 次；基线解码 NPU 调用为零。首个评分位置来自预填充，故调用数为 `6 × (4322 − 8)`。
+
+## 指标解释
+
+MAE、RMSE、最大绝对差针对未归一化 logits，不是百分比。TV 为两下一词概率分布的总变差距离，表中以百分比显示；KL 为 `KL(参考 || 候选)`，单位 nat。Top1 是在相同输入前缀下第一候选 token 的一致率，不是问答正确率。
+
+RMSE 由全部位置、全部词表元素的均方误差开方，未逐位置开方后平均。JSON 另保留去除整体平移的 logits RMSE、TV/KL 的 P50/P95/最大值、每题及每 256 个位置的统计。不同参照下的误差不能直接相加。
+
+## 复现与原始数据
+
+本地已不保留 `.f32`，仅运行 `score` 无法重新计算误差。复测应沿用保留的 `suite.json`，重新执行 PC 和板端推理以生成 logits，再评分；当前摘要用于查阅已有测量结果。
+
+入口：`engine/source/tests/cross_platform_accuracy.py`，阶段依次为 `prepare`、`pc`、`board`、`score`。PC 阶段需要可运行官方模型的 Torch/Transformers/FLA 环境，INT4 解包校验需要 compressed-tensors helper；评分阶段只需要 NumPy。板端编译 `ling3-quant-loss-probe`，用 `run_board_experiment.py` 管理并恢复服务与频率。
+
+```bash
+python engine/source/tests/cross_platform_accuracy.py prepare \
+  --source ./work/Ling-3.0-tiny --output ./work/results
+python engine/source/tests/cross_platform_accuracy.py pc --output ./work/results \
+  --source ./work/BF16 --official ./work/official-int4
+# 将 suite.json 复制到板端结果目录，执行以下板端阶段：
+python engine/source/tests/cross_platform_accuracy.py board --output ./work/board-results \
+  --probe ./work/ling3-quant-loss-probe --model ./models/local-final/v6-board-test/ling3-tiny-w4.l3r
+# 将 board_baseline、board_current 两个目录复制回 PC 后：
+python engine/source/tests/cross_platform_accuracy.py score --output ./work/results
+```
+
+完整统计：[comparison.json](measurements/cross-platform-int4-20260922/comparison.json)。目录中保留固定输入 `suite.json`、权重审计、板端结果摘要、环境校验和 SHA256 记录；逐词表 logits 与大型运行日志已清理，不作为仓库数据分发。原始 v6 权重 SHA256 为 `80f0086247328fe77b2f939df460b4955287b6f75f6aaada85512c56e652f435`，与发布包校验记录一致。

docs/KV_CACHE_BENCHMARK_20260922.md

@@ -0,0 +1,53 @@
+# RK3588 KV 缓存容量与长输入测试（2026-09-22）
+
+后续 16K/64 复测、CPU/NPU 曲线和优化分析见 [占用分析](KV_UTILIZATION_16K_20260922.md)。
+
+测试设备：NanoPi M6（RK3588，物理内存 15959 MiB，RKNPU 驱动 0.9.8），Ling3 v6 混合 W4A8/W8A8 权重。只比较 BF16 MLA KV 和 INT8 MLA KV（批量注意力采用原生 NPU INT8 矩阵乘，即此处的 W8A8 KV 路径）；其他模型权重、KDA FP32 状态不变。FP16 仍保留为可选实验模式，不参与此表。
+
+测试期间暂时停止 MindNano WebUI、OpenAI 适配服务、安卓视频桥、redroid 和 GNOME 会话；CPU 小核 1.8 GHz、大核 2.304/2.352 GHz，NPU 1 GHz，DMC 2.4 GHz，均固定最高频率。测试后恢复此前服务与调频设置。每一容量档独立启动服务，关闭历史会话快照和前缀检查点，以隔离模型及常驻 KV 内存。
+
+## 上下文容量
+
+`RSS` 是服务完成模型加载和预热时的进程常驻内存，**已经包含该档 KV 容量**；不是后续还要加上 KV 容量。`KV` 是按 6 层 MLA、每层 16 头计算的缓存字节数，BF16 每元素 2 字节，INT8 每元素 1 字节另加每 token/head 两个 FP32 scale。`余量` 是测量时系统的 `MemAvailable`，不是可供该服务独占的配额；RSS 也包含 NPU 共享映射。
+
+| 上下文 | BF16 KV | BF16 启动 RSS | BF16 余量 | INT8 KV | INT8 启动 RSS | INT8 余量 |
+| ---: | ---: | ---: | ---: | ---: | ---: | ---: |
+| 8K | 480 MiB | 5750 MiB | 7006 MiB | 246 MiB | 5512 MiB | 7411 MiB |
+| 16K | 960 MiB | 6230 MiB | 6482 MiB | 492 MiB | 5760 MiB | 7116 MiB |
+| 32K | 1920 MiB | 7192 MiB | 5473 MiB | 984 MiB | 6253 MiB | 6570 MiB |
+| 64K | 3840 MiB | 9115 MiB | 3642 MiB | 1968 MiB | 7242 MiB | 5583 MiB |
+| 128K | 7680 MiB | 12457 MiB | 334 MiB | 3936 MiB | 9217 MiB | 3605 MiB |
+| 256K | 15360 MiB | **约 19–21 GiB（推测，未启动）** | 不适用 | 7872 MiB | 12745 MiB | 95 MiB |
+
+BF16 128K 和 INT8 256K 虽完成初始化，但内存余量过低并观察到少量系统 swap 增长，不适合作为此设备的可靠工作档位；BF16 256K 明显超过 16GB，因此没有强行启动。INT8 256K 只是初始化成功，位置大于模型原生 128K 尚未验证质量，不能算作 256K 长文本可用。
+
+容量阶段原始 JSONL 中早期脚本产生的 `predicted_filled_rss_mib` **错误地在启动 RSS 上再次叠加 KV**，不要使用；表中的 `rss_mib`、`kv_capacity_mib` 和 `mem_available_mib` 是实测值或直接按布局计算的值。现有脚本已改为根据 8K 基线只外推容量的增量。
+
+## 输入与输出性能
+
+请求的目标是 `输入 token/最多输出 64 token`，相同模型与 ASCII 数字输入，各请求独立、缓存命中 0、关闭 thinking。小于等于 4096 输入使用 8K 上下文；8K、16K、32K、64K 输入分别使用 16K、32K、64K、128K 上下文，以给输出留足空间。下表填写实际 tokenizer 与 API 返回的 token 数、TTFT 和解码计算速度；每档运行一次，无法代表统计分布。初次短输入可能由于自动调度未达到 NPU 注意力启用门槛，不能归因于 INT8 矩阵乘。
+
+| 输入/输出 | BF16 TTFT (s) | INT8 TTFT (s) | INT8 TTFT 改善 | BF16 解码 tok/s | INT8 解码 tok/s |
+| ---: | ---: | ---: | ---: | ---: | ---: |
+| 128/64 | 0.778 | 0.808 | -4% | 18.38 | 18.53 |
+| 256/64 | 1.487 | 1.485 | 0% | 18.18 | 18.19 |
+| 512/64 | 2.834 | 2.755 | 3% | 17.15 | 17.71 |
+| 1024/64 | 5.902 | 5.559 | 6% | 16.08 | 16.16 |
+| 2048/64 | 13.217 | 12.111 | 8% | 13.45 | 13.51 |
+| 4096/64 | 32.731 | 28.834 | 12% | 10.64 | 10.22 |
+| 8192/64 | 90.562 | 76.846 | 15% | 7.11 | 7.11 |
+| 16384/64 | 285.410 | 231.574 | 19% | 4.28 | 4.45 |
+| 32768/64 | 986.870 | 772.622 | 22% | 2.32 | 2.53 |
+| 65536/64 | 内存余量不足 | 2780.517 | 不可直接比较 | 不适用 | 1.35 |
+
+BF16 128K 上下文启动时只剩约 334 MiB 可用，本次速度测试启动后最低仅约 65 MiB，故未请求 65536/64；不能把该项写成实测性能。短输入 128 token 两格式均为 `mla_npu_calls=0`；256 输入起逐步进入 NPU 路径，32K 输入为 1530 次 NPU MLA 调用、390 次 CPU MLA 调用（主要对应解码）。长输入下 TTFT 增长显著快于输入长度，32K 后解码仅约 2.3–2.5 token/s。单次结果用于观察趋势，不能据此断言百分比差异的统计显著性。
+
+32K 输入时 MLA NPU 路径记录的耗时约 BF16 840 秒、INT8 624 秒，已占 TTFT 的 81%～85%；64K INT8 约 2484 秒，占 TTFT 的 89%。此字段包含排布、内存同步及 attention 计算，并非纯 NPU 矩阵乘耗时。这说明继续优化长输入，应优先检查 MLA 的历史 KV 搬运与批量注意力，而不仅是启动内存。
+
+INT8 的 65536/64 在 128K 上下文中完整返回：输入、输出 token 数均准确，`finish_reason=length`，3066 次 NPU MLA 调用、0 回退，进程峰值 RSS 9225 MiB、进程 `VmSwap=0`，系统测试时余量约 3593 MiB。TTFT 约 46 分 21 秒，64-token 解码约 47 秒，证明这档能运行���不适合交互响应。INT8 256K 只是启动成功且仅余 95 MiB，超过模型原生 128K 位置范围，不做 128K 以上实际输入测试。
+
+在本机同时考虑内存余量时，可先以 BF16 64K、INT8 128K 作为**有余量的初始化档位**；这不是交互可用长度的建议。即便 INT8，4096 输入的 TTFT 也约 29 秒，32K 达约 13 分钟；对低延迟应用仍需压缩输入或改进长预填充。这里只测速度和内存，不代表两种 KV 格式的长文本回答质量相同。
+
+脚本：[kv_context_benchmark.py](../engine/source/tests/kv_context_benchmark.py)；板端原始 JSONL 和逐请求引擎日志保存在测试设备的独立运行目录，未纳入仓库。FP16 独立实验仍可用相同脚本指定 `--mode fp16` 重测，旧版 `mla_int8_api_benchmark.py` 与既有 FP16 数据保留在板端 `run/`；本次正式结论不混入 FP16。
+
+复现时在仓库根目录执行 `python3 engine/source/tests/kv_context_benchmark.py --help`，分别对 `--mode bf16` 和 `--mode int8` 运行 `--phase capacity` 与 `--phase perf`，使用相对路径传入 `--binary`、`--model` 和 `--output-dir` 即可。脚本只停止自己启动的测试服务，不会自动暂停其他系统服务或调整频率；测试前应检查可用内存与电源、散热状态。

docs/KV_HIT_OPTIMIZATION_20260922.md

@@ -0,0 +1,35 @@
+# KV 命中后的 NPU 副本复用
+
+状态：2026-09-22 已实现并在 RK3588 实测。
+
+## 问题
+
+exact prompt 命中只跳过 prefill，但 checkpoint 恢复原先会调用完整的 `InvalidateCaches()`。因此即使 prompt 前缀完全相同，NPU 解码路径也会重新打包整段历史 KV。长上下文每次命中都会重复支付这部分搬运成本。
+
+## 改动
+
+恢复轻量 checkpoint 时，根据恢复位置对 NPU 原生副本做局部失效：
+
+- 恢复位置之前已经完整结束的 tile 保留；
+- 包含被覆盖后缀的 tile 删除并在后续 decode 中重建；
+- canonical BF16 KV、checkpoint 内容和 logits 逻辑不变；
+- 完整 `DecoderState` 恢复仍执行全量失效，避免跨状态复用旧副本。
+
+这只优化副本打包和同步，不减少长上下文 attention 的矩阵乘计算量。
+
+## 板端验证
+
+NanoPi M6 / RK3588，16K context，8,192-token prompt，BF16 KV，4096 tile，NPU decode，1536 MiB decode cache，输出 8 token。冷请求和第一次 miss 后连续两次 exact hit 均在同一进程执行。
+
+| 请求 | 状态 | TTFT | 解码计算速度 | MLA NPU/CPU 调用 | MLA NPU 时间 |
+| --- | --- | ---: | ---: | ---: | ---: |
+| 冷请求 | disabled | 87.72 s | 3.01 tok/s | 420 / 12 | 43.28 s |
+| 首次同 session 请求 | miss | 88.64 s | 3.00 tok/s | 420 / 12 | 43.62 s |
+| 第一次 exact hit | exact_prompt_hit | 0.410 s | 3.48 tok/s | 42 / 0 | 1.411 s |
+| 第二次 exact hit | exact_prompt_hit | 0.434 s | 3.50 tok/s | 42 / 0 | 1.407 s |
+
+对照是旧的全量失效逻辑下 16K exact hit 约 3.25–3.29 tok/s；上下文长度不同，不能把两个绝对速度当成严格同条件提升，但 8K 复测已经证明恢复后保留完整 tile 能减少重复工作。结果原始文件在 [`measurements/prefix-hit-20260922/selective-8k/`](measurements/prefix-hit-20260922/selective-8k/)。
+
+## 边界
+
+恢复位置不在 tile 边界时，包含该位置的 tile 也会删除，保证被覆盖的 token 不会残留在 NPU 副本中。若切换 session、修改前缀或执行完整状态恢复，仍会清空全部副本。后续应在同一配置下补测 16K exact hit，并同时检查输出 token 和完整 logits 一致性。

docs/KV_UTILIZATION_16K_20260922.md

@@ -0,0 +1,73 @@
+# 16K/64 CPU 与 NPU 占用分析
+
+2026-09-22，NanoPi M6 / RK3588 / 16GB。结论：当前长上下文路径未持续占满 NPU；优先检查 CPU 重排、量化、同步和任务粒度，再评估单 token attention 的 NPU 实现。低 NPU busy 不等于可直接获得对应倍数的加速。
+
+## 性能复测
+
+同一 v6 权重，32K 初始化，实际输入 16384、输出 64 token，关闭 thinking 和缓存复用。服务加载预热后发起请求；TTFT 不含初始化时间。使用合成数字输入，只测性能，不代表语义质量。每格式一次复测。
+
+| KV | 上次 TTFT | 本次 TTFT | 上次解码 token/s | 本次解码 token/s | 本次峰值 RSS |
+| --- | ---: | ---: | ---: | ---: | ---: |
+| BF16 | 285.410 s | 283.127 s | 4.283 | 4.268 | 7200 MiB |
+| INT8 | 231.574 s | 228.706 s | 4.453 | 4.360 | 6262 MiB |
+
+INT8 指 KV 量化；批量 MLA 使用原生 NPU W8A8，单 token attention 仍在 CPU。解码计算速度为首 token 后 63 次模型计算的速度。单次差异不作统计显著性结论。
+
+## 占用曲线
+
+每约 100ms 读取 `/proc/stat` 和 `/sys/kernel/debug/rknpu/load`，监测程序置于小核。表格为按采样间隔加权的平均值，阶段边缘各排除 1 秒。CPU 百分数按单核计算，NPU 为驱动报告的各核 busy。
+
+| KV / 阶段 | CPU4 | CPU5 | CPU6 | CPU7 | NPU0 | NPU1 | NPU2 |
+| --- | ---: | ---: | ---: | ---: | ---: | ---: | ---: |
+| BF16 预填充 | 84.0% | 72.7% | 71.8% | 14.4% | 12.6% | 11.9% | 12.1% |
+| INT8 预填充 | 87.0% | 75.6% | 74.3% | 17.9% | 8.5% | 8.4% | 8.7% |
+| BF16 解码 | 75.4% | 76.1% | 80.5% | 78.6% | 13.7% | 13.7% | 13.3% |
+| INT8 解码 | 80.4% | 80.3% | 79.5% | 79.8% | 13.8% | 13.9% | 13.5% |
+
+BF16/INT8 预填充 NPU 单核 P95 分别约 13% / 11%～12%，解码约 14%～15%；上述阶段没有采到任一 NPU 核 busy≥90%。预填充最后 30 秒，CPU7 平均仅 8.4% / 11.1%，三核 NPU 分别约 11%～13% / 7%。
+
+![完整请求占用曲线](measurements/16k-profile-20260922/timeline.png)
+
+![解码占用曲线](measurements/16k-profile-20260922/decode.png)
+
+曲线橙色部分为解码。全程图按 1 秒分箱；解码图保留原始采样。驱动自身的统计窗口尚未核实，100ms 读取不代表 100ms 硬件分辨率，因此不能排除更短的满载脉冲，也不能用这些曲线证明逐算子的 CPU/NPU 重叠关系。
+
+## 与实现的对应关系
+
+1. **预填充已有 NPU 加速，但其前后处理仍在 CPU。** `mla_npu.cpp` 每个 head、每个 512-token 历史块都重新排列 K/V，执行输入同步、矩阵乘、输出同步和 CPU softmax。BF16 路径还有 Q/P 的残差补偿计算；INT8 路径还要重新量化 V 块。旧历史块会被后续 query 批次反复处理。
+2. **预填充三个工作线程分别驱动三个 NPU 核。** `CoreWorkers` 将它们绑定到 CPU4–6，MLA 阶段没有使用第四个工作线程。CPU7 随上下文增长越来越空闲，与 MLA 占比上升一致。不能直接把第四个线程加入现有缓冲区，必须处理所有权与同步。
+3. **单 token 的 QK、softmax、PV 在四个大核上扫描历史 KV。** `decoder.cpp` 的 `MlaAttention::Run` 走 CPU；批量 NPU 入口对 rows<16 返回 false。权重投影和专家仍使用 NPU，因此解码 NPU 并非完全空闲。
+4. **日志的 MLA NPU 时间不是硬件纯计算时间。** 本次 BF16 为 210.606 秒、INT8 为 155.815 秒，计入了上述 CPU 与同步开销。不能据此声称 NPU 占用了 TTFT 的 74% / 68%。
+
+代码见 [mla_npu.cpp](../engine/source/src/mla_npu.cpp)、[decoder.cpp](../engine/source/src/decoder.cpp)、[core_workers.cpp](../engine/source/src/core_workers.cpp)。CPU busy 也包含访存停顿，当前数据还不能区分算术瓶颈与内存带宽瓶颈。
+
+## 优化顺序与可验证目标
+
+| 顺序 | 方向 | 原因与验收 |
+| --- | --- | --- |
+| 1 | 拆分计时：KV 排布、量化、mem_sync、matmul、softmax、线程等待 | 先确定关键路径，不能把低 NPU busy 全部归因于一种操作 |
+| 2 | 历史 KV 按块维护 NPU 原生布局，增量更新 | 避免每个 query 批次重复转换同一历史；检查是否需要双份缓存、INT8 V 重量化是否改变数值 |
+| 3 | CPU7 准备下一块，双缓冲衔接三核 NPU | 使用已有空闲大核；计入 cache coherency 与同步成本，保证无数据竞争 |
+| 4 | 单 token 专用 NPU attention 原型，与 CPU SIMD 对照 | 当前 NPU 有时间空隙，值得尝试；不能简单放开 rows<16，把填充和重复重排带入解码 |
+| 5 | CPU INT8 内核及 KV 访问布局优化 | 目前 INT8 dot/accumulate 无专用手写 NEON；需检查编译产物，不能假定编译器完全未向量化 |
+
+建议先测 attention 微基准，再以相同的 16K/64 完整请求验收 TTFT、解码、RSS、数值误差及长回复质量。不能仅以 NPU 利用率提升为成功标准。
+
+**目前能确定还有调度与数据处理优化空间，不能确定能加速几倍。** 例如某优化若覆盖总耗时的 50% 且该部���快一倍，整体也仅快 1.33 倍；若覆盖 80%，整体才为 1.67 倍。这只是计算示例，不是本次测得的可优化比例。仅凭约 14% 的 NPU busy，无法承诺 16K 解码回到 20 token/s。
+
+## 测量条件与复现
+
+测试暂停 MindNano、安卓视频桥、redroid 和 GNOME；CPU 小核 1.8GHz、大核 2.304/2.352GHz、NPU 1GHz、DMC 2.4GHz。采样未见频率变化；BF16/INT8 温度峰值约 70.2/73.9℃，进程 VmSwap 均为 0。两种格式采样均通过，输入输出计数正确，缓存命中为 0。测试后原调频快照完全恢复、四项服务和 redroid 恢复，WebUI HTTP 200；测试进程已退出。
+
+采样器：[kv_utilization_profile.py](../engine/source/tests/kv_utilization_profile.py)。`--manage-board` 会临时修改服务和频率并在 finally 恢复，适用于本板的服务名和 sysfs 路径；强制断电或 SIGKILL 不保证自动恢复。
+
+```bash
+sudo python3 engine/source/tests/kv_utilization_profile.py \
+  --binary ./models/local-final/v6-board-test/mindnano-infer \
+  --model ./models/local-final/v6-board-test/ling3-tiny-w4.l3r \
+  --output-dir ./docs/measurements/new-profile-dir --manage-board
+uv run --no-project --with matplotlib python \
+  engine/source/tests/plot_kv_utilization.py ./docs/measurements/new-profile-dir
+```
+
+本地[统计摘要](measurements/16k-profile-20260922/summary.json)同目录保留曲线、请求结果和环境快照；逐次采样与引擎日志已清理，重新计算曲线需重新采样。历史板端运行目录未纳入仓库，本次文档清理未检查远端副本。

docs/LONG_DECODE_16K_16K_20260922.md

@@ -0,0 +1,81 @@
+# 16K 输入 / 16K 输出长解码负载测试
+
+状态：2026-09-22 已完成。
+
+已观测到首个明确的后端切换：`position=20481`、第 4098 个输出 token 时，每步 MLA 调用从 NPU/CPU = 6/0 变为 4/2。切换前近期速度约 7.46 token/s、NPU busy 约 56%；切换后近期约 5.50 token/s、约 36%。这是短滚动窗口观察，最终表格采用完整分段统计。没有进程换页或频率下降。
+
+第二个切换点为 `position=24577`、第 8194 个输出 token：MLA 从 4/2 变为 0/6。最终 16,384 个输出 token 全部完成，没有 EOS 提前结束、非有限 logits、NPU fallback 或换页。
+
+## 测试口径
+
+- NanoPi M6 / RK3588 / 16GB，同一 v6 混合 W4A8/W8A8 权重，BF16 KV，32K 初始化。
+- 输入严格 16,384 token，连续生成 16,384 token；no-think、贪心解码，未使用会话／前缀命中。与前轮相同的合成数字输入。
+- 独立 C++ 性能入口调用当前 decoder；只在此入口屏蔽 EOS 以保证固定输出长度，不修改服务的停止规则。记录被屏蔽次数和所有输出 token；这是性能压力测试，不证明长篇生成质量。
+- 使用与服务相同的环境配置、128-token 预热、system 边界及 128-token 批次划分；输出每个 token 的计算耗时、输出头耗时、MLA CPU/NPU 调用数和 NPU 耗时。
+- 开启预填充 KV 副本 1536MiB、NPU 解码、解码副本 1536MiB、4096 历史块、MoE 成本调度。保持当前预算，以检查随历史增长发生的后端变化。
+- CPU4–7 推理、NPU 三核；监控位于小核，每约 100ms 采样 CPU/NPU busy、CPU/NPU/DMC 频率、温度、RSS、系统 MemAvailable 和进程 VmSwap。
+- 测试临时停止应用并固定性能频率；后台任务退出时恢复。进程托管于 systemd，SSH 断开不影响测试。
+
+短入口校验：128/64 TTFT 760ms，解码 19.92 token/s，64 个 token 的文本与前轮服务版一致；未屏蔽 EOS，无后端错误，环境已正常恢复后才开始长测。
+
+## 需要验证的预算边界
+
+解码副本总预算按三个 NPU 工作线程等分。16 个 attention head 按 6/5/5 分配，第一条线程可能先达到限额；当前按“完整层能否放下”决定是否走 NPU，预算不足时使用 CPU。
+
+转为 CPU 的层仍保留已分配的历史副本。历史达到 24577（第 8194 个输出）时，实测从 NPU/CPU = 4/2 变成 0/6，与旧副本继续占据预算的代码逻辑一致。此情况不增加 `mla_fallbacks`，后者目前主要统计 NPU 执行错误，不能用 0 fallback 证明所有 attention 始终在 NPU。
+
+当前 4096-token 块中，一个 head 的 K+V 副本为 2.5MiB。第一条线程处理 6 个 head，每层每块需要 15MiB；其预算为 512MiB。历史 16385–20480 时需 5 块，六层共 450MiB。增长到第 6 块时，只能给前四层各追加 15MiB，共 510MiB；余下两层准入失败。这与实测切换位置一致。
+
+因此总预算未完全用满也会拒绝整层：此时三条线程分别约 510/425/425MiB，合计 1360MiB。进入第 7 块（历史 24577）后第一条线程连一层的新块也无法再容纳，实测六层全部转 CPU。历史 24577 后副本也没有主动淘汰，不能把这 1360MiB 当成仍有 attention 加速收益的缓存。
+
+若沿用三等分预算而希望 32K 历史的六层全部常驻，第一条线程需 720MiB，总预算至少 2160MiB，实际副本总量为 1920MiB。仅把总预算提高到 2048MiB 仍不够第一条线程使用。这是当前布局的容量计算，尚不是更高预算的实测结果；本次不在运行中改变预算。
+
+## 完整实测结果
+
+预填充 TTFT 为 **228.61s**；16,383 次解码计算共 **4,034.88s**，平均 **4.06 token/s**。预填充阶段 NPU 三核平均 busy 13.29%、A76 等效 2.42 核；解码全程平均 NPU busy 20.72%、A76 等效 2.81 核。解码平均值掩盖了后端切换，必须看下表。
+
+| 历史范围 | MLA NPU/CPU 层数 | 解码计算 token/s | NPU busy | A76 等效核数 |
+| --- | ---: | ---: | ---: | ---: |
+| 16,384–20,480 | 6 / 0 | 7.53 | 57.26% | 0.87 |
+| 20,480–22,528 | 4 / 2 | 5.44 | 36.50% | 1.98 |
+| 22,528–24,576 | 4 / 2 | 5.23 | 35.12% | 2.05 |
+| 24,576–26,624 | 0 / 6 | 3.15 | 9.30% | 3.40 |
+| 26,624–28,672 | 0 / 6 | 3.13 | 9.54% | 3.39 |
+| 28,672–30,720 | 0 / 6 | 2.97 | 9.09% | 3.42 |
+| 30,720–32,768 | 0 / 6 | 2.81 | 8.66% | 3.45 |
+
+历史增长本身也会让 attention 变慢，但本次最大性能断点来自缓存预算：6 层 NPU → 4 层 NPU＋2 层 CPU 后下降约 28%；再变成全 CPU 后，24,576–26,624 段相比前一段下降约 40%。因此“提高 NPU 利用率”的首要工程问题不是继续压榨 NPU 算力，而是避免当前预算管理造成整层阶梯式回退。
+
+全程固定 CPU4/5/6/7 为 2.304/2.304/2.352GHz、NPU 1GHz、DMC 2.4GHz；解码最高温度约 80.4℃，采样中最低 MemAvailable 2,138MiB，进程峰值 RSS 约 8.1GiB，VmSwap 为 0。预填充副本峰值约 960MiB。长测结束后服务、redroid、WebUI ���原频率均已恢复。
+
+## 结论与下一步
+
+当前 1536MiB 解码副本预算适合约 20K 历史；继续增长会让部分层、最终全部层回到 CPU。应优先改为**按历史块和层统一预算的淘汰／重排策略**：当完整六层无法继续常驻时，释放旧块并保留最近窗口，或让三条线程共享可借用的剩余预算；不能保留无收益的旧副本直到所有层回退。改动后要重新检查输出逐值一致、NPU/CPU 层数曲线和系统可用内存。
+
+提高预填充 NPU busy 仍有价值，但它不会修复解码阶段的阶梯回退。CPU softmax／概率准备和 NPU 调用重叠应在缓存容量策略之后优化，否则会把工作移到已经接近满载的 A76 上。
+
+## 命中 16K 前缀时的含义
+
+本报告的 228.6 秒是 `cache_prompt=false` 的冷预填充结果。若同一进程、同一活动会话再次提交完全相同的 16K prompt，`exact_prompt_hit` 会恢复已保存的轻量 checkpoint 和 logits，跳过这 16K token 的预填充；`cached_tokens` 应为 16,384，`prefill_ms` 接近零。此时第一 token 的 TTFT 不再是 228.6 秒，通常只剩 checkpoint 查找、恢复和采样开销。
+
+命中不会消除长上下文解码成本：每个新 token 仍需读取并计算 16K 历史。独立板端复测中，16 token 命中请求的解码速度为 **3.25–3.29 token/s**，TTFT **0.70–0.71 秒**，总耗时 **5.30–5.34 秒**；此前同配置的一次较快测量为约 4.70 token/s。因此不能再使用旧的“64 token 约 10–11 秒”估算，按现有实测范围外推，64 token 约 **14–20 秒**，应以目标板和后台负载下的实测为准。
+
+已加入按恢复位置的 NPU tile 局部失效：重复 exact hit 会保留未被覆盖的前缀 tile，避免重新打包整段历史。8K 板端复测达到 3.48–3.50 token/s，详细数据见 [`KV_HIT_OPTIMIZATION_20260922.md`](KV_HIT_OPTIMIZATION_20260922.md)。
+
+本次连续命中复测的冷请求预填充为 272.3 秒，之后两次完全相同的 16K prompt 均报告 `cache_status=exact_prompt_hit`、`cached_tokens=16384`、`prefill_ms≈0`。复测结果归档于 `docs/measurements/prefix-hit-20260922/`。冷预填充耗时受板端当时负载影响较大，但不会进入 exact hit 的预填充路径。
+
+若 prompt 在 16K 前缀后增加新用户内容，只跳过共同的 16K 前缀，新增 token 仍需预填充；新增内容越长，TTFT 越接近对应的长历史批处理成本。若继续生成超过 20K／24K，仍会触发本报告中的 6/0 → 4/2 → 0/6 层阶梯回退。
+
+当前命中有两种保存范围：活动 decoder 内的轻量 checkpoint 可在同一进程继续使用；跨会话持久保存需要完整 `DecoderState`。16K BF16 状态按当前估算约 988MiB，默认 `--session-cache-mib 256` 放不下，因此服务重启或切换后通常无法持久命中。即使提高预算，恢复完整状态仍需复制约 1GiB 数据，并会重新建立 NPU 原生副本。应以响应 `mindnano_metrics.cache_status`、`cached_tokens`、`cache_restore_ms`、`prefill_ms` 和 `mla_npu_calls/mla_cpu_calls` 判断是否真正命中。
+
+## 复现与文件
+
+- C++ 入口：`engine/source/tools/long_decode_benchmark.cpp`，构建目标 `ling3-long-decode-benchmark`。
+- 采样及环境管理：`engine/source/tests/long_decode_profile.py`。
+- 图表与分段统计：`engine/source/tests/summarize_long_decode.py`。
+- 板端结果保存在测试设备的独立运行目录，未纳入仓库。
+- 后台任务：`ling3-longdecode-16k16k-20260922.service`。
+
+原始运行曾生成 `events.jsonl`（逐 token）、`samples.jsonl`（硬件采样）、`progress.json`（进度）和 `generated.bin`（未过滤 token）；这些中间文件已清理。当前仅保留退出结果 `result.json`、按每 2K 历史汇总的 `summary.json` 和 `long-decode.png` 曲线，`generated.bin` 从未作为质量合格样例。
+
+本地 [measurements/long-decode-20260922/run](measurements/long-decode-20260922/run/) 保留最终 `summary.json`、`result.json`、环境快照和曲线。上述逐 token 事件、硬件采样、生成文本、进度文件及 smoke 运行已清理；需要重新统计或检查逐 token 内容时须重新运行测试。

docs/README.md

@@ -0,0 +1,26 @@
+# 文档索引
+
+这里保留当前 Ling3RKNN 发布说明直接引用的报告和少量可复核结果。
+
+## 核心报告
+
+- [BOARD_BENCHMARK_AND_INT4_20260922.md](BOARD_BENCHMARK_AND_INT4_20260922.md)：当前板端 128/64 至 16K/64 性能与官方 INT4 数值对比。
+- [INT4_BOARD_ACCURACY_20260922.md](INT4_BOARD_ACCURACY_20260922.md)：固定 teacher-forcing 条件下的 logits、概率分布和 Top1 一致率。
+- [KV_CACHE_BENCHMARK_20260922.md](KV_CACHE_BENCHMARK_20260922.md)：BF16/INT8 KV 的容量、内存和长输入性能。
+- [KV_UTILIZATION_16K_20260922.md](KV_UTILIZATION_16K_20260922.md)：16K 请求的 CPU/NPU 占用与瓶颈分析。
+- [KV_HIT_OPTIMIZATION_20260922.md](KV_HIT_OPTIMIZATION_20260922.md)：exact prompt 命中后的 NPU tile 局部复用。
+- [LONG_DECODE_16K_16K_20260922.md](LONG_DECODE_16K_16K_20260922.md)：16K 输入、16K 输出时的缓存预算阶梯回退。
+
+## 测量数据
+
+`measurements/` 只保留报告需要的汇总 JSON、曲线、环境摘要和校验信息。逐词表 `.f32`、大段生成日志、早期候选版本和重复运行结果不纳入工作区；重新测量应在板端生成新的结果目录，再把汇总文件复制回来。
+
+当前保留的目录：
+
+- `benchmark-current-20260922/`：README 性能表对应的请求结果。
+- `16k-profile-20260922/`：占用曲线、阶段摘要和 BF16/INT8 结果。
+- `prefix-hit-20260922/`：KV 命中冷请求与 exact hit 摘要。
+- `cross-platform-int4-20260922/`：INT4 对比摘要、输入套件、权重审计和板端结果摘要。
+- `long-decode-20260922/`：长解码汇总和曲线。
+
+历史 MOE 探针和一次性 NPU 优化报告已移出当前文档集；代码入口和当前用法以仓库根目录 [README.md](../README.md) 为准。

docs/measurements/16k-profile-20260922/bf16.result.json

@@ -0,0 +1,91 @@
+{
+  "mode": "bf16",
+  "context": 32768,
+  "input_tokens": 16384,
+  "output_tokens": 64,
+  "sampling_interval_s": 0.1,
+  "events": {
+    "request_start": 411624.893492226,
+    "first_content": 411908.055549879,
+    "request_end": 411922.863447763
+  },
+  "npu_load_source": "/sys/kernel/debug/rknpu/load",
+  "finish_reason": "length",
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.642428,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 4.26810375745384,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 14760.653344000002,
+    "decode_ms": 14805.646728,
+    "decode_tokens_per_second": 4.255133271608884,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790040377-1",
+    "major_page_faults": 0,
+    "minor_page_faults": 2058,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 762,
+    "mla_npu_ms": 210605.82986399997,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7200.046875,
+    "prefill_eval_ms": 283108.78474800003,
+    "prefill_ms": 283118.206186,
+    "prefill_tokens_per_second": 57.87174712569826,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 16384,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7200.046875,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "profile-bf16-1790040377512878116",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790040675,
+    "total_ms": 297932.614864,
+    "ttft_ms": 283126.834257,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 16384,
+      "total_tokens": 16448
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 16384,
+    "total_tokens": 16448
+  },
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/16k-profile-20260922/environment-after.json

@@ -0,0 +1,22 @@
+{
+  "sysfs": {
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_min_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_max_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_min_freq": "408000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_max_freq": "2304000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_min_freq": "408000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_max_freq": "2352000",
+    "/sys/class/devfreq/fdab0000.npu/governor": "rknpu_ondemand",
+    "/sys/class/devfreq/fdab0000.npu/min_freq": "300000000",
+    "/sys/class/devfreq/fdab0000.npu/max_freq": "1000000000",
+    "/sys/class/devfreq/dmc/governor": "dmc_ondemand",
+    "/sys/class/devfreq/dmc/min_freq": "534000000",
+    "/sys/class/devfreq/dmc/max_freq": "2400000000"
+  },
+  "matches_before": true,
+  "errors": [],
+  "meminfo": "MemTotal:       16342632 kB\nMemFree:         8877360 kB\nMemAvailable:   12609848 kB\nBuffers:           84068 kB\nCached:          3862800 kB\nSwapCached:          804 kB\nActive:           962348 kB\nInactive:        3503128 kB\nActive(anon):      51084 kB\nInactive(anon):   544200 kB\nActive(file):     911264 kB\nInactive(file):  2958928 kB\nUnevictable:       18156 kB\nMlocked:            3756 kB\nSwapTotal:       8171312 kB\nSwapFree:        5786160 kB\nZswap:                 0 kB\nZswapped:              0 kB\nDirty:               516 kB\nWriteback:            12 kB\nAnonPages:        535900 kB\nMapped:           377844 kB\nShmem:             74464 kB\nKReclaimable:     221104 kB\nSlab:             389900 kB\nSReclaimable:     221104 kB\nSUnreclaim:       168796 kB\nKernelStack:       14020 kB\nPageTables:        27052 kB\nSecPageTables:         0 kB\nNFS_Unstable:          0 kB\nBounce:                0 kB\nWritebackTmp:          0 kB\nCommitLimit:    16342628 kB\nCommitted_AS:    8769156 kB\nVmallocTotal:   133143592960 kB\nVmallocUsed:      110184 kB\nVmallocChunk:          0 kB\nPercpu:            10688 kB\nCmaTotal:         786432 kB\nCmaAllocated:       8780 kB\nCmaReleased:      777652 kB\nCmaFree:          320496 kB\nHugePages_Total:       0\nHugePages_Free:        0\nHugePages_Rsvd:        0\nHugePages_Surp:        0\nHugepagesize:       2048 kB\nHugetlb:               0 kB"
+}

docs/measurements/16k-profile-20260922/environment-before.json

@@ -0,0 +1,27 @@
+{
+  "sysfs": {
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_min_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_max_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_min_freq": "408000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_max_freq": "2304000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_min_freq": "408000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_max_freq": "2352000",
+    "/sys/class/devfreq/fdab0000.npu/governor": "rknpu_ondemand",
+    "/sys/class/devfreq/fdab0000.npu/min_freq": "300000000",
+    "/sys/class/devfreq/fdab0000.npu/max_freq": "1000000000",
+    "/sys/class/devfreq/dmc/governor": "dmc_ondemand",
+    "/sys/class/devfreq/dmc/min_freq": "534000000",
+    "/sys/class/devfreq/dmc/max_freq": "2400000000"
+  },
+  "active_services": [
+    "mindnano-openai.service",
+    "mindnano-webui.service",
+    "mindnano-android-stream.service",
+    "gdm.service"
+  ],
+  "redroid_running": true,
+  "meminfo": "MemTotal:       16342632 kB\nMemFree:         8090080 kB\nMemAvailable:   11816488 kB\nBuffers:           83572 kB\nCached:          3849152 kB\nSwapCached:          756 kB\nActive:           738760 kB\nInactive:        4214592 kB\nActive(anon):      50524 kB\nInactive(anon):  1041864 kB\nActive(file):     688236 kB\nInactive(file):  3172728 kB\nUnevictable:       18232 kB\nMlocked:            3832 kB\nSwapTotal:       8171312 kB\nSwapFree:        5778224 kB\nZswap:                 0 kB\nZswapped:              0 kB\nDirty:                 0 kB\nWriteback:             0 kB\nAnonPages:       1037936 kB\nMapped:           804196 kB\nShmem:             72156 kB\nKReclaimable:     224252 kB\nSlab:             422676 kB\nSReclaimable:     224252 kB\nSUnreclaim:       198424 kB\nKernelStack:       25792 kB\nPageTables:        63288 kB\nSecPageTables:         0 kB\nNFS_Unstable:          0 kB\nBounce:                0 kB\nWritebackTmp:          0 kB\nCommitLimit:    16342628 kB\nCommitted_AS:   50984000 kB\nVmallocTotal:   133143592960 kB\nVmallocUsed:      123500 kB\nVmallocChunk:          0 kB\nPercpu:            10240 kB\nCmaTotal:         786432 kB\nCmaAllocated:       8780 kB\nCmaReleased:      777652 kB\nCmaFree:          320496 kB\nHugePages_Total:       0\nHugePages_Free:        0\nHugePages_Rsvd:        0\nHugePages_Surp:        0\nHugepagesize:       2048 kB\nHugetlb:               0 kB"
+}

docs/measurements/16k-profile-20260922/environment-test.json

@@ -0,0 +1,20 @@
+{
+  "sysfs": {
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_governor": "performance",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_min_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_max_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_governor": "performance",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_min_freq": "2304000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_max_freq": "2304000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_governor": "performance",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_min_freq": "2352000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_max_freq": "2352000",
+    "/sys/class/devfreq/fdab0000.npu/governor": "performance",
+    "/sys/class/devfreq/fdab0000.npu/min_freq": "1000000000",
+    "/sys/class/devfreq/fdab0000.npu/max_freq": "1000000000",
+    "/sys/class/devfreq/dmc/governor": "performance",
+    "/sys/class/devfreq/dmc/min_freq": "2400000000",
+    "/sys/class/devfreq/dmc/max_freq": "2400000000"
+  },
+  "meminfo": "MemTotal:       16342632 kB\nMemFree:         9452440 kB\nMemAvailable:   13166396 kB\nBuffers:           83740 kB\nCached:          3835452 kB\nSwapCached:          768 kB\nActive:           906592 kB\nInactive:        3092096 kB\nActive(anon):      47596 kB\nInactive(anon):    96792 kB\nActive(file):     858996 kB\nInactive(file):  2995304 kB\nUnevictable:       14400 kB\nMlocked:               0 kB\nSwapTotal:       8171312 kB\nSwapFree:        5778992 kB\nZswap:                 0 kB\nZswapped:              0 kB\nDirty:                80 kB\nWriteback:             0 kB\nAnonPages:         93652 kB\nMapped:            89044 kB\nShmem:             64892 kB\nKReclaimable:     218464 kB\nSlab:             379228 kB\nSReclaimable:     218464 kB\nSUnreclaim:       160764 kB\nKernelStack:        4880 kB\nPageTables:         5332 kB\nSecPageTables:         0 kB\nNFS_Unstable:          0 kB\nBounce:                0 kB\nWritebackTmp:          0 kB\nCommitLimit:    16342628 kB\nCommitted_AS:    3814784 kB\nVmallocTotal:   133143592960 kB\nVmallocUsed:       92084 kB\nVmallocChunk:          0 kB\nPercpu:             6272 kB\nCmaTotal:         786432 kB\nCmaAllocated:       8780 kB\nCmaReleased:      777652 kB\nCmaFree:          320496 kB\nHugePages_Total:       0\nHugePages_Free:        0\nHugePages_Rsvd:        0\nHugePages_Surp:        0\nHugepagesize:       2048 kB\nHugetlb:               0 kB"
+}

docs/measurements/16k-profile-20260922/int8.result.json

@@ -0,0 +1,91 @@
+{
+  "mode": "int8",
+  "context": 32768,
+  "input_tokens": 16384,
+  "output_tokens": 64,
+  "sampling_interval_s": 0.1,
+  "events": {
+    "request_start": 411968.515409829,
+    "first_content": 412197.25641432,
+    "request_end": 412211.75429871
+  },
+  "npu_load_source": "/sys/kernel/debug/rknpu/load",
+  "finish_reason": "length",
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.641262,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 4.359712369150107,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 14450.494589000002,
+    "decode_ms": 14495.651608,
+    "decode_tokens_per_second": 4.346130943519017,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790040721-1",
+    "major_page_faults": 0,
+    "minor_page_faults": 2083,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 762,
+    "mla_npu_ms": 155815.12691300013,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 6261.60546875,
+    "prefill_eval_ms": 228688.91987900005,
+    "prefill_ms": 228697.054436,
+    "prefill_tokens_per_second": 71.64317365558777,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 16384,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 6261.60546875,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "profile-int8-1790040721134793678",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790040964,
+    "total_ms": 243201.586125,
+    "ttft_ms": 228705.803262,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 16384,
+      "total_tokens": 16448
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 16384,
+    "total_tokens": 16448
+  },
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/16k-profile-20260922/summary.json

@@ -0,0 +1,872 @@
+{
+  "bf16": {
+    "metrics": {
+      "cache_miss_reason": "disabled",
+      "cache_restore_ms": 1.642428,
+      "cache_save_ms": 0.0,
+      "cache_status": "disabled",
+      "cached_tokens": 0,
+      "common_prefix_tokens": 0,
+      "context_capacity_reached": false,
+      "context_length": 32768,
+      "continuation_save_ms": 0.0,
+      "continuation_skipped_budget": false,
+      "continuation_stored": false,
+      "continuation_tokens": 0,
+      "decode_compute_tokens_per_second": 4.26810375745384,
+      "decode_eval_count": 63,
+      "decode_eval_ms": 14760.653344000002,
+      "decode_ms": 14805.646728,
+      "decode_tokens_per_second": 4.255133271608884,
+      "effective_max_tokens": 64,
+      "finish_reason": "length",
+      "flow_control": "none",
+      "flow_wait_count": 0,
+      "flow_wait_ms": 0.0,
+      "generated_cached_tokens": 0,
+      "generated_state_lineage": false,
+      "id": "chatcmpl-1790040377-1",
+      "major_page_faults": 0,
+      "minor_page_faults": 2058,
+      "mla_cpu_calls": 390,
+      "mla_fallbacks": 0,
+      "mla_npu_calls": 762,
+      "mla_npu_ms": 210605.82986399997,
+      "model": "mindnano-ling3-tiny",
+      "peak_rss_mib": 7200.046875,
+      "prefill_eval_ms": 283108.78474800003,
+      "prefill_ms": 283118.206186,
+      "prefill_tokens_per_second": 57.87174712569826,
+      "prefix_cache_mib": 0.0,
+      "prefix_checkpoint_bytes": 0,
+      "prefix_checkpoint_count": 0,
+      "prefix_recompute_tokens": 0,
+      "prompt_evaluated_tokens": 16384,
+      "queue_ms": 0,
+      "requested_max_tokens": 64,
+      "reuse_generated_state": false,
+      "rss_mib": 7200.046875,
+      "sampling": {
+        "enable_thinking": false,
+        "repeat_penalty": 1.0,
+        "seed": 0,
+        "temperature": 0.0,
+        "top_k": 0,
+        "top_p": 1.0
+      },
+      "session_cache_bytes": 0,
+      "session_cache_evictions": 0,
+      "session_cache_skipped_budget": false,
+      "session_cache_stored": false,
+      "session_id": "profile-bf16-1790040377512878116",
+      "system_prefix_tokens": 8,
+      "timestamp": 1790040675,
+      "total_ms": 297932.614864,
+      "ttft_ms": 283126.834257,
+      "usage": {
+        "completion_tokens": 64,
+        "prompt_tokens": 16384,
+        "total_tokens": 16448
+      },
+      "warmed": true
+    },
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 16384,
+      "total_tokens": 16448
+    },
+    "sampler_error": null,
+    "stages": {
+      "prefill": {
+        "samples": 2711,
+        "interior_duration_s": 281.2550669920165,
+        "cpu": {
+          "cpu0": {
+            "mean": 0.9116421135108312,
+            "p95": 9.090909090909093,
+            "max": 54.54545454545454,
+            "min": 0.0
+          },
+          "cpu1": {
+            "mean": 1.4700822236794389,
+            "p95": 9.090909090909093,
+            "max": 54.54545454545454,
+            "min": 0.0
+          },
+          "cpu2": {
+            "mean": 2.5118762603711358,
+            "p95": 9.090909090909093,
+            "max": 60.0,
+            "min": 0.0
+          },
+          "cpu3": {
+            "mean": 0.4771656622786325,
+            "p95": 0.0,
+            "max": 63.63636363636363,
+            "min": 0.0
+          },
+          "cpu4": {
+            "mean": 83.97209219668899,
+            "p95": 90.9090909090909,
+            "max": 100.0,
+            "min": 63.63636363636363
+          },
+          "cpu5": {
+            "mean": 72.72041766769374,
+            "p95": 90.9090909090909,
+            "max": 100.0,
+            "min": 9.999999999999998
+          },
+          "cpu6": {
+            "mean": 71.7617586704062,
+            "p95": 90.9090909090909,
+            "max": 100.0,
+            "min": 0.0
+          },
+          "cpu7": {
+            "mean": 14.364965991257263,
+            "p95": 50.0,
+            "max": 60.0,
+            "min": 0.0
+          }
+        },
+        "process_cpu_percent": {
+          "mean": 240.70321905319364,
+          "p95": 270.8230237178778,
+          "max": 288.602237506844,
+          "min": 106.21811052021786
+        },
+        "npu": {
+          "core0": {
+            "mean": 12.636158344355458,
+            "p95": 13.0,
+            "max": 19.0,
+            "min": 0.0
+          },
+          "core1": {
+            "mean": 11.870733909545008,
+            "p95": 13.0,
+            "max": 21.0,
+            "min": 0.0
+          },
+          "core2": {
+            "mean": 12.077608407154674,
+            "p95": 13.0,
+            "max": 20.0,
+            "min": 0.0
+          }
+        },
+        "temperature_c": {
+          "mean": 67.20225470711578,
+          "p95": 68.384,
+          "max": 70.23,
+          "min": 54.538
+        },
+        "rss_mib": {
+          "mean": 7197.834941588325,
+          "p95": 7198.2421875,
+          "max": 7198.5,
+          "min": 7194.83203125
+        },
+        "max_process_swap_mib": 0.0,
+        "cpu_khz": {
+          "0": [
+            1800000
+          ],
+          "4": [
+            2304000
+          ],
+          "6": [
+            2352000
+          ]
+        },
+        "npu_hz": [
+          1000000000
+        ],
+        "dmc_hz": [
+          2400000000
+        ],
+        "npu_all_three_ge90_fraction": 0.0,
+        "npu_any_ge90_fraction": 0.0,
+        "a76_busy_cores": {
+          "mean": 2.428192345260462,
+          "p95": 2.75,
+          "max": 3.0414141414141413,
+          "min": 1.0
+        }
+      },
+      "prefill_last30": {
+        "samples": 271,
+        "interior_duration_s": 28.05183026503073,
+        "cpu": {
+          "cpu0": {
+            "mean": 0.2688066318026482,
+            "p95": 0.0,
+            "max": 9.090909090909093,
+            "min": 0.0
+          },
+          "cpu1": {
+            "mean": 0.1650101424546764,
+            "p95": 0.0,
+            "max": 9.090909090909093,
+            "min": 0.0
+          },
+          "cpu2": {
+            "mean": 2.9912419632761877,
+            "p95": 9.090909090909093,
+            "max": 9.999999999999998,
+            "min": 0.0
+          },
+          "cpu3": {
+            "mean": 0.06744496558552131,
+            "p95": 0.0,
+            "max": 9.090909090909093,
+            "min": 0.0
+          },
+          "cpu4": {
+            "mean": 85.12599184884506,
+            "p95": 90.9090909090909,
+            "max": 91.66666666666666,
+            "min": 63.63636363636363
+          },
+          "cpu5": {
+            "mean": 72.57149932710574,
+            "p95": 90.9090909090909,
+            "max": 91.66666666666666,
+            "min": 9.999999999999998
+          },
+          "cpu6": {
+            "mean": 71.96673285775329,
+            "p95": 90.9090909090909,
+            "max": 90.9090909090909,
+            "min": 0.0
+          },
+          "cpu7": {
+            "mean": 8.366140950873863,
+            "p95": 45.45454545454546,
+            "max": 54.54545454545454,
+            "min": 0.0
+          }
+        },
+        "process_cpu_percent": {
+          "mean": 236.41951121697102,
+          "p95": 270.7027451709863,
+          "max": 278.4376109776284,
+          "min": 106.21811052021786
+        },
+        "npu": {
+          "core0": {
+            "mean": 12.778646320886791,
+            "p95": 13.0,
+            "max": 14.0,
+            "min": 8.0
+          },
+          "core1": {
+            "mean": 11.476016733092514,
+            "p95": 13.0,
+            "max": 13.0,
+            "min": 8.0
+          },
+          "core2": {
+            "mean": 12.0444171549692,
+            "p95": 13.0,
+            "max": 13.0,
+            "min": 8.0
+          }
+        },
+        "temperature_c": {
+          "mean": 67.93146241955381,
+          "p95": 68.384,
+          "max": 69.307,
+          "min": 64.692
+        },
+        "rss_mib": {
+          "mean": 7198.250751695138,
+          "p95": 7198.2421875,
+          "max": 7198.5,
+          "min": 7198.2421875
+        },
+        "max_process_swap_mib": 0.0,
+        "cpu_khz": {
+          "0": [
+            1800000
+          ],
+          "4": [
+            2304000
+          ],
+          "6": [
+            2352000
+          ]
+        },
+        "npu_hz": [
+          1000000000
+        ],
+        "dmc_hz": [
+          2400000000
+        ],
+        "npu_all_three_ge90_fraction": 0.0,
+        "npu_any_ge90_fraction": 0.0,
+        "a76_busy_cores": {
+          "mean": 2.3803036498457795,
+          "p95": 2.7272727272727275,
+          "max": 2.868181818181818,
+          "min": 1.0
+        }
+      },
+      "decode": {
+        "samples": 121,
+        "interior_duration_s": 12.782317531004082,
+        "cpu": {
+          "cpu0": {
+            "mean": 7.2494741299370915,
+            "p95": 22.22222222222222,
+            "max": 45.45454545454546,
+            "min": 0.0
+          },
+          "cpu1": {
+            "mean": 3.912643142217936,
+            "p95": 36.36363636363637,
+            "max": 58.33333333333333,
+            "min": 0.0
+          },
+          "cpu2": {
+            "mean": 4.041498788858728,
+            "p95": 30.000000000000004,
+            "max": 55.55555555555556,
+            "min": 0.0
+          },
+          "cpu3": {
+            "mean": 3.0018665063409165,
+            "p95": 19.999999999999996,
+            "max": 63.63636363636363,
+            "min": 0.0
+          },
+          "cpu4": {
+            "mean": 75.43433910394856,
+            "p95": 81.81818181818181,
+            "max": 90.0,
+            "min": 60.0
+          },
+          "cpu5": {
+            "mean": 76.13240375844063,
+            "p95": 81.81818181818181,
+            "max": 90.0,
+            "min": 63.63636363636363
+          },
+          "cpu6": {
+            "mean": 80.45395947147252,
+            "p95": 90.0,
+            "max": 90.9090909090909,
+            "min": 70.0
+          },
+          "cpu7": {
+            "mean": 78.59016813826085,
+            "p95": 83.33333333333334,
+            "max": 90.9090909090909,
+            "min": 66.66666666666667
+          }
+        },
+        "process_cpu_percent": {
+          "mean": 308.9424112976011,
+          "p95": 334.5319427083788,
+          "max": 345.08531320685523,
+          "min": 254.43955323942478
+        },
+        "npu": {
+          "core0": {
+            "mean": 13.711681152650927,
+            "p95": 15.0,
+            "max": 15.0,
+            "min": 12.0
+          },
+          "core1": {
+            "mean": 13.71091804901339,
+            "p95": 15.0,
+            "max": 15.0,
+            "min": 12.0
+          },
+          "core2": {
+            "mean": 13.33182737376849,
+            "p95": 14.0,
+            "max": 14.0,
+            "min": 12.0
+          }
+        },
+        "temperature_c": {
+          "mean": 69.04744945196191,
+          "p95": 70.23,
+          "max": 70.23,
+          "min": 67.461
+        },
+        "rss_mib": {
+          "mean": 7200.046875,
+          "p95": 7200.046875,
+          "max": 7200.046875,
+          "min": 7200.046875
+        },
+        "max_process_swap_mib": 0.0,
+        "cpu_khz": {
+          "0": [
+            1800000
+          ],
+          "4": [
+            2304000
+          ],
+          "6": [
+            2352000
+          ]
+        },
+        "npu_hz": [
+          1000000000
+        ],
+        "dmc_hz": [
+          2400000000
+        ],
+        "npu_all_three_ge90_fraction": 0.0,
+        "npu_any_ge90_fraction": 0.0,
+        "a76_busy_cores": {
+          "mean": 3.1061087047212257,
+          "p95": 3.3363636363636364,
+          "max": 3.5272727272727273,
+          "min": 2.7272727272727275
+        }
+      }
+    },
+    "observed_npu_value_changes": 189
+  },
+  "int8": {
+    "metrics": {
+      "cache_miss_reason": "disabled",
+      "cache_restore_ms": 1.641262,
+      "cache_save_ms": 0.0,
+      "cache_status": "disabled",
+      "cached_tokens": 0,
+      "common_prefix_tokens": 0,
+      "context_capacity_reached": false,
+      "context_length": 32768,
+      "continuation_save_ms": 0.0,
+      "continuation_skipped_budget": false,
+      "continuation_stored": false,
+      "continuation_tokens": 0,
+      "decode_compute_tokens_per_second": 4.359712369150107,
+      "decode_eval_count": 63,
+      "decode_eval_ms": 14450.494589000002,
+      "decode_ms": 14495.651608,
+      "decode_tokens_per_second": 4.346130943519017,
+      "effective_max_tokens": 64,
+      "finish_reason": "length",
+      "flow_control": "none",
+      "flow_wait_count": 0,
+      "flow_wait_ms": 0.0,
+      "generated_cached_tokens": 0,
+      "generated_state_lineage": false,
+      "id": "chatcmpl-1790040721-1",
+      "major_page_faults": 0,
+      "minor_page_faults": 2083,
+      "mla_cpu_calls": 390,
+      "mla_fallbacks": 0,
+      "mla_npu_calls": 762,
+      "mla_npu_ms": 155815.12691300013,
+      "model": "mindnano-ling3-tiny",
+      "peak_rss_mib": 6261.60546875,
+      "prefill_eval_ms": 228688.91987900005,
+      "prefill_ms": 228697.054436,
+      "prefill_tokens_per_second": 71.64317365558777,
+      "prefix_cache_mib": 0.0,
+      "prefix_checkpoint_bytes": 0,
+      "prefix_checkpoint_count": 0,
+      "prefix_recompute_tokens": 0,
+      "prompt_evaluated_tokens": 16384,
+      "queue_ms": 0,
+      "requested_max_tokens": 64,
+      "reuse_generated_state": false,
+      "rss_mib": 6261.60546875,
+      "sampling": {
+        "enable_thinking": false,
+        "repeat_penalty": 1.0,
+        "seed": 0,
+        "temperature": 0.0,
+        "top_k": 0,
+        "top_p": 1.0
+      },
+      "session_cache_bytes": 0,
+      "session_cache_evictions": 0,
+      "session_cache_skipped_budget": false,
+      "session_cache_stored": false,
+      "session_id": "profile-int8-1790040721134793678",
+      "system_prefix_tokens": 8,
+      "timestamp": 1790040964,
+      "total_ms": 243201.586125,
+      "ttft_ms": 228705.803262,
+      "usage": {
+        "completion_tokens": 64,
+        "prompt_tokens": 16384,
+        "total_tokens": 16448
+      },
+      "warmed": true
+    },
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 16384,
+      "total_tokens": 16448
+    },
+    "sampler_error": null,
+    "stages": {
+      "prefill": {
+        "samples": 2186,
+        "interior_duration_s": 226.82875264098402,
+        "cpu": {
+          "cpu0": {
+            "mean": 3.190033704071436,
+            "p95": 9.999999999999998,
+            "max": 63.63636363636363,
+            "min": 0.0
+          },
+          "cpu1": {
+            "mean": 2.0593555380601223,
+            "p95": 9.090909090909093,
+            "max": 55.55555555555556,
+            "min": 0.0
+          },
+          "cpu2": {
+            "mean": 1.0668364473806766,
+            "p95": 9.090909090909093,
+            "max": 54.54545454545454,
+            "min": 0.0
+          },
+          "cpu3": {
+            "mean": 0.7942663239566917,
+            "p95": 0.0,
+            "max": 55.55555555555556,
+            "min": 0.0
+          },
+          "cpu4": {
+            "mean": 86.95497490105133,
+            "p95": 100.0,
+            "max": 100.0,
+            "min": 60.0
+          },
+          "cpu5": {
+            "mean": 75.56169423408855,
+            "p95": 100.0,
+            "max": 100.0,
+            "min": 11.111111111111116
+          },
+          "cpu6": {
+            "mean": 74.27095815676672,
+            "p95": 100.0,
+            "max": 100.0,
+            "min": 19.999999999999996
+          },
+          "cpu7": {
+            "mean": 17.936976400044003,
+            "p95": 50.0,
+            "max": 63.63636363636363,
+            "min": 0.0
+          }
+        },
+        "process_cpu_percent": {
+          "mean": 252.9000372840526,
+          "p95": 281.0343453372435,
+          "max": 290.75600310858556,
+          "min": 135.54321569560102
+        },
+        "npu": {
+          "core0": {
+            "mean": 8.497961034185657,
+            "p95": 11.0,
+            "max": 13.0,
+            "min": 6.0
+          },
+          "core1": {
+            "mean": 8.390116621609069,
+            "p95": 11.0,
+            "max": 14.0,
+            "min": 6.0
+          },
+          "core2": {
+            "mean": 8.659771930130951,
+            "p95": 12.0,
+            "max": 14.0,
+            "min": 6.0
+          }
+        },
+        "temperature_c": {
+          "mean": 69.1042196374582,
+          "p95": 70.23,
+          "max": 72.076,
+          "min": 61.923
+        },
+        "rss_mib": {
+          "mean": 6259.1302858772315,
+          "p95": 6259.54296875,
+          "max": 6260.05859375,
+          "min": 6256.1328125
+        },
+        "max_process_swap_mib": 0.0,
+        "cpu_khz": {
+          "0": [
+            1800000
+          ],
+          "4": [
+            2304000
+          ],
+          "6": [
+            2352000
+          ]
+        },
+        "npu_hz": [
+          1000000000
+        ],
+        "dmc_hz": [
+          2400000000
+        ],
+        "npu_all_three_ge90_fraction": 0.0,
+        "npu_any_ge90_fraction": 0.0,
+        "a76_busy_cores": {
+          "mean": 2.5472460369195056,
+          "p95": 2.9,
+          "max": 3.109090909090909,
+          "min": 1.4222222222222223
+        }
+      },
+      "prefill_last30": {
+        "samples": 271,
+        "interior_duration_s": 28.0351273129927,
+        "cpu": {
+          "cpu0": {
+            "mean": 3.5458929742734577,
+            "p95": 9.999999999999998,
+            "max": 18.181818181818176,
+            "min": 0.0
+          },
+          "cpu1": {
+            "mean": 0.22923978099244705,
+            "p95": 0.0,
+            "max": 9.090909090909093,
+            "min": 0.0
+          },
+          "cpu2": {
+            "mean": 0.0,
+            "p95": 0.0,
+            "max": 0.0,
+            "min": 0.0
+          },
+          "cpu3": {
+            "mean": 0.13451598622568586,
+            "p95": 0.0,
+            "max": 9.999999999999998,
+            "min": 0.0
+          },
+          "cpu4": {
+            "mean": 89.63772319001673,
+            "p95": 100.0,
+            "max": 100.0,
+            "min": 63.63636363636363
+          },
+          "cpu5": {
+            "mean": 76.30601640383126,
+            "p95": 100.0,
+            "max": 100.0,
+            "min": 11.111111111111116
+          },
+          "cpu6": {
+            "mean": 75.48294824867241,
+            "p95": 100.0,
+            "max": 100.0,
+            "min": 19.999999999999996
+          },
+          "cpu7": {
+            "mean": 11.118966549392773,
+            "p95": 50.0,
+            "max": 54.54545454545454,
+            "min": 0.0
+          }
+        },
+        "process_cpu_percent": {
+          "mean": 250.97085957370385,
+          "p95": 289.660407547599,
+          "max": 290.7321707398178,
+          "min": 135.54321569560102
+        },
+        "npu": {
+          "core0": {
+            "mean": 7.361752965870889,
+            "p95": 8.0,
+            "max": 9.0,
+            "min": 7.0
+          },
+          "core1": {
+            "mean": 7.088540242651115,
+            "p95": 8.0,
+            "max": 8.0,
+            "min": 7.0
+          },
+          "core2": {
+            "mean": 7.306253657463555,
+            "p95": 8.0,
+            "max": 8.0,
+            "min": 7.0
+          }
+        },
+        "temperature_c": {
+          "mean": 68.31621546224808,
+          "p95": 69.307,
+          "max": 70.23,
+          "min": 64.692
+        },
+        "rss_mib": {
+          "mean": 6259.549624614783,
+          "p95": 6259.54296875,
+          "max": 6260.05859375,
+          "min": 6259.54296875
+        },
+        "max_process_swap_mib": 0.0,
+        "cpu_khz": {
+          "0": [
+            1800000
+          ],
+          "4": [
+            2304000
+          ],
+          "6": [
+            2352000
+          ]
+        },
+        "npu_hz": [
+          1000000000
+        ],
+        "dmc_hz": [
+          2400000000
+        ],
+        "npu_all_three_ge90_fraction": 0.0,
+        "npu_any_ge90_fraction": 0.0,
+        "a76_busy_cores": {
+          "mean": 2.5254565439191317,
+          "p95": 2.9090909090909087,
+          "max": 3.0,
+          "min": 1.4222222222222223
+        }
+      },
+      "decode": {
+        "samples": 119,
+        "interior_duration_s": 12.45813832595013,
+        "cpu": {
+          "cpu0": {
+            "mean": 5.544687625883531,
+            "p95": 16.818181818181806,
+            "max": 30.000000000000004,
+            "min": 0.0
+          },
+          "cpu1": {
+            "mean": 3.1572634386762077,
+            "p95": 20.363636363636235,
+            "max": 60.0,
+            "min": 0.0
+          },
+          "cpu2": {
+            "mean": 2.3901098644112,
+            "p95": 19.090909090909033,
+            "max": 50.0,
+            "min": 0.0
+          },
+          "cpu3": {
+            "mean": 1.4197347260804165,
+            "p95": 9.090909090909093,
+            "max": 36.36363636363637,
+            "min": 0.0
+          },
+          "cpu4": {
+            "mean": 80.36134008938845,
+            "p95": 90.0,
+            "max": 91.66666666666666,
+            "min": 70.0
+          },
+          "cpu5": {
+            "mean": 80.29821904770955,
+            "p95": 90.0,
+            "max": 90.9090909090909,
+            "min": 70.0
+          },
+          "cpu6": {
+            "mean": 79.49032184878239,
+            "p95": 90.0,
+            "max": 90.9090909090909,
+            "min": 70.0
+          },
+          "cpu7": {
+            "mean": 79.79832350801284,
+            "p95": 90.0,
+            "max": 90.9090909090909,
+            "min": 66.66666666666667
+          }
+        },
+        "process_cpu_percent": {
+          "mean": 317.46316315671254,
+          "p95": 343.8993203409865,
+          "max": 355.21706636229163,
+          "min": 275.73030333083
+        },
+        "npu": {
+          "core0": {
+            "mean": 13.7566875361672,
+            "p95": 15.0,
+            "max": 15.0,
+            "min": 12.0
+          },
+          "core1": {
+            "mean": 13.89953521030507,
+            "p95": 15.0,
+            "max": 15.0,
+            "min": 12.0
+          },
+          "core2": {
+            "mean": 13.521365549424191,
+            "p95": 15.0,
+            "max": 15.0,
+            "min": 12.0
+          }
+        },
+        "temperature_c": {
+          "mean": 72.37917960062472,
+          "p95": 73.923,
+          "max": 73.923,
+          "min": 69.307
+        },
+        "rss_mib": {
+          "mean": 6261.605468749999,
+          "p95": 6261.60546875,
+          "max": 6261.60546875,
+          "min": 6261.60546875
+        },
+        "max_process_swap_mib": 0.0,
+        "cpu_khz": {
+          "0": [
+            1800000
+          ],
+          "4": [
+            2304000
+          ],
+          "6": [
+            2352000
+          ]
+        },
+        "npu_hz": [
+          1000000000
+        ],
+        "dmc_hz": [
+          2400000000
+        ],
+        "npu_all_three_ge90_fraction": 0.0,
+        "npu_any_ge90_fraction": 0.0,
+        "a76_busy_cores": {
+          "mean": 3.199482044938932,
+          "p95": 3.5007070707070707,
+          "max": 3.5590909090909086,
+          "min": 2.7939393939393944
+        }
+      }
+    },
+    "observed_npu_value_changes": 162
+  }
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-0-chinese.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 0,
+  "repeat": "chinese",
+  "events": {
+    "request_start": 456188.816388507,
+    "first_content": 456190.963557395,
+    "request_end": 456192.119949646
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.670428,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 18.432587130185446,
+    "decode_eval_count": 21,
+    "decode_eval_ms": 1139.286626,
+    "decode_ms": 1154.200015,
+    "decode_tokens_per_second": 18.194420141295875,
+    "effective_max_tokens": 64,
+    "finish_reason": "stop",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084941-12",
+    "major_page_faults": 32,
+    "minor_page_faults": 200,
+    "mla_cpu_calls": 138,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 12,
+    "mla_npu_ms": 171.94848100002855,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 1006632960,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 8161.9140625,
+    "prefill_eval_ms": 2108.897509,
+    "prefill_ms": 2108.936886,
+    "prefill_tokens_per_second": 156.95404759473308,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 331,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 6380.1015625,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-0-chinese1790084940435264828",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084944,
+    "total_ms": 3266.788975,
+    "ttft_ms": 2112.567085,
+    "usage": {
+      "completion_tokens": 22,
+      "prompt_tokens": 331,
+      "total_tokens": 353
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 22,
+    "prompt_tokens": 331,
+    "total_tokens": 353
+  },
+  "text": "缓存保存近期计算结果以快速响应用户请求，而索引帮助系统快速定位资料以支持问答。",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-1024-0.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 1024,
+  "repeat": 0,
+  "events": {
+    "request_start": 455800.524492545,
+    "first_content": 455806.249937804,
+    "request_end": 455810.033772762
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.523423,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 16.855708890999935,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 3737.6060780000003,
+    "decode_ms": 3781.566303,
+    "decode_tokens_per_second": 16.659763429249068,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084553-7",
+    "major_page_faults": 1,
+    "minor_page_faults": 272,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 42,
+    "mla_npu_ms": 890.8592660000002,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 62914560,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7257.9765625,
+    "prefill_eval_ms": 5688.080995,
+    "prefill_ms": 5688.179872,
+    "prefill_tokens_per_second": 180.02556589825775,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 1024,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7197.984375,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-1024-01790084552143379950",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084562,
+    "total_ms": 9472.748103,
+    "ttft_ms": 5691.058421,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 1024,
+      "total_tokens": 1088
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 1024,
+    "total_tokens": 1088
+  },
+  "text": "The number you've provided is a very long string of the digit **1**, specifically:\n\n**1111111111111111111111111111111111111111111",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-128-0.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 128,
+  "repeat": 0,
+  "events": {
+    "request_start": 455778.217041396,
+    "first_content": 455779.004366804,
+    "request_end": 455782.21085558
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.520799,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 19.975592616064677,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 3153.84886,
+    "decode_ms": 3204.224204,
+    "decode_tokens_per_second": 19.66154550650788,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084530-3",
+    "major_page_faults": 0,
+    "minor_page_faults": 314,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 0,
+    "mla_npu_ms": 0.0,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 0,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7197.38671875,
+    "prefill_eval_ms": 749.91185,
+    "prefill_ms": 749.926725,
+    "prefill_tokens_per_second": 170.6867280467698,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 128,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7197.38671875,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-128-01790084529835691085",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084534,
+    "total_ms": 3957.371323,
+    "ttft_ms": 753.034532,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 128,
+      "total_tokens": 192
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 128,
+    "total_tokens": 192
+  },
+  "text": "The number you've provided is a string of 111 ones:\n\n**1111111111111111111111111111111111111111111111",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-128-1.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 128,
+  "repeat": 1,
+  "events": {
+    "request_start": 455783.212983951,
+    "first_content": 455783.996650285,
+    "request_end": 455787.21142149
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.528673,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 19.88728216137581,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 3167.853681,
+    "decode_ms": 3212.47659,
+    "decode_tokens_per_second": 19.611037850395665,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084535-4",
+    "major_page_faults": 0,
+    "minor_page_faults": 16,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 0,
+    "mla_npu_ms": 0.0,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 0,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7197.390625,
+    "prefill_eval_ms": 746.5561180000001,
+    "prefill_ms": 746.570411,
+    "prefill_tokens_per_second": 171.4539562583827,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 128,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7197.390625,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-128-11790084534831820604",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084539,
+    "total_ms": 3961.73917,
+    "ttft_ms": 749.138909,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 128,
+      "total_tokens": 192
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 128,
+    "total_tokens": 192
+  },
+  "text": "The number you've provided is a string of 111 ones:\n\n**1111111111111111111111111111111111111111111111",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-128-2.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 128,
+  "repeat": 2,
+  "events": {
+    "request_start": 455788.213229017,
+    "first_content": 455789.008180291,
+    "request_end": 455792.231579269
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.56455,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 19.8304340067351,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 3176.9350069999996,
+    "decode_ms": 3221.085987,
+    "decode_tokens_per_second": 19.558620991262597,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084540-5",
+    "major_page_faults": 0,
+    "minor_page_faults": 8,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 0,
+    "mla_npu_ms": 0.0,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 0,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7197.390625,
+    "prefill_eval_ms": 758.0148969999999,
+    "prefill_ms": 758.029774,
+    "prefill_tokens_per_second": 168.86211670322888,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 128,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7197.390625,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-128-21790084539832181757",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084544,
+    "total_ms": 3981.815804,
+    "ttft_ms": 760.612563,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 128,
+      "total_tokens": 192
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 128,
+    "total_tokens": 192
+  },
+  "text": "The number you've provided is a string of 111 ones:\n\n**1111111111111111111111111111111111111111111111",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-128-warmup0.result.json

@@ -0,0 +1,90 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 128,
+  "repeat": "warmup0",
+  "events": {
+    "request_start": 455769.145641657,
+    "first_content": 455769.953634928,
+    "request_end": 455773.218449257
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.667219,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 19.58395001119543,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 3216.9199759999997,
+    "decode_ms": 3262.460505,
+    "decode_tokens_per_second": 19.310578596567563,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084521-1",
+    "major_page_faults": 9,
+    "minor_page_faults": 1093,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 0,
+    "mla_npu_ms": 0.0,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 0,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7195.33203125,
+    "prefill_eval_ms": 770.778052,
+    "prefill_ms": 770.793219,
+    "prefill_tokens_per_second": 166.0659636945656,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 128,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7195.33203125,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-128-warmup01790084521765028131",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084525,
+    "total_ms": 4036.661664,
+    "ttft_ms": 774.084781,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 128,
+      "total_tokens": 192
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 128,
+    "total_tokens": 192
+  },
+  "text": "The number you've provided is a string of 111 ones:\n\n**1111111111111111111111111111111111111111111111",
+  "passed": true
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-128-warmup1.result.json

@@ -0,0 +1,90 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 128,
+  "repeat": "warmup1",
+  "events": {
+    "request_start": 455773.219310576,
+    "first_content": 455774.013498827,
+    "request_end": 455777.215267703
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.480838,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 19.98250236303953,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 3152.7582910000015,
+    "decode_ms": 3199.438095,
+    "decode_tokens_per_second": 19.690957639860194,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084525-2",
+    "major_page_faults": 0,
+    "minor_page_faults": 313,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 0,
+    "mla_npu_ms": 0.0,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 0,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7196.359375,
+    "prefill_eval_ms": 757.241374,
+    "prefill_ms": 757.25654,
+    "prefill_tokens_per_second": 169.0346095642682,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 128,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7196.359375,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-128-warmup11790084525838699384",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084529,
+    "total_ms": 3959.868944,
+    "ttft_ms": 760.318262,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 128,
+      "total_tokens": 192
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 128,
+    "total_tokens": 192
+  },
+  "text": "The number you've provided is a string of 111 ones:\n\n**1111111111111111111111111111111111111111111111",
+  "passed": true
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-16384-0.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 16384,
+  "repeat": 0,
+  "events": {
+    "request_start": 455950.628072194,
+    "first_content": 456176.707612801,
+    "request_end": 456187.814361348
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.545882,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 6.062598492920985,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 10391.583753,
+    "decode_ms": 10435.555938,
+    "decode_tokens_per_second": 6.037052589655718,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084703-11",
+    "major_page_faults": 0,
+    "minor_page_faults": 952,
+    "mla_cpu_calls": 12,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 1140,
+    "mla_npu_ms": 159710.49429300014,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 1006632960,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 8161.9140625,
+    "prefill_eval_ms": 226028.90916399998,
+    "prefill_ms": 226036.530079,
+    "prefill_tokens_per_second": 72.48630301583347,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 16384,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7201.96875,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-16384-01790084702246849346",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084939,
+    "total_ms": 236480.440198,
+    "ttft_ms": 226044.768173,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 16384,
+      "total_tokens": 16448
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 16384,
+    "total_tokens": 16448
+  },
+  "text": "The number 1111111111111111111111111111111111111111111111111111111111111",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-2048-0.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 2048,
+  "repeat": 0,
+  "events": {
+    "request_start": 455811.035712419,
+    "first_content": 455823.824196503,
+    "request_end": 455828.418413266
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 2.82634,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 13.854736480869109,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 4547.181398000001,
+    "decode_ms": 4591.889189,
+    "decode_tokens_per_second": 13.719843272986262,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084563-8",
+    "major_page_faults": 22,
+    "minor_page_faults": 374,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 90,
+    "mla_npu_ms": 2995.6814800000006,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 125829120,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7322.2890625,
+    "prefill_eval_ms": 12748.942459,
+    "prefill_ms": 12749.451434,
+    "prefill_tokens_per_second": 160.64077523184937,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 2048,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7202.3125,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-2048-01790084562654593698",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084581,
+    "total_ms": 17345.997227,
+    "ttft_ms": 12753.984368,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 2048,
+      "total_tokens": 2112
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 2048,
+    "total_tokens": 2112
+  },
+  "text": "The number you've provided is a very long string of 1s. If you're looking for a specific property or calculation related to this number, please let me know what you'd like to know! For example:\n\n- Is it a prime number?\n- What is its binary representation?\n- What",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-4096-0.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 4096,
+  "repeat": 0,
+  "events": {
+    "request_start": 455829.420369547,
+    "first_content": 455858.497705999,
+    "request_end": 455864.166573134
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.528673,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 11.205954866329831,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 5622.010864000002,
+    "decode_ms": 5666.513311,
+    "decode_tokens_per_second": 11.117947941232675,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084582-9",
+    "major_page_faults": 0,
+    "minor_page_faults": 412,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 186,
+    "mla_npu_ms": 10669.514125999995,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 251658240,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7428.83203125,
+    "prefill_eval_ms": 29037.960202000002,
+    "prefill_ms": 29039.002072,
+    "prefill_tokens_per_second": 141.05673991928285,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 4096,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7189.01953125,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-4096-01790084581039276495",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084616,
+    "total_ms": 34709.565303,
+    "ttft_ms": 29042.925696,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 4096,
+      "total_tokens": 4160
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 4096,
+    "total_tokens": 4160
+  },
+  "text": "The number 1111111111111111111111111111111111111111111111111111111111111",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-512-0.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 512,
+  "repeat": 0,
+  "events": {
+    "request_start": 455793.233466424,
+    "first_content": 455796.026951758,
+    "request_end": 455799.522607724
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.518756,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 18.2647241578978,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 3449.271911,
+    "decode_ms": 3493.321101,
+    "decode_tokens_per_second": 18.034414294742497,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084545-6",
+    "major_page_faults": 15,
+    "minor_page_faults": 588,
+    "mla_cpu_calls": 390,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 18,
+    "mla_npu_ms": 267.490423,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 31457280,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7229.96875,
+    "prefill_eval_ms": 2756.413911,
+    "prefill_ms": 2756.460289,
+    "prefill_tokens_per_second": 185.74859093431704,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 512,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7200.0703125,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-512-01790084544852345078",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084552,
+    "total_ms": 6252.594311,
+    "ttft_ms": 2759.148373,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 512,
+      "total_tokens": 576
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 512,
+    "total_tokens": 576
+  },
+  "text": "The number you've provided is a very long string of the digit **1**, consisting of **127** ones.\n\nHere's a breakdown:\n\n- **Length**: 127 digits, all of which are `1`.\n- **Value**: This number is equal to  \n ",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/candidate-bf16-8192-0.result.json

@@ -0,0 +1,91 @@
+{
+  "label": "candidate",
+  "mode": "bf16",
+  "target_tokens": 8192,
+  "repeat": 0,
+  "events": {
+    "request_start": 455865.168485081,
+    "first_content": 455941.650157788,
+    "request_end": 455949.626029576
+  },
+  "metrics": {
+    "cache_miss_reason": "disabled",
+    "cache_restore_ms": 1.537424,
+    "cache_save_ms": 0.0,
+    "cache_status": "disabled",
+    "cached_tokens": 0,
+    "common_prefix_tokens": 0,
+    "context_capacity_reached": false,
+    "context_length": 32768,
+    "continuation_save_ms": 0.0,
+    "continuation_skipped_budget": false,
+    "continuation_stored": false,
+    "continuation_tokens": 0,
+    "decode_compute_tokens_per_second": 8.3745080032212,
+    "decode_eval_count": 63,
+    "decode_eval_ms": 7522.829995000001,
+    "decode_ms": 7569.617727,
+    "decode_tokens_per_second": 8.322745252416892,
+    "effective_max_tokens": 64,
+    "finish_reason": "length",
+    "flow_control": "none",
+    "flow_wait_count": 0,
+    "flow_wait_ms": 0.0,
+    "generated_cached_tokens": 0,
+    "generated_state_lineage": false,
+    "id": "chatcmpl-1790084617-10",
+    "major_page_faults": 0,
+    "minor_page_faults": 633,
+    "mla_cpu_calls": 12,
+    "mla_fallbacks": 0,
+    "mla_npu_calls": 756,
+    "mla_npu_ms": 43982.95758200004,
+    "mla_prefill_native_cache_bytes": 0,
+    "mla_prefill_native_cache_peak_bytes": 503316480,
+    "model": "mindnano-ling3-tiny",
+    "peak_rss_mib": 7660.67578125,
+    "prefill_eval_ms": 76438.775055,
+    "prefill_ms": 76441.712234,
+    "prefill_tokens_per_second": 107.17073885741378,
+    "prefix_cache_mib": 0.0,
+    "prefix_checkpoint_bytes": 0,
+    "prefix_checkpoint_count": 0,
+    "prefix_recompute_tokens": 0,
+    "prompt_evaluated_tokens": 8192,
+    "queue_ms": 0,
+    "requested_max_tokens": 64,
+    "reuse_generated_state": false,
+    "rss_mib": 7180.70703125,
+    "sampling": {
+      "enable_thinking": false,
+      "repeat_penalty": 1.0,
+      "seed": 0,
+      "temperature": 0.0,
+      "top_k": 0,
+      "top_p": 1.0
+    },
+    "session_cache_bytes": 0,
+    "session_cache_evictions": 0,
+    "session_cache_skipped_budget": false,
+    "session_cache_stored": false,
+    "session_id": "candidate-bf16-8192-01790084616787407779",
+    "system_prefix_tokens": 8,
+    "timestamp": 1790084701,
+    "total_ms": 84016.803552,
+    "ttft_ms": 76447.071196,
+    "usage": {
+      "completion_tokens": 64,
+      "prompt_tokens": 8192,
+      "total_tokens": 8256
+    },
+    "warmed": true
+  },
+  "usage": {
+    "completion_tokens": 64,
+    "prompt_tokens": 8192,
+    "total_tokens": 8256
+  },
+  "text": "The number 1111111111111111111111111111111111111111111111111111111111111",
+  "passed": true,
+  "sampler_error": null
+}

docs/measurements/benchmark-current-20260922/environment-after.json

@@ -0,0 +1,22 @@
+{
+  "sysfs": {
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_min_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_max_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_min_freq": "408000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_max_freq": "2304000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_min_freq": "408000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_max_freq": "2352000",
+    "/sys/class/devfreq/fdab0000.npu/governor": "rknpu_ondemand",
+    "/sys/class/devfreq/fdab0000.npu/min_freq": "300000000",
+    "/sys/class/devfreq/fdab0000.npu/max_freq": "1000000000",
+    "/sys/class/devfreq/dmc/governor": "dmc_ondemand",
+    "/sys/class/devfreq/dmc/min_freq": "534000000",
+    "/sys/class/devfreq/dmc/max_freq": "2400000000"
+  },
+  "matches_before": true,
+  "errors": [],
+  "meminfo": "MemTotal:       16342632 kB\nMemFree:         9660836 kB\nMemAvailable:   10573704 kB\nBuffers:          186508 kB\nCached:          2700736 kB\nSwapCached:          868 kB\nActive:          1206636 kB\nInactive:        2175568 kB\nActive(anon):      68168 kB\nInactive(anon):   524168 kB\nActive(file):    1138468 kB\nInactive(file):  1651400 kB\nUnevictable:       17796 kB\nMlocked:            3396 kB\nSwapTotal:       8171312 kB\nSwapFree:        5723440 kB\nZswap:                 0 kB\nZswapped:              0 kB\nDirty:               884 kB\nWriteback:             0 kB\nAnonPages:        513132 kB\nMapped:           322356 kB\nShmem:             93892 kB\nKReclaimable:     330576 kB\nSlab:             525984 kB\nSReclaimable:     330576 kB\nSUnreclaim:       195408 kB\nKernelStack:       15036 kB\nPageTables:        28016 kB\nSecPageTables:         0 kB\nNFS_Unstable:          0 kB\nBounce:                0 kB\nWritebackTmp:          0 kB\nCommitLimit:    16342628 kB\nCommitted_AS:    9386864 kB\nVmallocTotal:   133143592960 kB\nVmallocUsed:      112432 kB\nVmallocChunk:          0 kB\nPercpu:            12416 kB\nCmaTotal:         786432 kB\nCmaAllocated:       8780 kB\nCmaReleased:      777652 kB\nCmaFree:          422952 kB\nHugePages_Total:       0\nHugePages_Free:        0\nHugePages_Rsvd:        0\nHugePages_Surp:        0\nHugepagesize:       2048 kB\nHugetlb:               0 kB"
+}

docs/measurements/benchmark-current-20260922/environment-before.json

@@ -0,0 +1,27 @@
+{
+  "sysfs": {
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_min_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy0/scaling_max_freq": "1800000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_min_freq": "408000",
+    "/sys/devices/system/cpu/cpufreq/policy4/scaling_max_freq": "2304000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_governor": "ondemand",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_min_freq": "408000",
+    "/sys/devices/system/cpu/cpufreq/policy6/scaling_max_freq": "2352000",
+    "/sys/class/devfreq/fdab0000.npu/governor": "rknpu_ondemand",
+    "/sys/class/devfreq/fdab0000.npu/min_freq": "300000000",
+    "/sys/class/devfreq/fdab0000.npu/max_freq": "1000000000",
+    "/sys/class/devfreq/dmc/governor": "dmc_ondemand",
+    "/sys/class/devfreq/dmc/min_freq": "534000000",
+    "/sys/class/devfreq/dmc/max_freq": "2400000000"
+  },
+  "active_services": [
+    "mindnano-openai.service",
+    "mindnano-webui.service",
+    "mindnano-android-stream.service",
+    "gdm.service"
+  ],
+  "redroid_running": true,
+  "meminfo": "MemTotal:       16342632 kB\nMemFree:         8566064 kB\nMemAvailable:    9195264 kB\nBuffers:          183244 kB\nCached:          2423660 kB\nSwapCached:          812 kB\nActive:          1146648 kB\nInactive:        2660648 kB\nActive(anon):     102416 kB\nInactive(anon):  1199908 kB\nActive(file):    1044232 kB\nInactive(file):  1460740 kB\nUnevictable:       17916 kB\nMlocked:            3516 kB\nSwapTotal:       8171312 kB\nSwapFree:        5668656 kB\nZswap:                 0 kB\nZswapped:              0 kB\nDirty:               100 kB\nWriteback:             0 kB\nAnonPages:       1217360 kB\nMapped:           499716 kB\nShmem:            100444 kB\nKReclaimable:     333032 kB\nSlab:             559300 kB\nSReclaimable:     333032 kB\nSUnreclaim:       226268 kB\nKernelStack:       28724 kB\nPageTables:        71180 kB\nSecPageTables:         0 kB\nNFS_Unstable:          0 kB\nBounce:                0 kB\nWritebackTmp:          0 kB\nCommitLimit:    16342628 kB\nCommitted_AS:   54749148 kB\nVmallocTotal:   133143592960 kB\nVmallocUsed:      132744 kB\nVmallocChunk:          0 kB\nPercpu:            13216 kB\nCmaTotal:         786432 kB\nCmaAllocated:      72284 kB\nCmaReleased:      714148 kB\nCmaFree:          320412 kB\nHugePages_Total:       0\nHugePages_Free:        0\nHugePages_Rsvd:        0\nHugePages_Surp:        0\nHugepagesize:       2048 kB\nHugetlb:               0 kB"
+}