`US 20180109541A1
`( 19 ) United States
`( 12 ) Patent Application Publication ( 10 ) Pub . No . : US 2018 / 0109541 A1
`( 43 ) Pub . Date :
`Apr . 19 , 2018
`Gleichauf
`
`( 54 ) BLOCKCHAIN MINING USING TRUSTED
`NODES
`( 71 ) Applicant : ARM Ltd . , Cambridge ( GB )
`( 72 ) Inventor : Paul Harry Gleichauf , Los Altos , CA
`( US )
`( 21 ) Appl . No . : 15 / 295 , 695
`( 22 ) Filed :
`Oct . 17 , 2016
`Publication Classification
`
`( 51 )
`
`Int . Ci .
`H04L 29 / 06
`H04L 29 / 08
`H04W 8 / 24
`
`( 2006 . 01 )
`( 2006 . 01 )
`( 2006 . 01 )
`
`( 52 )
`
`H04L 9 / 32
`( 2006 . 01 )
`H04W 12 / 06
`( 2006 . 01 )
`U . S . CI .
`CPC . . . . . . H04L 63 / 123 ( 2013 . 01 ) ; H04L 67 / 1097
`( 2013 . 01 ) ; H04L 2463 / 102 ( 2013 . 01 ) ; H04L
`9 / 3236 ( 2013 . 01 ) ; H04W 12 / 06 ( 2013 . 01 ) ;
`H04W 8 / 24 ( 2013 . 01 )
`( 57 )
`ABSTRACT
`Briefly , example methods , apparatuses , and / or articles of
`manufacture are disclosed that may be implemented , in
`whole or in part , using one or more mobile communication
`devices and / or processing devices to facilitate and / or sup
`port one or more operations and / or techniques for block
`chain mining using trusted nodes , such as via democratiza
`tion of associated resources for fair blockchain mining , for
`example .
`
`Mobile Car
`110 Mobile Service Provider
`
`102
`
`118
`
`Transaction
`processor
`
`122
`
`122
`
`Inactive Mining Node
`
`Device DB
`Subscribers DB
`Billing DB
`Blockchain
`scheduler
`
`T
`Blockchain caches
`1122
`Active Mining Node
`
`104
`Mobile Device
`IMEI Subscriber
`
`106
`Mobile Device
`IMEI Subscriber
`
`IMSI
`ICCID ,
`etc .
`
`C
`114
`
`Oooo
`IMSI , etc .
`
`124
`
`IMSI
`ICCID ,
`etc .
`am
`
`C
`112
`
`0000
`IMSI , etc .
`
`120
`Lr122 Transaction
`processor
`
`1122
`
`Inactive Mining Node
`
`108
`
`Mobile Device
`IMEI Subscriber
`
`124
`-
`
`IMSI
`ICCID ,
`etc .
`
`2000
`MSI , etc .
`
`116
`
`PGR2023-00039 - Upstream Data
`Ex. 2005 - Page 1
`
`
`
`Patent Application Publication
`
`Apr . 19 , 2018 Sheet 1 of 5
`
`US 2018 / 0109541 A1
`
`Transaction processor
`
`122
`
`- 120
`
`102
`
`
`
`
`
`Mobile Service Provider
`
`Subscribers DB Billing DB
`
`Device DB
`
`Blockchain scheduler
`
`r122
`
`
`
`Blockchain caches
`
`
`
`
`
`Inactive Mining Node
`
`
`
`
`
`Active Mining Node
`
`110
`
`118
`
`Transaction processor
`
`
`
`
`
`Inactive Mining Node
`
`
`
`
`
`Mobile Device IMEI Subscriber
`
`1089
`
`Oooo
`IMSI ICCID , etc .
`
`I IMSI , etc .
`
`116
`
`21 - 14
`
`Mobile Device IMEI Subscriber
`
`
`
`1067
`
`FIG . 1
`
`0 IMSI , etc .
`> 0000
`etc .
`
`IMSI ICCID ,
`
`112
`
`-
`
`- 124
`
`-
`
`I
`
`-
`
`+
`
`0000 O IMSI , etc .
`IMSI ICCID , etc .
`
`114
`
`
`
`
`
`Mobile Device IMEI Subscriber
`
`104
`
`PGR2023-00039 - Upstream Data
`Ex. 2005 - Page 2
`
`
`
`Patent Application Publication
`
`Apr . 19 , 2018 Sheet 2 of 5
`
`US 2018 / 0109541 A1
`
`- 202
`( START
`
`- 204
`Enable customer
`voice / data
`
`200
`
`r 208
`
`206
`
`Opt - in
`
`Yes
`
`NO
`
`Voice / data services
`advertisement , etc .
`
`Customer pool
`
`210
`
`Download App
`
`Validate
`Provision
`
`- 212
`
`- 214
`
`Available
`
`Voice / data mining services
`advertisement , etc .
`
`FIG . 2
`
`- 216
`
`Customer Pool
`Mining pool
`
`+
`
`PGR2023-00039 - Upstream Data
`Ex. 2005 - Page 3
`
`
`
`Patent Application Publication
`
`Apr . 19 , 2018 Sheet 3 of 5
`
`US 2018 / 0109541 A1
`
`r 300
`
`- 306
`Candidate Block N
`
`- 318
`Candidate Block M
`
`324
`
`# n 77 . # p
`
`Rewards - rel .
`Transaction
`
`Rewards - rel .
`Transaction
`# p + 1
`
`Reward
`Transaction
`into next
`block
`
`Transaction
`
`Transaction
`# n + 1
`
`Transaction
`# n + 2
`
`PE001 - 11 Transaction
`
`Reward
`316
`
`Reward
`
`- 322
`MSP
`Internal
`Blockchain
`Block
`# 0
`
`Block
`# 1
`
`Block
`# 2
`
`START
`
`- 304
`
`MSP
`broadcasts
`transactions
`
`312
`Blockchain
`Customer
`# 1
`
`Block
`# 0
`
`Block
`# 1
`
`Block
`# 2
`
`Block
`# N - 1
`
`# n + 3
`
`- 308
`Broadcast to
`miner pool
`310
`Miner A solves
`Block N
`
`314
`Return to
`mining pool
`
`320
`1
`Broadcast to
`miner pool
`
`326
`Miners verify
`Block M .
`
`Block
`# M - 1
`
`FIG . 3
`
`PGR2023-00039 - Upstream Data
`Ex. 2005 - Page 4
`
`
`
`Patent Application Publication
`
`Apr . 19 , 2018 Sheet 4 of 5
`
`US 2018 / 0109541 A1
`
`400
`
`402
`Communicating electronically with a plurality of nodes on a network
`regarding a validation of a block of on - line transactions for a blockchain ,
`at least some of the plurality of nodes comprising at least one of the
`following : a full node ; a lightweight node ; or any combination thereof ,
`one or more communications of the communicating electronically
`occurring , at least in part , through use of trusted computational
`capabilities of the at least some of the plurality of nodes
`
`Qualifying the at least some of the plurality of nodes for a reward based ,
`at least in part , on the validation of the block of on - line transactions
`
`- 404
`
`7 406
`Qualifying the at least some of the plurality of nodes for a reward
`based , at least in part , on the trusted computational capabilities
`of the at least some of the plurality of nodes
`
`FIG . 4
`
`PGR2023-00039 - Upstream Data
`Ex. 2005 - Page 5
`
`
`
`Patent Application Publication
`
`Apr . 19 , 2018 Sheet 5 of 5
`
`US 2018 / 0109541 A1
`
`500
`
`- 502
`
`508
`
`- 506
`
`First Device
`
`Network
`
`Third Device
`
`- 530
`Communication
`Interface
`
`- 520
`
`Processor
`
`Second Device
`
`- 504
`
`- 532
`Input / Output
`
`515
`
`- 524
`Primary
`Memory
`
`522
`526
`Secondary
`Memory
`
`Memory
`
`- 540
`
`Computer - Readable
`Medium
`
`FIG . 5
`
`PGR2023-00039 - Upstream Data
`Ex. 2005 - Page 6
`
`
`
`US 2018 / 0109541 A1
`
`Apr . 19 , 2018
`
`BLOCKCHAIN MINING USING TRUSTED
`NODES
`BACKGROUND
`1 . Field
`[ 0001 ] The present disclosure relates generally to block
`chain infrastructure and , more particularly , to blockchain
`mining using trusted nodes .
`2 . Information
`Typically , although not necessarily , a blockchain is
`[ 0002 ]
`a content or data structure having a number of serially
`ordered , back - linked blocks of validated on - line transac
`tions . A block is typically , although not necessarily , a
`container - type content or data structure that aggregates a list
`of on - line transactions and references or " links ” back — to
`a previous block in a chain , also called a " parent " block , via
`a digital fingerprint of the previous block or so - called block
`" hash . ” As such , in a blockchain , each block contains a hash
`of its parent block , thus , effectively linking blocks in the
`chain via a sequence of hashes all the way to the very first
`block or so - called “ genesis ” block . Because a current
`block ' s hash incorporates and , thus , affects a previous
`block ' s hash in a blockchain , changing or modifying a
`parent block would modify a hash of its child ' s block . In
`turn , changing or modifying a child block would modify a
`hash of a grandchild ' s block and so on . Such a structure may ,
`for example , ensure that , once a block has a larger or
`otherwise sufficient number of subsequent or next genera
`tion blocks , the block may be difficult to modify due , at least
`in part , to an expensive effort involving re - computations of
`all previous blocks . As such , if an existing block in
`a
`blockchain is changed , then subsequent blocks must be
`recomputed , at a considerable computational cost . There
`fore , older blocks age to become accepted transaction his
`tory , and more secure as a result .
`[ 0003 ]
`In some instances , transactions within a block may ,
`for example , be validated by a particular network node ,
`known as a mining node or " miner , ” such as by finding a
`correct solution to a mathematical problem or puzzle via
`repeated cryptographic hashing operations . Having solved a
`puzzle , a miner may , for example , receive a reward and / or
`appropriate fee and may record its validated block of on - line
`transactions in a blockchain . At times , to be included in a
`blockchain , a validated block may also be verified or con
`firmed , such as by other miners on a network to ensure that
`the block complies with consensus rules ( e . g . , includes a
`correct solution to a puzzle , has a syntactically valid struc
`ture , etc . ) , network - wide or otherwise . To solve a puzzle ,
`however , a miner may compete with other miners on a
`network , such as by generating fixed - length hashes by
`repeatedly trying to vary an output of a hash a very large
`number of times , for example , until a resulting hash matches
`specific requirements . To achieve this , a miner may expend
`significant computing effort , processing and / or electrical
`power , among other things .
`[ 0004 ]
`In this high - intensity computing environment with
`ever - more - difficult blockchain puzzles , a likelihood of a
`miner without highly specialized hashing hardware capable
`of more effectively and / or efficiently finding a solution to a
`blockchain puzzle is rather small . As such , blockchain ' s
`incentive system encourages miners to adopt more efficient
`
`technology and , thereby , at least keep up with escalating
`difficulty of mining each new generation of blocks , and
`indirectly to jostle to monopolize potential earnings through
`utilizing continuously improved mining technology . Today ,
`to make mining profitable or sustainable , miners may utilize
`application - specific integrated circuits ( ASICs ) with a sig
`nificant hashing power , such as in relation to graphic pro
`cessing units ( GPUs ) , field programmable gate arrays
`( FGPA ) , etc . used in the past . As such , mining has become
`a business with significant capital costs ( e . g . , for an ASIC
`accelerated hash computation system , a place to house it ,
`network connections , etc . ) as well as operating costs ( elec
`tricity , monitoring personnel , etc . ) , meaning that ASIC min
`ers geographically clustered near cheaper electrical power
`and / or cooler climates ( e . g . , for ASIC heat dissipation , etc . ) ,
`for example , may gain an unfair advantage over other miners
`on a network . As a result , blockchain mining has become
`increasingly concentrated in particular geographic areas ,
`such as in cooler ( e . g . , mountainous , etc . ) places with readily
`accessible ( e . g . , unregulated , etc . ) and / or cheaper hydro
`power , for example .
`[ 0005 ]
`In some instances , the ability to compete for lesser
`reward over time ( possibly supplemented with transaction
`fees ) , such as due to a diminishing blockchain reward
`structure , for example , and / or exponential increase in min
`ing difficulty may lead to a rapid escalation of more pow
`erful hardware in fewer hands and / or particular geographic
`areas . This may , for example , disrupt a blockchain consen
`sus mechanism , may lead to a decline in blockchain protocol
`security , may have international trust and / or resiliency
`implications , etc . , and may ultimately lead to a failure of a
`blockchain mining market . For example , at times , a block
`chain thought to be secure due , at least in part , to its length ,
`as discussed above , may be undone by a group of conspiring
`miners having a significant share of a mining power via
`creating a longer chain ( e . g . , via a fork , etc . ) and , thus ,
`reversing previous blocks . As such , in some instances ,
`security of a blockchain may require knowing that partici
`pating miners have bounded and / or trusted computational
`capability , such as to guard against and / or detect potential
`selfish mining attacks , for example . Yet , current blockchain
`infrastructure may not be capable of determining or mea
`suring trustworthiness of mining nodes , such as in terms of
`their computational capability , for example , especially in a
`blockchain network where nodes are generally unknown
`and / or allowed to join or leave the network with little or no
`restrictions .
`BRIEF DESCRIPTION OF THE DRAWINGS
`[ 0006 ] Claimed subject matter is particularly pointed out
`and distinctly claimed in the concluding portion of the
`specification . However , both as to organization and / or
`method of operation , together with objects , features , and / or
`advantages thereof , it may best be understood by reference
`to the following detailed description if read with the accom
`panying drawings in which :
`[ 0007 ] FIG . 1 is a schematic diagram illustrating features
`associated with an implementation of an example use case or
`scenario of an operating environment .
`[ 0008 ]
`FIG . 2 is a flow diagram illustrating an implemen
`tation of an example process that may be performed to
`facilitate and / or support techniques for blockchain mining
`using trusted nodes .
`
`PGR2023-00039 - Upstream Data
`Ex. 2005 - Page 7
`
`
`
`US 2018 / 0109541 A1
`
`Apr . 19 , 2018
`
`FIG . 3 is a flow diagram illustrating another imple -
`[ 0009 ]
`mentation of an example process that may be performed to
`facilitate and / or support techniques for blockchain mining
`using trusted nodes .
`[ 0010 ]
`FIG . 4 is a flow diagram illustrating yet another
`implementation of an example process that may be per
`formed to facilitate and / or support techniques for blockchain
`mining using trusted nodes .
`[ 0011 ] FIG . 5 is a schematic diagram illustrating an imple
`mentation of an example computing environment associated
`with a server .
`[ 0012 ] Reference is made in the following detailed
`description to accompanying drawings , which form a part
`hereof , wherein like numerals may designate like parts
`throughout that are corresponding and / or analogous . It will
`be appreciated that the figures have not necessarily been
`drawn to scale , such as for simplicity and / or clarity of
`illustration . For example , dimensions of some aspects may
`be exaggerated relative to others . Further , it is to be under
`stood that other embodiments may be utilized . Furthermore ,
`structural and / or other changes may be made without depart
`ing from claimed subject matter . References throughout this
`specification to “ claimed subject matter ” refer to subject
`matter intended to be covered by one or more claims , or any
`portion thereof , and are not necessarily intended to refer to
`a complete claim set , to a particular combination of claim
`Taun
`sets ( e . g . , method claims , apparatus claims , etc . ) , or to a
`particular claim . It should also be noted that directions
`and / or references , for example , such as up , down , top ,
`bottom , and so on , may be used to facilitate discussion of
`drawings and are not intended to restrict application of
`claimed subject matter . Therefore , the following detailed
`description is not to be taken to limit claimed subject matter
`and / or equivalents .
`DETAILED DESCRIPTION
`[ 0013 ] References throughout this specification to one
`implementation , an implementation , one embodiment , an
`embodiment , and / or the like means that a particular feature ,
`structure , characteristic , and / or the like described in relation
`to
`a particular implementation and / or embodiment is
`included in at least one implementation and / or embodiment
`of claimed subject matter . Thus , appearances of such
`phrases , for example , in various places throughout this
`specification are not necessarily intended to refer to the same
`implementation and / or embodiment or to any one particular
`implementation and / or embodiment . Furthermore , it is to be
`understood that particular features , structures , characteris
`tics , and / or the like described are capable of being combined
`in various ways in one or more implementations and / or
`embodiments and , therefore , are within intended claim
`scope . In general , of course , as has always been the case for
`the specification of a patent application , these and other
`issues have a potential to vary in a particular context of
`usage . In other words , throughout the disclosure , particular
`context of description and / or usage provides helpful guid
`ance regarding reasonable inferences to be drawn ; however ,
`likewise , “ in this context ” in general without further quali
`fication refers at least to the context of the present patent
`application .
`[ 0014 ] Some example methods , apparatuses , and / or
`articles of manufacture are disclosed herein that may be
`used , in whole or in part , to facilitate and / or support one or
`more operations and / or techniques for blockchain mining
`
`using trusted nodes , such as via democratization of associ
`ated resources for fair blockchain mining . For example , as
`will be seen , in some instances , participants providing
`blockchain mining services may benefit from a variety of
`incentive plans that may be dynamically updated to reflect a
`value of resources that participants may contribute . In this
`context , “ fair , " " fairness , " or like terms with respect to
`blockchain mining refer to a principle allowing miners to
`track available rewards at a given time , such as while a
`blockchain mining process equitably and / or consistently
`honors these services and / or incentives . As also discussed
`below , in some instances , these one or more operations
`and / or techniques may , for example , be advantageously
`implemented , in whole or in part , in and / or with mobile
`communication devices . As used herein , " mobile device , "
`" mobile communication device , " " location - aware mobile
`device , " or like terms may be used interchangeably and refer
`to any kind of special purpose computing platform or
`apparatus that may from time to time have a position or
`location that changes . In some instances , a mobile commu
`nication device may , for example , be capable of estimating
`its location using one or more appropriate techniques and / or
`communicating with other devices , mobile or otherwise ,
`through wireless transmission or receipt of information
`according to one or more communication protocols . As a
`way of illustration , special purpose mobile communication
`devices , which may herein be called simply mobile devices ,
`may include , for example , cellular telephones , smart tele
`phones , personal digital assistants ( PDAs ) , laptop comput
`ers , personal entertainment systems , tablet personal com
`puters ( PC ) , personal audio or video devices , personal
`navigation devices , navigation systems , etc . , or any other
`type of device capable of being identified and / or authenti
`cated via one or more communication protocols , wireless or
`otherwise .
`[ 0015 ]
`In this context , blockchain “ mining ” or simply
`“ mining ” refers to a process of validating a block of on - line
`transactions by a mining node or “ miner , ” such as for
`inclusion in a blockchain , for example , via solving a block
`chain problem or puzzle , which may qualify the mining node
`or miner for a reward and / or appropriate fee . As used herein ,
`the terms “ mining node ” and “ miner ” may be used inter
`changeably and refer to a network node capable of solving
`a blockchain problem or puzzle via one or more crypto
`graphic hashing operations , such as using a proof - of - work
`type process or approach . Claimed subject matter is not
`limited to a particular process or approach , of course . For
`example , in some instances , a proof - of - stake - type process or
`approach may be used , in whole or in part , such as employ
`ing an escrow account for a particular miner and / or levying
`against disincentives to prevent or lessen improper miner
`behavior . Thus , even though a proof - of - work - type process
`or approach is used herein , such as for ease of discussion ,
`any other suitable processes or approaches , consensus - based
`or otherwise , may be utilized herein , in whole or in part ,
`such as instead of or in any combination with a proof - of
`work - type process or approach . For purposes of explanation ,
`to solve a blockchain puzzle , a miner of a particular block
`may hash the block ' s header repeatedly , such as , for
`example , by changing one parameter at the end of the
`header ' s hash , a so - called " nonce , " until a resulting hash
`meets a specific criteria , typically , a value that is equal or
`less than a current target ( e . g . , a value of a hash of a block ' s
`header , etc . ) . In some instances , one or more cryptographic
`
`PGR2023-00039 - Upstream Data
`Ex. 2005 - Page 8
`
`
`
`US 2018 / 0109541 A1
`
`Apr . 19 , 2018
`
`hashing operations may , for example , be implemented , at
`least in part , via a SHA256 - type process ( e . g . , double
`SHA256 , etc . ) , such as for a target comprising a 256 - bit
`number written as hexadecimal , though claimed subject
`matter is not so limited . Any other suitable cryptographic
`hashing operations now known ( e . g . , Scrypt , Blake - 256 ,
`CryptoNight , HEFTY1 , Quark , SHA - 3 , scrypt - jane , scrypt
`n , etc . ) and / or later developed may also be employed , in
`whole or in part , or otherwise considered .
`[ 0016 ] An “ on - line transaction ” or simply “ transaction ”
`refers to a signed on - line content structure indicating an
`agreement , communication , recordation , or some other elec
`tronic or on - line event . For example , a transaction may
`indicate a transfer of value , such as a cryptographic cur
`rency , etc . , transfer of assets and / or rights , such as a real
`estate property , confirmation of an identity , or the like . A
`transaction may , for example , be signed via any suitable
`digital signature , such as via a public key , private key , or the
`like , or any combination thereof . At times , a transaction may
`reference a previous transaction ' s output as new transaction
`input , for example , and may assign one or more input values
`to new output , as was indicated . A transaction may or may
`not be encrypted . As used herein , " on - line ” refers to a type
`of a communication that may be implemented electronically ,
`such as via one or more suitable communications networks
`( e . g . , wireless , wired , etc . ) , for example . It should be under
`stood , however , that these are merely examples of a trans
`action or on - line transaction , and claimed subject matter is
`not limited in this respect .
`[ 0017 ] " Content , ” as the term used herein , should be
`interpreted broadly and refers to signals , such signal packets ,
`for example , and / or states , such as physical states on a
`memory device , for example , but otherwise is employed in
`a manner irrespective of format , such as any expression ,
`representation , realization , and / or communication , for
`example . Content may comprise , for example , any informa
`tion , knowledge , and / or experience , such as , again , in the
`form of signals and / or states , physical or otherwise . In this
`context , " electronic ” or “ on - line content ” refers to content in
`a form that although not necessarily capable of being
`perceived by a human , ( e . g . , via human senses , etc . ) may
`nonetheless be transformed into a form capable of being so
`perceived , such as visually , haptically , and / or audibly , for
`example . Non - limiting examples may include text , audio ,
`images , video , combinations , or the like . Thus , content may
`be stored and / or transmitted electronically , such as before or
`after being perceived by human senses . In general , it may be
`understood that electronic and / or on - line content may be
`intended to be referenced in a particular discussion , although
`in the particular context , the term
`" content " may be
`employed for ease of discussion . Specific examples of
`content may include , for example , an e - mail message , text
`message , audio file , video file , web page , or the like .
`Claimed subject matter is not intended to be limited to these
`particular examples , of course .
`[ 0018 ] . As was indicated , one or more network nodes may
`comprise , for example , one or more mining nodes capable of
`finding a valid proof of work for new blocks via repeated
`cryptographic hashing operations . Depending on an imple
`mentation , a mining node may comprise , for example , a full
`node , a lightweight node , or any combination thereof . In this
`context , a “ full node ” refers to a network node capable of
`facilitating and / or supporting all or most processes for
`blockchain mining . For example , a full node may be capable
`
`of finding a valid proof of work , network routing , providing
`wallet services , maintaining a full copy of a blockchain in its
`memory , verify and / or propagate transactions , enforce con
`sensus rules , or the like . A “ lightweight node , ” as the term
`used herein , refers to any mining node other than a full node .
`For example , a lightweight node may be capable of finding
`a valid proof of work for a block of on - line transactions
`and / or communicating block - related updates for inclusion in
`a blockchain , but may not be capable of maintaining a full
`copy of a blockchain in its memory , such as due , at least in
`part , to memory constraints , as one possible example . Thus ,
`in some instances , a lightweight node may , for example , rely
`on one or more other nodes ( e . g . , other lightweight nodes ,
`full nodes , server devices on a network , etc . ) , such as for
`transaction verifications , block validations , etc . One particu
`lar example of a lightweight node may include a simplified
`payment verification ( SPV ) node capable of downloading
`block headers , rather than full blocks , for example , for a
`blockchain . Claimed subject matter is not so limited , of
`course .
`[ 0019 ] As alluded to previously , in some instances , block
`chain ' s security may be jeopardized or affected , for
`example , by a geographically localized syndicate of miners
`controlling a preponderance of mining computational
`resources , such as through access to cheaper power , superior
`mining technology , or the like . In some instances , these or
`like geographic concentrations , particularly over con
`strained network links , may also impact or affect block
`chain ' s security due , at least in part , to network - related
`“ bottlenecks . ” As was also indicated , since a typical block
`chain may allow for a participation of unknown and , thus ,
`untrusted nodes , and since verification of nodes ' identity
`and / or computational capacity is outside of a typical block
`chain ' s protocol , at times , blockchain infrastructure may be
`vulnerable to selfish mining attacks , among others . Since , in
`some instances , a blockchain may be offered and / or
`employed as and / or in connection with a suitable service
`( e . g . , for banking transaction processing , etc . ) , as discussed
`below , this may , for example , present a concern in some
`instances . For example , in banking , financial , or like sectors ,
`among others , allowing unknown and / or untrusted parties to
`validate transactions , such as clear payments , remittances , or
`the like may not be desirable and / or prudent . In addition , at
`times , network - related scalability may affect performance of
`blockchain infrastructure , for example , considering that a
`relatively larger number of miners may be necessary or
`otherwise useful to validate transactions . For example , more
`" fragile ” or less scalable networks may fail to keep a larger
`number of mining nodes on - line ( e . g . , operational , etc . ) ,
`which , in some instances , may make a task of finding a valid
`solution more difficult .
`[ 0020 ]
`To address these or like issues , at times , banking ,
`financial , or like services employ private blockchains that
`may be of relatively limited use , such as for inter - bank funds
`transfers , for example , by allowing another trusted bank ( s )
`to participate , such as using trusted hardware to add blocks
`to a collective blockchain and keeping miners select ,
`secured , and / or relatively small in number . This approach ,
`however , may not fully benefit from decentralized and / or
`distributed nature of blockchain infrastructure , such as , for
`example , beyond the cloud - like model of being able to
`dynamically distribute load among many parties and / or track
`the costs . As was indicated , at times , a larger numbers of
`participating authenticated platforms of known capacity
`
`PGR2023-00039 - Upstream Data
`Ex. 2005 - Page 9
`
`
`
`US 2018 / 0109541 A1
`
`Apr . 19 , 2018
`
`may , for example , increase a security of a blockchain .
`Accordingly , it may be desirable to develop one or more
`methods , systems , and / or apparatuses that may generate
`and / or integrate trusted blockchain infrastructure with an
`operations support system ( OSS ) or like computing platform
`of a service provider , such as to implement blockchain
`mining in a larger - scale controlled computing environment ,
`which may include a world - wide network of nodes , as one
`example , with provable computational capability .
`[ 0021 ] Thus , as will be described in greater detail below ,
`in an implementation , one or more blocks of on - line trans
`actions may , for example , be validated , at least in part , via
`finding valid proof of work while using idle cycles of
`processing units of network - connected mobile devices reg
`istered with one or more mobile service providers ( MSPs ) .
`Here , mobile device - related records may be used , at least in
`part , to address lack of trustworthiness or like issues dis
`cussed above , such as via associated unique identities , for
`example , indicative of mobile devices ' computational capa
`bilities . More specifically , based , at least in part , on one or
`more identifiers , such as an International Mobile Equipment
`Identity ( IMEI ) , an International Mobile Subscriber Identity
`( IMSI ) , or the like , an MSP may be capable of certifying
`computational capabilities of its mobile devices and / or prov
`ing that a particular mobile device is not an ASIC - acceler
`ated miner with an unfair advantage .
`[ 0022 ] As also discussed below , charging cycles of par
`ticipating mobile devices may be extended in some manner ,
`such as at night while a network is underutilized , for
`example , and used , in whole or in part , for finding valid
`proof of work , communicating updates to a blockchain ,
`and / or other applicable processes . Thus , in some instances ,
`one or more operations and / or techniques for blockchain
`mining using trusted nodes may , for example , provide
`advantages , such as via enabling a service provider to offer
`one or more blockchain - related services , among others , in
`exchange for a reward and / or appropriate fee , as will also be
`seen . At times , utilization of trusted mining entities may also
`prevent rapid increases in mining capacity on a relatively
`fast cadence . Namely , with a possibility of an end - of
`Moore ' s - Law , a Nakamoto - based model for escalating dif
`ficulty may , for example , become problematic since , at
`times , advancing cadence of difficulty may not reflect rates
`of advancing hardware capabilities . As was also alluded to
`previously , one or more approaches discussed herein may
`yield a more predictable and / or controlled blockchain infra
`structure .
`0023 ] FIG . 1 is a schematic diagram illustrating features
`associated with an implementation of an example use case or
`scenario of an operating environment 100 that may be used ,
`in whole or in part , to facilitate and / or support one or more
`operations and / or techniques for blockchain mining using
`trusted nodes . As was indicated , in some instances , example
`operating environment 100 may , for example , be imple
`mented , in whole or in part , in connection with a blockchain
`service that may be offered and / or provided by a mobile
`service provider ( MSP ) , referenced generally via an arrow at
`102 . As seen , MSP 102 may , for example , have a plurality
`of subscribing mobile devices , referenced generally at 104 ,
`106 , and 108 , such as registered on its network via one or
`more unique identifiers , discussed below . It should be noted
`that , even though a certain number of particular devices ,
`networks , systems , databases , features , links , etc . are illus
`trated , any number of suitable devices , networks , systems ,
`
`databases , features , links , etc . may be implemented herein .
`For example , in some instances , a number of service pro
`viders may join efforts , collaborate , etc . so as to offer and / or
`provide mobile and / or blockchain services in a number of
`jurisdictions , even globally . For example , mobile service
`providers may confederate around the globe to provide a
`global service across a diurnal cycle with larger populations
`charging their phones or otherwise relatively inactive . Also ,
`depending on an implementation , a single and / or double
`sided arrow , if shown , may , for example , indica