Patent Publication Number: US-10320569-B1

Title: Systems and methods for authenticating a digitally signed assertion using verified evaluators

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application claims priority to Provisional Application No. 62/653,330 filed on Apr. 5, 2018 and entitled “SYSTEMS AND METHODS FOR ENERGY AND TIME-EFFICIENT CRYPTOGRAPHIC IMMUTABLE LEDGER GENERATION AND AUTHENTICATION” the entirety of which is incorporated herein by reference. 
    
    
     FIELD OF THE INVENTION 
     The present invention generally relates to the field of data storage and authentication in distributed computing systems. In particular, the present invention is directed to systems and methods for authenticating a digitally signed assertion using verified evaluators. 
     BACKGROUND 
     Distributed ledgers and related data storage techniques, such as block chain technology, have greatly improved the ability to track transactions and other data securely in a transparent and readily verifiable manner. Block chain technology, however, remains limited in its usefulness because of its inherently extensive demands on computing power; verification of chains of transactions via hashing and public key cryptographic algorithms, and creation of new entries on such chains by similar processes, uses many computing clock cycles, which in turn results in costly degrees of consumption of energy and sometimes in lengthy wait times. Solutions thus far have implicitly proposed trade-offs between security and efficiency, for instance by using expedited processes that review portions of chains on a heuristic basis, skipping or deferring until later the review of entire chains to ensure the integrity of the process. The high degree of certainty required for the ledgers, however, means that such tradeoffs are not optimal, and generally must be supplemented with the same expensive processes originally used. 
     SUMMARY OF THE DISCLOSURE 
     In an aspect, a method of authenticating a digitally signed assertion using verified evaluators includes receiving, by a first processor coupled to a memory at least a first digitally signed assertion. The method includes identifying, by the first processor, at least a cryptographic evaluator communicatively coupled to the first processor. The method includes assigning, by the first processor, at least a confidence level to the at least a cryptographic evaluator. The method includes providing, by the first processor, the at least a first digitally signed assertion to the at least a cryptographic evaluator. The method includes receiving, by the first processor and from the at least a cryptographic evaluator, at least an appraisal of the at least a first digitally signed assertion. The method includes authenticating, by the first processor, the at least a first digitally signed assertion as a function of the at least an appraisal and the at least a confidence level. 
     In another aspect, a system for authenticating a digitally signed assertion using a verified evaluator includes a first processor coupled to a memory, the first processor communicatively coupled to at least a cryptographic evaluator. The first processor is designed and configured to receive at least a first digitally signed assertion, assign at least a confidence level to the at least a cryptographic evaluator provide the at least a digitally signed assertion to the cryptographic evaluator receiving, from the at least a cryptographic evaluator, at least an appraisal of the at least a first digitally signed assertion, and authenticate the at least a first digitally signed assertion as a function of the at least an appraisal and the at least a confidence level. 
     These and other aspects and features of non-limiting embodiments of the present invention will become apparent to those skilled in the art upon review of the following description of specific non-limiting embodiments of the invention in conjunction with the accompanying drawings. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       For the purpose of illustrating the invention, the drawings show aspects of one or more embodiments of the invention. However, it should be understood that the present invention is not limited to the precise arrangements and instrumentalities shown in the drawings, wherein: 
         FIG. 1  is a block diagram illustrating an exemplary embodiment of a system for authenticating a digitally signed assertion using verified evaluators; 
         FIG. 2  is a block diagram illustrating an exemplary embodiment of a temporally sequential listing of digitally signed assertions; 
         FIG. 3  is a block diagram of an exemplary embodiment of a network for authenticating a digitally signed assertion using verified evaluators; 
         FIG. 4 \ is a flow diagram illustrating an exemplary method of authenticating a digitally signed assertion using verified evaluators; and 
         FIG. 5  is a block diagram of a computing system that can be used to implement any one or more of the methodologies disclosed herein and any one or more portions thereof. 
     
    
    
     The drawings are not necessarily to scale and may be illustrated by phantom lines, diagrammatic representations and fragmentary views. In certain instances, details that are not necessary for an understanding of the embodiments or that render other details difficult to perceive may have been omitted. 
     DETAILED DESCRIPTION 
     At a high level, aspects of the present disclosure are directed to improvements to architecture and processes for authentication of digitally signed assertions and files containing digitally signed assertions, including cryptographic immutable ledgers, such as block chains or the like. In an embodiment, methods for selecting evaluators, which may be members of a network sharing or accessing an immutable ledger, may include selection of a subset of possible evaluators to perform a more rapid authentication process than that presented by a purely consensus-based approach. Selection of evaluators to perform authentication may include identifying evaluators having proximity to a querying device so that authentication may occur more rapidly, as well as identifying evaluators that may be trusted according to one or more protocols for determining levels of trust. 
     In an embodiment, methods and systems described herein may perform implement one or more aspects of a cryptographic system. In one embodiment, a cryptographic system is a system that converts data from a first form, known as “plaintext,” which is intelligible when viewed in its intended format, into a second form, known as “cyphertext,” which is not intelligible when viewed in the same way. Cyphertext may be unintelligible in any format unless first converted back to plaintext. In one embodiment, a process of converting plaintext into cyphertext is known as “encryption.” Encryption process may involve the use of a datum, known as an “encryption key,” to alter plaintext. Cryptographic system may also convert cyphertext back into plaintext, which is a process known as “decryption.” Decryption process may involve the use of a datum, known as a “decryption key,” to return the cyphertext to its original plaintext form. In embodiments of cryptographic systems that are “symmetric,” decryption key is essentially the same as encryption key: possession of either key makes it possible to deduce the other key quickly without further secret knowledge. Encryption and decryption keys in symmetric cryptographic systems may be kept secret, and shared only with persons or entities that the user of the cryptographic system wishes to be able to decrypt the cyphertext. One example of a symmetric cryptographic system is the Advanced Encryption Standard (“AES”), which arranges plaintext into matrices and then modifies the matrices through repeated permutations and arithmetic operations with an encryption key. 
     In embodiments of cryptographic systems that are “asymmetric,” either encryption or decryption key cannot be readily deduced without additional secret knowledge, even given the possession of a corresponding decryption or encryption key, respectively; a common example is a “public key cryptographic system,” in which possession of the encryption key does not make it practically feasible to deduce the decryption key, so that the encryption key may safely be made available to the public. An example of a public key cryptographic system is RSA, in which an encryption key involves the use of numbers that are products of very large prime numbers, but a decryption key involves the use of those very large prime numbers, such that deducing the decryption key from the encryption key requires the practically infeasible task of computing the prime factors of a number which is the product of two very large prime numbers. Another example is elliptic curve cryptography, which relies on the fact that given two points P and Q on an elliptic curve over a finite field, and a definition for addition where A+B=R, the point where a line connecting point A and point B intersects the elliptic curve, where “0,” the identity, is a point at infinity in a projective plane containing the elliptic curve, finding a number k such that adding P to itself k times results in Q is computationally impractical, given correctly selected elliptic curve, finite field, and P and Q. 
     Some embodiments of the disclosed systems and methods involve creation and/or evaluation of digital signatures. A digital signature as used herein is an encrypted mathematical representation of a file or other set of data using the private key of a public key cryptographic system. Signature may be verified by decrypting the encrypted mathematical representation using the corresponding public key and comparing the decrypted representation to a purported match that was not encrypted; if the signature protocol is well-designed and implemented correctly, this means the ability to create the digital signature is equivalent to possession of the private decryption key. Likewise, if mathematical representation of file is well-designed and implemented correctly, any alteration of the file will result in a mismatch with the digital signature; the mathematical representation may be produced using an alteration-sensitive, reliably reproducible algorithm, such as a hashing algorithm as described in further detail below. A mathematical representation to which the signature may be compared may be included with signature, for verification purposes; in other embodiments, the algorithm used to produce the mathematical representation is publicly available, permitting the easy reproduction of the mathematical representation corresponding to any file. 
     In some embodiments, persons, devices, or transactions may be authenticated or assigned a confidence level using digital certificates. In one embodiment, a digital certificate is a file that conveys information and links the conveyed information to a “certificate authority” that is the issuer of a public key in a public key cryptographic system. Certificate authority in some embodiments contains data conveying the certificate authority&#39;s authorization for the recipient to perform a task. The authorization may be the authorization to access a given datum. The authorization may be the authorization to access a given process. In some embodiments, the certificate may identify the certificate authority. The digital certificate may include a digital signature. 
     In some embodiments, a third party such as a certificate authority (CA) is available to verify that the possessor of the private key is a particular entity; thus, if the certificate authority may be trusted, and the private key has not been stolen, the ability of an entity to produce a digital signature confirms the identity of the entity and links the file to the entity in a verifiable way. Digital signature may be incorporated in a digital certificate, which is a document authenticating the entity possessing the private key by authority of the issuing certificate authority and signed with a digital signature created with that private key and a mathematical representation of the remainder of the certificate. In other embodiments, digital signature is verified by comparing the digital signature to one known to have been created by the entity that purportedly signed the digital signature; for instance, if the public key that decrypts the known signature also decrypts the digital signature, the digital signature may be considered verified. Digital signature may also be used to verify that the file has not been altered since the formation of the digital signature. In other embodiments where trust in a single certificate authority is undesirable (e.g., where there is concern of the certificate authority and verifier colluding), the same functionality may be accomplished by a group of certificate authorities acting to authenticate in coordination, with the requirement that a threshold number of the group of certificate authorities, and/or a threshold proportion of the group of certificate authorities, agree (e.g. “threshold cryptography”); a confidence level in each certificate authority may be determined according to any method or means described herein for determination of a confidence level in any device or entity, including without limitation in a cryptographic evaluator as described in further detail below. In an embodiment, certificate authorities that have a confidence level below a given threshold level may be eliminated; in other embodiments, certificate authority confidence levels may be aggregated according to any method shown herein. Aggregate confidence level may be used for threshold cryptography as described above; for instance, agreeing certificate authorities may have an aggregate confidence level which must exceed a threshold, or aggregate confidence level of agreeing certificate authorities may be required to represent a threshold proportion of aggregate confidence level of all certificate authorities in group. Additional embodiments may include group signature schemes that issue certificates on a membership public key generated by a secure computing module as described in further detail below; in such scenarios, authentication may include proof by the secure computing module that the secure computing module possesses a secret key to a public key/certificate pair. 
     In some embodiments, systems and methods described herein produce cryptographic hashes, also referred to by the equivalent shorthand term “hashes.” A cryptographic hash, as used herein, is a mathematical representation of a lot of data, such as files or blocks in a block chain as described in further detail below; the mathematical representation is produced by a lossy “one-way” algorithm known as a “hashing algorithm.” Hashing algorithm may be a repeatable process; that is, identical lots of data may produce identical hashes each time they are subjected to a particular hashing algorithm. Because hashing algorithm is lossy, it may be impossible to reconstruct a lot of data from a hash produced from the lot of data using the hashing algorithm. In the case of some hashing algorithms, reconstructing the full lot of data from the corresponding hash using a partial set of data from the full lot of data may be possible only by repeatedly guessing at the remaining data and repeating the hashing algorithm; it is thus computationally difficult if not infeasible for a single computer to produce the lot of data, as the statistical likelihood of correctly guessing the missing data may be extremely low. However, the statistical likelihood of a computer of a set of computers simultaneously attempting to guess the missing data within a useful timeframe may be higher, permitting mining protocols as described in further detail below. 
     In an embodiment, hashing algorithm may demonstrate an “avalanche effect,” whereby even extremely small changes to lot of data produce drastically different hashes. This may thwart attempts to avoid the computational work necessary to recreate a hash by simply inserting a fraudulent datum in data lot, enabling the use of hashing algorithms for “tamper-proofing” data such as data contained in an immutable ledger as described in further detail below. This avalanche or “cascade” effect may be evinced by hashing processes such as such as Winternitz hashes and Secure Hash Algorithm (“SHA-1”); persons skilled in the art, upon reading the entirety of this disclosure, will be aware of various suitable hashing algorithms for purposes described herein. Verification of a hash corresponding to a lot of data may be performed by running the lot of data through a hashing algorithm used to produce the hash. Such verification may be computationally expensive, albeit feasible, potentially adding up to significant processing delays where repeated hashing, or hashing of large quantities of data, is required, for instance as described in further detail below. 
     Referring now to  FIG. 1 , an exemplary embodiment of a system  100  for authenticating a digitally signed assertion using verified evaluators is illustrated. In an embodiment, system  100  includes a first processor  104 . First processor  104  may be any processor as described below in reference to  FIG. 5 . First processor  104  may be included in any computing device as described below in reference to  FIG. 5 . First processor may include a single processor operating independently, or may include two or more processors operating in concert, in parallel, sequentially or the like; two or more processors may be included together in a single computing device or in two or more computing devices. First processor may be an element of, be in communication with, or otherwise utilize a secure computing module as described below in further detail. First processor may be or include a cryptographic evaluator as described below in further detail. 
     Still referring to  FIG. 1 , first processor  104  is coupled to a memory  108 . Memory  108  may include any form of memory described below in reference to  FIG. 5 . Memory  108  may be incorporated in a device containing first processor  104 , distributed through several devices, which may contain first processor  104 , or a component thereof, or in another device accessible to first processor  104  via electronic communication. First processor  104  may be communicatively coupled to at least a cryptographic evaluator  112 . First processor may be designed and configured to receive at least a first digitally signed assertion  116 , assign at least a confidence level to the at least a cryptographic evaluator  112 , provide the at least a digitally signed assertion  116  to the cryptographic evaluator, receive, from the at least a cryptographic evaluator  112 , at least an appraisal of the at least a first digitally signed assertion  116 , and authenticate the at least a first digitally signed assertion  116  as a function of the at least an appraisal and the at least a confidence level. 
     Referring now to  FIG. 2 , system  100  may be used to perform one or more processing steps necessary to create, maintain, and/or authenticate a digitally signed assertion  116 . In one embodiment, at least a digitally signed assertion  116  is a collection of textual data signed using a digital signature as described above. Collection of textual data may contain any textual data, including without limitation American Standard Code for Information Interchange (ASCII), Unicode, or similar computer-encoded textual data, any alphanumeric data, punctuation, diacritical mark, or any character or other marking used in any writing system to convey information, in any form, including any plaintext or cyphertext data; in an embodiment, collection of textual data may be encrypted, or may be a hash of other data, such as a root or node of a Merkle tree or hash tree, or a hash of any other information desired to be recorded in some fashion using a digitally signed assertion. In an embodiment, collection of textual data states that the owner of a certain transferable item represented in the at least a digitally signed assertion  116  register is transferring that item to the owner of an address. At least a digitally signed assertion  116  may be signed by a digital signature created using the private key associated with the owner&#39;s public key, as described above. For instance, at least a digitally signed assertion  116  may describe a transfer of virtual currency, such as crypto-currency as described below. The virtual currency may be a digital currency. Item of value may be a transfer of trust, for instance represented by a statement vouching for the identity or trustworthiness of the first entity. Item of value may be an interest in a fungible negotiable financial instrument representing ownership in a public or private corporation, a creditor relationship with a governmental body or a corporation, rights to ownership represented by an option, derivative financial instrument, commodity, debt-backed security such as a bond or debenture or other security as described in further detail below. At least a digitally signed assertion  116  may describe the transfer of a physical good; for instance, at least a digitally signed assertion  116  may describe the sale of a product. In some embodiments, a transfer nominally of one item may be used to represent a transfer of another item; for instance, a transfer of virtual currency may be interpreted as representing a transfer of an access right; conversely, where the item nominally transferred is something other than virtual currency, the transfer itself may still be treated as a transfer of virtual currency, having value that depends on many potential factors including the value of the item nominally transferred and the monetary value attendant to having the output of the transfer moved into a particular user&#39;s control. The item of value may be associated with the at least a digitally signed assertion  116  by means of an exterior protocol, such as the COLORED COINS created according to protocols developed by The Colored Coins Foundation, the MASTERCOIN protocol developed by the Mastercoin Foundation, or the ETHEREUM platform offered by the Stiftung Ethereum Foundation of Baar, Switzerland, the Thunder protocol developed by Thunder Consensus, or any other protocol. 
     Still referring to  FIG. 2 , in one embodiment, an address is a textual datum identifying the recipient of virtual currency or another item of value in at least a digitally signed assertion  116 . In some embodiments, address is linked to a public key, the corresponding private key of which is owned by the recipient of the at least a digitally signed assertion  116 . For instance, address may be the public key. Address may be a representation, such as a hash, of the public key. Address may be linked to the public key in the memory  120  of a computing device, for instance via a “wallet shortener” protocol. Where address is linked to a public key, a transferee in the at least a digitally signed assertion  116  may record a subsequent at least a digitally signed assertion  116  transferring some or all of the value transferred in the first at least a digitally signed assertion  116  to a new address in the same manner. At least a digitally signed assertion  116  may contain textual information that is not a transfer of some item of value in addition to, or as an alternative to, such a transfer. For instance, as described in further detail below, at least a digitally signed assertion  116  may indicate a confidence level associated with a cryptographic evaluator as described in further detail below. 
     With continued reference to  FIG. 2 , at least a digitally signed assertion  116  may be included in a temporally sequential listing  120 . Temporally sequential listing  120  may include any set of data used to record a series of at least a digitally signed assertion  116  in an inalterable format that permits authentication of such at least a digitally signed assertion  116 . In some embodiments, temporally sequential listing  120  records a series of at least a digitally signed assertion  116  in a way that preserves the order in which the at least a digitally signed assertion  116  took place. 
     Temporally sequential listing  120  may preserve the order in which the at least a digitally signed assertion  116  took place by listing them in chronological order; alternatively or additionally, temporally sequential listing  120  may organize digitally signed assertions  116  into sublistings  200 , such as “blocks” in a blockchain, which may be themselves collected in a temporally sequential order; digitally signed assertions  116  within a sublisting  200  may or may not be temporally sequential. The ledger may preserve the order in which at least a digitally signed assertion  116  took place by listing them in sublistings  200 , and placing the sublistings  200  in chronological order. The temporally sequential listing  120  may be a distributed, consensus-based ledger, such as those operated according to the protocols promulgated by Ripple Labs, Inc., of San Francisco, Calif., or the Stellar Development Foundation, of San Francisco, Calif., or of Thunder Consensus. In some embodiments, the ledger is a secured ledger; in one embodiment, a secured ledger is a ledger having safeguards against alteration by unauthorized parties. The ledger may be maintained by a proprietor, such as a system administrator on a server, that controls access to the ledger; for instance, the user account controls may allow contributors to the ledger to add at least a digitally signed assertion  116  to the ledger, but may not allow any users to alter at least a digitally signed assertion  116  that have been added to the ledger. In some embodiments, ledger is cryptographically secured; in one embodiment, a ledger is cryptographically secured where each link in the chain contains encrypted or hashed information that makes it practically infeasible to alter the ledger without betraying that alteration has taken place, for instance by requiring that an administrator or other party sign new additions to the chain with a digital signature. Temporally sequential listing may be incorporated in, stored in, or incorporate, any suitable data structure, including without limitation any database, datastore, file structure, distributed hash table, or the like. In some embodiments, the timestamp of an entry is cryptographically secured and validated via trusted time, either directly on the chain or indirectly by utilizing a separate chain. In one embodiment the validity of timestamp is provided using a time stamping authority as described in the RFC 3161 standard for trusted timestamps, or in the ANSI ASC x9.95 standard. In another embodiment, the trusted time ordering is provided by a group of entities collectively acting as the time stamping authority with a requirement that a threshold number of the group of authorities sign the timestamp. 
     In some embodiments, secure computing module  124  may integrate a precision clock reference for determination of locations and latencies of nodes in the network graph. In non-limiting example, the precision clock reference may be a cesium- or rubidium-based atomic clock, active hydrogen maser, GPS disciplined oscillator, precision crystal oscillator, SAW oscillator, quartz oscillator or related that provides microsecond or better timing accuracy. In some embodiments, precision time may be used to establish physical distance by inference from latency statistics of nodes in the network, whether using probabilistic, Bayesian or other statistical methods, machine learning classifiers or other. In some embodiments, changes in inferred physical distance or latency between nodes in the graph may be used to flag potentially compromised secure computing modules, man in the middle or other attacks. 
     In some embodiments, temporally sequential listing  120 , once formed, cannot be altered by any party, no matter what access rights that party possesses. For instance, temporally sequential listing  120  may include a hash chain, in which data is added during a successive hashing process to ensure non-repudiation. Temporally sequential listing  120  may include a block chain. In one embodiment, a block chain is temporally sequential listing  120  that records one or more new at least a digitally signed assertion  116  in a data item known as a sublisting  200  or “block.” An example of a block chain is the BITCOIN block chain used to record BITCOIN transactions and values. Sublistings  200  may be created in a way that places the sublistings  200  in chronological order, and links each sublisting  200  to a previous sublisting  200  in the chronological order, so that any computing device may traverse the sublistings  200  in reverse chronological order to verify any at least a digitally signed assertion  116  listed in the block chain. Each new sublisting  200  may be required to contain a cryptographic hash describing the previous sublisting  200 . In some embodiments, the block chain contains a single first sublisting  200 , sometimes known as a “genesis block.” 
     The creation of a new sublisting  200  may be computationally expensive; for instance, the creation of a new sublisting  200  may be designed by a “proof of work” protocol accepted by all participants in forming the temporally sequential listing  120  to take a powerful set of computing devices a certain period of time to produce. Where one sublisting  200  takes less time for a given set of computing devices to produce the sublisting  200 , protocol may adjust the algorithm to produce the next sublisting  200  so that it will require more steps; where one sublisting  200  takes more time for a given set of computing devices to produce the sublisting  200 , protocol may adjust the algorithm to produce the next sublisting  200  so that it will require fewer steps. As an example, protocol may require a new sublisting  200  to contain a cryptographic hash describing its contents; the cryptographic hash may be required to satisfy a mathematical condition, achieved by having the sublisting  200  contain a number, called a nonce, whose value is determined after the fact by the discovery of the hash that satisfies the mathematical condition. Continuing the example, the protocol may be able to adjust the mathematical condition so that the discovery of the hash describing a sublisting  200  and satisfying the mathematical condition requires more or less steps, depending on the outcome of the previous hashing attempt. Mathematical condition, as an example, might be that the hash contains a certain number of leading zeros and a hashing algorithm that requires more steps to find a hash containing a greater number of leading zeros, and fewer steps to find a hash containing a lesser number of leading zeros. In some embodiments, production of a new sublisting  200  according to the protocol is known as “mining.” The creation of a new sublisting  200  may be designed by a “proof of stake” protocol as will be apparent to those skilled in the art upon reviewing the entirety of this disclosure. 
     In some embodiments, protocol also creates an incentive to mine new sublistings  200 . The incentive may be financial; for instance, successfully mining a new sublisting  200  may result in the person or entity that mines the sublisting  200  receiving a predetermined amount of currency. The currency may be fiat currency. Currency may be crypto-currency as defined below. In other embodiments, incentive may be redeemed for particular products or services; the incentive may be a gift certificate with a particular business, for instance. In some embodiments, incentive is sufficiently attractive to cause participants to compete for the incentive by trying to race each other to the creation of sublistings  200 . Each sublisting  200  created in temporally sequential listing  120  may contain a record or at least a digitally signed assertion  116  describing one or more addresses that receive an incentive, such as virtual currency, as the result of successfully mining the sublisting  200 . 
     Where two entities simultaneously create new sublistings  200 , temporally sequential listing  120  may develop a fork; protocol may determine which of the two alternate branches in the fork is the valid new portion of the temporally sequential listing by evaluating, after a certain amount of time has passed, which branch is longer. “Length” may be measured according to the number of sublistings  200  in the branch. Length may be measured according to the total computational cost of producing the branch. Protocol may treat only at least a digitally signed assertion  116  contained the valid branch as valid at least a digitally signed assertion  116 . When a branch is found invalid according to this protocol, at least a digitally signed assertion  116  registered in that branch may be recreated in a new sublisting  200  in the valid branch; the protocol may reject “double spending” at least a digitally signed assertion  116  that transfer the same virtual currency that another at least a digitally signed assertion  116  in the valid branch has already transferred. As a result, in some embodiments the creation of fraudulent at least a digitally signed assertion  116  requires the creation of a longer temporally sequential listing branch by the entity attempting the fraudulent at least a digitally signed assertion  116  than the branch being produced by the rest of the participants; as long as the entity creating the fraudulent at least a digitally signed assertion  116  is likely the only one with the incentive to create the branch containing the fraudulent at least a digitally signed assertion  116 , the computational cost of the creation of that branch may be practically infeasible, guaranteeing the validity of all at least a digitally signed assertion  116  in the temporally sequential listing  120 . 
     Additional data linked to at least a digitally signed assertion  116  may be incorporated in sublistings  200  in the temporally sequential listing  120 ; for instance, data may be incorporated in one or more fields recognized by block chain protocols that permit a person or computer forming a at least a digitally signed assertion  116  to insert additional data in the temporally sequential listing  120 . In some embodiments, additional data is incorporated in an unspendable at least a digitally signed assertion  116  field. For instance, the data may be incorporated in an OP RETURN within the BITCOIN block chain. In other embodiments, additional data is incorporated in one signature of a multi-signature at least a digitally signed assertion  116 . In an embodiment, a multi-signature at least a digitally signed assertion  116  is a at least a digitally signed assertion  116  to two or more addresses. In some embodiments, the two or more addresses are hashed together to form a single address, which is signed in the digital signature of the at least a digitally signed assertion  116 . In other embodiments, the two or more addresses are concatenated. In some embodiments, two or more addresses may be combined by a more complicated process, such as the creation of a Merkle tree or the like. In some embodiments, one or more addresses incorporated in the multi-signature at least a digitally signed assertion  116  are typical crypto-currency addresses, such as addresses linked to public keys as described above, while one or more additional addresses in the multi-signature at least a digitally signed assertion  116  contain additional data related to the at least a digitally signed assertion  116 ; for instance, the additional data may indicate the purpose of the at least a digitally signed assertion  116 , aside from an exchange of virtual currency, such as the item for which the virtual currency was exchanged. In some embodiments, additional information may include network statistics for a given node of network, such as a cryptographic evaluator, e.g. the latencies to nearest neighbors in a network graph, the identities or identifying information of neighboring nodes in the network graph, the trust level and/or mechanisms of trust (e.g. certificates of physical encryption keys, certificates of software encryption keys, (in non-limiting example certificates of software encryption may indicate the firmware version, manufacturer, hardware version and the like), certificates from a trusted third party, certificates from a decentralized anonymous authentication procedure, and other information quantifying the trusted status of the at least a cryptographic evaluator  112 ) of neighboring nodes in the network graph, IP addresses, GPS coordinates, and other information informing location of the node and/or neighboring nodes, geographically and/or within the network graph. In some embodiments, additional information may include history and/or statistics of neighboring nodes with which the node has interacted. In some embodiments, this additional information may be encoded directly, via a hash, hash tree or other encoding. 
     With continued reference to  FIG. 2 , in some embodiments, virtual currency is traded as a crypto-currency. In one embodiment, a crypto-currency is a digital, currency such as Bitcoins, Peercoins, Namecoins, and Litecoins. Crypto-currency may be a clone of another crypto-currency. The crypto-currency may be an “alt-coin.” Crypto-currency may be decentralized, with no particular entity controlling it; the integrity of the crypto-currency may be maintained by adherence by its participants to established protocols for exchange and for production of new currency, which may be enforced by software implementing the crypto-currency. Crypto-currency may be centralized, with its protocols enforced or hosted by a particular entity. For instance, crypto-currency may be maintained in a centralized ledger, as in the case of the XRP currency of Ripple Labs, Inc., of San Francisco, Calif. In lieu of a centrally controlling authority, such as a national bank, to manage currency values, the number of units of a particular crypto-currency may be limited; the rate at which units of crypto-currency enter the market may be managed by a mutually agreed-upon process, such as creating new units of currency when mathematical puzzles are solved, the degree of difficulty of the puzzles being adjustable to control the rate at which new units enter the market. Mathematical puzzles may be the same as the algorithms used to make productions of sublistings  200  in a block chain computationally challenging; the incentive for producing sublistings  200  may include the grant of new crypto-currency to the miners. Quantities of crypto-currency may be exchanged using at least a digitally signed assertion  116  as described above. 
     Still referring to  FIG. 2 , at least a digitally signed assertion  116  may be included data structures or memory elements besides a temporally sequential file, including without limitation any temporary or persistent memory as used in or by any computing device as described below in reference to  FIG. 5 . For example, and without limitation, at least a digitally signed assertion  116  may include one or more encrypted or otherwise secured or partitioned memory entries as entered for instance using a secure computing module or according to a secure computing protocol as described in further detail below. 
     With continued reference to  FIG. 2 , in an embodiment at least a digitally signed assertion  116 , temporally sequential listing  120  and/or one or more sublistings  200  may be used to record an exchange of securities. A “security” as used herein may be a security that may be traded on stock exchanges, bond markets, commodities markets, futures contracts, options contracts, derivative financial instruments or the like, including without limitation an interest in a fungible bulk security (e.g. equity securities traded on exchanges are backed by paper securities enumerated in units of more than 1 share, typically in units of 100 shares, also known as a bulk security, with a result that trades not in whole groups of 100 actually represent an interest in a bulk security) or any other security as described above. Security may include, without limitation, a debt security, such as a bond, debenture, or other share or tranche of a debt; debt may include government debt, personal debt, commercial debt, or the like. Security may include, without limitation, an equity security, such as a share or portion of a share in common stock or premium stock, an ownership interest in a partnership or other business entity, or the like. Security may include, without limitation, an interest in a commodity or currency, or a derivative financial instrument. 
     Still referring to  FIG. 2 , in some embodiments an exchange of securities may be performed by listing each of a security to be purchased and a price to be paid for the security to be purchased in a temporally sequential listing  120 . Price to be paid for security may include another security, an amount of virtual currency, and/or any other value, including without limitation fiat currency, interest in real property, or an ownership interest in any object or right having a demonstrable economic value. A digitally signed assertion indicating possession of either security or price to be paid for security may be entered on temporally sequential listing; each digitally signed assertion may be authenticated by any suitable process for authentication, including authentication as described below in reference to method  400  and/or consensus authentication. In an embodiment, a first digitally signed assertion is recorded on temporally sequential listing  120  asserting ownership of security by first party, and a second digitally signed assertion is recorded on temporally sequential listing  120  asserting ownership of price to be paid by a second party. The validity of each assertion may be attested to by an entity having an accepted authority to indicate possession of security and/or price; for instance, and without limitation, a digitally signed assertion may be created by an entity issuing the security, such as a corporate entity issuing an equity or debt security to a purchaser, wherein digitally signed assertion is signed by a device that may be demonstrated as possessed by the entity issuing the security. In further example, a digitally signed assertion may be created by an entity such as a custodial agent, securities clearing house or depository trust. In a non-limiting example, a digitally signed assertion may represent the creation of a digital instance of a security previously existing as a paper certificate, in non-limiting example a fungible bulk security or interest therein. Additionally or alternatively, a digitally signed assertion may transfer some or all of a security that currently only exists as a paper stock certificate; for instance and without limitation, a trusted and/or non-anonymous entity, such as a custodian service provider, a depository trust company, or the like may sign digitally assigned assertion using a computing device that may be identified using a secure computing module, a certificate authority, and/or a threshold cryptographic protocol as described above. Digitally signed assertion may sign security to possessing party by signing an assertion listing an address belonging to possessing party as described above. Similarly, second or purchasing party may possess or receive a digitally signed assertion establishing second party&#39;s ownership of price to be paid. 
     With continued reference to  FIG. 2 , a commitment in the form of at least a third digitally signed assertion may be created or recorded in temporally sequential listing  120 . At least a third digitally signed assertion may include an assertion signed by first party transferring security to second party, and a digitally signed assertion signed by second party transferring security to first party; this may be performed by having each of first and second party sign a single assertion indicating transfer of the security and transfer of the price to be paid, or two separate assertions, a first indicating transfer of the security and a second indicating transfer of the price to be paid. In the latter case, each of two assertions making up at least a third assertion may reference the other assertion or may reference both the security and the price to be paid. In an embodiment, recording of at least a third digitally signed assertion may form a “commitment” stage of an exchange of securities. In an embodiment, at least a third digitally signed assertion may include additional assertions performing a “netting” process, whereby one or more central counterparties first purchase each of security and price to be paid from first and second parties, for instance by recording digitally signed assertions exchanging value as described above, and then perform exchange of security and price in an additional set of digitally signed assertions. In an embodiment, central counterparties may be entities having high levels of trust and/or collateral; for instance, each central counterparty may have previously recorded digitally signed assertions indicating possession of an amount of value capable of offsetting values of security and/or price to be paid, and may record digitally signed assertions indicating that such previously recorded digitally signed assertions may be applied to price either of security or of price to be paid in the event of a failed transaction. In an embodiment, a collection of counterparties may act in coordination through a mechanism of threshold endorsement, such as without limitation a threshold cryptographic process as described above. For instance, for a given financial risk, any one counterparty may not have sufficient levels of trust and/or collateral, however the total financial risk may be covered by having a threshold number of central counterparties assert, for instance via additional digitally signed assertions, that they will participate in the transaction by making reference to the at least a third digitally signed assertion. 
     Still referring to  FIG. 2 , a clearing process may be performed to ensure that the trade is valid; clearing may include authentication of an instance of temporally sequential listing  120  containing first assertion, second assertion, at least a third assertion, and any additional assertions such as assertions entered by one or more central counterparties. Authentication may include any authentication process suitable for authentication of a temporally sequential listing  120 , including without limitation any authentication process described below in reference to  FIG. 4 . Authentication may further involve additional checks of identity of entities involved, including first entity, second entity, and/or central counterparties. In an embodiment, central counterparties may act in a non-anonymous manner; i.e. central counterparties may record their identities in temporally sequential listing  120  or otherwise make their identities public. First party and/or second party may be anonymous; in an embodiment, central counterparties may increase collateral amounts to account for anonymity. First party and/or second party may also be identified by machine identities using, e.g., certificate authorities and/or secure computing modules  124  incorporated in computing devices possessed by each of first party and/or second party. Authentication and/or clearing may include review or assessment of previous transactions performed by either of first party or second party to establish a degree of trust in first party and/or second party; degree of trust may be used to set collateral amounts, where a lower degree of trust corresponds to a higher collateral amount. Review or assessment of degree of trust may include, in non-limiting examples, relative weighting of attested trust elements within a “chain of trust”; for instance, depending upon the contemplated threat vectors to which a cryptographic evaluator is subject, degree of trust assigned may more heavily weight attestation of the hardware manufacturer(s), the code operating on the device, the computational output of the device, the trusted time of the device, the trusted nature of the device memory, or other attestable attributes of the device. 
     Still referring to  FIG. 2 , security exchange may conclude with settlement, where settlement is an exchange of security for price to be paid. In an embodiment, settlement is concluded upon authentication of instance of temporally sequential listing  120  recording first assertion, second assertion, and at least a third assertion; instance may also include any central counterparty assertions. In an embodiment, one or more assertions may be required to utilize multi-party assertion, e.g. a threshold number of verifiers may be required to authenticate in order for the assertion to be valid. In an embodiment, settlement may involve additional steps, such as inspection or validation of temporally sequential listing  120  by a governmental, quasi-governmental, or agreed-upon commercial authority; authentication may be suspended until inspection is completed, preventing distribution of and/or reliance on instance of temporally sequential listing  120  until inspection is complete. 
     With continued reference to  FIG. 2 , in an embodiment at least a digitally signed assertion  116 , temporally sequential listing  120  and/or one or more sublistings  200  may be used to record wire transfer. A wire transfer, as used herein, may be an electronic transfer of monetary value from a first user to a second user. First user and/or second user may be a person or an entity such as a business entity, trust, club, or other organization. In an embodiment, wire transfer may be performed as follows: a first digitally signed assertion may be entered on an instance of temporally sequential listing  120  transferring an item of property to first user; item of property may be anything to which a monetary value maybe ascribed. Item of property may include, e.g., money from an electronic account in fiat currency or virtual currency. Item of property may include a Item of property may include an ownership interest in a tangible good. Item of property may include an ownership interest in a parcel of real property. Item of interest may include an ownership interest in an item of intellectual property. First digitally signed assertion may, as a non-limiting example, transfer the item of property to an address belonging to first user. A second digitally signed assertion may then be entered transferring item of property from first user to second user; item of property may, for instance, be transferred to an address belonging to second user. In an embodiment, first digitally signed assertion may be authenticated with a first instance of temporally sequential file  120  prior to subsequent entry of a second digitally signed assertion, or in other words the first digitally signed assertion may be recorded in a first block which is authenticated, prior to entry in a second, subsequent block, of the second digitally signed assertion; alternatively, where an entity signing the first digitally signed assertion is a highly trusted entity, first digitally signed assertion may be trusted as well, permitting authentication of first digitally signed assertion and second digitally signed assertion in a single block. Determination that entity signing first digitally signed assertion may be performed by combining a determination of confidence level as described below with an association of the device performing the signing to the entity performing the signing. As a non-limiting example entity performing the signing may be a bank or other financial institution, a wire transfer retail company, or any other entity that frequently performs such transactions, and may be identified as such on temporally sequential listing  120 , a network connecting one or more cryptographic evaluators, or the like; as a result, entity performing the signing may be held accountable for failed transactions or double transactions. Entity performing the signing may be linked to device performing the signing by a certificate authority, which may be any certificate authority as described above. Alternatively or additionally, entity performing the signing may be linked to device by transaction history in temporally sequential listing  120 . For instance, temporally sequential listing  120  may contain a plurality of similar transactions performed by device, indicating a course of business conducted by device. In an embodiment the use of trust levels may thus substantially improve authentication wire transfer; this improvement may be further realized by more rapid authentication as described below in reference to  FIG. 4 . 
     Still viewing  FIG. 2 , in the above-described example the wire transfer may be a person-person or person-entity transfer; first entity may be a person or user not affiliated with signing entity. Wire transfer may also be entity-entity, for instance between two banks, financial institutions, wire transfer retailers or the like. In an embodiment signing entity and first entity may be the same. For instance, an institution in the business of wire transfers may use first digitally signed assertion to convey one or more items of property to itself in temporally sequential listing  120 . Alternatively, first transaction may directly sign property to second institution; possession of property by first institution may be assumed based on highly trusted status as described above. An additional assertion from second user/second institution to an end user or institution may further be performed; alternatively or additionally, after transfer is complete transferred value may be spent as virtual currency. In some embodiments, transfer may follow a real-time gross settlement protocol in which the entire amount to be transferred is transferred in a single transaction; first, second, and/or third assertions may be focused on transferring amounts for a single transaction. In an embodiment, first, second, and/or third digitally signed assertion may convey more than one item of property to more than one user; for instance, wire transfer may follow a periodic net settlement protocol wherein multiple transactions are simultaneously performed, typically found in institution-institution transfers. In that case, a series of potential institution-institution transfers may be planned by one or more institutions, the net sum to be transferred from one institution to the other may be calculated, and the calculated net sum may be transferred. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of multiple variations on the above methods and protocols that may be used to perform wire transfers consistently with this disclosure. 
     Continuing to refer to  FIG. 2 , in an embodiment temporally sequential listing  120 , sublistings  200  and/or digitally signed assertions may be used to support mobile payment processes and systems, including payments transacted through social media, messaging clients, text messaging, email services or other communication services. In an embodiment, mobile payment is a process or system whereby a user can pay for goods or services by transferring data from a mobile computing device. Mobile computing device may include any computing device carried on the person of a user, including without limitation a tablet, music playing device, cellular phone, digital phone, smartphone, wearable computing device, smart watch or the like. Mobile computing device may contain any element as described below for any computing device in reference to  FIG. 5 . In an embodiment, value may be transferred from mobile device by any means for transferring data from a mobile device to another device; such means may include without limitation wireless communication via pairing, near-field communication, contactless data transfer, or the like, or display and scanning of visual codes such as quick-read (QR) codes. Mobile pay process may transfer value by such means based, for instance, on credit card numbers or bank account numbers; such numbers may be provided securely using a tokenization process such as without limitation EMV tokenization as provided by EMVCo, LLC of Foster City, Calif. In an embodiment, a digital wallet containing an element of cryptocurrency may be provided on mobile computing device; element of cryptocurrency may include, without limitation, a private key corresponding to an address or other public key belonging to paying user. In an embodiment, a digitally signed assertion may be entered on temporally sequential listing  120  or an instance thereof transferring some amount of currency or other value to user; instance of temporally sequential listing  120  may be authenticated according to methods described below. Alternatively or additionally, where device signing digitally signed assertion is highly trusted as described above, only digitally signed assertion may be authenticated; it may be assumed, for instance, that should instance of temporally sequential listing  120  be “beaten” to authentication by another instance, a highly trusted entity operating a highly trusted device may re-post digitally signed assertion. In an embodiment, use of confidence levels to authenticate assertion and/or temporally sequential listing  120  may enable rapid transfer of funds to user&#39;s mobile wallet on demand; this may increase speed and security of payment processes. 
     With continued reference to  FIG. 2 , in an embodiment, temporally sequential listing  120  may be used to add security and speed to credit card transactions. A credit card transaction may be a transaction wherein a person or entity presents a set of data identifying an account such as a rolling credit line or bank account in the name of the person or entity, and agrees to permit a payment for a good, service, commodity, bill, or other item from the account, and (in the case of a rolling credit account) agrees to pay the balance according to terms arranged with an institution proffering the account; the institution may be a bank or other financial institution. Credit card payments may suffer from certain drawbacks that arise from their flexibility and ease of use. One such drawback is that they rely upon a user&#39;s promise to pay; this imposes a cost on the credit card payment system, as institutions offering credit card accounts must assume the risk of non-payment. That risk in turn is mitigated by charging a card-holder (the person able to draw payments against the account as described above) a high interest rate for carried balances, and by charging merchants and others receiving credit card payments a transaction fee. This may be mitigated by funding or offsetting credit card transactions with digitally signed assertions in the name of the user of the credit card, the assertions including a value to offset or otherwise secure credit card payments. Each credit card transaction may alternatively or additionally be memorialized in a digitally signed assertion entered on temporally sequential listing  120 . This may establish a secure, transparent audit chain indicating which transactions have taken place using a given credit card number. In an embodiment, transactions may be recorded using a hash of one or more identifying data elements pertaining to credit card account, including without limitation a credit card number, expiration date, security code, and/or pin (where credit card is used with the “chip and pin” transaction protocol or the like). 
     Still viewing  FIG. 2 , in an embodiment temporally sequential listing  120  and/or digitally signed assertions may be used to secure and/or securely distribute medical data. Medical data as used herein may include patient data such as data recorded during medical treatment and diagnosis, data gathered concerning a patient using medical diagnostic equipment and/or medical implants or monitors, and data used to operate implants, monitors, or other devices used for diagnosis, treatment or alleviation of patients&#39; conditions. Medical data may include software or firmware used to operate medical equipment, including without limitation implants, monitors, or other devices used for diagnosis, treatment or alleviation of patients&#39; conditions. Medical devices may include devices that directly or indirectly track physiological parameters and are available with or without a physician, such as activity trackers, heart rate monitors, EEG monitors, functional near infrared spectroscopy (fNIRS) devices, diffuse optical tomography (DOT) devices, functional ultrasound (fUS) devices, EKGs, transcranial magnetic stimulators (TMS), transcranial direct current stimulator (tDCS), blood analyte spectrometers, glucose measurement devices, continuous glucose monitors and the like. As a non-limiting example, medical devices have become enabled with wireless capabilities allowing data migration to and from the device inside or attached to the body and other entites such as a patients care team, manufacturer or third party data analysis firm. Data migration occurs with wireless radiofrequency from wires in the body to a wire circuitry outside of the body. 
     With continued reference to  FIG. 2 , medical devices may include wearable devices that are not implanted but are used by doctors to monitor a patients biological normal and abnormal functions. An example of this may be an external cardiac defibrillator which monitors a person&#39;s heart rate and above or below a selected threshold administers a potentially life-saving defibrillator shock of a chosen energy as therapy to resume a normal heart rate and rhythm in the event the person goes into a potentially fatal arrhythmia. When this occurs, data may be transmitted via a home monitor that is given with the device. Data may also be transmitted at the discretion of the patient should different alarms occur signaling a potentially disruptive arrhythmia. Implantable medical devices have become enabled with capabilities to monitor physiological changes in the body which may be used to study normal and abnormal events in the body or to trigger a therapeutic response necessary for the health of the person with the implanted device. Examples of medical devices enabled to perform therapeutic stimulation actions may include implantable cardiac devices, implantable pacemakers, implantable flow monitors, Implantable nerve stimulators including spinal cord stimulators, sacral nerve stimulators, vagal nerve stimulators, trigeminal nerve stimulators, deep brain stimulators or other active neuromodulation devices, vision prosethetics, robotic limb prosthetics, bladder stimulators, diaphragm stimulators, cochlear implants and other active implantable medical devices. Therapeutic drug delivery may also be done via implantable medical device. Temporary and permanent diagnostic implants may be used to monitory important health markers. Medical devices may be enabled with wireless capabilities allowing data migration to and from the device inside or attached to the body and other entities such as a patients care team, manufacturer or third party data analysis firm. Data migration may occur with wireless radiofrequency from wires in the body to a wire circuitry outside of the body or other means of data migration. 
     Still viewing  FIG. 2 , data migration may occur from the medical device implanted in the patient via wireless communication. Data may be received and recorded by the receiving party without the patient viewing and or reviewing such data. This may give rise to questions concerning data ownership; the patient may not have full control over who is using and collecting data. Data migration may occur from the patient to the patient care team at regularly scheduled intervals and when the health is compromised. The data in an implantable cardiac defibrillator may transmit heart rate, electrocardiogram (EKG), abnormal bouts of arrhythmias including ventricular fibrillation, tachycardia, and when shock therapy has been administered. Resistance data may also be collected to determine fluid retention in or around the heart and/or the device. Data may be collected via a manufacturer&#39;s compatible device used to collect the data wirelessly. This data may include inertial sensors, networks (BLE, wifi, Zigbee, or other), GPS, temperature, inference of position, altitude, movement, activity, and the like. Other examples of sensitive data transmission that may use the authentication process described herein include glucose readings from a stand-alone continuous glucose monitor (CGM) or transmission and authentication of data from CGM sensor element to actuator element (e.g. insulin pump) in a closed loop device, and other closed loop medical devices. The data may then be analyzed by the physician or care team member and a summary may be provided to the patient. Once again, the data ownership may be in question as the patient may not be able to decide when and to who the data can be given. The patient also may not be able to get the downloaded raw data to view. In most cases events that are not felt may not be discovered until much later leaving the patient with no clues as to inputs to the arrhythmia. Data migration may occur from the manufacturer to the patient&#39;s device via firmware updates which may occur at night when the probability that the patient is near the home monitoring system is higher. The patient may typically be unaware of any data migration to the device and the origin or persons responsible. Patient may also not be privy to downloads or content of the downloads. If asked, patients may be denied access and sent back to their doctors who only provide the summary. 
     Continuing to view  FIG. 2 , security of data migration between implant and doctors and manufacturers has become an opportunity for data hacking, especially since end patient has no ability to protect or even see the data being transmitted or collected. In some embodiments, security of data may be ensured by access control using one or more digitally signed assertions. For instance, and without limitation, a medical device such as a patient implant may be programmed, including via hardware programming, to accept only data that is digitally signed using a private key linked to a public key that medical device has recorded. Firmware/software updates and/or data supplied to medical device may be recorded and conveyed as a series of digitally signed assertions signed with the required private key. Such assertions may be recorded in temporally sequential listing  120 . Data received from medical devices may similarly be signed by a private key stored or hardcoded on medical device; hardcoding may be implemented according to any form of secure computing module or any process using or used by secure computing module, as described below. Medical records may be stored in encrypted form as well; in an embodiment, transfer of encrypted medical records encrypted with a first public key associated with a first private key may be performed in a three-step process: (1) encryption with a second public key associated with a second private key belonging to the recipient, (2) decryption using the first private key, and (3) entry of a digitally signed assertion signed with the first private key and transferring access to the owner of the second private key, by reference to second public key. This protocol may ensure that medical records always remain encrypted and viewable only to persons authorized to view them, with authority transferred concurrently with assertions indicating granting of permission; moreover, where digitally signed assertions are recorded in temporally sequential listing  120 , a history of transfers of access rights may be created in a transparent and readily traceable form. 
     Referring again to  FIG. 1 , at least a cryptographic evaluator  112  may include an element incorporated in a computing device or set of computing devices incorporating first processor  104 ; for instance at least a cryptographic evaluator  112  may function as a secure computing module or secure computing environment utilized by or in conjunction with first processor  104 , as described in further detail below. At least a cryptographic evaluator  112  may alternatively or additionally include or be included in one or more devices external to devices including first processor  104 . For instance, at least a cryptographic evaluator  112  may include one or more devices connected to first processor  104  via a network, which may include without limitation the Internet or a sub-network thereof; network may alternatively or additionally include one or more intranets belonging to one or more institutions, one or more extranets, one or more protected networks such as virtual private networks or the like, or any other network that may occur to a person skilled in the art upon reading the entirety of this disclosure. 
     With continued reference to  FIG. 1 , at least a cryptographic evaluator  112  may include a secure computing module  124 . As used herein, a secure computing module  124  is a hardware element configured to perform one or more secured operations beyond the control of other circuit elements or software, whether incorporated with the secure computing module  124  in a circuit or computing device, or a part of an extrinsic computing device. As a result, at least one secured operation performed by secure computing module  124  is intrinsically reliable; that is, the at least one secured operation may be relied upon by any other module or user to produce an expected result regardless of behavior by neutral or adversarial parties, as long as some basic set of assumptions hold true. Other parties may be able to assign a confidence level in secure computing module  124  and/or a system or computing device incorporating secure computing module  124  based on the above-described set of assumptions. As a non-limiting, example, a secure computing module designed to produce an expected result despite all software-only attacks may give rise to a first confidence level, whereas another secure computing module designed to produce its expected result in the face of all software or hardware attacks may give rise to a second confidence level; the second confidence level may be higher, owing to the reduced probability that the second secure computing module would be compromised. 
     Still viewing  FIG. 1 , secure computing module  124  may include a trusted platform module (TPM)  128 . In an embodiment, a TPM  128  may include a hardware module, which may be an integrated circuit, an optoelectronic circuit, a section of an integrated circuit on the same die as a processor, an integrated circuit packaged with other die in a multi-chip module or other multi-die integration method, or printed circuit board product; TPM  128  may have any suitable elements of digital or analog circuitry usable to perform one or more processes as described herein, including without limitation processes used to determine confidence levels and/or authenticate digitally signed assertions as described below. TPM  128  may have memory and/or other logic and/or a processor in its own right which may be in a non-limiting example a crypto-processor. TPM  128  may have a hard-coded process for signing a digital signature, which may be performed using a private key, which is associated with a public key. This private key and/or signing process may be produced using a genuinely random process during manufacturing, and/or unique object (UNO) fingerprint, and/or a physically unclonable function (PUF), or any other disorder-based security primitive, defined as a function that creates challenge responses from a physical circuit that depend on unique features of that circuit, including without limitation microstructure features or elements that depend on random physical factors occurring or conferred during manufacture. Private key may be extracted via physically unclonable function processes using, for instance, a fuzzy extractor or key extractor physically unclonable function. Private key extraction may utilize additional corrective measures, including as a nonlimiting example machine learning, neural networks, convolutional neural networks and the like, or other approaches to provide error correction over the operating temperature range of the device. Private key generation may additionally incorporate true random number generator(s) (TRNGs), pseudorandom number generators (PRNGs) and related devices. 
     With continued reference to  FIG. 1 , TPM  128  may include circuitry to generate one or more asymmetric key pairs according to a public key cryptosystem as described above, and/or to sign a digital circuit. TPM  128  may include one or more tamper-proofing designs or components to prevent reverse-engineering; for instance, and without limitation,—TPM  128  may include metastable elements, such that it is not possible to predict the circuit behavior from a plan of the circuit, without electrically probing the circuit; one or more instances or subsections of the circuit may be disposed within a three-dimensional chip in a form that makes it infeasible to probe with drilling and/or thinning via chemical-mechanical polishing, grinding, etching or the like, or slicing the chip, and so arrayed that drilling and/or slicing and/or thinning via chemical-mechanical polishing, grinding, etching or the like will destroy the circuit sufficiently to make the PK impossible to recover. Random and/or physically unclonable functions may be used by the crypto-processor in the TPM  128  to ensure that the manufacturer furthermore has no way of predicting how subsequent key-pairs can be generated. The TPM  128  may be used for a DAA as disclosed in further detail below. TTP may be implemented using any PKI system/asymmetrical system as described above, including without limitation RSA and elliptic curve PKI systems. 
     Still referring to  FIG. 1 , one or more TPMs  128  or subcomponents thereof, e.g. PUF, key extractor, key storage memory, may be integrated directly into the integrated circuit (IC), e.g. in non-limiting examples as contiguous functional block within the 3D space of the IC, and/or with fingers interdigitating other logic blocks in the IC, and/or as multiple distinct functional blocks wired together electrically, such that it is infeasible to electrically probe the outputs of the key extractor via man in the middle or other attacks. More than one computing circuit, memory storage element or other logic function of at least a cryptographic evaluator  112  may incorporate a TPM  128  or its subcomponents, such that all or subsets of computing circuits of at least a cryptographic evaluator  112  may authenticate each other as trusted components, in order to preserve the trusted nature of all of subsets of the computing, memory storage, network interface and other logic functions of the at least a cryptographic evaluator  112 . 
     Still viewing  FIG. 1 , secure computing module  124  may employ PUF and associated circuitry without a TPM, or in addition to a TPM. Secure computing module  124 , with or without TPM, may include one or more separate integrated circuits; one or more separate integrated circuits may instantiate one or more PUFs and associated circuitry to generate upon request a private hardware key incorporated therein. In an embodiment, one or more PUFs generate a random number seed of a private key. PUFs may be implemented in a variety of ways, e.g. by designing a series of circuits that are unstable in their exact outputs and depend on the physical randomness of the silicon during fabrication. PUFs, when properly designed, which requires knowledge of semiconductor physics as well as circuit design, may be so unstable that it would be infeasible to know their output even if an attacker knew the circuit design and manufacturing details fully. PUFs may also be fabricated in such a way that any attempt to probe or physically deconstruct the device causes its destruction, making spoofing attempts infeasible to even the most sophisticated state-sponsored actor. A PUF-generated private key and the circuitry needed to query/respond in Direct Anonymous Attestation (DAA) may be incorporated into every part of secure computing module  124  and/or a system incorporating secure computing module  124 . The result may be that chips or ICs so designed and placed within a device can themselves verify all the other chips in the device are legitimate, obfuscating physical access man-in-the-middle attacks. 
     Continuing to view  FIG. 1 , PUFs may be implemented in secure computing module  124  and/or TPM by various means. In an embodiment, PUFs may include non-intrinsic PUFs. Non-intrinsic PUFs may include without limitation optics-based PUFs. Optics-based PUFs may include, as a nonlimiting example, optical PUFs. Optical PUFs may be implemented, for instance, using a transparent material doped with scattering particles, whereby interaction between light source and material causes a unique speckle pattern. Scattering particles may be introduced in an uncontrolled process. Optics-based PUFs may include scattering media such as paper-based PUFS, wherein, for instance reflection or scattering of a focused laser beam from the irregular fiber structure of paper may be used as unique identifier. This approach may alternatively or additionally be used with any substance having a sufficiently unpredictable effect on light or electromagnetic radiation, such as any diffusive substance, including various biological substances. Optics-based PUFs may include phosphor PUFs, wherein a random blend of small phosphor particles may be introduced into the bulk of a device or its surface; the subsequent phosphorescent pattern may be the unique identifier. Non-intrinsic PUFs may include without limitation radio frequency (RF)-based PUFs. RF-based PUFs may include, as a nonlimiting example, RF-DNA PUFs, which may utilize flexible silicone sealant embedded with thin, randomly-arranged copper wires; near-field scattering of EM waves by the copper wires may be measured, for instance in a 5-6 GHz band. Resulting random scattering effects may be measured by a matrix of RF antennas. RF-based PUFs may include inductor-capacitor (LC) PUFs, which may be implemented, without limitation, by means including a capacitor, such as a glass plate with metal plates on both sides, serially chained with a passive inductor such as a metal coil on the glass plate; this may form a passive LC resonator circuit which may absorb some amount of power when placed in an external RF field. A frequency sweep may indicate the circuit resonant frequencies, which depend on the capacitive and inductive components. Manufacturing variations in the construction may lead to resonant peak variations. 
     Still viewing  FIG. 1 , Non-intrinsic PUFs may include without limitation electronics-based PUFs. Electronics-based PUFs may include, as a nonlimiting example, coating PUFs. In a non-limiting example of a coating PUF, a comb-shaped sensor may be fabricated on the surface of IC. A passive dielectric coating may be sprayed directly on the surface, where the dielectric particles are dispersed randomly. Capacitance measurements between sensors may be used as identifiers. Opaque and chemically inert coating may offer further protection. Non-intrinsic PUFs may include power distribution network PUFs. Power distribution network PUFs may be based on resistance variations in a power grid of a silicon chip. Voltage drops and equivalent resistances in power distribution system may be measured and subject to random manufacturing variability. Additional non-intrinsic PUFs may include, without limitation, compact disc (CD)-based PUFs. N For instance, measured lengths of lands and pits on a CD may exhibit a random deviation from their intended lengths due to fabrication process variations. This variation may be large enough to be observed by monitoring the electrical signal of the photodetector in a CD player. Non-intrinsic PUFs may include acoustical PUFs, which may be constructed by observing the characteristic frequency spectrum of an acoustical delay line, where a bit string is extracted by performing principal component analysis. Non-intrinsic PUFS may include magstripe-based PUFs, which may leverage randomness of particle patterns in magnetic media (for instance in magnetic swipe cards). These types of PUFs may be used commercially to prevent credit card fraud. In all examples, the bit string may be obtained by a number of mathematical processes, for example independent component analysis (ICA), principal component analysis (PCA), signal power spectral density (PSD) etc. 
     With continued reference to  FIG. 1 , in an embodiment, PUFs may include intrinsic PUFs, which may also be known as silicon-based PUFs. Intrinsic PUFs may include without limitation arbiter PUFs, including without limitation delay-based silicon PUFs: there may be different ways of implementing this type of PUF, but many involve a race condition between two digital paths on a silicon chip. The paths may be designed to be identical, but random silicon manufacturing variation may leads to one path being longer or shorter than the other. An arbiter, implemented for instance as a digital or analog circuit, may return the winner (i.e. the path that transmits a signal more rapidly) and that is a single unit or challenge-response pair (CRP), which may be replicated multiple times to produce an overall result. Metastability may be an issue with this type of PUF, and may lead to a decrease in reliability. Intrinsic PUFs may include ring oscillator PUFs, which may nominally be comprised of two multiplexers, two counters, one comparator and K ring oscillators (each of which resonates at a particular frequency, where the variation is caused by fabrication variations). Each ring may oscillate at a unique frequency depending on the characteristics of each of its inverters, the two multiplexers select two ROs to compare. Two counter blocks may count the number of oscillations of each of the two ROs in a fixed time interval; at the end of the interval, the outputs of the two counters are compared, and depending on which of the two counters has the highest value, the output of the PUF is set to 0 or 1. This may overcome problems of metastability, and, thereby be considered more reliable. Both ring oscillator PUFs and arbiter PUFs may be vulnerable to “machine learning attacks.” 
     Still referring to  FIG. 1 , intrinsic PUFs may include asynchronous PUFs, which may be synonymous with Self-Timed Ring PUFs. This may possess the same structure as the generic ring oscillator, however such PUFs may use self-timed rings instead of the inverter chains. The design may be based on the use of the Muller&#39;s C-element, a fundamental building block of asynchronous circuits. A significant benefit of self-timed rings may be that they make resulting PUF more immune to environmental variations. However, there may be an increase in the used silicon surface area. Furthermore, these self-timed structures may be prone to entering deadlock states. Intrinsic PUFS may include glitch PUFS; this may also involve a delay-based PUF construction which may be based on glitch behavior of combinatorial logic circuits. Occurrence of glitches may be determined by the difference in delay of the different logical paths from the input to output. As with other delay-based methods, the exact circuit delays may be subject to silicon manufacturing variations, and the number and shape of resulting glitches on output signals may be unique and be used as a PUF response. 
     Continuing to refer to  FIG. 1 , intrinsic PUFs may include SRAM PUFs. A typical SRAM cell is composed of two cross-coupled inverters and two access transistors. When the cell is powered up, the two cross-coupled inverters may enter a “power-struggle,” where the winner is decided by the difference in the driving strength of the MOSFETs in the cross coupled inverters. Theoretically, there are three possible states, where two are stable and one is metastable. If the transistors in the inverter circuits are perfectly matched, then the SRAM may remain metastable forever. Practically speaking, even though the transistors are designed to be identical, random variations in fabrication may ensure one has a stronger driving current, and this defines the initial start-up value for the cell. The majority of cells have an initial state that consistently may be returned to when powered up, and this is an important characteristic that allows them to be used for PUFs. Number of CRPs may be proportional to size of the memory. Currently, SRAM based PUFs may be a favorite amongst deployed technologies; as a result, their use may be attractive in that the SRAM cell is extraordinarily well characterized, but in principle may be characterized at manufacturing such that A malicious actor may be able to impersonate the private key. Intrinsic PUFs may include DRAM PUB, which leverage decay behavior of DRAM cells. DRAM cells include an access transistor and capacitor, and the charge stored in the capacitor decays over time—that decay behavior may vary based on random process variations. Compared to transistor-array-based design, this type of PUF may require less real estate because it can be built using pre-existing on-chip memory blocks. 
     Still viewing  FIG. 1 , in an embodiment, PUFs may include PUFs based on random mismatch between nominally cross-coupled devices. Such PUFs may include without limitation latch PUFs, which may be based on the settling state of two cross-coupled NOR-gates (a simple SR latch). Latch may be forced into an unstable state (through a reset signal), and it may subsequently converge on a stable state when it is released, depending on internal mismatch between the NOR gates. There may be a practical advantage to this PUF over SRAM PUFs, as it can be used at any time while the device is powered, not just during startup. Additional PUFs may include flip-flop PUFs, which may be based on the power-up behavior of D flip-flops, which normally are comprised of a number of latch structures. Because of this composition, there may be a PUF behavior for the D flip-flop similar to the basic latch PUF. PUFs may include butterfly PUFs: SRAM PUFs may be impossible on FPGA platforms, because the SRAM found on these systems are forcibly cleared. The butterfly PUF was engineered in direct response this issue. The SRAM cell behavior may be mimicked by cross-coupling two transparent data latches, forming a bistable circuit. By leveraging the clear functionality of the latches, the circuit may be forced into an unstable state (and converge when released). PUFs may include buskeeper PUFs, which may be similar to other PUFs based on bistable memory elements, but leveraging buskeeper cells. Again, a cross-coupled inverter structure may form the basis of the PUF. A significant benefit of this method may be the small size of the buskeeper cells. Another non-limiting example of PUFs may be bistable ring PUFS. This type of PUF may be considered a hybrid of the ring oscillator PUF and the SRAM PUF, wherein the structure is similar to the ring oscillator PUF, but the number of inverting elements is even. This may mean that the loop does not oscillate, but is bistable (like the SRAM PUF). Using reset logic, the bistable ring may destabilize and subsequently stabilize into a state that is set by the random silicon manufacturing variations. 
     Continuing to view  FIG. 1 , PUFs may include mixed-signal PUFs. Mixed-signal PUFs may include threshold voltage PUFs, wherein identically designed transistors in an addressable array may drive resistive loads, and, because of random silicon manufacturing variations, the transistor threshold voltages and current through the load may be random. Mixed-signal PUFs may include inverter gain PUFs, which may be based on the variable gain of equally designed inverters. The variable gain may be random because of random silicon process variations. Each challenge-response pair may be extracted from a pair of inverters. Mixed-signal PUFs may include SHIC PUFs, which may include an addressable array of diodes implemented as a crossbar memory forms the structure. Read-out time of each memory cell may be influenced by random silicon manufacturing variations and this forms a PUF response. Mixed-signal PUFs may include SRAM failure PUFs. Static noise margin for an individual SRAM cell may depend on random silicon manufacturing variations. As such, each SRAM cell may produce a bit failure at different noise levels, and this may be leveraged to generate a PUF response. 
     With continued reference to  FIG. 1 , PUFs may include quantum confinement PUFs. Implementation of quantum confinement PUFs may involve characterizing fluctuations in tunneling through quantum wells in resonant tunneling diodes (RTDs). Quantum confinement PUF may function, as a non-limiting example, through measuring electronic properties, for instance by determining current/voltage response of one or more RTDs (in any parallel or series arrangement) and analyzing the resultant curves for peak values, slopes, gradients, valleys, full-width-half-max, number of peaks, or other component identified by the current-voltage response that would serve as a uniquely identifying characteristic. Confined energy levels may be highly sensitive to the specific nanostructure within each RTD, leading to a distinct tunneling spectrum for every device. There are many constructions of quantum-confinement PUFs based on these principles as will be evident to those skilled in the art, including using an array of RTDs and quantum wells, extending the number of challenge-response-pairs, and so forth. Additional methods for PUF implementation may include, without limitation Kirchoff Law Johnson Noise based methods, as well as other methods that represent improvements in primarily standby power, secondarily chip area (relatively insensitive unless this is a significant lag beyond existing SRAM PUB) for a given uniqueness, robustness and randomness. Methods to recapitulate the private key in the event a stronger (e.g. more truly random or unique) PUF architecture is feasible in a given design may also be used. For instance, and without limitation, the system may re-authenticate at some interval if the key is completely lost, but building tolerance/support for this at protocol level would significantly reduce the engineering burden on the PUF itself. Other applications of other types of PUFs, such as uniquely identifying a particular material good based on, for example, a unique pattern developed due to the details of how the part was manufactured, extruded, finish coating was sprayed, etc., either across the part or at one or more points on the part, may also be implemented or exploited. These details may include optical reflection/scattering at one or more of the material interfaces, the measurement of this optical response, and optionally the computation of a digital bit string uniquely identifying or representing the optical response. 
     Further viewing  FIG. 1 , PUFs may include, without limitation, nano-electromechanical (NEM) PUFs. NEM PUFs may include PUFs that leverage stiction of a silicon nanowire to a binary gate structure. In an embodiment, an NEM PUF system may be highly robust; as a non-limiting example, NEM PUF may work effectively across a wide range of environmental conditions, including without limitation thermal variation, exposure to microwave radiation, and exposure to high dose radiation at various frequencies. 
     With continued reference to  FIG. 1 , PUFs may include, without limitation, PUFs implemented using design of vertical interconnect accesses (VIA or via), which may include electrical connections connecting layers in electronic circuits such as multilayered integrated circuits, that cross through the plane of one or more adjacent layers. A “VIA-PUF” may be created by, without limitation, designing VIAs with a small enough size that there is a roughly equal chance that they will or will not be created; this may cause the VIAs that function in the completed circuit to be randomly placed, leading to circuit behavior that is not predictable ahead of time. The above-mentioned randomness generated by random VIA creation may cause the resulting circuit to behave as a PUF. Such a VIA-PUF may be extremely robust over time and across environmental conditions. 
     Continuing to refer to  FIG. 1 , PUFs may include one or more photonic PUFs. In an embodiment, a photonic PUF may take advantage of the fact that some photonic devices can operate in a non-linear and/or chaotic manner. For instance, a silicon photonic micro-cavity may be used to instantiate a photonic PUF, for example by using a disk-with-chamfer design and operating in a non-linear optical regime, causing the micro-cavities to exhibit reverberant chaotic behavior. Optical output waveforms may also be complex and highly sensitive to precise physical cavity structure; at the same time responses may remain highly repeatable. Continuing the example, ultrashort optical pulses (e.g. in the femtosecond region) may be used to probe micro-cavities; the pulses may excite a unique combination of spatial optical modes that may interact with fine-scale structure of cavity interiors and with one another through optical nonlinearity of silicon. Each sequence of optical responses may contain spatiotemporal features that are extremely sensitive to cavity structures. It may be possible to extract long binary keys, including keys of 2.4 gigabytes or more, from a single micro-cavity PUF. Alternative or additional non-linear photonic devices may be used to implement a photonic PUF. 
     Still viewing  FIG. 1 , a secure protocol stack may build on secure root established using PUFs and/or ICs incorporating PUFs. Secure protocol stack may be deployed as a layer-2 scaling solution on top of existing temporally sequential listings  120  such as blockchains, distributed ledgers, its own chain, or any other data storage structure. Protocol may define multiple trust levels for nodes, such as cryptographic evaluators  112 , in a decentralized network. Nodes with secure computing modules  124  as disclosed herein, may be considered trusted nodes by protocol; protocol may allow for multiple trust levels as versions of hardware and software are released, including opportunities for other manufacturers to deploy hardware, and such trust levels may contribute to calculations of confidence levels as described in further detail below. Trusted nodes, or other devices incorporating secure computing modules  124  as described herein, may be able to authenticate each other anonymously and without a trusted third party. As a non-limiting example, a network elected trusted node, analogous to the Accelerator node in other protocols, (or series of nodes) may maintain a register of trusted nodes. This register may itself be distributed across all nodes or a subset of nodes in a blockchain, distributed ledger, or other data storage mechanism. This register may be implemented via threshold cryptography as described above, or other means. Protocol may allow for varying levels of decentralization of this trusted register depending on application. For instance, and without limitation, a securities settlement platform, for example to engage in securities exchanges as described above, may be far more centralized than a more open source cryptocurrency system. For backwards compatibility with existing hardware, nodes in the network may utilize any hardware infrastructure; formal verification methods may be used to establish the “trust level” of any node, these formal methods may attested in the digital signature assertion process; as a non-limiting example nodes implementing the described trusted node architecture may be assigned a higher trust level than Intel SGX based hardware, which may be assigned a higher trust level above completely unsigned hardware; various different implementations of secure computing module  124  may be assigned different trust levels. In a heterogeneous network consisting of devices of differing trust levels, the network may adopt a “hybrid consensus” protocol, in which proof of work and/or proof of stake is hybridized with block signatures from trusted nodes. 
     Continuing to refer to  FIG. 1 , secure computing module  124  may implement one or more secure memory storage protocols. One or more secure memory storage protocols may be protocols designed to prevent unauthorized access to memory and/or to protect secure computing module  124  from attacks compromising memory; secure memory storage protocols may prevent, as a non-limiting example, compromise of memory used for computation. In an embodiment, one or more memory elements may be located within a trusted computing boundary (TCB); TCB may be a boundary within which it is physically, information-theoretically, or computationally infeasible for exterior computing elements to probe, manipulate, access, or otherwise interact with elements under control of or incorporated in secure computing module  124 . For instance, and without limitation, it may be infeasible to physically probe the memory or access the memory from other software elements. In some embodiments, one or more memory elements may be located outside of trusted computing boundary. In some embodiments, a memory interface uses algorithmic techniques to randomize memory access patterns, for instance using obfuscated access, oblivious RAM, or ORAM. Such algorithmic techniques may implement one or more randomization techniques. In an embodiment, when crossing a trusted computing boundary, a memory interface data bus may be encrypted; that is data passed to the memory interface data bus may be encrypted using any hardware or software based encryption techniques discussed in this disclosure. In an embodiment, secure computing module  124  may incorporate a memory controller located within the trusted computing boundary to encrypt and authenticate by a secret key memory elements such as without limitation memory page tables and/or memory pages accessible by other software elements, such as an operating system. Various techniques, processes, means or elements may be used to implement the above-described secure memory protocols, For instance, secure computing module  124  may use hardware-enabled access control to protect memory access; hardware access control may, as a non-limiting example, be performed by tagging each memory entry with a “container identifier” corresponding to a page, file, or other grouping of memory, enabling secure computing module  124  to determine whether tampering has occurred. Secure computing module  124  may perform one or more safe-sharing protocols for hardware shared with other resources; for instance, where an exception, termination of a programmed process, or other condition causes a secured process to exit, shared registers may be reset to eliminate protected data prior to access by other processes. Secure computing module  124  may operate using one or more dedicated memory objects, registers, or storage elements; as a non-limiting example, secure computing module  124  may operate with dedicated cache lines not available to other processes or circuits, preventing, e.g., stack or buffer overrun attacks to corrupt or steal data. Dedicated memory elements may be wired only to secure computing module  124 ; access to dedicated memory elements may be rendered impossible except by way of secure computing module  124 . Secure computing module  124  may use one or more order-preserving memory storage protocols to detect “reset attacks” or fraudulent data entries presented out of order; such order preserving memory storage protocols may include, without limitation, Merkle trees or other hash trees in which each new entry contains a hash of a recently stored data entry and a hash of earlier Merkle tree and/or hash tree entries, rendering false or out-of-order entries computationally infeasible, or any temporally sequential listing as described above, including without limitation blockchains and the like. Secure computing module  124  may utilize oblivious random access memory (RAM) wherein memory access patterns are obfuscate to prevent detection of memory access patterns by outside observers attempting to deduce execution details regarding processes performed using secure computing module  124 . Secure computing module  124  and/or device incorporating secure computing module  124  may incorporate a trusted non-volatile storage device that provides some means of verification of secure storage capability and other properties. Memory protocols as described above may be used to implement methods of attested storage and the chain of trust beginning at PUF level up through processor, memory and code. Such mechanisms may be used to secure long-term storage (e.g. SSDs, spinning disks, tape, other), RAM, or other memory storage facilities. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various ways in which memory storage, securing, encryption, measuring, and attesting techniques as disclosed herein may be implemented and/or utilized by or with secure computing modules  124 . 
     Still referring to  FIG. 1 , secure computing module  124  may include a secure processor  132 . Secure processor  132  may be a processor as described below in reference to  FIG. 5 . Secure processor  132  may operate autonomously from other processors and/or an operating system operating on at least a cryptographic evaluator; for instance, secure processor  132  may store entries in temporary or long-term memory in encrypted form, where decryption is impossible without private keys not available to devices, circuits or software besides secure processor  132 . Encryption may likewise be impossible without private keys available only to secure processor  132 . Secure processor  132  may also digitally sign memory entries using, for instance, a private key available only to secure processor  132 . Keys available only to secure processor  132  may include keys directly encoded in hardware of the secure processor  132 ; i.e., a process to digitally sign and/or encrypt using keys may be coded using logic circuits, field-programmable arrays, read-only memory, burning into memory using one-time programmable polysilicon fuses, or the like, and thus be immutable absent physical changes to secure processor  132 . Secure processor  132  may be constructed, similarly to TPM  128 , to frustrate alteration and/or probing to discover and/or alter private keys. Private keys may be demonstrable as uniquely associated with secure processor  132  by use of PUF as described above; secure processor  132  may include, for instance, a TPM  128  as described above. Alternatively or additionally, a certificate authority as described above, which may be a manufacturer of secure processor  132 , may verify that one or more public keys are associated uniquely with secure processor  132  according to any protocol suitable for digital certificates. 
     With continued reference to  FIG. 1 , secure computing module  124  may perform and/or follow one or more attestation protocols. Attestation, as used herein, may be a process whereby a remote device and/or user may verify the identity of a secure computing module  124  and/or a cryptographic evaluator  112  incorporating the secure computing module  124 . Attestation processes may authenticate secure computing module  125  and/or cryptographic evaluator  112 . Attestation may further provide verified program execution, whereby a remote device and/or user may be assured that a specified program has executed with specified inputs and produced specified outputs. In an embodiment, this is accomplished by (a) “measuring” memory contents of memory including program instructions and/or inputs by creating a cryptographic hash of those contents; (b) storage of the hash in a trusted location such as a trusted register, memory of a third-party device operated by a trusted entity, a temporally sequential listing as described above, including without limitation a blockchain, or other trusted memory that may occur to persons skilled in the art upon reviewing the entirety of this disclosure; (c) execution of the code, as preserved in the above-described hash; and/or (d) digitally signing the hash using a non-volatile signing key embedded in the secure computing module  124 . 
     With continued reference to  FIG. 1 , secure computing device  124  may implement one or more methods of attested computation. Attested computation may include or involve one or more methods to ensure that computation of a program, known as an attested program, is trusted and signed by secure computing module  124  and/or computing device incorporating secure computing module; this may be supported by means to assert the state of the system memory, code, and input data. In an embodiment, secure computing module  124  and/or a computing device incorporating secure computing module  124  computes a cryptographic hash of a system state when performing a trusted computation. System state may include, without limitation, program code and/or one or more elements of data being computed. A resulting cryptographic hash of system state may be stored in one or more trusted or secured memories as described above. Secure computing module  124  and/or computing device incorporating secure computing module  124  may append a cryptographic signature based upon any private key that may be associated with secure computing module  124  as described herein. Secure computing module  124  and/or computing device incorporating secure computing module  124  may operate a security reset of working memory prior to load of data for trusted computation; for instance, the secure computing module  124  and/or computing device incorporating secure computing module  124  may append a hash of the memory to cryptographic hash of system state following reset and prior to loading data. Secure computing module  124  and/or computing device incorporating secure computing module  124  may append its authentication signature of memory page tables and/or memory tables. Upon completion of the trusted computation, which may include execution of program code of system state, secure computing module  124  and/or computing device incorporating secure computing module  124  may append an output value of the trusted computation to cryptographic hash of system state. In an embodiment, an output value of the trusted computation may itself be cryptographically hashed and/or encrypted; encryption may be performed using any form of hardware or software based encryption that may be associated with secure computing module  124 . Secure computing module  124  and/or computing device incorporating secure computing module  124  may include a system to compute one or more hash trees of cryptographic hash of the computation, system state, and/or outputs; secure computing module  124  and/or computing device incorporating secure computing module  124  may store the one or more hash trees within the trusted computation boundary. Hash trees may be appended to the trusted computation hash. Any process steps or components described above as performing trusted and/or attested computing may be performed or omitted in any order or combination as will be apparent to those skilled in the art, upon reading the entirety of this disclosure; for instance, order of appending data may be done in any combination. 
     With continued reference to  FIG. 1 , examples of secure computing modules may include, without limitation, a TPM as described above. Secure computing module  124  may include a TPM combined with a boot-measuring protocol using hash trees, Merkle trees, or the like to measure boot entries to create an “attested boot.” Secure computing module  124  may include a trusted execution technology (TXT) module combining TPM with establishment of a secure container at run-time; secure container may be isolated from a software stack and OS of at least a cryptographic evaluator  112  and/or use TPM to measure and attest to secure container prior to launch. Secure computing module  124  may include execute-only memory (XOM). Secure computing module  124  may include an Aegis processor. Secure computing module  124  may include a Bastion processor. Secure computing module  124  may include a trusted execution environment (TEE) or enclave, such as that enabled by SOFTWARE GUARD EXTENSIONS (SGX) system as promulgated by Intel Corporation of Santa Clara, Calif. Secure computing module  124  may include a Sanctum processor based on RISC V architecture. Secure computing module  124  may include an Ascend secure infrastructure. Secure computing module  124  may include a Ghostrider secure infrastructure. Secure computing module  124  may include an ARM TrustZone. Secure computing module  124  may include a Trusted Little Kernel (TLK) as promulgated by Nvidia Corporation of Santa Clara, Calif. Secure computing module  124  may include Secure Encrypted Virtualization (SEV) as promulgated by Advanced Micro Devices, Inc. of Santa Clara, Calif. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various additional or alternative trusted computing processes that may be used to implement secure computing module  124  as disclosed herein. System  100  may incorporate or communicate with a certificate authority  136 . 
     Still viewing  FIG. 1 , trusted computing, secure computing module  124  and/or protocols using secure computing module  124  may be used to establish a unique but anonymous electronic identity container to provide user control over online data. One of the current business models of web search engines, social media platforms and other internet businesses is to provide a service (search, social media, shopping platform) in exchange for the collection of user data which is then sold in near-instantaneous ad targeting exchanges to advertisers in a competitive bidding process, the process may include the targeting of ads and collection and storage of the browsing person&#39;s metadata. Advertisers and other websites may use cookies and related technologies to obtain and track additional metadata of the user (e.g. shopping and browsing trends), this data being used to further optimize targeting of advertisement for goods and services. In an embodiment, a trusted hardware device, such as without limitation a secure computing module  124 , incorporated into or associated with a device utilized for browsing a web page, interaction with a social media network, and any other web browsing may be used to instantiate an identity container. In a non-limiting example, the identity container is an electronic record structure that includes one or more public attestation keys of the trusted hardware device as used in an anonymity preserving attestation scheme, e.g. in non-limiting example a direct anonymous attestation procedure as described in further detail below in reference to  FIG. 4 . A method using identity container may establish in non limiting example one or more permissioned and/or revocable access levels to the users metadata contained in the identity container. In a non-limiting example, the identity container may be stored on the trusted hardware device and may be provisioned to one or more intermediates by exchange of public/private keys. Similarly, identity container may enable user to allow advertisers, web services or other entities to bid on access to one or more permissioned access levels of the identity container and the contents enclosed. In non-limiting example, by analogy to existing web advertisement bidding systems, the user may provide conditional access to one or more intermediate parties; the one or more intermediate parties may be composed of one or more entities. Provision may be accomplished by means of e.g. threshold cryptographic methods, such that it is infeasible for the intermediate party to maliciously leak the conditionally accessed data. Such data may further be obfuscated by a variety of means in a conditional exchange stage, such that the relative value of the metadata may be ascertained to some degree of certainty, but the actual metadata is not accessible. Intermediate party may facilitate a bid on access to one or more permissioned levels of the users identity container and the enclosed metadata. Depending upon the value established by said metadata and other factors, which may include features such as the user&#39;s minimum percentage of revenue share, the bid is concluded and the users percentage revenue share is assigned to the user. This system and method may further be used to transfer to an anonymous but uniquely identifiable user the revenue obtained in a bid for users metadata. In non-limiting example, the user may associate a cryptocurrency or other bank account directly or via third party to the unique identifier. In an embodiment, this process may function in a manner analogous to browser cookies, identity pixels and other technologies that are established from web service to user as a means to track and obtain metadata about that user. A mechanism may be established whereby the user may browse otherwise anonymously, but grant permissioned and/or revocable access to a container enclosing both the metadata they wish to provide (e.g. demographics, location, etc), as well as data the web service or services may wish to associate with the user (e.g., shopping history). 
     Referring now to  FIG. 3 , one or more steps in forming, modifying, recording transactions in, and authenticating cryptographically signed assertions, temporally sequential listing  120 , or one or more sublistings  200  may be performed by a network  300  of cryptographic evaluators  112 . Each cryptographic evaluator may be designed and configured to participate in or practice one or more processes described herein for creation, modification, and/or authentication of temporally sequential listing  120 , portions or sublistings  200  thereof, and/or transactions. Network  300  may be connected, and information may be distributed throughout network  300 , in any suitable way. As a non-limiting example, network  300  may be a centralized network, where all nodes in the network, including without limitation all cryptographic evaluators  112 , send their data to and receive their data from, a central node (i.e. a server), so that communications by all non-central nodes are mediated by or through the central node. As a further non-limiting example, network  300  may be a distributed network wherein each node may be connected to and communicate with any other node; nodes not directly connected may transmit messages to and from one another via intermediate nodes, for instance by “hopping” messages from one node to another. Network  300  may include a decentralized network, having a plurality of local centralized nodes that connect to one another, such that “non-centralized” nodes connect only via local centralized nodes, or connections between locally centralized nodes. Network  300  may include a “federated” network. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various forms and/or configurations network  300  may take consistently with the disclosed systems and methods. 
     With continued reference to  FIG. 3 , in an embodiment, temporally sequential listing  120  is copied or provided in its entirety to each at least a cryptographic evaluator  112 . Alternatively or additionally, temporally sequential listing  120  may be copied to some cryptographic evaluators  112  but not to others; for instance, where the temporally sequential listing  120  is a block chain or a consensus ledger created for exchanges of virtual currency or other commercial exchanges, the temporally sequential listing  120  may be copied to all cryptographic evaluators  112  participating in such exchanges. In other embodiments still, various components of temporally sequential listing  120  are distributed to various computing devices, such as the cryptographic evaluators  112  in a network. In other embodiments still, subcomponents of complete temporally sequential listing  120  are distributed to various computing devices in a network  300 , such that a group of computing devices such as the cryptographic evaluators  112  may each have a copy of the same subcomponent, and in totality, all subcomponents making up the complete temporally sequential listing  120  are contained in the network  300 . Distribution of devices having a copy of the same subcomponent of temporally sequential listing  120  may be optimized locally in network graph space and/or geographical space, for example as described in further detail below. Where temporally sequential listing  120  is centralized, computing devices that do not possess a copy of the temporally sequential listing  120  may obtain information from and convey information to the temporally sequential listing  120  by communicating with the computing device or set of computing devices on which the centralized temporally sequential listing  120  is maintained. Where temporally sequential listing  120  is decentralized and multiple copies of the entire temporally sequential listing  120  are distributed to multiple computing devices, computing devices that do not possess a copy of the temporally sequential listing  120  may obtain information from and convey information to a copy of the temporally sequential listing  120  residing on a computing device that does have a copy; requests for information and changes to the temporally sequential listing  120  may be propagated to all other computing devices having copies of the temporally sequential listing  120 . In some embodiments, the algorithm selecting the initial computing device with which to communicate may follow protocols as described in further detail below in reference to  FIG. 4 . 
     Still viewing  FIG. 3 , first processor  104  may be connected to network  300 . In an embodiment, a first processor  104  may be one of cryptographic evaluators  112  in network  300 . First processor  104  may store locally an instance of temporally sequential listing  120  to be authenticated by one or more cryptographic evaluators  112 . Alternatively or additionally, first processor  104  may be referring to an instance of temporally sequential listing  120  stored on one or more cryptographic evaluators  112 ; first processor  104  may not itself be at least a cryptographic evaluator  112 . 
     Still referring to  FIG. 3 , systems and methods as described herein may involve computation, calculation, assessment, assignment, or use of a confidence level associated with one or more processes, devices, or data, including without limitation one or more processes, appraisals, and/or cryptographic evaluators as described herein. Confidence level, as used herein, is an element of data expressing a degree to which the safety, security, or authenticity of a process, device, or datum may be relied upon. As used herein, a confidence level may include a numerical score; numerical score may be a score on a scale having one extremum representing a maximal degree of reliability, and a second extremum representing a minimum degree of liability. As a non-limiting example, extremum representing maximal degree of reliability may be a maximal number of an ordered set of numbers such as an open or closed set on the real number line, a sequential listing of integers or natural numbers, or the like; persons skilled in the art will be aware that selection of a numerical extremum to represent a higher level of confidence or reliability, albeit intuitively pleasing, is not mathematically necessary, and any suitable mapping of level of confidence or reliability to numerical objects or ranges may feasibly be substituted. As a further non-limiting example, numerical score may include, or be mappable to, a probability score, such as a percentage probability or a 0-1 probability level. Confidence level may include further information or indications, such as without limitation flags denoting untrustworthy, suspect, or hostile elements; for instance a flag may indicate that a particular device, program, process, or element of data appears to be compromised and/or has been involved in fraudulent or otherwise hostile or disruptive engagement with system  100  and/or methods described herein in the past. Methods of aggregating, computing, and/or using confidence levels will be described in further detail below. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various ways in which confidence levels may be implemented, calculated, assigned, and/or used as consistent with methods and systems disclosed herein. 
     Referring now to  FIG. 4 , an exemplary embodiment of a method  400  of authenticating a digitally signed assertion using a verified evaluator is illustrated. At step  405 , first processor  104  receives a first digitally signed assertion  116 . In an embodiment, first digitally signed assertion  116  may be any digitally signed assertion as described above, including without limitation a transaction recording an exchange of cryptocurrency, an assertion establishing a confidence level in one or more cryptographic evaluators as described in further detail below, an assertion recording an authentication determination as enacted in embodiments of method  400 , or any other digitally signed assertion. Receiving first digitally signed assertion  116  may include, without limitation, receiving first digitally signed assertion  116  directly, receiving a temporally sequential listing  120 , which may be a distributed ledger, distributed immutable ledger, and/or blockchain as described above including first digitally signed assertion  116 . Temporally sequential listing  120  may include a temporally ordered plurality of sub-listings  200 , wherein each sub-listing of the temporally ordered plurality of sub-listing contains at least a digitally signed assertion. Temporally sequential listing  120  may be immutable. One or more sublistings  200  may be immutable. Receiving may include receiving a sublisting  200  of a temporally sequential listing  120 . Receiving may further include receiving a reference to first digitally signed assertion  116 , temporally sequential listing  120 , or sublisting  200 ; reference may include without limitation a uniform resource locator (URL) indicating a location at which first digitally signed assertion  116 , temporally sequential listing  120 , and/or subfile is located, receiving a numerical or textual string identifying first digitally signed assertion  116 , temporally sequential listing  120 , and/or sublisting  200 , including without limitation a hash or checksum of first digitally signed assertion  116 , temporally sequential listing  120 , and/or sublisting  200 , or the like. Received first digitally signed assertion  116 , temporally sequential listing  120 , sublisting  200 , or reference thereto may be stored in memory  108  coupled to first processor  104 . 
     At step  410 , and with continued reference to  FIG. 4 , first processor  104  may identify at least a cryptographic evaluator  112 . At least a cryptographic evaluator may include one or more cryptographic evaluators  112  as described above in reference to  FIGS. 1-3 . At least a cryptographic evaluator  112  may be communicatively coupled to first processor  104 , for instance via network  300 ; at least a cryptographic evaluator may alternatively or additionally be incorporated in a single computing device or set of parallel devices with first processor  104 . In an embodiment, first processor  104  selects cryptographic evaluator  112  from among a plurality of cryptographic evaluators communicatively coupled to first processor  104 . 
     Still referring to  FIG. 4 , selection of at least a cryptographic evaluator  112  may involve selection of one or more cryptographic evaluators  112  situated to perform steps as described herein in optimal processing times; this may be determined according to one or more measures of distance or time between each at least a cryptographic evaluator  112  and first processor  104 . For instance, and without limitation, where plurality of cryptographic evaluators is connected to first processor  104  via a network, first processor may identify a proximate cryptographic evaluator of the plurality of cryptographic evaluators in a graph representing the network; a proximal at least a cryptographic evaluator  112  on a graph, may include, for instance, a at least a cryptographic evaluator  112  within a certain number of steps through the graph from the first processor  104 . Steps may also be weighted according to, e.g., estimates of physical distance or length of wire between cryptographic evaluators  112  connected by steps, as measured using network latency analysis and/or other processes for instance as described below. As a further example, selection may include selecting at least a geographically proximate at least a cryptographic evaluator  112  of the plurality of cryptographic evaluators  112 . Geographical location of first processor  104  and/or at least a at least a cryptographic evaluator  112  may be performed by analysis of IP addresses, which may be compared to stored information mapping such addresses to particular geographical locations or the like; geographical location of first processor  104  may alternatively or additionally be determined using navigational facilities, such as the global positioning system (GPS) or other protocols used to determine the location of a device. Distance between first processor  104  and at least a at least a cryptographic evaluator  112  may be computed using this information and compared to a threshold value; at least a at least a cryptographic evaluator  112  may be selected only if distance is below the threshold value, which may include, for instance, a radius of a certain number of miles or kilometers around the determined location of the first processor  104 . 
     Still viewing  FIG. 4 , selection may, as an additional example, include selection of a temporally proximate at least a cryptographic evaluator  112 , which may be at least a cryptographic evaluator  112  that under network latency analysis, time for response to a “ping” signal, or the like presents a likelihood of a more rapid response. Alternatively or additionally, past response times and/or past times in which generation of appraisals as described in further detail below was performed may be recorded in memory  108  and/or in temporally sequential listing  120 ; selection of at least a cryptographic evaluator  112  may be performed based on past performance time. 
     Still viewing  FIG. 4 , selection may include selection of only highly trusted cryptographic evaluators  112 , for instance as determined by determination of confidence levels as described below, such that the fewest cryptographic evaluators  112  are required for a given security requirement. These methods may be used to optimize network performance of authentication processes. In another example, additional data as described above that are incorporated into blocks or otherwise made available to nodes of the network may be utilized to optimally select which cryptographic evaluators  112  are selected. Selection of at least a cryptographic evaluator  112  may include selection to minimize total communication latency, where total communication latency is total expected time for each cryptographic evaluator  112  to respond with an appraisal as described in further detail below; such selection may involve determining, for instance, a selection of plurality of cryptographic evaluators  112  presenting an optimal or near-optimal network traversal time, which may be computed using node-count distances, geographical distances, network communication latency times, and/or expected performance times by particular cryptographic evaluators  112 . Such optimization may involve a near-optimal resolution of a “traveling salesman” problem, including without limitation a “greedy algorithm” in which each selection step involves choosing a locally optimal cryptographic evaluator  112 ; for instance, first processor  104  may choose a first “nearest” cryptographic evaluator  112  as measured by any of the above metrics, including any measure of actual or path distance and/or any measure of communication or computation latency. Continuing the example, first processor  104  may subsequently select a second cryptographic evaluator according to a locally optimal next selection under the above-described metric or metrics, selecting from locally optimal steps that either first cryptographic evaluator  112 , first processor  104 , either, or both may perform. This may be repeated until a desired number of cryptographic evaluators  112  is selected; “desired” number may be a raw threshold number, an aggregate confidence level as described in further detail below, or the solution to another optimization problem such as optimization of confidence versus speed as described in further detail below. Alternatively or additionally, optimal selection may make use of data concerning previously performed transactions; use of such data may include selection of an acceptably rapid previous transaction, or use of a plurality of previous selections to produce an algorithmic or mathematical solution to optimal selection using, e.g. a polynomial regression process, a neural-net machine learning process, or the like. Persons skilled in the art will be aware of various machine learning, deep learning, or other adaptive techniques that may be used to approach such an optimization problem, upon reviewing the entirety of this disclosure. 
     In an embodiment, and still viewing  FIG. 4 , selection of at least a cryptographic evaluator  112  may include establishing an aggregate confidence-level threshold, determining confidence levels of the plurality of cryptographic evaluators  112 , and identifying at least a cryptographic evaluator of the one or more cryptographic evaluators, the at least a cryptographic evaluator having an aggregate confidence level exceeding the aggregate confidence-level threshold. Evaluation of confidence level of each of the plurality of cryptographic evaluators  112  may be performed as described in further detail below. Establishment of an aggregate confidence level in a plurality of cryptographic evaluators  112  having a plurality of associated confidence levels may involve, e.g., adding together confidence levels; alternatively, aggregate confidence level may be computed by viewing each confidence level as a probability, calculating an aggregate probability by averaging or other statistical combination processes, and selecting cryptographic evaluators  112  so as to result in an aggregate probability representing a desired confidence level. Alternatively or additionally, a machine-learning algorithm as described above may analyze past transactions to determine an optimal mathematical operation for calculating an aggregate confidence level. As noted below, a desired confidence level to be used as a threshold may be computed in turn by reference to a user input indicating a desired confidence level, a minimal confidence level set by first processor  104  and/or network, for instance to ensure some degree of overall network integrity, a calculation based on a value of a transaction recorded in at least a digitally signed assertion  116 , or the like. 
     Still viewing  FIG. 4 , in an embodiment, identifying the at least a cryptographic evaluator further includes generating a cost function of confidence level and communication latency and minimizing the cost function. In an embodiment, cost function may be selected to optimize one or more user and/or network goals. Goals to be optimized may include, without limitation, a desired degree of latency (defined herein as a speed with which authentication occurs), security (which may be defined, e.g., as a degree of confidence in the accuracy of the authentication process), anonymity (defined as a degree of difficulty in obtaining information concerning a user of querying device and/or a person entering a transaction on temporally sequential listing  120 ), and throughput (defined as an aggregate or average latency across users and cryptographic evaluators  112 ). There may be tradeoffs between the above-mentioned four goals. For instance, if user wishes to perform authentication rapidly, reducing the number of nodes in at least a highly trusted at least a cryptographic evaluator  112  may improve the speed with which authentication can take place, as may selection of proximate nodes as described above. Anonymity, however, may favor selection of more widely scattered cryptographic evaluators  112  to make it more difficult to deduce where first processor  104  is located geographically or within network; additional measures to ensure anonymity, such as use of an anonymizing protocol such as the Tor protocol promulgated by The Tor Project, Inc., which functions by directing all internet traffic through a network containing a plurality of relays to conceal a user&#39;s location and usage from network surveillance and/or traffic analysis attempts, using “onion routing” processes, or the like may further increase latency and slow down authentication. Similarly, where greater security is a goal, more nodes may be added to at least a highly trusted at least a cryptographic evaluator  112  to increase the statistical likelihood of correct authentication determinations, and selections of at least a highly trusted at least a cryptographic evaluator  112  across a wider range of network locations and/or geographical locations may improve the likely independence of authenticating nodes, also slowing the process. Thus, a person who wants to convey a large amount of money very secretly using a transaction recorded on temporally sequential listing  120  may desire a very high degree of security and anonymity, and may accept a greater degree of latency in exchange. As a non-limiting example, securities transfer or exchange processes may be implemented to be slower, and require greater security; regulatory obstacles to anonymity may mitigate against anonymity, anonymity may be sacrificed in favor of speed and accuracy, for instance, by authenticating using a small number of cryptographic evaluators  112  associated with high confidence levels. As another non-limiting example, wire-transfer and/or credit card transactions may require fast, high-security, processing, relying on high degree of trust and low anonymity on part of institutions (i.e. identifying the institutions and using strong protocols to identify devices associated therewith, while maintaining high anonymity on part of clients. As a further example, processes involving medical devices and/or medical data may require high anonymity and high security, which may be emphasized above speed. In an embodiment, the ability of method  400  or variations thereof to modify these parameters for optimal results in different scenarios may be highly advantageous over existing methods. 
     With continued reference to  FIG. 4 , cost function may be dynamically set by a selected degree of optimization for one or more attributes. Determining degree of optimization may be performed via a user interface, which may be a graphical user interface (GUI), for instance by providing a user with one or more sliders representing desired degrees of security, transaction speeds, and/or levels of anonymity; sliders may be linked to absolute ranges of the attributes or may alternatively be used proportionally to represent relative importance to user of each attribute. Positions of one or more sliders may be reset according to stored mathematical relationships between different items; mathematical relationships may be determined by combining or producing machine-learning processes. A related or separate set of mathematical relationships may be used to determine how selection of at least a highly trusted at least a cryptographic evaluator  112  affects each attribute. Protocol implemented in embodiments herein may support varying security and anonymity demands by the parties to the transactions. For instance, two parties wishing to exchange $5M over the network will demand commensurate security and require some reduction in anonymity to comply with federal laws, in exchange for slightly longer validation times. Conversely, a customer purchasing a coffee at Starbucks will demand relatively little security and may be fully anonymous; a potential malicious actor utilizing a great number of small transactions to hide a large total transaction from regulators may be thwarted by identifying anonymous certificates that are re-used above some threshold and flagged by the network. This may allow network to self-adapt to meet varying demands. 
     With continued reference to  FIG. 4 , mathematical relationships between attributes and each other and/or between attributes and selection of at least a highly trusted at least a cryptographic evaluator  112  may be derived by collection of statistics concerning past transactions. In some embodiments, statistical relationships are determined through one or more machine learning processes; for instance, data describing the speed, authenticity, and anonymity of a plurality of past transactions may be subjected to regression analysis, such as linear or polynomial regression, to determine one or more equations relating one parameter of such transactions to one or more other such parameters. Similarly, a neural net may be provided with such a plurality of past transactions. Machine-learning processes may be supervised and/or unsupervised; for instance, attributes to compare may be preselected to ensure that machine-learning processes result in relationships between desired attributes and transaction parameters. Mathematical relationships may demonstrate, e.g., that a certain number of nodes in at least a highly trusted node results in a 95% degree of confidence in authenticity, that a second, higher number of nodes results in a 98% degree of confidence, and the like. As a further example, mathematical relationships may associate a level of anonymity, as measured in average proportion information content concerning user and/or first processor  104  obtainable from a transaction, information entropy of transaction, or the like, to average network or geographical distance between nodes of at least a highly trusted node, to selection of protocols to anonymize, and the like. Relationships between, the above parameters and latency may also be represented. Direct relationships between attributes to be optimized may be determined by machine learning processes; alternatively or additionally, such relationships may be determined using relationships of each attribute to parameters of selected at least a highly trusted node. 
     Still referring to  FIG. 4 , first processor  104  may use one or more additional selection criteria to choose at least a cryptographic evaluator  112 . As a non-limiting example, first processor may identify at least cryptographic evaluator  112  by determining a degree of involvement of a cryptographic evaluator, of the plurality of cryptographic evaluators, in at least a digitally signed assertion, and selecting the at least a cryptographic evaluator  112  as a function of the determination. Determining a degree of involvement may involve determining whether a cryptographic evaluator has digitally signed the digitally signed assertion; where cryptographic evaluator digitally signed the assertion, cryptographic evaluator may have an interest in the outcome of the assertion. Where cryptographic evaluator is identified in the at least a digitally signed assertion, cryptographic evaluator may have an interest in the outcome of the assertion. Where cryptographic evaluator is identified in or has signed a distinct digitally signed assertion listed in, for instance, a recent sublisting  200  and/or set of sublistings  200  yet to be authenticated, cryptographic evaluator may have an interest in authentication performed in method  400 . In an embodiment, first processor  104  may not select cryptographic evaluator where cryptographic evaluator has an interest in the authentication, assertion, and/or currently un-authenticated sublisting  200  or temporally sequential listing  120  instance; first processor  104  may reduce a determined confidence level of such an evaluator, and may select the evaluator at the reduced confidence level. 
     With continued reference to  FIG. 4 , identification of at least a cryptographic evaluator  112  may further involve determination that a cryptographic evaluator of plurality of cryptographic evaluators is currently available; determination may involve “pinging” cryptographic evaluator, viewing cryptographic evaluator in a listing of evaluators currently “online” on network  300 , or the like. 
     At step  415 , and still referring to  FIG. 4 , first processor  104  assigns at least a confidence level to at least a cryptographic evaluator. This may be performed by methods including reference to varying trust levels associated with various different implementations of secure computing modules  124  as described above. In an embodiment, assigning at least a confidence level includes determining an identity of at least a cryptographic evaluator, and assigning the confidence level as a function of the identity of the at least a cryptographic evaluator. Determination of identity of the at least a cryptographic evaluator may be performed using a trusted third-party (TTP) scheme. In an embodiment, a TTP scheme is a scheme in which a designated entity, such as a certificate authority as described above monitors and reviews a digital signature passed between two or more communicants, such as first processor  104  and at least a cryptographic evaluator  112 . For instance, first processor  104  or another device in communication with at least a cryptographic evaluator  112  may convey to at least a cryptographic evaluator a “challenge” containing some element of data to which at least a cryptographic evaluator  112  may respond with a digital signature signing the challenge with a private key. A certificate authority may then attest to the possession of the private key by at least a cryptographic evaluator  112 , thus identifying the at least a cryptographic evaluator  112  to the first processor  104 . Certificate authority may include, without limitation, a manufacturer of a secure computing module  124  as described above; in an embodiment, verification of identity of at least a cryptographic evaluator by certificate authority may be combined with additional identification of cryptographic evaluator using secure computing module  124  as described in further detail below. With continued reference to  FIG. 4 , a TTP process may be used to establish confidence level in at least a cryptographic evaluator  112  directly; for instance, a certificate authority may vouch for one or more attributes of at least a cryptographic evaluator  112 , and such voucher may be used, solely or in combination with other processes, to determine the confidence level. 
     With continued reference to  FIG. 4 , identifying at least a cryptographic evaluator  112  may alternatively or additionally involve identifying the at least a cryptographic evaluator  112  using a secure computing module  124  incorporated in the at least a cryptographic evaluator  112 . For instance, secure computing module  124  may sign a challenge or other element of data using a digital signature that may only be signed by secure computing module  124 ; this may be accomplished by reference to a manufacturer&#39;s identification of a public key associated with the secure computing module  124  private key used in the signature. Secure computing module  124  may sign with a private key generated using a PUF as described above. In an embodiment, and as a non-limiting example, secure computing module  124  may implement a decentralized anonymous authentication scheme (DAA). In an embodiment, DAA is an anonymous digital signature scheme, which instead of reliance on a certificate authority to link a particular private key to a particular party, uses reference to a group public key or to multiple public keys to verify an anonymous signature. This may be performed, for instance using a “principal signer” implementing a TPM  128  protocol. TPM  128  protocol may be performed using a TPM  128  operated on at least a cryptographic evaluator  112  and/or as part of a secure computing module  124  operating on at least a cryptographic evaluator  112 . TPM  128  may be used as a “first signer” of a digital certificate, signing with a physically embedded private key as described above. In an embodiment TPM  128  signs an element of data using physically embedded private key, indicating that the possessor of the TPM  128  is signatory. A second signer, which may be TPM  128  and/or at least a cryptographic evaluator  112 , may previously or subsequently sign the element of data or another element linked to the element signed using physically embedded private key. First signer may, for instance, sign an element of data to form a transaction as described above regarding immutable ledger to an address representing a public key that is linked to a private key used by second signer. Various versions of this protocol may be implemented, and persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of the many variations that may be applied to perform a TPM  128  protocol. 
     Continuing to refer to  FIG. 4 , assigning the at least a confidence level may include performing a trusted time evaluation of at least an action performed by the at least a cryptographic evaluator  112 . At least an action may be a response from at least a cryptographic evaluator  112  to first processor and/or any other device connected to at least a cryptographic evaluator  112 , for instance using network  300  as described above. At least an action may be creation or signature of at least a signed assertion. Trusted time verification of timestamps provided in at least an action may be performed as described above regarding trusted time implementations. Alternatively or additionally, a response time or response latency of a particular cryptographic evaluator of at least a cryptographic evaluator may be tracked and compared to at least an action; for instance, where at least an action has a latency or response time that differs more than a threshold amount from the typical response time, confidence level regarding that cryptographic evaluator may be lowered, to reflect a greater probability, as a non-limiting example, of a “man in the middle” attack. 
     Still viewing  FIG. 4 , further methods may involve establishing a confidence level in a network of devices, which may be or include a network of cryptographic evaluators. Such networks may include, for instance, networks of networks. Networks may include a network having two or more trusted computing devices. In some embodiments the network may consist only of trusted computing devices. In some embodiments, the network may include untrusted computing devices; communication to untrusted computing nodes may be mediated by one or more trusted nodes. Communication between any trusted and untrusted nodes accomplished by method of establishing a secure communication channel. In some embodiments, a trusted device may provide a cryptograph hash of trusted computation to one or more devices in the network as an assertion of trusted status. Confidence level in network may be established via anonymous attestation the trusted status of a network, wherein trust is defined by the least common denominator 
     With continued reference to  FIG. 4 , and as a further example, identifying at least a cryptographic evaluator  112  may involve implementing an attestation protocol as described above. In an embodiment, secure computing module  124  may perform attestation protocol to identify itself; in another embodiment, secure computing module  124  may perform an attestation protocol with regard to a program. For instance, secure computing module  124  may use a program verification attestation protocol to demonstrate that secure computing module  124  is the same secure computing module  124  used to perform a previous transaction; previous transaction may include, without limitation, a previous digital signing of a digitally signed assertion  116 , a previous generation of an appraisal of a digitally signed assertion  116  as described in further detail below, or any other program execution that may be associated with secure computing module  124  and/or cryptographic evaluator. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various processes whereby a secure computing module  124  may be used to identify a cryptographic evaluator  112  in which the secure computing module  124  is incorporated. 
     Still referring to  FIG. 4 , first processor  104  may determine a confidence level in identity of at least a cryptographic evaluator  112 . Confidence level in identity may be computed, for instance, using one or more statistical measures of reliability of the identification method used; for instance, a user may enter an instruction on first processor  104  providing statistics indicating success rates of various identification methods. Statistics may be collected based, as a non-limiting example, on discoveries of vulnerabilities in particular identification protocols and/or particular instances of secure computation module. User may alternatively make a subjective assessment, based on expert knowledge, for instance, of a confidence level to assign based on such findings, and enter that confidence level. Statistics and/or user-entered confidence level in identification method may be used as multipliers or otherwise combined with confidence-level calculations as described in further detail below, or otherwise assigning a confidence level as a function of the confidence level in the identity. First processor  104  may also determine confidence level in identity as a function of, for instance, one or more algorithms collecting statistics concerning degree of accuracy in past iterations of method  400  of a particular process for identifying at least a cryptographic evaluator  112 . 
     With continued reference to  FIG. 4 , identifying at least a cryptographic evaluator  112  may include identifying a first cryptographic evaluator using a first identification protocol and identifying a second cryptographic evaluator using a second identification protocol. As a non-limiting example, a first cryptographic evaluator of a plurality of cryptographic evaluators may be identified using a TTP protocol, while a second may be identified using a DAA protocol. As a further example, a first cryptographic evaluator may be identified using a first version of a secure computation module  124  incorporated in the first cryptographic evaluator, while a second cryptographic evaluator may be identified using a second version of a secure computation module  124 ; the first version may, for instance, be a GhostRider implementation while the second is an SGX implementation, or the like. In an embodiment, identification of cryptographic evaluators using heterogenous methods decreases the likelihood of an exploit successfully compromising all evaluators, as such an exploit would be required to take advantage of a potentially wide range of different vulnerabilities. Furthermore, in an embodiment first processor  104  may perform a time-of-evaluation selection of identification protocols, for instance by selecting from a stored menu of protocols using a random number generator or pseudorandom number generator; this may further decrease the probability of a successful exploit. 
     Continuing to refer to  FIG. 4 , assigning a confidence level may further include evaluating at least a second digitally signed assertion signed by a cryptographic evaluator of at least a cryptographic evaluator  112  and assigning a confidence level to the cryptographic evaluator as a function of the evaluation of the at least a second digitally signed assertion. At least a second digitally signed assertion may be identified as signed by the cryptographic evaluator using any identification process or protocol as described above. In an embodiment, at least a second digitally signed assertion is incorporated in a temporally sequential listing of digitally signed assertions; as a non-limiting example, first digitally signed assertion may be contained in a temporally sequential listing of digitally signed assertions and second digitally signed assertion may be contained in the temporally sequential listing of digitally signed assertions. For instance, where temporally sequential listing  120  is a blockchain or similar data structure, each assertion may be included in the blockchain. At least a second digitally signed assertion may include a plurality of digitally signed assertions. For instance, at least a at least a cryptographic evaluator  112  may record a series of digitally signed assertions in temporally sequential listing  120 ; each transaction of the series of transactions may be authenticated by any process suitable for authenticating temporally sequential listing  120 , including any process described herein for authentication of temporally sequential listing  120 . Transactions performed by at least a at least a cryptographic evaluator  112  may be scored according to authenticity; for instance, trusted status may be conferred on at least a cryptographic evaluator  112  only if a certain number of authenticated transactions have been performed by at least a cryptographic evaluator  112 , a certain amount of value has been conveyed in authenticated transactions by at least a node, a certain proportion (which may be 100%) of transactions performed by at least a at least a cryptographic evaluator  112  have been successfully authenticated, or any other suitable benchmarking and/or scoring process or combination thereof. At least a second assertion may include assertions that were recorded in rejected instances of temporally sequential listing  120 , such as rejected forks; in an embodiment, confidence level may be reduced as a function of a number of rejected forks including assertions signed by at least a cryptographic evaluator, for instance. 
     Still referring to  FIG. 4 , in an embodiment, determining a confidence level may include determining that at least a cryptographic evaluator is disinterested from the at least a first digitally signed assertion; this determination may be performed as described above. Confidence level may be adjusted where at least a cryptographic evaluator is determined to be interested as described above; for instance, user-entered or other instructions in memory may specify a multiplier or other mathematical calculation modifying a confidence level otherwise found for a cryptographic evaluator; as a non-limiting example a confidence level may be reduced by 5% for a cryptographic evaluator involved in an assertion included in a sublisting  200  also containing at least a first digitally signed assertion, and 10% for direct involvement of a cryptographic evaluator in the first digitally signed assertion. Degree to which involvement of cryptographic evaluator in first digitally signed assertion affects confidence level may also be assessed using data describing past iterations of method  400  and/or past authentication methods wherein one or more interested cryptographic evaluators were involved in authentication; machine learning algorithms as described above may, for instance, be used. 
     With continued reference to  FIG. 4 , confidence level may be determined by a consensus process; for instance, all cryptographic evaluators currently connected to network  300  may determine a confidence level concerning a particular cryptographic evaluator. This determination may be performed, for instance, by authenticating one or more past instances of temporally sequential listing  120  and/or one or more sublistings  200  thereof. Determination may include identification of one or more rejected instances of temporally sequential listing  120 . Each cryptographic evaluator of plurality of cryptographic evaluators may provide a confidence level for the cryptographic evaluator to be evaluated. First processor  104  and/or another processor communicatively coupled to network  300  may calculate an aggregate confidence level based on confidence levels submitted by plurality of cryptographic evaluators; aggregation may be performed according to any method for aggregation of confidence levels described above. In an embodiment, aggregation may be weighted according to a previously determined confidence level of each cryptographic evaluator of plurality of cryptographic evaluators performing consensus determination of confidence level of cryptographic evaluator to be evaluated. This may include, e.g., ignoring confidence level submissions from evaluators having confidence levels below a certain threshold; alternatively or additionally, first processor  104  may request confidence level determinations by a plurality of evaluators previously determined to have a confidence level above a certain threshold level. 
     With further reference to  FIG. 4 , assigning the at least a confidence level may include evaluating an assertion, in a temporally sequential listing  120  of assertions, assigning a recorded confidence level to a cryptographic evaluator of the at least a cryptographic evaluator, and assigning the confidence level as a function of the recorded confidence level. For instance, one or more processors, a consensus process, first processor  104 , and/or a network of cryptographic evaluators having a confidence level in excess of a threshold, may have previously evaluated a confidence level in a certain cryptographic evaluator; in an embodiment, such a confidence level may itself be recorded in an assertion listed in temporally sequential listing  120 . A plurality of such assertions, corresponding to a plurality of cryptographic evaluators, may be listed; as such, first processor  104  may determine confidence level in one or more cryptographic evaluators solely by retrieving confidence levels so recorded. Alternatively or additionally, first processor  104  may combine such confidence levels with confidence level determinations made by other means. Combination may be performed, e.g., by retrieving such confidence levels from temporally sequential listing  120  for at least a first cryptographic evaluator, and calculating a confidence level for at least a second cryptographic evaluator by any other process described above. As a further example, first processor  104  may retrieve a confidence level recorded in temporally sequential listing  120  for a given cryptographic evaluator, determine a confidence level for the same cryptographic evaluator, and then aggregate the two confidence levels according to any process as described above for aggregation of confidence levels. 
     Still referring to  FIG. 4 , first processor  104  may further weight or modify confidence level according to one or more additional factors. For instance, confidence level may be weighted according to how recently cryptographic evaluator signed a digitally signed assertion in an authenticated instance of temporally sequential listing  120 , where a more recently authenticated assertion may result in a higher confidence level or higher weight assigned to the confidence level, and a less recently authenticated assertion may result in a lower confidence level or a lower weight assigned to that confidence level. As another example a cryptographic evaluator that has recently “sold off” a large amount of value and/or has an assertion in a sublisting  200  currently awaiting authentication may have its confidence level decreased. As a further example, an evaluator with little or no history, or an anonymous evaluator, may be assigned some minimal or “neutral” confidence level indicating treatment as a “consensus” evaluator rather than a “trusted” evaluator. An evaluator associated with a previous fraudulent transaction may be assigned a confidence level of zero or may be excluded from evaluation processes. 
     At step  420 , and still referring to  FIG. 4 , first processor  104  provides the at least a digitally signed assertion to at least a cryptographic evaluator  112 . Provision of the at least a first digitally signed assertion may be performed in any manner suitable for reception of the at least a first digitally signed assertion. For instance, and without limitation, at least a first digitally signed assertion may be directly transmitted to at least a cryptographic evaluator  112 . A temporally sequential listing  120  instance containing at least a first digitally signed assertion may be transmitted to at least a cryptographic evaluator  112 . A sublisting  200  containing at least a first digitally signed assertion may be transmitted to at least a cryptographic evaluator  112 . Alternatively or additionally, an indication of at least a first digitally signed assertion, such as a URL, hash, checksum, or the like may be transmitted. 
     At step  425 , and still referring to  FIG. 4 , first processor  104  may receive, from at least a cryptographic evaluator  112 , at least an appraisal of the at least a first digitally signed assertion. At least a cryptographic evaluator  112  may generate the at least an appraisal by evaluating a digital signature of at least a first digitally signed assertion  116 ; digital signature may be compared to a public key known to be associated with a device or entity alleged to have signed the at least a first digitally signed assertion  116 . Where at least a first digitally signed assertion includes an address as described above, at least a cryptographic evaluator  112  may evaluation earlier digitally signed assertions referencing the address, for instance tracing back a given transfer of value or other item through a series of such transactions, as described above. Where at least a first digitally signed assertion is included in a temporally sequential listing  120  instance, at least a cryptographic evaluator may authenticate the instance; this may be performed according to any method for authenticating an instance of a temporally sequential listing  120  or sublisting  200 , including hashing one or more sublistings and comparing hashes to listed values, following sequence of hashed sublistings  200  to a “genesis block” or a block/sublisting acknowledged by a consensus process or the like to be an authentic entry, or any other process that may occur to a person skilled in the art upon reviewing the entirety of this disclosure. Receiving the at least an appraisal may include receiving at least an appraisal of a temporally sequential listing  120  of assertions containing the at least a first digitally signed assertion. Receiving the at least an appraisal may include receiving at least an appraisal of a digital signature of the at least a first digitally signed assertion. Receiving the at least an appraisal may include receiving at least an appraisal of information contained in the at least a first digitally signed assertion. 
     Still viewing  FIG. 4 , appraisal may include a binary determination that at least a first digitally signed assertion and/or temporally sequential listing  120  containing at least a first digitally signed assertion is or is not authentic. As another non-limiting example appraisal may include a confidence level of at least a cryptographic evaluator  112  regarding at least a first digitally signed assertion and/or temporally sequential listing  120 . At least an appraisal may be digitally signed; for instance, at least an appraisal may be digitally signed using a key that may be associated with at least a cryptographic evaluator  112  according to any methods or means described above for associating a key with a cryptographic evaluator  112 . 
     At step  430 , and still referring to  FIG. 4 , first processor  104  authenticates at least a first digitally signed assertion as a function of at least an appraisal and at least a confidence level. For instance, where receiving at least an appraisal includes receiving an appraisal confidence level, authenticating at least a first digitally signed assertion  116  may include authenticating the at least a first digitally signed assertion as a function of the appraisal confidence level; as a non-limiting example appraisal confidence level may be aggregated with confidence level assigned to at least a cryptographic evaluator according to any process for such aggregation as described above. As a further example, where at least a cryptographic evaluator includes a plurality of cryptographic evaluators, and the plurality of cryptographic evaluators has a number of cryptographic evaluators, authenticating the at least a first digitally signed assertion may include authenticating the at least a first digitally signed assertion as a function of the number of cryptographic evaluators. For instance, an overall confidence level in at least a first digitally signed assertion  116  may be determined to be higher where a greater quantity of cryptographic evaluators is higher, and lower where the overall number of cryptographic evaluators is lower; the number may be the number of cryptographic evaluators that submit appraisals, which may be lower than the number to which first processor  104  provided at least a first digitally signed assertion, such that weighting by number of responses may aid in determining whether the authentication process is sufficiently robust for a given threshold determination, as discussed in further detail below. 
     Still referring to  FIG. 4 , where at least a cryptographic evaluator includes a plurality of cryptographic evaluators, authenticating the at least a first digitally signed assertion may include determining an aggregate confidence level of the plurality of cryptographic evaluators and authenticating the at least a first digitally signed assertion as a function of aggregate confidence level. Aggregation of confidence levels may be performed according to any process for aggregation as described above. In an embodiment, aggregate confidence level is further aggregated with appraisal confidence levels; for instance, each cryptographic evaluator&#39;s appraisal confidence level may be aggregated with that cryptographic evaluator&#39;s assigned confidence level, and then further aggregated with similarly obtained confidence levels from other cryptographic evaluators. 
     In an embodiment, and still viewing  FIG. 4 , plurality of cryptographic evaluators  112  may have differing levels of trusted status. Differing levels may be based upon properties of incorporated secure computing modules  124 ; non-limiting examples of such properties may include the length of private keys, randomness and entropy of private key generator, degree of complexity of secure computing module  124  generation, strength of security assumptions or contemplated adversaries in implementing secure computing module generation  124 , brand or reputation of manufacturer, or other properties as described above. Alternatively or additionally, differing levels of trust may be based upon, e.g., a number of transactions in a transaction record of a at least a cryptographic evaluator  112  as described above, a proportion of successful transactions, an aggregate value of transactions and/or aggregate value of successful transactions as a proportion of aggregate value of transactions, any other metric, or any combination thereof, as described above. In an embodiment, where the at least a cryptographic evaluator  112  includes a first cryptographic evaluator having a first confidence level and producing a first appraisal of the at least an appraisal and a second cryptographic evaluator having a second confidence level and producing a second appraisal of the at least an appraisal, and where the confidence level is different from second confidence level, authenticating the at least a first digitally signed assertion may include weighting the first appraisal by first confidence level and second appraisal by the second confidence level; this may be a natural consequence of a method of aggregation of confidence levels and/or appraisals as described above. In an embodiment some cryptographic evaluators may have, for instance, a neutral confidence level, indicating that no information is available to determine a confidence level for those cryptographic evaluators; such evaluators may be assigned a confidence level and/or weight consistent with the lack of information. This may enable the implementation of a hybrid network containing “trusted” cryptographic evaluators and “consensus” cryptographic evaluators. 
     With continued reference to  FIG. 4 , first processor  104  may produce a true or false authentication result based on the above-described determinations. For instance, and without limitation, first processor  104  may compare an aggregate confidence level to a threshold confidence level; threshold confidence level may be set, as a non-limiting example, by a user selection of a slider as described above. Alternatively or additionally, threshold level may be set automatically by first processor  104  as a function of, for instance, an exchanged value represented in at least a first digitally signed assertion  116 , where threshold level may be higher, for instance, for higher values. As a further example, threshold level may be lower where at least a first digitally signed assertion  116  was signed by a cryptographic evaluator  112  having a higher confidence level, and lower where at least a first digitally signed assertion  116  was signed by a cryptographic evaluator  112  having a lower confidence level. 
     Still referring to  FIG. 4 , where aggregate confidence level falls below an applicable threshold, first processor  104  may determine that authentication of at least a first digitally signed assertion  116  has failed. First processor  104  may determine a cause for failure; for instance, if all responding cryptographic evaluators appraised at least a first digitally signed assertion  116  as authentic and/or provided it a high confidence level, but an insufficient number of evaluators responded with appraisals and/or an aggregate confidence level of responding cryptographic evaluators was too low, first processor  104  may initiate method or some steps of method again to iteratively arrive at a sufficient network of cryptographic evaluators to produce a reliable answer. Where responding cryptographic evaluators assessed at least a first digitally signed assertion as inauthentic or provided a low assertion confidence level, first processor  104  may determine that at least a first digitally signed assertion  116  is inauthentic. 
     With continued reference to  FIG. 4 , where first processor  104  determines that at least a first digitally signed assertion is authentic, first processor may provide an indication that at least a first digitally signed assertion is authentic to a user, a cryptographic evaluator, all cryptographic evaluators attached to network  300 , or any other suitable device. Where, for instance, temporally sequential listing  120  and/or a sublisting  200  has been determined to be authentic according to method  400 , first processor may distribute listing to all cryptographic evaluators in network, or to all nodes configured to receive authenticated instances of temporally sequential listing  120 . 
     In an embodiment, the above-described method  400  enables authentication by a smaller number of cryptographic evaluators  112  to produce an equally reliable result to that created by traditional consensus-based authentication in a much smaller amount of time. Additional performance improvements may be realized by use of trusted cryptographic evaluators  112  that are closer, and thus capable of more rapid responses. Current block chain-based technologies utilize consensus of large numbers of anonymous cryptographic evaluators  112  to secure a at least a digitally signed assertion  116  rather than relying upon trusted parties. While decentralization is beneficial and avoids the need for trusted entities, the time and cost to authenticate a at least a digitally signed assertion  116  using consensus is prohibitive relative to a trusted party. Several efforts claim to enable faster at least a digitally signed assertion  116 , either by processing only sublistings  200  and then authenticating on the chain (e.g. Ripple, Lightning) or by using a smaller number of “honest” cryptographic evaluators  112 , considered “trusted” by various heuristics, to authenticate a at least a digitally signed assertion  116  in an “accelerator” mode onto an “optimistic fast path” (e.g. Thunder Consensus—see https://eprint.iacr.org/2017/913.pdf). These fundamentally break several promises of block chain, though: the at least a digitally signed assertion  116  is not actually considered secure and authentic until placed on the “slow” chain, so other measures (e.g. escrow, proxy for trusted party, or other) are utilized to “secure” this fast at least a digitally signed assertion  116  in the interim. When found to be corrupted, these “accelerator” at least a digitally signed assertion  116  are reverted. This may be a benefit over other e.g. clearinghouse style at least a digitally signed assertion  116  protocols, but is not actually any better than the existing block chain solutions in terms of capital outlay. (e.g., for this period of, say, 10 minutes, both sides of the at least a digitally signed assertion  116  effectively still hold that balance of the at least a digitally signed assertion  116  on the books). As a result, selection of a subset of cryptographic evaluators  112  to perform authentication may produce far more efficient authentication. In the limit of a network consisting of only trusted nodes, block verification may occur several orders of magnitude faster than any current approach, with scalability increasing proportionally. Further, DAA with trusted hardware may allow for optimization of decentralized routing, which accelerates and builds upon the notion of shards in existing protocols. 
     It is to be noted that any one or more of the aspects and embodiments described herein may be conveniently implemented using one or more machines (e.g., one or more computing devices that are utilized as a user computing device for an electronic document, one or more server devices, such as a document server, etc.) programmed according to the teachings of the present specification, as will be apparent to those of ordinary skill in the computer art. Appropriate software coding can readily be prepared by skilled programmers based on the teachings of the present disclosure, as will be apparent to those of ordinary skill in the software art. Aspects and implementations discussed above employing software and/or software modules may also include appropriate hardware for assisting in the implementation of the machine executable instructions of the software and/or software module. 
     Such software may be a computer program product that employs a machine-readable storage medium. A machine-readable storage medium may be any medium that is capable of storing and/or encoding a sequence of instructions for execution by a machine (e.g., a computing device) and that causes the machine to perform any one of the methodologies and/or embodiments described herein. Examples of a machine-readable storage medium include, but are not limited to, a magnetic disk, an optical disc (e.g., CD, CD-R, DVD, DVD-R, etc.), a magneto-optical disk, a read-only memory “ROM” device, a random access memory “RAM” device, a magnetic card, an optical card, a solid-state memory device, an EPROM, an EEPROM, and any combinations thereof. A machine-readable medium, as used herein, is intended to include a single medium as well as a collection of physically separate media, such as, for example, a collection of compact discs or one or more hard disk drives in combination with a computer memory. As used herein, a machine-readable storage medium does not include transitory forms of signal transmission. 
     Such software may also include information (e.g., data) carried as a data signal on a data carrier, such as a carrier wave. For example, machine-executable information may be included as a data-carrying signal embodied in a data carrier in which the signal encodes a sequence of instruction, or portion thereof, for execution by a machine (e.g., a computing device) and any related information (e.g., data structures and data) that causes the machine to perform any one of the methodologies and/or embodiments described herein. 
     Examples of a computing device include, but are not limited to, an electronic book reading device, a computer workstation, a terminal computer, a server computer, a handheld device (e.g., a tablet computer, a smartphone, etc.), a web appliance, a network router, a network switch, a network bridge, any machine capable of executing a sequence of instructions that specify an action to be taken by that machine, and any combinations thereof. In one example, a computing device may include and/or be included in a kiosk. 
       FIG. 5  shows a diagrammatic representation of one embodiment of a computing device in the exemplary form of a computer system  500  within which a set of instructions for causing a control system to perform any one or more of the aspects and/or methodologies of the present disclosure may be executed. It is also contemplated that multiple computing devices may be utilized to implement a specially configured set of instructions for causing one or more of the devices to perform any one or more of the aspects and/or methodologies of the present disclosure. Computer system  500  includes a processor  504  and a memory  508  that communicate with each other, and with other components, via a bus  512 . Bus  512  may include any of several types of bus structures including, but not limited to, a memory bus, a memory controller, a peripheral bus, a local bus, and any combinations thereof, using any of a variety of bus architectures. 
     Memory  508  may include various components (e.g., machine-readable media) including, but not limited to, a random access memory component, a read only component, and any combinations thereof. In one example, a basic input/output system  516  (BIOS), including basic routines that help to transfer information between elements within computer system  500 , such as during start-up, may be stored in memory  508 . Memory  508  may also include (e.g., stored on one or more machine-readable media) instructions (e.g., software)  520  embodying any one or more of the aspects and/or methodologies of the present disclosure. In another example, memory  508  may further include any number of program modules including, but not limited to, an operating system, one or more application programs, other program modules, program data, and any combinations thereof. 
     Computer system  500  may also include a storage device  524 . Examples of a storage device (e.g., storage device  524 ) include, but are not limited to, a hard disk drive, a magnetic disk drive, an optical disc drive in combination with an optical medium, a solid-state memory device, and any combinations thereof. Storage device  524  may be connected to bus  512  by an appropriate interface (not shown). Example interfaces include, but are not limited to, SCSI, advanced technology attachment (ATA), serial ATA, universal serial bus (USB), IEEE 1394 (FIREWIRE), and any combinations thereof. In one example, storage device  524  (or one or more components thereof) may be removably interfaced with computer system  500  (e.g., via an external port connector (not shown)). Particularly, storage device  524  and an associated machine-readable medium  528  may provide nonvolatile and/or volatile storage of machine-readable instructions, data structures, program modules, and/or other data for computer system  500 . In one example, software  520  may reside, completely or partially, within machine-readable medium  528 . In another example, software  520  may reside, completely or partially, within processor  504 . 
     Computer system  500  may also include an input device  532 . In one example, a user of computer system  500  may enter commands and/or other information into computer system  500  via input device  532 . Examples of an input device  532  include, but are not limited to, an alpha-numeric input device (e.g., a keyboard), a pointing device, a joystick, a gamepad, an audio input device (e.g., a microphone, a voice response system, etc.), a cursor control device (e.g., a mouse), a touchpad, an optical scanner, a video capture device (e.g., a still camera, a video camera), a touchscreen, and any combinations thereof. Input device  532  may be interfaced to bus  512  via any of a variety of interfaces (not shown) including, but not limited to, a serial interface, a parallel interface, a game port, a USB interface, a FIREWIRE interface, a direct interface to bus  512 , and any combinations thereof. Input device  532  may include a touch screen interface that may be a part of or separate from display  536 , discussed further below. Input device  532  may be utilized as a user selection device for selecting one or more graphical representations in a graphical interface as described above. 
     A user may also input commands and/or other information to computer system  500  via storage device  524  (e.g., a removable disk drive, a flash drive, etc.) and/or network interface device  540 . A network interface device, such as network interface device  540 , may be utilized for connecting computer system  500  to one or more of a variety of networks, such as network  544 , and one or more remote devices  548  connected thereto. Examples of a network interface device include, but are not limited to, a network interface card (e.g., a mobile network interface card, a LAN card), a modem, and any combination thereof. Examples of a network include, but are not limited to, a wide area network (e.g., the Internet, an enterprise network), a local area network (e.g., a network associated with an office, a building, a campus or other relatively small geographic space), a telephone network, a data network associated with a telephone/voice provider (e.g., a mobile communications provider data and/or voice network), a direct connection between two computing devices, and any combinations thereof. A network, such as network  544 , may employ a wired and/or a wireless mode of communication. In general, any network topology may be used. Information (e.g., data, software  520 , etc.) may be communicated to and/or from computer system  500  via network interface device  540 . 
     Computer system  500  may further include a video display adapter  452  for communicating a displayable image to a display device, such as display device  536 . Examples of a display device include, but are not limited to, a liquid crystal display (LCD), a cathode ray tube (CRT), a plasma display, a light emitting diode (LED) display, and any combinations thereof. Display adapter  452  and display device  536  may be utilized in combination with processor  504  to provide graphical representations of aspects of the present disclosure. In addition to a display device, computer system  500  may include one or more other peripheral output devices including, but not limited to, an audio speaker, a printer, and any combinations thereof. Such peripheral output devices may be connected to bus  512  via a peripheral interface  556 . Examples of a peripheral interface include, but are not limited to, a serial port, a USB connection, a FIREWIRE connection, a parallel connection, and any combinations thereof. 
     The foregoing has been a detailed description of illustrative embodiments of the invention. Various modifications and additions can be made without departing from the spirit and scope of this invention. Features of each of the various embodiments described above may be combined with features of other described embodiments as appropriate in order to provide a multiplicity of feature combinations in associated new embodiments. Furthermore, while the foregoing describes a number of separate embodiments, what has been described herein is merely illustrative of the application of the principles of the present invention. Additionally, although particular methods herein may be illustrated and/or described as being performed in a specific order, the ordering is highly variable within ordinary skill to achieve methods, systems, and software according to the present disclosure. Accordingly, this description is meant to be taken only by way of example, and not to otherwise limit the scope of this invention. 
     Exemplary embodiments have been disclosed above and illustrated in the accompanying drawings. It will be understood by those skilled in the art that various changes, omissions and additions may be made to that which is specifically disclosed herein without departing from the spirit and scope of the present invention.