Unverified50% confidenceFactExact time
Code 128's mod 103 check character algorithm is: add the start character value plus the cumulative value of each data character (weighted by code set), then multiply by position weight (the start character has weight 1, increasing thereafter), and finally take the result modulo 103 to obtain the check character value.
1
Sources
50%
Confidence
Long-term
Relevance
10/19/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedWhether the Code128 check character must be encoded depends on the specific implementation and reader behavior; many lightweight generators omit it, and some decoders can still output data when the check character is missing but do not perform verification.65% similarUnverifiedIn large model invocations, text and code in both input and output are converted into token counts.65% similarUnverifiedThe root cause is that the generator wrote the raw string BIN-7742-A directly into the barcode, and the scanning side interpreted the leading B as the start character of Code 128 Code Set B, causing the overall parsing context of subsequent characters to shift.64% similarUnverifiedIn autocomplete functionality testing, approximately 81 lines of code were written with Ponytail disabled, while only 14 lines were needed with it enabled (using the HTML native datalist element).64% similarUnverifiedWord counting should be implemented in code as a unit-testable function, something that a prompt cannot achieve64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1067451API
curl https://kongchang.com/api/v1/knowledge/claims/1067451MCP
get_claim(id=1067451)