IP Library › Granted Patent US 12,542,676
Granted Patent B2
US 12,542,676 · App. 18/625,029 · Granted Feb 3, 2026

Systems and methods for recording data representing multiple interactions

Inventors: Ajith Thekadath (San Ramon, CA); Suman Mukherjee (Foster City, CA); Mondo Jacobs (San Ramon, CA); David Henstock (San Francisco, CA)
Assignee: Visa International Service Association
H04L9/3239G06F16/2379H04L9/30H04L9/3247H04L9/50
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,542,676
App. No.
18/625,029
Granted
Feb 3, 2026
Kind
B2
Abstract

A method for combining multiple interactions into a single record entry is disclosed. A data package can be created that represents a set of interactions, and each entity associated with an interaction can review the data package. Each entity can indicate agreement with the interactions by digitally signing the data package. Once signed by each involved entity, the data package can be stored in a record such as a blockchain.

Claims (29)

1 . A method comprising:

receiving, by an administrative node computer, from a first node computer, a data package which defines a plurality of interactions, the plurality of interactions including a first interaction associated with the first node computer and a second interaction associated with the administrative node computer, where the first interaction includes transferring a first value from a first account associated with the first node computer to a second account associated with the administrative node computer, and where the second interaction includes transferring a second value from the second account associated with the administrative node computer to a third account associated with a second node computer; and

creating, by the administrative node computer, a block for a blockchain, the block including the data package.

2 . The method of claim 1 , where the plurality of interactions are designed to, in combination, transfer the second value from the first account associated with the first node computer to the third account associated with the second node computer.

3 . The method of claim 1 , where the first value is the same as the second value.

4 . The method of claim 1 , where the data package indicates that the second value will be transferred even if the first value is not transferred.

5 . The method of claim 1 , where the data package was generated by the first node computer.

6 . The method of claim 1 , where the data package includes a first address of the administrative node computer and a second address of the second node computer.

7 . The method of claim 1 , further comprising:

transmitting, by the administrative node computer, the data package to the second node computer.

8 . A method comprising:

generating, by a first node computer, a data package which defines a plurality of interactions, the plurality of interactions including a first interaction associated with the first node computer and a second interaction associated with an administrative node computer, where the first interaction includes transferring a first value from a first account associated with the first node computer to a second account associated with the administrative node computer, and where the second interaction includes transferring a second value from the second account associated with the administrative node computer to a third account associated with a second node computer; and

transmitting, by the first node computer, the data package to the administrative node computer, wherein the administrative node computer creates a block for a blockchain, the block including the data package.

9 . The method of claim 8 , where the plurality of interactions are designed to, in combination, transfer the second value from the first account associated with the first node computer to the third account associated with the second node computer.

10 . The method of claim 8 , where a first smart contract causes the first interaction to occur, and a second smart contract causes the second interaction to occur.

11 . The method of claim 8 , where the data package is a first data package, the plurality of interactions is a first plurality of interactions, and the block further includes a second data package that defines a second plurality of interactions different than the first plurality of interactions.

12 . The method of claim 8 , where the second value is less than the first value.

13 . The method of claim 8 , where the data package indicates that the second value will be transferred even if the first value is not transferred.

14 . A method comprising:

receiving, by a second node computer, a data package which defines a plurality of interactions, the plurality of interactions including a first interaction associated with a first node computer and a second interaction associated with an administrative node computer, wherein the first interaction includes transferring a first value from a first account associated with the first node computer to a second account associated with the administrative node computer, wherein the second interaction includes transferring a second value from the second account associated with the administrative node computer to a third account associated with the second node computer, and wherein the administrative node computer creates a block for a blockchain, the block including the data package; and

verifying, by the second node computer, that the data package is entered into the blockchain.

15 . The method of claim 14 , where the plurality of interactions are designed to, in combination, transfer the second value from the first account associated with the first node computer to the third account associated with the second node computer.

16 . The method of claim 14 , further comprising:

providing, by the second node computer, a third value to a fourth account associated with a user, wherein the third value is equal to the second value.

17 . The method of claim 16 , where the providing the third value to the fourth account associated with the user occurs before the second value is received from the second account associated with the administrative node computer.

18 . The method of claim 14 , further comprising:

updating, by the second node computer, local records based on the data package.

19 . The method of claim 14 , where the data package indicates that the second value will be transferred even if the first value is not transferred.

20 . The method of claim 14 , where the data package is received from the administrative node computer, and the data package was generated by the first node computer.

Continuity (4)
Continuation 17863861 · Jul 13, 2022
Continuation 16604950
Provisional Application 62490502 · Apr 26, 2017
Related Publication 20240265007A1 · Aug 8, 2024
References Cited (67)
US 10419209B1 · Griffin et al. · 2019 [cited by applicant]
US 10521780B1 · Hopkins, III et al. · 2019 [cited by applicant]
US 11128437B1 · Nossik · 2021 [cited by examiner]
US 11188977B2 · Youb · 2021 [cited by examiner]
US 11429592B2 · Thekadath · 2022 [cited by applicant]
US 20080046443A1 · Fachan et al. · 2008 [cited by applicant]
US 20080144637A1 · Sylvain et al. · 2008 [cited by applicant]
US 20130197939A1 · Shah · 2013 [cited by applicant]
US 20150121081A1 · Dayka et al. · 2015 [cited by applicant]
US 20160028552A1 · Spanos et al. · 2016 [cited by applicant]
US 20160099920A1 · Meuleman et al. · 2016 [cited by applicant]
US 20160253663A1 · Clark et al. · 2016 [cited by applicant]
US 20160275461A1 · Sprague et al. · 2016 [cited by applicant]
US 20160283920A1 · Fisher et al. · 2016 [cited by applicant]
US 20160342976A1 · Davis · 2016 [cited by applicant]
US 20160342989A1 · Davis · 2016 [cited by applicant]
US 20170046364A1 · Gajendran et al. · 2017 [cited by applicant]
US 20170046651A1 · Lin et al. · 2017 [cited by applicant]
US 20170046652A1 · Haldenby et al. · 2017 [cited by applicant]
US 20170059744A1 · Lundy et al. · 2017 [cited by applicant]
US 20170091397A1 · Shah · 2017 [cited by applicant]
US 20170250972A1 · Ronda et al. · 2017 [cited by applicant]
US 20170323294A1 · Rohlfing et al. · 2017 [cited by applicant]
US 20180004930A1 · Csinger et al. · 2018 [cited by applicant]
US 20180232526A1 · Reid · 2018 [cited by examiner]
US 20190208414A1 · Roennow et al. · 2019 [cited by applicant]
US 20200099518A1 · Jacobs et al. · 2020 [cited by applicant]
US 20200387893A1 · Maim · 2020 [cited by examiner]
CN 105761143A · 2016 [cited by applicant]
CN 105956923A · 2016 [cited by applicant]
CN 105976232A · 2016 [cited by applicant]
CN 106230852A · 2016 [cited by applicant]
CN 106296138A · 2017 [cited by applicant]
CN 106452785A · 2017 [cited by applicant]
EP 3073670A1 · 2016 [cited by applicant]
GB 201617872D · 2016 [cited by applicant]
WO 2016161073A1 · 2016 [cited by applicant]
WO 2017004527A1 · 2017 [cited by applicant]
WO 2018085558A2 · 2018 [cited by applicant]
WO WO2018112947A1 · 2018 [cited by examiner]
Mathews, Malachy, Dan Robles, and Brian Bowe. “BIM+ blockchain: A solution to the trust problem in collaboration?.” (2017). (Year: 2017). [cited by examiner]
U.S. Appl. No. 16/604,950 , “Corrected Notice of Allowability”, May 18, 2022, 2 pages. [cited by applicant]
U.S. Appl. No. 16/604,950 , “Corrected Notice of Allowability”, May 12, 2022, 3 pages. [cited by applicant]
U.S. Appl. No. 16/604,950 , First Action Interview Office Action Summary, Mailed On Feb. 8, 2022, 4 pages. [cited by applicant]
U.S. Appl. No. 16/604,950 , First Action Interview Pilot Program Pre-Interview Communication, Mailed On Jan. 26, 2022, 5 pages. [cited by applicant]
U.S. Appl. No. 16/604,950 , Notice of Allowance, Mailed On Apr. 15, 2022, 10 pages. [cited by applicant]
AU2018257949 , “First Examination Report”, Apr. 28, 2022, 3 pages. [cited by applicant]
AU2018257949 , “Notice of Acceptance”, Aug. 10, 2022, 3 pages. [cited by applicant]
AU2022241492 , “First Examination Report”, Sep. 19, 2023, 3 pages. [cited by applicant]
AU2022241492 , “Notice of Acceptance”, Jan. 29, 2024, 3 pages. [cited by applicant]
Application No CA3,059,438 , Office Action, Mailed On Jan. 4, 2024, 5 pages. [cited by applicant]
Chandrasekhar et al., “A Trapdoor Hash-Based Mechanism for Stream Authentication”, Institute of Electrical and Electronics Engineers Transactions on Dependable and Secure Computing, vol. 9, No. 5, May 22, 2012, pp. 699-… [cited by applicant]
Application No. CN201880027081.0 , Notice of Decision to Grant, Mailed On Apr. 19, 2022, 6 pages. [cited by applicant]
Application No. CN201880027081.0 , Office Action, Mailed On Dec. 22, 2021, 18 pages. [cited by applicant]
Application No. EP18789851.5 , Extended European Search Report, Mailed On Mar. 3, 2020, 8 pages. [cited by applicant]
Application No. EP18789851.5 , Office Action, Mailed On Jun. 11, 2021, 4 pages. [cited by applicant]
Merkle , “Protocols for Public Key Cryptosystems”, 1980 IEEE Symposium on Security and Privacy, Apr. 1980, 13 pages. [cited by applicant]
Application No. PCT/US2018/027455 , International Preliminary Report on Patentability, Mailed On Nov. 7, 2019, 8 pages. [cited by applicant]
Application No. PCT/US2018/027455 , International Search Report and Written Opinion, Mailed On Aug. 1, 2018, 12 pages. [cited by applicant]
Rivest et al., “A Method for Obtaining Digital Signatures and Public Key Cryptosystems”, Communications of the ACM, vol. 21, Issue 2, Feb. 1978, 7 pages. [cited by applicant]
Xu et al., “DL-BAC: Distributed Ledger Based Access Control for Web Applications”, Proceedings of the 26th International Conference on World Wide Web Companion, Apr. 3, 2017, pp. 1445-1450. [cited by applicant]
IN201947045952 , “First Examination Report”, Jan. 28, 2022, 6 pages. [cited by applicant]
Application No. CN202210773767.2 , Office Action, Mailed On Feb. 19, 2025, 12 pages. [cited by applicant]
Li et al., “Theory Application Fields and Challenge of the Blockchain Technology”, Telecommunications Science, No. 12, Dec. 20, 2016,. [cited by applicant]
EP18789851.5 , “Intention to Grant”, May 31, 2024, 9 pages. [cited by applicant]
Application No. CN202210773767.2 , Notice of Decision to Grant, Mailed On Jun. 17, 2025, 5 pages. [cited by applicant]
Application No. CA 3,059,438, Notice of Allowance, Mailed On Jul. 10, 2025, 1 page. [cited by applicant]