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 →26 patent families on flash program-verify algorithms, led by one filer with 9 families and a long tail of single-filing entrants.
82 published records collapse into 26 simple (DOCDB) families; the difference is the same invention filed in more than one country. In force = 28 of 82 records still granted and maintained at the data cut-off; the rest are pending, withdrawn, refused or lapsed.
This page reports records matching "non-volatile memory" OR "flash memory" combined with "program verify" OR "program-verify" and the term algorithm, anywhere in the title, abstract or claims. The search carries no date limit, so the set spans whatever filing dates the matching documents happen to have. It returns 82 published records that de-duplicate to 26 simple patent families.
26 families is a small pool. The figures on this page describe what this particular search string returned, not the size or shape of any wider field, and they are a starting point for further search rather than a map of the technology.
Counted over all 82 published records, including filings from before 2007; the filing-trend chart below covers only the 44 records from 2007 onward, so the two charts are not the same set of documents. Ordered by volume only, not by importance or claim strength. Counted in simple (DOCDB) patent families, so one invention filed in several countries counts once. Names come from Patsnap's standardised assignee field as recorded on each document; subsidiaries and group companies are not merged. The icon before each name is read from the name itself (words such as University, Institute or Ltd); the data carries no organisation-type field, so treat it as a reading aid rather than a classification. Filings held by named individuals rather than organisations are removed where they can be identified (3 here); that identification is not exhaustive, so an individually held filing can still appear below. Either way those filings stay inside the totals above. This table shows the top 13 of the 13 filers returned for this search; the data endpoint returns at most 100 entities, so even that 13 is not the complete set of filers. A single family can name more than one filer, so these counts overlap and do not add up to the total.
Pick a task. Every answer cites the patents behind it.
The two views below use different counting units: the trend chart counts published records by earliest filing year, while the technology split counts simple patent families.
Records run from 2007 (7) to a peak of 10 in 2020, with 0 recorded for 2026. The window from 2022 onward is still filling in: recent filings take time to publish, so the last few years understate eventual totals and should not be read as a drop in filing activity.
Counted in published records by earliest filing year, not de-duplicated into families. A filing is counted in the year it was filed, but it only becomes visible after it publishes: roughly 18 months for most routes, and up to 30 months where a PCT application enters national phase. 2022 onwards are therefore still filling in and are shaded; no growth figure on this page uses them. Because this series counts documents rather than inventions, a rise can mean more inventions or the same inventions filed in more countries; this dataset cannot separate the two. This chart covers 2007-2026 (44 records); the 82 total quoted above includes earlier filings outside the window.
G11C (static & digital memories) appears on 25 of the 26 families in scope (96.2%), the highest share of any subclass in this set. Because a family can carry more than one IPC class, the shares shown in the chart add up to more than 100%.
Shares are the percentage of the 26 patent families in scope. One patent family 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 nonvolatile memory program verify algorithm for flash devices patent landscape and every answer comes back with the patent numbers behind it.
Try EurekaThe abstract describes a method that runs a program verify operation after a write to non-volatile memory, where the operation reports a pass or fail against an existing measurement threshold, and then dynamically adjusts that threshold for subsequent program verify operations based on prior results.This is the first record returned under the database's default ordering, not the most cited, newest or broadest document in the set. What its granted claims actually require has to be read from the claim set itself; an abstract and a family count cannot establish that.


Selected as the first record the search returns under the database default order, then shown in full. It is not ranked by citations, claim breadth or commercial importance, and it is not a judgement about which filing in this space matters most.
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 →Three figures from the dataset, reported as counted, with the limits that apply to each.
SanDisk Technologies LLC is named on 9 of the 26 simple patent families in scope, the highest share of any single row in the listed filers. This is a count of named families, not a measure of claim scope, validity or enforceability.
Of the 13 listed filers, 12 hold 2 or fewer simple patent families each. Filer rows are not mutually exclusive, a family can name more than one filer, so these counts are not added together into a combined share anywhere on this page.
G11C, static & digital memories, is the IPC subclass attached to 25 of the 26 families in this search. Because one family can carry several IPC classes, this share is read against the family total directly, not against a sum of all subclasses shown.
28 of the 82 published records were granted and still in force as of the 2026-10-27 retrieval date. The remaining records fall into other statuses that this page does not break out, and legal status changes continuously rather than measuring quality.
Eureka can read the same corpus for gaps instead of for coverage: under-claimed branches adjacent to nonvolatile memory program verify algorithm for flash devices patent landscape, with the prior art for and against each one.
26 families is a narrow pool to build conclusions on by itself. These are ways to use it as a starting point rather than a finished answer.
Program-verify and threshold-adjustment language varies a good deal across flash controller filings. Alternate phrasing may surface families this string did not catch.
Open Eureka to rerun the search →Family counts and abstracts describe what a document is about, not what it legally covers. Reading the independent claims of the records that matter to you is the only way to know what they require.
Open Eureka to read full claim sets →Because filer rows are not rolled up to corporate group and can overlap across one family, each row needs to be checked on its own rather than grouped by name similarity.
Open Eureka to inspect filer records →This search returns 82 published records that de-duplicate to 26 simple patent families. The two numbers differ because a single invention can be published more than once, for example when it is filed in several countries or re-published at different prosecution stages. There is no date limit applied to the search, so this set spans whatever filing dates the matching documents carry, and the 26-family figure is the right one to use when comparing filers or technology shares.
SanDisk Technologies LLC is named on 9 of the 26 simple patent families in scope, the highest share of any single row among the 13 listed filers (34.6%). Twelve of those 13 listed filers hold 2 or fewer families each, so the rest of the list is spread thinly. This count reflects named families only, not the breadth or strength of any filer's claims.
G11C covers static and digital memories, and it is attached to 25 of the 26 simple patent families in this search (96.2%). A family can carry more than one IPC class, so this share is not exclusive of the other classes shown on the page's chart. The concentration in G11C reflects how the search string matched documents, not a claim about how broad or narrow the memory field is overall.
US9349476B2, assigned to SanDisk Technologies LLC, is simply the first record returned under the database's default ordering for this search, it is not flagged on this page as the most cited, newest or most representative document. Its abstract describes a method that runs a program-verify operation after a write and adjusts the measurement threshold used by later verify operations based on prior pass/fail results. What its granted claims actually require, and how far they reach, needs to be read from the claim set itself rather than inferred from the abstract.
The filing trend counts published records by earliest filing year, and the years from 2022 onward are still filling in because recent filings take 18 to 30 months to publish depending on the route. The peak so far in this series is 10 records in 2020, with earlier years such as 2007 at 7. Reading the most recent years as a decline would be a misread of publication lag, not a signal about actual filing activity.
No. 26 families is a small pool generated by one specific search string, and absence of a document from it is far more likely to mean the search terms missed it than that no one has filed in that area. The filer and technology shares reported here describe exactly what this search returned, not the shape of program-verify technology as a whole. Treat this page as a starting point for a broader search rather than a finished landscape.
Go past this page: query the whole nonvolatile memory program verify algorithm for flash devices patent landscape corpus yourself, in your own scope.
Every answer comes back with patent numbers you can open.
Search. Every figure on this page comes from one Patsnap search, run once and not edited afterwards. This is the exact search string:
TAC:(("non-volatile memory" OR "flash memory") AND ("program verify" OR "program-verify") AND algorithm)
Reading the field codes: TAC searches the title, abstract and claims of each record, not the full description. The search string sets no date limit, so the scope is every matching record in the database regardless of when it was filed. It is not restricted to recent years. How this string was built matters for how far the counts can be pushed. It was generated in batch from a topic list rather than hand-crafted for this page, and the result set is not manually screened. A keyword search over title, abstract and claims both over-captures (unrelated filings that happen to use the same words) and under-captures (the same invention written in different words). This page cannot measure either effect, so read every figure here as what this particular string returned, not as what exists in the field. One subclass (G11C) carries 96.2% of the patent families, so this search returned a classification-tight set.
What is being counted. Two different units appear on this page and they are not interchangeable. The filer list and the technology split are counted in simple (DOCDB) patent families: one invention counts once however many countries it was filed in. The total, the jurisdiction split and the filing-year chart are counted in published records: the same invention counts once per publication. For this search that is 82 records and 26 families. Record counts reward filing in many jurisdictions; family counts do not. Shares are only ever taken against a denominator in the same unit, and each one names it.
Who the filers are. Names come from Patsnap's standardised assignee field, as recorded on the documents themselves. They are not rolled up to corporate group: a parent and its subsidiaries appear as separate entries, and a portfolio acquired from another company stays under the name on the document unless the assignment is reflected there. This list is meant to carry organisations, not people. Filings held by a named individual are identified by matching the assignee against the inventors on the same search, and, for names written in Chinese, Japanese or Korean characters, by the name carrying no organisational suffix; those are removed from the list (3 of them here). Neither test is exhaustive: the inventor list it matches against is itself capped, and a personal name written in Latin script with no organisational wording in it cannot be told apart from a short company name by rule. So an individually held filing can still appear in the list. Those filings stay inside every total and share on this page either way, so the listed entries can add up to less than the total. A record shown in full further down still names its assignee exactly as the patent office records it, including where that is a person: that name is how the record is identified and checked. What is left out of the ranking is people as ranked entries, not people as cited sources. The table shows the top 13 of the 13 filers returned, ordered by count alone; the data endpoint returns at most 100 entities, so even that 13 is not every filer. One patent family can name several filers and each is counted separately, so these rows are not slices of a divided whole: adding them together over-counts, and this page deliberately publishes no combined "top five" share for that reason. See every filer, individuals included
Dates. The year chart counts by earliest filing year, not publication year. A filing only becomes visible once it publishes: roughly 18 months for most routes, and up to 30 months where a PCT application enters national phase. Measured across these pages, the year four back from today still holds only about 89% of its eventual count. 2022 onwards are therefore shaded on the chart as still filling in. The data behind this page was retrieved on 2026-10-27.
Legal status. "In force" counts documents whose legal status at retrieval was granted and maintained (28 of 82). Everything else is pending, withdrawn, refused, lapsed or not determinable, and those states are not broken out here because the underlying codes do not separate them cleanly. Legal status changes continuously and is reported per document, not per family. Get the status breakdown in Eureka
Classification. The technology split uses IPC subclasses (four characters, for example H01M). A single record usually carries several, so the shares add up to more than 100% and a record can appear in more than one bar. Subclass is a coarse grouping; it describes the field a record was classified into, not what the claims cover. Break the classes down to subgroup level
Who wrote the words. The tables, charts, counts, shares and patent numbers on this page are produced directly from the search result by a program; none of them are written or estimated by a language model. The surrounding prose, headings, FAQ answers and the answers in the question panel are drafted by a language model that is given those same figures and is not permitted to introduce others. Prose can still mis-describe a correct figure, so where the two disagree, the tables and charts are the record.
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 limitations that apply to every figure above. Recent filings are under-counted, because an application is not public until roughly 18 months after filing and database loading adds further delay. The search string defines and constrains everything shown: records that use different terminology, or that sit outside the fields searched, are absent and cannot be counted. Applicant names, classification codes, legal-status codes and citation records are taken as recorded and may contain errors, duplicates, omissions or stale entries. Ordering by volume is not a measure of quality, scope, enforceability or commercial value, and a larger portfolio is not a stronger one. 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, validity or infringement search, nor does it constitute legal, financial, investment, or professional advice, and it should not be relied upon as such. No attorney-client relationship is created by it. Any patent, commercial, or strategic decision should be verified independently against the primary records 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.
The question panel. The answers behind the suggested questions on this page were written when the page was generated, not in response to your click. The progress steps that play before an answer appears are an animation of how that analysis was done; nothing is being searched or computed at that moment. Typing your own question instead opens Patsnap Eureka, which does run it live.
Help us improve
Something wrong, out of date, or missing on this page? Tell us and it goes straight to the team that maintains it.
This page