Proof linking: distributed verification of java classfiles in the presence of multiple classloaders
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The standard JVM invokes a complex, resource-consuming, bytecode verifier to ensure the type-safety of untrusted code. Such protection mechanism is unpractical for VM's deployed on small devices or built for high-performance applications. This motivates the need for distributed verification systems, in which a mobile code runtime environment shares some or all of its verification burden with certain remotely located parties in order to establish the trust of a mobile program. This paper advocates the adoption of a previously-proposed mobile code verification architecture, Proof Linking, as a standard intrastructure for performing distributed verification in the JVM. Proof Linking not only supports both CLDC-style and signature-based distributed verification protocols, but it also provides interoperability between the two. We also extend our previous work to account for the presence of multiple classloaders, thereby allowing Proof Linking to be adopted not only by CLDC-compliant devices,...
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it