Constraint-Level Design of zkEVMs: Architectures, Trade-offs, and Evolution

• URL: http://arxiv.org/abs/2510.05376v1
• Date: Mon, 06 Oct 2025 21:10:11 GMT
• Title: Constraint-Level Design of zkEVMs: Architectures, Trade-offs, and Evolution
• Abstract summary: Zero-knowledge Virtual Machines (zkEVMs) must reconcile a fundamental contradiction: the Virtual Machine was designed for transparent sequential execution, while zero-knowledge proofs require circuit representations.<n>This survey provides the first systematic analysis of how existing major production zkEVM implementations resolve this tension through distinct constraint engineering strategies.
• Score: 3.724127405825709
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Zero-knowledge Ethereum Virtual Machines (zkEVMs) must reconcile a fundamental contradiction: the Ethereum Virtual Machine was designed for transparent sequential execution, while zero-knowledge proofs require algebraic circuit representations. This survey provides the first systematic analysis of how existing major production zkEVM implementations resolve this tension through distinct constraint engineering strategies. We develop a comparative framework that maps the design space across three architectural dimensions. First, arithmetization schemes reveal stark trade-offs: R1CS requires compositional gadget libraries, PLONKish achieves elegance through custom gates that capture complex EVM opcodes in single constraints, while the homogeneous structure of AIR fundamentally mismatches the irregular instruction set of EVM. Second, dispatch mechanisms determine constraint activation patterns: selector-based systems waste trace width on inactive constraints, while ROM-based approaches trade memory lookups for execution flexibility. Third, the Type 1-4 spectrum quantifies an inescapable trade-off: the bit-level EVM compatibility of Type 1 demands significantly higher constraint complexity than the custom instruction sets of Type 4. Beyond cataloging implementations, we identify critical open problems across multiple domains: performance barriers preventing sub-second proving, absence of formal verification for constraint-to-EVM semantic equivalence, lack of standardized benchmarking frameworks, and architectural gaps in hybrid zkEVM/zkVM designs, decentralized prover coordination, privacy preservation, and interoperability.

Related papers

• Agentic Designer: Progressive Multi-Agent Collaboration for Structure-Aware Interior Layout Generation [84.5255199507027]
  Agentic Designer is a progressive framework that formulates structure-aware interior layout generation as an iterative and constraint-verified decision process.<n>By layout decomposing into modular stages of proposal, verification, synthesis and adjustment, the framework coordinates three specialized agents, a Generator, an Evaluator, and a Refiner.<n>This mechanism enforces stepwise geometric validation and correction before each placement is committed, thereby preventing error accumulation.
  arXiv  Detail & Related papers  (2026-07-23T02:46:11Z)
• Controller-Augmented Hidden Markov Models: A Computational Framework for Constrained Sequential Inference [0.0]
  We present Controller-Augmented Hidden Markov Models (CHMMs)<n>CHMMs is a framework that compiles each constraint into a finite-state controller tracking the minimal sufficient history.<n>We evaluate CHMMs against 6 alternative decoders on 3 real-world sequence-labeling tasks.
  arXiv  Detail & Related papers  (2026-06-11T19:29:09Z)
• The Illusion of Multi-Agent Advantage [63.92466143571383]
  We show that expert-architected Multi-Agent Systems (MAS) consistently outperforms automatically generated architectures in raw performance and cost-efficiency.<n>Existing evaluation frameworks mask critical architectural gaps and inefficiencies by failing to account for the marginal utility of increased computational cost.
  arXiv  Detail & Related papers  (2026-06-11T07:39:24Z)
• RefEvo: Agentic Design with Co-Evolutionary Verification for Agile Reference Model Generation [17.822629270807283]
  RefEvo is a dynamic multi-agent framework designed for agile and reliable reference modeling.<n>We show how RefEvo achieves a 95% pass rate, outperforming static baselines by a large margin.
  arXiv  Detail & Related papers  (2026-04-27T09:22:02Z)
• HeBA: Heterogeneous Bottleneck Adapters for Robust Vision-Language Models [3.8707695363745214]
  Heterogeneous Bottleneck Adapter (HeBA) is a unified architectural framework that introduces modality-specific inductive biases.<n>HeBA processes visual tokens via 2D depthwise-separable convolutions to preserve spatial correlations.<n>Unlike standard expanding adapters, HeBA employs a compression bottleneck that explicitly forces the model to learn compact, robust features.
  arXiv  Detail & Related papers  (2026-03-17T15:23:04Z)
• Architecture-Aware Multi-Design Generation for Repository-Level Feature Addition [53.50448142467294]
  RAIM is a multi-design and architecture-aware framework for repository-level feature addition.<n>It shifts away from linear patching by generating multiple diverse implementation designs.<n>Experiments on the NoCode-bench Verified dataset demonstrate that RAIM establishes a new state-of-the-art performance.
  arXiv  Detail & Related papers  (2026-03-02T12:50:40Z)
• VEQ: Modality-Adaptive Quantization for MoE Vision-Language Models [41.557274086591924]
  Post-Training Quantization (PTQ) is an effective training-free technique to address the massive memory and computation overhead.<n>Visual Expert Quantization (VEQ) is a dual-aware quantization framework designed to accommodate cross-modal differences and heterogeneity between experts.<n>Our method achieves significant average accuracy gains of 2.04% on Kimi-VL and 3.09% on Qwen3-VL compared to the previous SOTA quantization methods.
  arXiv  Detail & Related papers  (2026-02-01T05:53:09Z)
• Steering to Say No: Configurable Refusal via Activation Steering in Vision Language Models [26.60985401108749]
  We develop textbfConfigurable textbfRefusal in textbfVLMs (textbfCR-VLM)<n>CR-VLM consists of three integrated components: (1) extracting a refusal vector via a teacher-forced mechanism to amplify the refusal signal; (2) introducing a gating mechanism that mitigates over-refusal by preserving acceptance for in-scope queries; and (3) designing a counterfactual vision enhancement module that aligns visual representations with refusal requirements.
  arXiv  Detail & Related papers  (2026-01-31T10:54:33Z)
• Why Does the LLM Stop Computing: An Empirical Study of User-Reported Failures in Open-Source LLMs [50.075587392477935]
  We conduct the first large-scale empirical study of 705 real-world failures from the open-source DeepSeek, Llama, and Qwen ecosystems.<n>Our analysis reveals a paradigm shift: white-box orchestration relocates the reliability bottleneck from model algorithmic defects to the systemic fragility of the deployment stack.
  arXiv  Detail & Related papers  (2026-01-20T06:42:56Z)
• CSMCIR: CoT-Enhanced Symmetric Alignment with Memory Bank for Composed Image Retrieval [54.15776146365823]
  Composed Image Retrieval (CIR) enables users to search for target images using both a reference image and manipulation text.<n>We propose CSMCIR, a unified representation framework that achieves efficient query-target alignment through three synergistic components.
  arXiv  Detail & Related papers  (2026-01-07T09:21:38Z)
• MEIC-DT: Memory-Efficient Incremental Clustering for Long-Text Coreference Resolution with Dual-Threshold Constraints [42.81232562487108]
  textbfMEIC-DT is a memory-efficient incremental clustering approach based on a lightweight Transformer.<n>We show that MEIC-DT achieves highly competitive coreference performance under stringent memory constraints.
  arXiv  Detail & Related papers  (2025-12-31T08:26:34Z)
• SCoTER: Structured Chain-of-Thought Transfer for Enhanced Recommendation [24.019381388104236]
  We propose SCoTER, a unified framework that treats pattern discovery and structure-aware transfer as a jointly optimized problem.<n>Specifically, SCoTER operationalizes this through two synergistic components: a GVM pipeline for automated pattern discovery and a structure-preserving integration architecture that transfers stepwise logic to efficient models.
  arXiv  Detail & Related papers  (2025-11-24T03:00:04Z)
• Localized Kernel Projection Outlyingness: A Two-Stage Approach for Multi-Modal Outlier Detection [0.0]
  Two-Stage LKPLO is a novel multi-stage outlier detection framework.<n>It overcomes the coexisting limitations of conventional projection-based methods.<n>It achieves state-of-the-art performance on challenging datasets.
  arXiv  Detail & Related papers  (2025-10-28T03:53:46Z)
• OmniEVA: Embodied Versatile Planner via Task-Adaptive 3D-Grounded and Embodiment-aware Reasoning [50.45036742963495]
  We introduce OmniEVA, an embodied versatile planner that enables advanced embodied reasoning and task planning.<n>A Task-Adaptive 3D Grounding mechanism enables context-aware 3D grounding for diverse embodied tasks.<n>An Embodiment-Aware Reasoning framework incorporates task goals and embodiment constraints into the reasoning loop, resulting in planning decisions that are both goal-directed and executable.
  arXiv  Detail & Related papers  (2025-09-11T10:32:22Z)
• Hierarchy-Consistent Learning and Adaptive Loss Balancing for Hierarchical Multi-Label Classification [8.889313669713918]
  HMC faces challenges in maintaining structural consistency and balancing loss weighting in Multi-Task Learning.<n>We propose a classifier called HCAL based on MTL integrated with prototype contrastive learning and adaptive task-weighting mechanisms.
  arXiv  Detail & Related papers  (2025-08-19T02:15:41Z)
• Efficient Multi-Instance Generation with Janus-Pro-Dirven Prompt Parsing [53.295515505026096]
  Janus-Pro-driven Prompt Parsing is a prompt- parsing module that bridges text understanding and layout generation.<n>MIGLoRA is a parameter-efficient plug-in integrating Low-Rank Adaptation into UNet (SD1.5) and DiT (SD3) backbones.<n>The proposed method achieves state-of-the-art performance on COCO and LVIS benchmarks while maintaining parameter efficiency.
  arXiv  Detail & Related papers  (2025-03-27T00:59:14Z)
• HyperVQ: MLR-based Vector Quantization in Hyperbolic Space [56.4245885674567]
  A common solution is to employ Vector Quantization (VQ) within VQ Variational Autoencoders (VQVAEs)<n>We introduce HyperVQ, a novel approach that formulates VQ as a hyperbolic Multinomial Logistic Regression (MLR) problem.<n>Our experiments demonstrate that HyperVQ matches traditional VQ in generative and reconstruction tasks, while surpassing it in discriminative performance.
  arXiv  Detail & Related papers  (2024-03-18T03:17:08Z)
• Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI [108.08079323459822]
  This paper studies a new multi-intelligent edge artificial-latency (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) We measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain.
  arXiv  Detail & Related papers  (2022-07-03T06:57:07Z)
• Squeezeformer: An Efficient Transformer for Automatic Speech Recognition [99.349598600887]
  Conformer is the de facto backbone model for various downstream speech tasks based on its hybrid attention-convolution architecture. We propose the Squeezeformer model, which consistently outperforms the state-of-the-art ASR models under the same training schemes.
  arXiv  Detail & Related papers  (2022-06-02T06:06:29Z)
• Tensor Completion with Provable Consistency and Fairness Guarantees for Recommender Systems [5.099537069575897]
  We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. We show that a single property/constraint: preserving unit-scale consistency, guarantees the existence of both a solution and, under relatively weak support assumptions, uniqueness.
  arXiv  Detail & Related papers  (2022-04-04T19:42:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.