- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
HierRTL builds a node–register-cone–design hierarchy from elaborated RTL and runs a Graph U-Net over it. The model is jointly trained on design-level PPA (area/power/WNS/TNS) and per-register setup slack (Stage I), then fine-tuned with a listwise loss to rank editable regions within a design using labels from LLM-generated, formally verified rewrites evaluated with a commercial flow (Stage II). Reported results are strong for Stage I: mean PPA NMAE 5.26 vs. 7.14 (RTL-Timer), and slack NMAE 3.59 vs. 4.75. For Stage II, within-design Spearman is 29.53 vs. 26.03 (GAT).
Critical strengths
- Stage-I accuracy. Consistent gains on all four PPA targets and register slack over a broad baseline set on 22.8k designs with a design-level split.
- Label pipeline. Only formally proven equivalent rewrites are kept and evaluated with a common commercial flow. The dataset may be reusable.
Critical weaknesses
My two main concerns are that 1) the technical novelty is limited relative to closely related work and 2) the Stage-II evidence does not yet support a strong region-ranking claim.
-
The “first” region-prioritization claim needs better positioning. Dr. RTL [1] already localizes optimization regions from register-level critical paths and uses a rewrite–synthesis–verification loop similar in spirit to the pipeline here. RTL-Timer also uses predicted slack to guide optimization. HierRTL may differ in learning an explicit ranking from rewrite outcomes, but this distinction needs to be made directly.
-
Register-cone hierarchy is not new. Register-centered subgraphs and register dependency graphs already appear in SNS v2, and register cones are used in CircuitFusion and TopoRTL. The main difference here seems to be the downward path over a fixed semantic hierarchy, which is close to a standard Graph U-Net decoder. The paper needs to isolate what is new beyond this combination.
-
Joint design- and register-level prediction is also not new. RTL-Timer predicts register slack and derives design-level timing quantities; MasterRTL aggregates register-endpoint paths into WNS/TNS; CircuitEncoder supports slack-, cone-, and PPA-level tasks with one encoder. This weakens the novelty of the multi-granularity supervision claim.
-
Overlapping cones need more analysis for area/power. HierRTL does not literally sum cone predictions, but shared logic enters multiple cone states before being routed back to nodes. The paper should explain why this does not bias area/power modeling. METIS is not a very relevant comparator for this issue.
-
Stage-II gains are modest relative to the reported variability. Spearman is 29.53 ± 1.00 vs. 26.03 ± 5.71 for GAT. Top-1 is 46.88 ± 1.11 vs. 45.61 ± 2.42 for CircuitFusion. With only 3 seeds, the evidence for a robust ranking gain is limited.
-
Key baselines are missing. Stage II has only about 3.3 regions per design on average, so a random Top-1 baseline is nontrivial. More importantly, there is no random, region-size, register-count, or worst-slack baseline. The last one is especially important because related work [1] already relies on timing criticality, and HierRTL itself predicts register slack.
-
Stage-II data may not reflect real optimization well. The paper does not clearly report the size/source distribution of the Stage-II subset. Also, labels are generated from rewrites produced by a single rewrite generator, so the target may partly measure where that generator can find improvements rather than the intrinsic optimization potential of a region.
[1] W. Fang, Y. Lu, S. Liu, J. Wang, Z. Guo, J. He, F. Tu, and Z. Xie. Dr. RTL: Autonomous Agentic RTL Optimization through Tool-Grounded Self-Improvement. arXiv:2604.14989, 2026.
Questions for authors
Q1. How is your region prioritization different from the critical-path localization in [1], which also maps register-level timing information back to RTL regions? How is it different from RTL-Timer-style guidance based directly on predicted slack? What does the learned ranking capture beyond a worst-slack heuristic?
Q2. Apart from using register cones as a fixed semantic hierarchy, what is new in the downward path compared with a standard Graph U-Net decoder? What can it capture that the bottom-up hierarchies in SNS v2, CircuitFusion, and TopoRTL cannot?
Q3. Shared logic can belong to multiple register cones. How does the model avoid bias from repeated cone membership for additive targets such as area and power? Also, the final design readout uses mean/max pooling. Where is design size encoded for size-dependent targets such as area?
Q4. The N column in Table 1 differs across baselines. Are all methods evaluated on the same test designs and trained with comparable budgets? Please also report standard deviations over seeds for Stage I.
Q5. How many editable regions does a typical Stage-II design have, and what fraction of region targets are zero or tied? How are tied targets handled in Spearman/Kendall and Top-1?
Q6. Fig. 2 mentions CEC/DSEC. Are sequential rewrites allowed? If so, when is sequential equivalence used, and what are the equivalence-check pass rates and retained candidates per region?
4 comments
Response for Reviewer yCMk(2/4)
W4 & Q3. Overlapping cones, PPA readout, and size information
(1) What cone overlap represents
A node may belong to several register cones. These cones provide contextual features, not separate area/power estimates to be added.
(2) Normalize incoming context
For a node with a nonempty cone set :
a_{vc} &= \frac{\langle Qh_v^{\mathrm{skip}},Kh_c^{\mathrm{dec}}\rangle}{\sqrt{d}}, \\ w_{vc} &= \frac{\sigma(a_{vc})}{\sum_{c'\in\mathcal C(v)}\sigma(a_{vc'})}, \\ q_v &= \sum_{c\in\mathcal C(v)}w_{vc}h_c^{\mathrm{dec}}. \end{aligned}$$ - $h_v^{\mathrm{skip}}$ is the local node state, and $h_c^{\mathrm{dec}}$ is a decoded cone state. - $Q,K$ are learned projections, $d$ is the hidden dimension, and $\sigma$ is sigmoid. - Nonnegative weights sum to one, making $q_v$ a weighted average rather than a sum that grows with cone memberships. **(3) Read each original node once** - Gate $q_v$ with the local skip state to produce one decoded feature per original node. - Area/Power heads read mean/max pooling over these unique nodes. Shared logic therefore occupies one readout position. This avoids explicit repeated cone contributions. Area/power remain learned outputs. METIS compares grouping semantics. **(4) Encode size before pooling** - **log(1+cone size) projection and count-scaled PNA aggregation** carry size information into the node states. - HierRTL has the lowest mean PPA error in all four timing-report register-name groups. - For the 19 Test designs with ≥1,000 register names, across-design mean PPA Spearman×100 is **88.34 for HierRTL**, versus 47.61 for RTL-Timer and 73.47 for TopoRTL. --- ### W5. Stage-II margins and variability We add complete graph and LLM-based comparisons, reporting means±sample SD. The added text encoders are Qwen3-Embedding[9] and CodeV[10]: | Method | Spearman×100↑ | Kendall×100↑ | | --- | ---: | ---: | | GCN | 22.97 ± 2.32 | 20.76 ± 1.87 | | GAT | 26.03 ± 5.71 | 23.55 ± 5.12 | | GIN | 24.15 ± 2.16 | 21.84 ± 1.78 | | RTL-Timer | 10.65 ± 3.87 | 10.00 ± 3.42 | | CircuitEncoder | 22.99 ± 2.55 | 21.06 ± 2.32 | | StructRTL | 6.49 ± 8.29 | 6.27 ± 7.76 | | TopoRTL | 13.91 ± 2.94 | 13.24 ± 2.59 | | CircuitFusion | 12.92 ± 2.31 | 12.25 ± 1.91 | > **Additional LLM-based methods and HierRTL** > > | Method | Spearman×100↑ | Kendall×100↑ | Parameters (M)↓ | Matmul GFLOPs/design↓ | Inference ms/design↓ | > |---|---:|---:|---:|---:|---:| > | Qwen3-Embedding 0.6B | 27.85 ± 0.43 | 25.85 ± 0.75 | 596.11 | 1,858.877 | 58.51 | > | Qwen3-Embedding 4B | 24.18 ± 1.77 | 22.37 ± 1.50 | 4,022.51 | 12,224.960 | 173.36 | > | Qwen3-Embedding 8B | 26.43 ± 1.18 | 24.63 ± 1.46 | 7,568.43 | 22,086.065 | 311.69 | > | CodeV-CL 7B | 19.38 ± 2.57 | 17.23 ± 2.30 | 6,608.54 | 27,812.254 | 355.79 | > | CodeV-DS 6.7B | 26.74 ± 1.85 | 24.45 ± 1.76 | 6,609.52 | 21,845.916 | 288.15 | > | CodeV-QC 7B | 20.36 ± 1.82 | 17.97 ± 2.14 | 7,071.62 | 20,326.649 | 285.39 | > | HierRTL | **29.53 ± 1.00** | **26.93 ± 0.91** | **1.47** | **0.187** | **9.13** | - **Task:** Learn regional priorities from verified rewrite gains, using only the original RTL at inference. - **Results:** HierRTL has the highest mean Spearman and Kendall, with fewer parameters and less computation than the text baselines. --- ### W6. Additional heuristics and classical EDA comparisons We first compare simple heuristics on the original Stage-II Test ranking set. HierRTL uses the Table 2 mean±sample SD: | Original Stage-II Test comparison | Spearman ×100 ↑ | Top-1 (%) ↑ | Normalized regret ×100 ↓ | |---|---:|---:|---:| | Uniform random, exact expectation | 0.00 | 29.82 | 63.45 | | Region register-group count | −3.05 | 29.88 | 62.93 | | Predicted worst endpoint slack | 6.79 | 35.71 | 58.02 | | HierRTL | **29.53 ± 1.00** | **46.88 ± 1.11** | **46.37 ± 1.51** | **Measured-report comparison** **(1) Designs** From the original Stage-II Test set (**202 designs, 676 regions**), include every design meeting both conditions for each target: - **Complete reports:** Every original region has a valid score, so both methods rank the same candidates. - **Defined ranking:** At least two regions and nonconstant opportunity labels. **(2) Ranking methods** - **Report rule, Area/Power:** Descending regional area/power share. Shared cells are split equally among their regions. - **Report rule, WNS/TNS:** Ascending worst setup slack among the region's register endpoints. - **Report sources:** Area/power use source-hierarchy-preserving synthesis with ≥95% traceable attribution. Slack uses the original implementation reports. - **HierRTL:** The original RTL graph and region memberships produce four opportunity scores, ranked in descending order. Training uses gains from equivalence-verified rewrites.Response for Reviewer yCMk(3/4)
(3) Evaluation
Compare both methods against the same opportunity labels and average over designs for each target:
- ρ: Within-design region-order agreement.
- Top-1: Whether the selected region has the highest label.
| Comparison | AREA | POWER | WNS | TNS |
|---|---|---|---|---|
| Report rule | Area share | Power share | Worst setup slack | Worst setup slack |
| Report rule: ρ×100↑ | 27.85 | −5.39 | 14.53 | 22.30 |
| HierRTL: ρ×100↑ | 31.70 | 42.65 | 22.59 | 29.27 |
| Report rule: Top-1 (%)↑ | 44.44 | 29.03 | 53.66 | 41.30 |
| HierRTL: Top-1 (%)↑ | 61.11 | 61.29 | 56.10 | 50.00 |
HierRTL has higher mean ranking metrics for all four targets. Resource share and timing criticality do not fully capture rewrite opportunities.
W7 & Q5. Stage-II distribution, zero labels, and ties
(1) Region distribution
- Full dataset: 1,919 designs and 6,093 regions, with 1–144 regions per design.
- Test: 202 designs and 676 regions, with 1–41 regions per design.
- Sources: DynamicRTL 758, RTLCoder 409, DeepRTL-v2 299, DeepCircuitX 254, and MG-Verilog 199 designs.
| Editable regions per design | Full dataset: designs | Test: designs |
|---|---|---|
| 1 | 862 | 83 |
| 2–4 | 734 | 78 |
| 5–9 | 236 | 31 |
| 10–19 | 64 | 6 |
| ≥20 | 23 | 4 |
(2) Zero gains and ties
- Zero label: No positive gain found for that target within the specified rewrite flow and budget.
- Label scope: Opportunities depend on the generator. Beneficial regions can change across candidate pools.
- Tied region: Another region in the same design has the same label, including zero-label ties. The table's columns can overlap.
| Target | Zero-gain regions | Regions with tied labels |
|---|---|---|
| Area | 397/676 (58.73%) | 319/676 (47.19%) |
| Power | 415/676 (61.39%) | 357/676 (52.81%) |
| WNS | 457/676 (67.60%) | 386/676 (57.10%) |
| TNS | 453/676 (67.01%) | 394/676 (58.28%) |
Both columns cover all 676 Test regions.
(3) Evaluation
- Evaluate designs with at least two regions and nonconstant labels.
- Spearman: Average ranks for ties. Kendall: Tau-b.
- Top-1: Any best-labeled region is correct, with tolerance 10⁻¹². Tied predictions use a fixed order. Constant predictions receive zero correlation.
- Average designs equally within each target, then average the four targets. Listwise training skips single-region/constant-label groups and gives tied labels equal relevance.
Q4. Different N values and Stage-I variability
(1) Why N differs
Hardware and compute limits, method costs, and compatibility issues during adaptation and data processing leave some methods evaluated on smaller usable subsets. PPA label definitions are unchanged.
(2) Identical Test comparison
- Take the prediction-coverage intersection of 14 methods: 2,018 common Test designs.
- Reuse the original training-set normalization.
- Mean PPA NMAE×100: RTL-Timer 6.311, TopoRTL 7.091, HierRTL 4.701.
The relative prediction advantage remains on identical Test inputs.
(3) Training budgets
- Use the original design splits and Validation-based checkpoint selection, with budgets reflecting method costs.
- External pretrained methods retain their initialization. Text encoders remain frozen while their heads are trained.
(4) Stage-I variability
| Stage-I error, NMAE ×100 ↓ | Mean ± sample SD |
|---|---|
| Area | 4.322 ± 0.233 |
| Power | 6.213 ± 0.372 |
| WNS | 5.073 ± 0.079 |
| TNS | 5.433 ± 0.105 |
| Mean of four PPA targets | 5.260 ± 0.041 |
| Register slack, macro | 3.586 ± 0.031 |
PPA covers 2,306 Test designs. Slack uses valid endpoint labels.
Q6. Sequential edits, equivalence checks, and candidate counts
(1) Allowed edits and equivalence
- Edits may occur inside sequential process blocks under interface, clock/reset, and written-signal constraints.
- Candidates must pass both CEC and DSEC. Unknown, timeout, and failed checks are rejected.
(2) Additional rewrite experiment
- Formal checks: 1,087/1,199 candidates pass both proofs (90.66%), or 73.35% of all 1,482 planned attempts.
- PPA: 1,085 completed measurement attempts, corresponding to 270 distinct implementations including the 17 originals.
- Per region/pool: Two planned attempts, with 0–2 completed PPA measurements and mean 1.46.
(3) Original dataset
Historical exports retain 21,914 rewrites, of which 21,825 contribute to labels. Candidates per region range from 1 to 10, with mean 3.58.
Response for Reviewer yCMk(4/4)
References
[1] Wenji Fang, Yao Lu, Shang Liu, Jing Wang, Ziyan Guo, Junxian He, Fengbin Tu, and Zhiyao Xie. Dr. RTL: Autonomous agentic RTL optimization through tool-grounded self-improvement. arXiv preprint arXiv:2604.14989, 2026.
[2] Wenji Fang, Shang Liu, Hongce Zhang, and Zhiyao Xie. Annotating slack directly on your Verilog: Fine-grained RTL timing evaluation for early optimization. In Proceedings of the 61st ACM/IEEE Design Automation Conference, pp. 1–6, 2024.
[3] Ceyu Xu, Pragya Sharma, Tianshu Wang, and Lisa Wu Wills. Fast, robust and transferable prediction for hardware logic synthesis. In Proceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture, pp. 167–179, 2023.
[4] Wenji Fang, Shang Liu, Jing Wang, and Zhiyao Xie. CircuitFusion: Multimodal circuit representation learning for agile chip design. In International Conference on Learning Representations, pp. 51523–51545, 2025.
[5] Mingyu Zhao, Xun He, Jiawei Liu, Jianwang Zhai, and Chuan Shi. Topology matters in RTL circuit representation learning. In The Fourteenth International Conference on Learning Representations (ICLR), 2026.
[6] Hongyang Gao and Shuiwang Ji. Graph U-Nets. In International Conference on Machine Learning, pp. 2083–2092. PMLR, 2019.
[7] Wenji Fang, Yao Lu, Shang Liu, Qijun Zhang, Ceyu Xu, Lisa Wu Wills, Hongce Zhang, and Zhiyao Xie. MasterRTL: A pre-synthesis PPA estimation framework for any RTL design. In IEEE/ACM International Conference on Computer Aided Design (ICCAD), pp. 1–9, 2023.
[8] Wenji Fang, Shang Liu, Hongce Zhang, and Zhiyao Xie. A self-supervised, pre-trained, and cross-stage-aligned circuit encoder provides a foundation for various design tasks. In Proceedings of the 30th Asia and South Pacific Design Automation Conference, pp. 505–512, 2025.
[9] Yanzhao Zhang, Mingxin Li, Dingkun Long, Xin Zhang, Huan Lin, Baosong Yang, Pengjun Xie, An Yang, Dayiheng Liu, Junyang Lin, Fei Huang, and Jingren Zhou. Qwen3 Embedding: Advancing text embedding and reranking through foundation models. arXiv preprint arXiv:2506.05176, 2025.
[10] Y. Zhao et al. CodeV: Empowering LLMs for Verilog generation through multi-level summarization. arXiv preprint arXiv:2407.10424, 2024.
Response for Reviewer yCMk(1/4)
Thank you for the comments on positioning and Stage-II evidence. We group related weaknesses and questions below. W and Q refer to the reviewer’s Weaknesses and Questions, respectively.
W1 & Q1. Positioning and timing criticality
The methods supply different decisions: Dr. RTL executes a rewrite loop, RTL-Timer supplies timing guidance, and HierRTL allocates regional exploration effort before candidate generation.
Our contribution is a regional prioritization task learned from verified rewrite gains. The model supplies exploration priorities to a downstream rewrite optimizer.
Worst slack measures current timing criticality, whereas learned ranking predicts gains discoverable by the specified rewrite flow. A critical region may have no feasible improving rewrite, while other regions may offer area or power gains. W6 tests this distinction directly.
W2 & Q2. Circuit-specific hierarchy and downward propagation
SNS v2[3], CircuitFusion[4], and TopoRTL[5] use register-centered representations. Following Graph U-Nets[6], HierRTL adds downward propagation along RTL dependencies and readout from decoded original nodes.
(1) Semantic hierarchy
(2) Downward propagation
(3) Shared node representation
(4) Evidence
The matched-capacity control changes only the PPA readout:
W3. Role of multi-granularity supervision
RTL-Timer[2], MasterRTL[7], and CircuitEncoder[8] already support related multi-granularity tasks. Our contribution is the jointly supervised node representation and its transfer to regional opportunity ranking.
(1) Complementary supervision on shared states
(2) Transfer to Stage-II