Computer science conferences should require tamper-evident, nonrepudiable experimental attestations via a proof-of-compute layer, demonstrated by the K-Veritas reference implementation.
Token value inequality in reasoning traces enables identifying core versus redundant tokens via log probabilities, yielding 76% token reduction with preserved accuracy via selective compression.