{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q3TTYJQLIEQPGLPDYPTOF2WXOE","short_pith_number":"pith:Q3TTYJQL","schema_version":"1.0","canonical_sha256":"86e73c260b4120f32de3c3e6e2ead7711a83c69717fadba6d214238fe294721a","source":{"kind":"arxiv","id":"2008.05555","version":1},"attestation_state":"computed","paper":{"title":"Compiling a Higher-Order Smart Contract Language to LLVM","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Amrit Kumar, Anton Trunov, George P\\^irlea, Ilya Sergey, Jacob Johannsen, Vaivaswatha Nagaraj","submitted_at":"2020-08-12T20:06:33Z","abstract_excerpt":"Scilla is a higher-order polymorphic typed intermediate level language for implementing smart contracts. In this talk, we describe a Scilla compiler targeting LLVM, with a focus on mapping Scilla types, values, and its functional language constructs to LLVM-IR.\n  The compiled LLVM-IR, when executed with LLVM's JIT framework, achieves a speedup of about 10x over the reference interpreter on a typical Scilla contract. This reduced latency is crucial in the setting of blockchains, where smart contracts are executed as parts of transactions, to achieve peak transactions processed per second. Exper"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2008.05555","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2020-08-12T20:06:33Z","cross_cats_sorted":[],"title_canon_sha256":"3a2d6d251b1351feaf1efd98e5da84130d5042e052a02d79084b0e38c0f642c3","abstract_canon_sha256":"22b9130dc739ad347e6bb727d8247bfb9a5a5a9817afc258fdc81002a9bd3a3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:54.657838Z","signature_b64":"KGbtiKkdjTsdDTwEe185HOJ0w071I3+f3vf9TEdn9HYMJ1eW3Sdf0A3yn8t9PvyyNrIi1yHxdzv3frbNp5KSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86e73c260b4120f32de3c3e6e2ead7711a83c69717fadba6d214238fe294721a","last_reissued_at":"2026-07-05T01:26:54.657353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:54.657353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compiling a Higher-Order Smart Contract Language to LLVM","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Amrit Kumar, Anton Trunov, George P\\^irlea, Ilya Sergey, Jacob Johannsen, Vaivaswatha Nagaraj","submitted_at":"2020-08-12T20:06:33Z","abstract_excerpt":"Scilla is a higher-order polymorphic typed intermediate level language for implementing smart contracts. In this talk, we describe a Scilla compiler targeting LLVM, with a focus on mapping Scilla types, values, and its functional language constructs to LLVM-IR.\n  The compiled LLVM-IR, when executed with LLVM's JIT framework, achieves a speedup of about 10x over the reference interpreter on a typical Scilla contract. This reduced latency is crucial in the setting of blockchains, where smart contracts are executed as parts of transactions, to achieve peak transactions processed per second. Exper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.05555","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.05555/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2008.05555","created_at":"2026-07-05T01:26:54.657411+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.05555v1","created_at":"2026-07-05T01:26:54.657411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.05555","created_at":"2026-07-05T01:26:54.657411+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3TTYJQLIEQP","created_at":"2026-07-05T01:26:54.657411+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3TTYJQLIEQPGLPD","created_at":"2026-07-05T01:26:54.657411+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3TTYJQL","created_at":"2026-07-05T01:26:54.657411+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.08591","citing_title":"OpenMLDB: A Real-Time Relational Data Feature Computation System for Online ML","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q3TTYJQLIEQPGLPDYPTOF2WXOE","json":"https://pith.science/pith/Q3TTYJQLIEQPGLPDYPTOF2WXOE.json","graph_json":"https://pith.science/api/pith-number/Q3TTYJQLIEQPGLPDYPTOF2WXOE/graph.json","events_json":"https://pith.science/api/pith-number/Q3TTYJQLIEQPGLPDYPTOF2WXOE/events.json","paper":"https://pith.science/paper/Q3TTYJQL"},"agent_actions":{"view_html":"https://pith.science/pith/Q3TTYJQLIEQPGLPDYPTOF2WXOE","download_json":"https://pith.science/pith/Q3TTYJQLIEQPGLPDYPTOF2WXOE.json","view_paper":"https://pith.science/paper/Q3TTYJQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.05555&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3TTYJQLIEQPGLPDYPTOF2WXOE/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3TTYJQLIEQPGLPDYPTOF2WXOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3TTYJQLIEQPGLPDYPTOF2WXOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3TTYJQLIEQPGLPDYPTOF2WXOE/action/storage_attestation","attest_author":"https://pith.science/pith/Q3TTYJQLIEQPGLPDYPTOF2WXOE/action/author_attestation","sign_citation":"https://pith.science/pith/Q3TTYJQLIEQPGLPDYPTOF2WXOE/action/citation_signature","submit_replication":"https://pith.science/pith/Q3TTYJQLIEQPGLPDYPTOF2WXOE/action/replication_record"}},"created_at":"2026-07-05T01:26:54.657411+00:00","updated_at":"2026-07-05T01:26:54.657411+00:00"}