Eureka on the web
When you want the answer in the next five minutes.
The agent works the prompt against patents and technical literature, citing every source.
Run your analysis now →RISC-V processor design optimization is a small but fast-moving corner of computing hardware patents. The search scope captures 49 patent families filed between 2015 and mid-2026 against branch prediction, pipeline optimization and ISA customization claim language, almost all of it classified under a single IPC subclass, G06F. That concentration is itself informative: this is not yet a field with distinct sub-clusters competing for claim space — it is one architectural core with a few emerging variants layered on top.
Filing volume has moved from a slow start in 2017 through a midpoint dip in 2022 to a peak of eight filings in 2025, the most recent complete year available. Given the roughly 18-month lag between filing and publication, the true trajectory through 2026 is understated in any chart pulled today, and the field should be read as still accelerating rather than plateauing.
Filings in this scope run from 2015 through the mid-2026 cut-off, with volume still rising into the most recent complete year even after accounting for publication lag.
Annual filings moved from 5 in 2017 to a midpoint of 3 in 2022 before climbing to a peak of 8 in 2025 — the most recent full year on record. Because publication typically lags filing by around 18 months, the 2026 figure shown is necessarily incomplete and should not be read as a slowdown.
All 49 core records classify under G06F (electric digital data processing), with only single incidental hits landing in A61P and H04W. That concentration means the technology is defined almost entirely by processor-architecture claims rather than by application-specific overlays into other fields — the H04W and A61P hits are the exception, not an emerging trend.
Shares are the percentage of the 49 records in scope. A patent can carry several IPC classes, so the shares add up to more than 100%.
This page is one run against one query. Ask Eureka your own question about risc-v processor design optimization and every answer comes back with the patent numbers behind it.
Try EurekaA RISC-V branch prediction method and device, an electronic device and a computer readable storage medium are provided. On the basis of the prior art, the remaining jump times of the jump instruction are additionally acquired, and the single jump step length (not fixed to 1) is calculated according to the difference of remaining jump times during two consecutive jumps. Whether the target jump instruction has executed the last jump can be judged according to the single jump step length in combination with the real-time remaining jump times, so as to determine the jump times that need to be executed subsequently.Filed by Inspur Suzhou Intelligent Technology, published 2022-07-28 — illustrates the variable-step-length approach to branch prediction that distinguishes this filing from fixed-step prior art.


| # | Publication no. | Patent title | Citations |
|---|---|---|---|
| 1 | US20170177368A1 | Techniques for metadata processing | 81 |
| 2 | US20170177367A1 | Techniques for metadata processing | 70 |
| 3 | US20190213322A1 | Techniques for metadata processing | 67 |
| 4 | US9785440B2 | Techniques for metadata processing | 45 |
| 5 | US20180011708A1 | Techniques for metadata processing | 44 |
| 6 | US10936713B2 | Techniques for metadata processing | 41 |
| 7 | US20190384604A1 | Techniques for metadata processing | 39 |
| 8 | US10235176B2 | Techniques for metadata processing | 38 |
| 9 | US10261794B2 | Techniques for metadata processing | 34 |
| 10 | US20190171457A1 | Techniques For Metadata Processing | 33 |
Ranking reflects citation count within the searched corpus, which favours older filings; treat it as a measure of influence on later filers rather than current commercial weight.
Each row carries its publication number; clicking a row searches Eureka by that number.
When you want the answer in the next five minutes.
The agent works the prompt against patents and technical literature, citing every source.
Run your analysis now →When it has to run inside your own pipeline.
Patent search, landscape analysis and assignee resolution as MCP tools. Drop them into any agent framework, or call REST directly.
Browse MCP servers →Reading citation weight, filing office and recent momentum together points to a field with one settled architectural foundation and a much more open, still-forming layer of prediction and customization claims sitting above it.
The four highest-cited records in this dataset all belong to the same 'Techniques for metadata processing' filing family. That concentration means later applicants working on RISC-V instruction handling are citing back to a single foundational approach rather than several competing ones.
China now edges out the United States as the leading receiving office in this scope, a shift that reflects the surge of Chinese university and corporate filings on branch prediction and pipeline optimization since the early 2020s.
Filings dipped to a midpoint of 3 in 2022 before climbing to a peak of 8 in 2025, the most recent complete year in the dataset. Because publication lags filing by around 18 months, the true 2025-2026 volume is likely higher than currently visible.
Every core record in this dataset classifies under G06F, with only single incidental hits elsewhere. That means the field's claim space is defined almost entirely by processor-architecture language rather than application-specific overlays.
Eureka can read the same corpus for gaps instead of for coverage: under-claimed branches adjacent to risc-v processor design optimization, with the prior art for and against each one.
No single assignee shows filing activity in the latest tracked year, which means the current leaderboard reflects who built the foundational position earlier, not who is actively extending it right now.
The Charles Stark Draper Laboratory and University of Pennsylvania Board of Trustees pairing is the strongest co-assignee relationship in this dataset, tied to the highly-cited metadata-processing family that anchors the field's most influential claims.
Applicants including Inspur Suzhou Intelligent Technology and several Chinese universities account for the bulk of recent filings, concentrated on branch prediction and pipeline-optimization claim language rather than the earlier metadata-processing architecture.
Institutions such as Shandong University, University of Electronic Science and Technology of China, and Hubei University each appear with limited filing counts, reflecting a fragmented academic layer rather than sustained corporate portfolios.
| Assignee | Recent year | YoY |
|---|---|---|
| Charles Stark Draper Laboratory, Inc. | 0 | — |
| Inspur Suzhou Intelligent Technology Co., Ltd. | 0 | — |
| The Trustees of the University of Pennsylvania | 0 | — |
| Shandong Lingneng Electronic Technology Co., Ltd. | 0 | — |
| Shandong University | 0 | — |
| University of Electronic Science and Technology of China | 0 | — |
| Hubei University | 0 | -100% |
| Shenzhen Yanjin Chuangxin Electronic Technology Co., Ltd. | 0 | -100% |
The trends above point to specific next questions for teams deciding where to file, license or design around existing claims.
The metadata-processing family's citation weight suggests broad influence, but only a full claims read — not the abstract — will show exactly what is enforceable.
Pull full claim sets in EurekaWith China now ahead of the US in filing volume and 2025-2026 figures still understated by publication lag, re-checking this trend in six months will sharpen the picture.
Set up filing alerts in EurekaThe near-absence of H04W-adjacent claims and the lack of a dominant ISA-customization filer both point to open claim territory worth scoping before a competitor moves first.
Explore white space in EurekaThis dataset covers 49 published patent families filed between 2015 and the mid-2026 data cut-off, matched against RISC-V branch prediction, pipeline optimization, ISA customization and general design-optimization claim language. Because publication lags filing by roughly 18 months, the true count for the most recent one to two years is understated in any trend chart pulled today. Patent families, rather than raw document counts, are the fairer unit here because they neutralise repeat continuation filings from the same applicant.
Filing activity concentrates around a mix of Chinese university and corporate applicants alongside a smaller number of US-based holders, with China representing the largest single receiving office in this dataset at 19 filings against 18 for the United States. No single assignee dominates the recent-year momentum figures — every top-ranked assignee tracked shows zero filings in the latest year, indicating the field's current activity is distributed across a broader set of newer entrants rather than concentrated in a handful of incumbents. A ranking table pulled from the full dataset will show the specific order more precisely than any summary can.
The most-cited record in this scope is US20170177368A1, titled "Techniques for metadata processing," with 81 citations, followed closely by three related filings in the same metadata-processing family at 70, 67 and 45 citations. High citation counts inside a searched corpus tend to favour older filings simply because they have had more time to accumulate references, so treat this as a signal of historical influence on later filers rather than a claim that these are the most commercially important patents being filed today.
The clearest gap is the near-total absence of claims connecting RISC-V pipeline or branch-prediction mechanisms to wireless-communication context, despite only one incidental H04W hit against 49 core G06F records. ISA customization claims are present in the search scope but lack any standout highly-cited record, suggesting that sub-area remains fragmented rather than consolidated around dominant claim language. Geographically, filing coverage in Europe and Singapore sits at only two records each, far behind China and the US, which points to thinner prior art in those jurisdictions for a targeted filing strategy.
No — the record describes a specific mechanism: calculating a variable single-jump step length from the difference in remaining jump counts across two consecutive jump instructions, then using that step length with real-time remaining-jump-count data to judge whether a target jump has executed its final iteration. Branch predictors built on fixed-step assumptions, pure history-table lookups, or entirely different signal sources fall outside the language described in this abstract. Anyone building a jump-count-delta-driven predictor should have counsel review the granted claims directly rather than relying on the abstract alone.
Go past this page: query the whole risc-v processor design optimization corpus yourself, in your own scope.
Every answer comes back with patent numbers you can open.
Disclaimer. This page is generated from Patsnap Eureka data drawn from a limited snapshot of global patent and scientific-literature records, and is provided for general information and reference only.
Patent data carries inherent limitations: recent filings (typically the most recent 18–24 months) are under-counted due to standard publication lag; counts may be reported at either a patent-family or a patent-record basis and are not always directly comparable; classification, applicant-name, and citation data may contain errors, duplicates, or omissions; and the underlying search query defines and constrains the scope shown. As a result, the analysis may be incomplete or inaccurate and may not reflect the full technology landscape.
Nothing on this page constitutes an exhaustive prior-art, novelty, freedom-to-operate, or validity search, nor does it constitute legal, financial, investment, or professional advice, and it should not be relied upon as such. Any patent, commercial, or strategic decision should be verified independently and reviewed with qualified patent, legal, and domain professionals. Patsnap makes no warranties, express or implied, as to the accuracy, completeness, or fitness for any particular purpose of the information presented.
Machine translation. Assignee and organisation names originally recorded in Chinese, Japanese or Korean have been rendered into English by an AI translation step so that the tables stay readable. These renderings are best-effort and may not match a company's registered English name; the original name is what the underlying patent record carries, and it is what any Eureka query launched from this page uses.