Method of laminating multi layer structure together in a roll-to-roll process to make a pre-lamination that may be used in the making of credit and gift cards and mirror image variations thereof
US 11,052,698 Lapsed on the fee recordLapsed Jul 6, 2025 on the fee record · From the USPTO record
20-year base term ends May 17, 2037
First maintenance fee unpaid; grace period ended.
May 17, 2017
Jul 6, 2025
Jul 6, 2021
May 17, 2037
How we calculated this date
| Step | Input | Date after this step | Confidence |
|---|---|---|---|
| Base term, 20 years from filing | Clock starts May 17, 2017, when the earliest non-provisional application in its chain was filed (this one was filed Apr 9, 2019) | May 17, 2037 | USPTO record |
| Continuity chain | Every parent in the chain resolved | no change | USPTO record |
| Patent term adjustment | No term adjustment record on a grant after 2005, so none is added | no change | USPTO record |
| Terminal disclaimer cap | Disclaimer on file (approved), reference document not resolved | no cap applied, and none guessed | USPTO record |
| Patent term extension | None on file | no change | USPTO record |
| Fee events | 0 of 3 maintenance fees paid | lapsed Jul 6, 2025 | USPTO record |
| Computed term end | The steps above, in order | Jul 6, 2025 | USPTO record |
Sources
Google Patents · The patent document at USPTO · Assignment records at USPTO
USPTO account required: This application in Patent Center · USPTO's maintenance fee lookup
Maintenance fee events come from USPTO's own fee records. Its fee lookup asks for the patent number and the application number.
Not on this page: the patent's family, its recorded assignments and its citation count. USPTO's assignment records, linked above, list every recorded assignment.
Every date shows its work: the base term, any term adjustment or extension, any disclaimer cap, and the maintenance fee record, each with a confidence tier. How this record was built
Computed patent terms end on the dates shown. Related patents and pending applications may cover overlapping subject matter.