IP Library › Granted Patent US 12,513,012
Granted Patent B1
US 12,513,012 · App. 18/090,430 · Granted Dec 30, 2025

Linear network coding for blockchains

Inventor: Steve Shattil (Cheyenne, WY)
Assignee: Tybalt, LLC
H04L9/50H04L9/3218
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,513,012
App. No.
18/090,430
Granted
Dec 30, 2025
Kind
B1
Abstract

In a blockchain, transacting a record comprises performing linear network coding on the record or on a data file corresponding to the record, to produce a plurality of coded data parts; and storing at least one of the plurality of coded data parts on the blockchain or storing a proof of knowledge on the blockchain, the proof of knowledge derived from the coded data parts. Linear network coding coefficients might be derived from cryptographic hashes of the plurality of coded data parts. An all-or-nothing transform can use the cryptographic hashes to provide the proof of knowledge.

Claims (34)

1 . A method for transacting a record in a blockchain, comprising:

performing linear network coding on the record or on a data file corresponding to the record, to produce a plurality of coded data parts;

communicating fewer than the plurality of coded data parts to each blockchain node, each file-sharing network node, or each Cloud storage network node; and

storing the fewer than the plurality of coded data parts on the each blockchain node, the each file-sharing network node, or the each Cloud storage network node;

wherein each of the plurality of coded data parts is smaller than the record or the data file; and wherein the linear network coding derives linear network coding coefficients from a one-way function of at least one of the plurality of coded data parts.

2 . The method of claim 1 , wherein storing comprises employing fewer than the plurality of coded data parts to effect a state change on the blockchain.

3 . The method of claim 1 , wherein each of the plurality of coded data parts comprises an index corresponding to chronology of production of the plurality of coded data parts.

4 . The method of claim 1 , wherein each of the plurality of coded data parts comprises an identifier that associates the each of the plurality of coded data parts with the data file.

5 . The method of claim 1 , wherein at least one of the plurality of coded data parts comprises an initialization vector.

6 . The method of claim 1 , further comprising performing an all-or-nothing transform on a plurality of original data parts produced from the data file, or the plurality of coded data parts.

7 . The method of claim 1 , further comprising encrypting the data file, at least one of the plurality of coded data parts, or the data file and at least one of the plurality of coded data parts.

8 . An apparatus for transacting a record in a blockchain, comprising:

at least one processor; and

at least one computer-readable memory in electronic communication with the at least one processor, and instructions stored in the at least one computer-readable memory, the instructions executable by the at least one processor for:

performing linear network coding on the record or on a data file corresponding to the record, to produce a plurality of coded data parts;

communicating fewer than the plurality of coded data parts to each blockchain node, each file-sharing network node, or each Cloud storage network node; and

storing the fewer than the plurality of coded data parts on the each blockchain node, the each file-sharing network node, or the each Cloud storage network node;

wherein each of the plurality of coded data parts is smaller than the record or the data file; and wherein the linear network coding derives linear network coding coefficients from a one-way function of at least one of the plurality of coded data parts.

9 . The apparatus of claim 8 , wherein storing comprises employing the fewer than the plurality of coded data parts to effect a state change on the blockchain.

10 . The apparatus of claim 8 , wherein each of the plurality of coded data parts comprises an index corresponding to chronology of production of the coded data parts.

11 . The apparatus of claim 8 , wherein each of the plurality of coded data parts comprises an identifier that associates the each of the plurality of coded data parts with the data file.

12 . The apparatus of claim 8 , wherein at least one of the plurality of coded data parts comprises an initialization vector.

13 . The apparatus of claim 8 , further comprising instructions stored in the at least one computer-readable memory, the instructions executable by the at least one processor for: performing an all-or-nothing transform on a plurality of original data parts produced from the data file, or the plurality of coded data parts.

14 . The apparatus of claim 8 , further comprising instructions stored in the at least one computer-readable memory, the instructions executable by the at least one processor for: encrypting the data file, at least one of the plurality of coded data parts, or the data file and at least one of the plurality of coded data parts.

15 . A computer program product, comprising: a non-transitory computer-readable memory having computer-readable program code stored thereon, the computer-readable program code containing instructions executable by at least one processor for:

performing linear network coding on the record or on a data file corresponding to the record, to produce a plurality of coded data parts;

communicating fewer than the plurality of coded data parts to each blockchain node, each file-sharing network node, or each Cloud storage network node; and

storing the fewer than the plurality of coded data parts on the each blockchain node, the each file-sharing network node, or the each Cloud storage network node;

wherein each of the plurality of coded data parts is smaller than the record or the data file; and wherein the linear network coding derives linear network coding coefficients from a one-way function of at least one of the plurality of coded data parts.

16 . The computer program product of claim 15 , wherein storing comprises employing the fewer than the plurality of coded data parts to effect a state change on the blockchain.

17 . The computer program product of claim 15 , wherein each of the plurality of coded data parts comprises an index corresponding to chronology of production of the plurality of coded data parts.

18 . The computer program product of claim 15 , wherein each of the plurality of coded data parts comprises an identifier that associates the each coded data part with the data file.

19 . The computer program product of claim 15 , wherein at least one of the plurality of coded data parts comprises an initialization vector.

20 . The computer program product of claim 15 , wherein the computer-readable program code further comprises instructions executable by the at least one processor for: performing an all-or-nothing transform on at least one of a plurality of original data parts produced from the data file, or the plurality of coded data parts.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 21, 2026
From: SHATTIL, STEVE, MR.
To: TYBALT, LLC
Reel/Frame 073540/0207 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 5, 2026
From: SHATTIL, STEVE
To: TYBALT, LLC
Reel/Frame 073362/0639 →
Continuity (2)
Provisional Application 63295326 · Dec 30, 2021
Provisional Application 63295334 · Dec 30, 2021
References Cited (143)
US 6331837B1 · Shattil · 2001 [cited by applicant]
US 7076168B1 · Shattil · 2006 [cited by applicant]
US 7430257B1 · Shattil · 2008 [cited by applicant]
US 7529198B2 · Jain et al. · 2009 [cited by applicant]
US 7743253B2 · Lauter et al. · 2010 [cited by applicant]
US 7787514B2 · Shattil · 2010 [cited by applicant]
US 7965761B2 · Shattil · 2011 [cited by applicant]
US 8068426B2 · Sundararajan et al. · 2011 [cited by applicant]
US 8098751B2 · Shattil · 2012 [cited by applicant]
US 8451756B2 · Lucani et al. · 2013 [cited by applicant]
US 8516344B2 · Kim · 2013 [cited by applicant]
US 8553784B2 · Huang et al. · 2013 [cited by applicant]
US 8670390B2 · Shattil · 2014 [cited by applicant]
US 8711978B2 · Kim · 2014 [cited by applicant]
US 8780693B2 · Kim et al. · 2014 [cited by applicant]
US 8929550B2 · Shattil · 2015 [cited by applicant]
US 8942082B2 · Shattil · 2015 [cited by applicant]
US 8953612B2 · Liu et al. · 2015 [cited by applicant]
US 8958309B2 · Kim · 2015 [cited by applicant]
US 9088351B2 · Liu et al. · 2015 [cited by applicant]
US 9112916B2 · Summerson et al. · 2015 [cited by applicant]
US 9165013B2 · Medard et al. · 2015 [cited by applicant]
US 9185529B2 · Medard et al. · 2015 [cited by applicant]
US 9191371B2 · Chang et al. · 2015 [cited by applicant]
US 9225471B2 · Shattil · 2015 [cited by applicant]
US 9270421B2 · Shattil · 2016 [cited by applicant]
US 9325805B2 · Shattil · 2016 [cited by applicant]
US 9402209B1 · Vivanco et al. · 2016 [cited by applicant]
US 9473226B2 · Shattil · 2016 [cited by applicant]
US 9485063B2 · Shattil · 2016 [cited by applicant]
US 9537759B2 · Calmon et al. · 2017 [cited by applicant]
US 9602246B2 · Mendes et al. · 2017 [cited by applicant]
US 9628231B2 · Shattil · 2017 [cited by applicant]
US 9647800B2 · Lucani et al. · 2017 [cited by applicant]
US 9673920B2 · Shattil · 2017 [cited by applicant]
US 9722776B2 · Nguyen et al. · 2017 [cited by applicant]
US 9749388B2 · Mahdaviani et al. · 2017 [cited by applicant]
US 9768842B2 · Shattil · 2017 [cited by applicant]
US 9787614B2 · Heide et al. · 2017 [cited by applicant]
US 9819449B2 · Shattil · 2017 [cited by applicant]
US 9860022B2 · Krigslund et al. · 2018 [cited by applicant]
US 9941996B2 · Yang et al. · 2018 [cited by applicant]
US 9954859B2 · Niset et al. · 2018 [cited by applicant]
US 10014882B2 · Sen et al. · 2018 [cited by applicant]
US 10034200B2 · Narasimha et al. · 2018 [cited by applicant]
US 10069746B2 · Anderson et al. · 2018 [cited by applicant]
US 10237782B2 · Yang et al. · 2019 [cited by applicant]
US 10355720B2 · Shattil · 2019 [cited by applicant]
US 10389568B1 · Shattil · 2019 [cited by applicant]
US 10425135B2 · Shattil · 2019 [cited by applicant]
US 10452621B2 · Medard et al. · 2019 [cited by applicant]
US 10484171B2 · Hu et al. · 2019 [cited by applicant]
US 10516617B2 · Anderson et al. · 2019 [cited by applicant]
US 10530574B2 · Shi et al. · 2020 [cited by applicant]
US 10958530B1 · Bowers · 2021 [cited by examiner]
US 11025312B2 · Shattil · 2021 [cited by applicant]
US 11075786B1 · Shattil · 2021 [cited by applicant]
US 11108705B2 · Fouli et al. · 2021 [cited by applicant]
US 11223508B1 · Shattil · 2022 [cited by applicant]
US 11297657B2 · Lahouti et al. · 2022 [cited by applicant]
US 11893626B2 · Youb · 2024 [cited by examiner]
US 12069180B1 · Racz · 2024 [cited by examiner]
US 20050152391A1 · Effros et al. · 2005 [cited by applicant]
US 20060224760A1 · Yu · 2006 [cited by examiner]
US 20100260189A1 · Ansari et al. · 2010 [cited by applicant]
US 20110051729A1 · Wei et al. · 2011 [cited by applicant]
US 20110142141A1 · Huang et al. · 2011 [cited by applicant]
US 20110243324A1 · Lima · 2011 [cited by examiner]
US 20120096124A1 · Medard et al. · 2012 [cited by applicant]
US 20120236763A1 · Lucani et al. · 2012 [cited by applicant]
US 20130073850A1 · Zaverucha · 2013 [cited by examiner]
US 20130230058A1 · Summerson et al. · 2013 [cited by applicant]
US 20130232397A1 · Summerson et al. · 2013 [cited by applicant]
US 20140016469A1 · Ho et al. · 2014 [cited by applicant]
US 20140036657A1 · Suter et al. · 2014 [cited by applicant]
US 20140269485A1 · Medard et al. · 2014 [cited by applicant]
US 20140269503A1 · Medard et al. · 2014 [cited by applicant]
US 20140269505A1 · Medard et al. · 2014 [cited by applicant]
US 20140328342A1 · Berman et al. · 2014 [cited by applicant]
US 20150146615A1 · Yu et al. · 2015 [cited by applicant]
US 20150358118A1 · Krigslund et al. · 2015 [cited by applicant]
US 20160134546A1 · Anderson et al. · 2016 [cited by applicant]
US 20160154970A1 · Calmon et al. · 2016 [cited by applicant]
US 20160182088A1 · Sipos et al. · 2016 [cited by applicant]
US 20160191402A1 · Anderson et al. · 2016 [cited by applicant]
US 20160359770A1 · Heide et al. · 2016 [cited by applicant]
US 20170118674A1 · Narasimha et al. · 2017 [cited by applicant]
US 20170127463A1 · Narasimha et al. · 2017 [cited by applicant]
US 20170195914A1 · Yang et al. · 2017 [cited by applicant]
US 20170317986A1 · Hu et al. · 2017 [cited by applicant]
US 20170364450A1 · Struttmann · 2017 [cited by examiner]
US 20170364698A1 · Goldfarb · 2017 [cited by examiner]
US 20170364700A1 · Goldfarb · 2017 [cited by examiner]
US 20170364701A1 · Struttmann · 2017 [cited by examiner]
US 20180046815A9 · Calmon et al. · 2018 [cited by applicant]
US 20180121286A1 · Sipos · 2018 [cited by examiner]
US 20180205552A1 · Struttmann · 2018 [cited by examiner]
US 20180212764A1 · Shi · 2018 [cited by examiner]
US 20190288850A1 · Beecham · 2019 [cited by examiner]
US 20190297649A1 · Lahouti et al. · 2019 [cited by applicant]
US 20190319797A1 · Suresh · 2019 [cited by examiner]
US 20200177311A1 · Ho · 2020 [cited by examiner]
US 20200213106A1 · Kang · 2020 [cited by examiner]
US 20200351220A1 · Fouli et al. · 2020 [cited by applicant]
US 20200382625A1 · Medard et al. · 2020 [cited by applicant]
US 20210058989A1 · Simsek · 2021 [cited by examiner]
US 20210105342A1 · Ballif et al. · 2021 [cited by applicant]
US 20210209077A1 · Snellman · 2021 [cited by examiner]
US 20210258375A1 · Cai · 2021 [cited by examiner]
US 20220069987A1 · Medard et al. · 2022 [cited by applicant]
US 20230108366A1 · Tang · 2023 [cited by examiner]
US 20230179435A1 · Heinecke · 2023 [cited by examiner]
US 20230188355A1 · Collins · 2023 [cited by examiner]
US 20230419327A1 · Wu · 2023 [cited by examiner]
US 20240129120A1 · Carr · 2024 [cited by examiner]
US 10,673,758 B2, 06/2020, Shattil (withdrawn) [cited by applicant]
S. Dasgupta, et al.; “Design of a polynomial ring based symmetric homomorphic encryption scheme”; Perspectives in Science (2016) 8, 692-695. [cited by applicant]
D. Charles, et al.; “Signatures for Network Coding”; International Journal of Information and Coding Theory 2006(1): 25; Mar. 2006. [cited by applicant]
N. Cai, et al.; “Secure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes”; IEEE Transactions on Information Theory ( vol. 66, Issue: 3, Mar. 2020). [cited by applicant]
X. Chu, et al.; “Practical Random Linear Network Coding on GPUs”; International Conference on Research in Networking, 2009, pp. 573-585. [cited by applicant]
M.N. Krohn, et al.; “On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution”; IEEE Symposium on Security and Privacy, 2004. Proceedings. May 2004. [cited by applicant]
M. Adeli, et al.; “Secure Network Coding with Minimum Overhead Based on Hash Functions”; IEEE Comm Letters, vol. 13, No. 12. Dec. 2009. [cited by applicant]
A. Kirsch, et al.; “Hash-Based Techniques for High-Speed Packet Processing”; Algorithms for Next Generation Networks, 2010; 181-218. [cited by applicant]
R. Dougherty, et al.; “Insufficiency of Linear Coding in Network Information Flow”; IEEE Transactions on Information Theory, vol. 51, No. 8, Aug. 2005. [cited by applicant]
T. Ho and D.S. Lun; “Network Coding: An Introduction”; Cambridge University Press; 1st edition (Apr. 14, 2008). [cited by applicant]
S-Y.R. Li, et al.; “Linear Network Coding”; IEEE Transactions on Information Theory, vol. 49, No. 2, Feb. 2003. [cited by applicant]
Y. Liu and Y. Morgan; “Security against Passive Attacks on Network Coding System—A Survey”; Computer Networks (2018), doi: 10.1016/j.comnet.2018.03.013. [cited by applicant]
C. Gkantsidis, et al.; “Network Coding for Large Scale Content Distribution”; Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Mar. 2005. [cited by applicant]
C. Fragouli and E. Soljanin; “Network Coding Applications”; Foundations and Trends in Networking, vol. 2, No. 2 (2007) 135-269. [cited by applicant]
J. Katz, B. Waters; “Compact Signatures for Network Coding”; International Association for Cryptologic Research http://eprint.iacr.org/2008/316, Oct. 2009. [cited by applicant]
E. Yilmaz, R. Knopp; “Hash-and-Forward Relaying for Two-Way Relay Channel”; 2011 IEEE International Symposium on Information Theory Proceedings; Jul. 31, 2011-Aug. 5, 2011. [cited by applicant]
Y. Liu and Y. Morgan; “Security Analysis of Subspace Network Coding”; Journal of Information Security, 2018, 9, 85-94. Jan. 23, 2018. [cited by applicant]
S. Katti, et al.; “XORs in The Air: Practical Wireless Network Coding”; IEEE/ACM Transactions on Networking Year: 2008 | vol. 16, Issue: 3. [cited by applicant]
V. Cerf, et al.; “Delay-Tolerant Network Architecture: The Evolving Interplanetary Internet”; IPN Research Group, <draft-irtf-ipnrg-arch-01.txt> Aug. 2002. [cited by applicant]
P.A. Chou, et al.; “Practical Network Coding”; Allerton Conference on Communication, Control, and Computing | Oct. 2003. [cited by applicant]
A. Gabizon, et al., “PlonK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge” Cryptology ePrint Archive, Paper 2019/953; year = {2019}. [cited by applicant]
T. Ho, et al., “On the utility of network coding in dynamic environments,” in Proc. Int. Workshop on Wireless Ad-Hoc Networks, Oulu, Finland, May/Jun. 2004, pp. 196-200. [cited by applicant]
T. Ho, et al., “A Random Linear Network Coding Approach to Multicast”, IEEE Transactions on Information Theory, vol. 52, No. 10, Oct. 2006. [cited by applicant]
A. Tavory, et al., “Bounds on linear codes for network multicast,” Electronic Colloquium on Computational Complexity, vol. 10, No. 033, 2003. [cited by applicant]
Q. Dong, et al.; “Practical network coding in wireless networks”; Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, MOBICOM 2007, Montréal, Quebec, Canada, Sep. 9-14, 2007. [cited by applicant]
ETSI TS 136.211 V13.0.0; LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Jan. 2016. [cited by applicant]
ETSI TS 138 211 V15.3.0; 5G NR, Physical channels and modulation (Oct. 2018). [cited by applicant]
3GPP TR 22.803 V12.2.0; 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; Feasibility study for Proximity Services (ProSe) (Release 12) (Jun. 2013). [cited by applicant]