512 research outputs found
BabySpartan: Lasso-based SNARK for non-uniform computation
No full textLasso (Setty, Thaler, Wahby, ePrint 2023/1216) is a recent lookup argument that ensures that the prover cryptographically commits to only small values. This note describes BabySpartan, a SNARK for a large class of constraint systems that achieves the same property. The SNARK is a simple combination of SuperSpartan and Lasso. The specific class of constraint systems supported is a generalization of so-called Plonkish constraint systems (and a special case of customizable constraint systems (CCS)). Whereas a recent work called Jolt (Arun, Setty, and Thaler, ePrint 2023/1217) can be viewed as an application of Lasso to uniform computation, BabySpartan can be viewed as applying Lasso to non-uniform computation
Arun Shourie and his Christian critic
No full textCritique by Fr. Augustine Kanjamala on Arun Shourie's Missionaries in India and response to it by the author
Makespan reduction using dynamic job sequencing combined with buffer optimization applying genetic algorithm in a manufacturing system
No full textR16. Formulation and Evaluation of Doxorubicin HCl Nanoliposomes by Ethanol Injection Method
No full textCorresponding author (Pharmaceutics and Drug delivery): Arun Kumar Kotha, [email protected]://egrove.olemiss.edu/pharm_annual_posters/1015/thumbnail.jp
Jolt: SNARKs for Virtual Machines via Lookups
No full textSuccinct Non-interactive Arguments of Knowledge (SNARKs) allow an untrusted prover to establish that it correctly ran some witness-checking procedure on a witness. A zkVM (short for zero-knowledge Virtual Machine) is a SNARK that allows the witness-checking procedure to be specified as a computer program written in the assembly language of a specific instruction set architecture (ISA).
A converts computer programs into a lower-level representation such as an arithmetic circuit or generalization thereof. A SNARK for circuit-satisfiability can then be applied to the resulting circuit.
We describe a new front-end technique called Jolt that applies to a variety of ISAs. Jolt arguably realizes a vision called the , which seeks to produce circuits that only perform lookups into pre-determined lookup tables. The circuits output by Jolt primarily perform lookups into a gigantic lookup table, of size more than , that depends only on the ISA. The validity of the lookups are proved via a new called Lasso described in a companion work (Setty, Thaler, and Wahby, e-print 2023). Although size- tables are vastly too large to materialize in full, the tables arising in Jolt are structured, avoiding costs that grow linearly with the table size.
We describe performance and auditability benefits of Jolt compared to prior zkVMs, focusing on the popular RISC-V ISA as a concrete example. The dominant cost for the Jolt prover applied to this ISA (on -bit data types) is cryptographically committing to about six -bit field elements per step of the RISC-V CPU. This compares favorably to prior zkVM provers, even those focused on far simpler VMs
Understanding the value-chain of counterfeit products: A multimethod investigation
No full textThe student, - Sreekumar Arun, accepted the attached license on 2021-04-13 at 23:09.The student, - Sreekumar Arun, submitted this Dissertation for approval on 2021-04-13 at 23:23.This Dissertation was approved for publication on 2021-04-15 at 11:53.DSpace SAF Submission Ingestion Package generated from Vireo submission #16317 on 2021-09-16 at 17:03:02Made available in DSpace on 2021-09-17T02:34:25Z (GMT). No. of bitstreams: 2
SREEKUMARARUN-DISSERTATION-2021.pdf: 1165555 bytes, checksum: 5224c2afec936d334243407f8cdc4a58 (MD5)
LICENSE.txt: 4213 bytes, checksum: 6a931b7df048f222f1bf46543b830705 (MD5)
Previous issue date: 2021-04-15Embargo set by: Seth Robbins for item 118507
Lift date: 2023-09-17T02:34:57Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemAuthor requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemU of I OnlyThe context of this dissertation is the market for counterfeit products, which accounts for more than one trillion US dollars of trade globally every year. Entrepreneurs who manufacture and market these products are clandestine and operate in the black market. Drawing from this context, this dissertation seeks to advance knowledge on how entrepreneurs strategically use ambiguity in marketing communications, and in relationships with other firms. The first essay examines how and why equivocation is used as a persuasive strategy by sellers of counterfeit products. This essay develops a framework that can help qualitatively and quantitatively identify equivocation rhetoric in firm-generated text. The second essay examines how relationships between firms are managed when one of the firms employs ambiguity as a protection strategy. Specifically, the essay sheds light on how manufacturers and retailers of counterfeit products succeed in maintaining ambiguity, and in managing relationship tension arising from ambiguity. Put together, the essays present an investigation of how counterfeit manufacturers and retailers conduct their marketing functions despite being clandestine and illegal.Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2023-05-0
Author Correction: A shared neural basis underlying psychiatric comorbidity
No full textCorrection to: Nature Medicine. Published online 24 April 2023. In the version of this article initially published, the STRATIFY data also included cohort data from the ESTRA consortium, though this was not acknowledged in the author list and the section in Methods on the Stratify dataset. The Methods are now updated, and the author list is amended to combine the STRATIFY and ESTRA consortium names and to include the following authors: Marina Bobou, M. John Broulidakis, Betteke Maria van Noort, Zuo Zhang, Lauren Robinson, Nilakshi Vaidya, Jeanne Winterer, Yuning Zhang, Sinead King, Hervé Lemaître, Ulrike Schmidt, Julia Sinclair, Argyris Stringaris and Sylvane Desrivières. The STRATIFY and ESTRA consortia are now combined to list Marina Bobou, M. John Broulidakis, Betteke Maria van Noort, Zuo Zhang, Lauren Robinson, Nilakshi Vaidya, Jeanne Winterer, Yuning Zhang, Sinead King, Gareth J. Barker, Arun L. W. Bokde, Hervé Lemaître, Frauke Nees, Dimitri Papadopoulos Orfanos, Ulrike Schmidt, Julia Sinclair, Argyris Stringaris, Henrik Walter, Robert Whelan, Sylvane Desrivières and Gunter Schumann as members, and the IMAGEN consortium is updated to also include Sylvane Desrivières. Affiliations, author contributions and acknowledgements have been updated to reflect the new authorship, and all changes have been made in the HTML and PDF versions of the article
Verifying Jolt zkVM Lookup Semantics
No full textLookups are a popular way to express repeated constraints in state-of-the art SNARKs. This is especially the case for zero-knowledge virtual machines (zkVMs), which produce succinct proofs of correct execution for programs expressed as bytecode according to a specific instruction set architecture (ISA). The Jolt zkVM (Arun, Setty & Thaler, Eurocrypt 2024) for RISC-V ISA employs Lasso (Setty, Thaler & Wahby, Eurocrypt 2024), an efficient lookup argument for massive structured tables, to prove correct execution of instructions. Internally, Lasso performs multiple lookups into smaller subtables, then combines the results.
We present an approach to formally verify Lasso-style lookup arguments against the semantics of instruction set architectures. We demonstrate our approach by formalizing and verifying all Jolt 32-bit instructions corresponding to the RISC-V base instruction set (RV32I) using the ACL2 theorem proving system. Our formal ACL2 model has undergone extensive validation against the Rust implementation of Jolt. Due to ACL2\u27s bit-blasting, rewriting, and developer-friendly features, our formalization is highly automated.
Through formalization, we also discovered optimizations to the Jolt codebase, leading to improved efficiency without impacting correctness or soundness. In particular, we removed one unnecessary lookup each for four instructions, and reduced the sizes of three subtables by 87.5\%
Nebula: Efficient read-write memory and switchboard circuits for folding schemes
No full textFolding schemes enable prover-efficient incrementally verifiable computation (IVC), where a proof is generated step-by-step, resulting in a space-efficient prover that naturally supports continuations. These attributes make them a promising choice for proving long-running machine executions (popularly, zkVMs ). A major problem is designing an efficient read-write memory. Another challenge is overheads incurred by unused machine instructions when incrementally proving a program execution step.
Nebula addresses these with new techniques that can paired with modern folding schemes. First, we introduce commitment-carrying IVC, where a proof carries an incremental commitment to the prover’s non-deterministic advice provided at different steps. Second, we show how this unlocks efficient read-write memory (which implies indexed lookups) with a cost-profile identical to that of non-recursive arguments. Third, we provide a new universal switchboard circuit construction that combines circuits of different instructions such that one can turn off uninvoked circuit elements and constraints, offering a new way to achieve pay-per-use prover costs.
We implement a prototype of a Nebula-based zkVM for the Ethereum virtual machine (EVM). We find that Nebula’s techniques qualitatively provide a smaller constraint system to represent the EVM over standard memory-checking techniques, and lead to over faster proof generation for the standard ERC20 token transfer transaction
Seismic Velocities of the Whitestone Anorthosite and its Mylonitized Equivalents in the Parry Sound Shear Zone
No full textTitle: Seismic Velocities of the Whitestone Anorthosite and its Mylonitized Equivalents in the Parry Sound Shear Zone, Author: Arun Sen, Location: ThodeCompressional wave velocities of the Whitestone anorthosite and its mylonitic equivalent in the Parry Sound shear zone have been measured in the field and to two kilobars in a laboratory confining pressure vessel. Mylonitiztion of the anorthosite has resulted in a preferred orientation of constituent minerals and retrograde mineral assemblages. A seimic anisotropy is consequently developed in the mylonite such that the P-wave velocitites are lower for propagation directions perpendicular to mylonite than for its anorthosite protolith. In the field, rock weathering and surface fractures control velocity variations. At low confining pressure (shallow depth) the P-wave velocity anisotropy is controlled by fracturing which is in turn related to the mylonitic fabric. At approximately one kilobar pressure (depths close to five kilometres) where fractures and porosity are insignificant, the P-wave anisotropy is due solely to the aggregate mineral velocities and their solution and their orientations. The undeformed Whitestone anorthosite has an average P-wave velocity of 7.02 km/s measured in three perpendicular directions at 2 kilobars confining pressure. The mylonite has the following P-wave velocities at 2 kilobars confining pressure: 6.83 km/s parallel to both foliation and lineation, 6.70 km/s parallel to foliation and perpendicular to lineation, and 6.57 km/s perpendicular to foliation.ThesisBachelor of Science (BSc
- …
