Unverified50% confidenceFactExact time
Kirchenbauer方案通常将前一个token的ID与保密密钥拼接后输入哈希函数（如SHA-256）生成伪随机数种子，前γ比例（通常γ=0.5）的token归入绿名单
1
Sources
50%
Confidence
Long-term
Relevance
8/23/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe green list/red list scheme works by using the previous token as a hash seed at each token generation step to divide the vocabulary into a green list and a red list, applying a positive logit bias to green-list tokens, and detecting whether the proportion of green-list tokens is significantly above 50% during verification.61% similarUnverifiedWhen generating each token, the watermarking algorithm randomly partitions the vocabulary into a green list and a red list based on a hash of the preceding context, and slightly increases the probability of green list tokens being selected.59% similarUnverified为运行状态生成唯一哈希值通常采用MD5或SHA-256算法，序列化需规范化处理（字典键值排序、浮点数截断精度）以避免语义等价状态生成不同哈希值57% similarUnverifiedAPI signature mechanisms generate a unique signature string by sorting request parameters and combining them with a timestamp, nonce, and key using a hashing algorithm (such as MD5 or HMAC-SHA256).51% similarUnverifiedKruskal 算法基于并查集按边权排序，Prim 算法类似 Dijkstra 的节点扩展策略，两者均可在 O(ElogE) 内求解最小生成树51% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/789699API
curl https://kongchang.com/api/v1/knowledge/claims/789699MCP
get_claim(id=789699)