Legal Claim Exchange with Price Time Priority Queues

Abstract

Various implementations directed to a legal claim exchange with price time priority queues are described herein. In one implementation, a method may include receiving claim attribute data from users for legal claims, a legal claim corresponding to a compensation claim by a respective user and the claim attribute data comprising data corresponding to a legal claim type for the legal claim, a monetary value for the legal claim, or combinations thereof. The method may also include receiving device data for the legal claims from the users, wherein the device data for the legal claim comprises data corresponding to locations associated with the legal claim. The method may further include generating a legal claim exchange for legal claim units based on the claim attribute data and the device data, wherein a legal claim unit corresponds to a contractual right to the legal claim available for purchase by the users.

Description

BACKGROUND OF THE INVENTION

The following descriptions and examples are not admitted as prior art by virtue of their inclusion within this section.

In some scenarios, legal claims for litigation or patents may lack data organization methods and systems that can expedite funding. Data has not traditionally been organized to associate biomarkers and structured factual data to structured litigation and patent claims. This associated data can be used to form a structured data blockchain around the litigation or patent claim as an asset, which then may be further organized by satellite geolocation data and price-time priority queues to make the litigation and patent claims exchange-traded. Such queues may not be used because litigation and patent claim systems may typically be considered to be closed, non-transparent, non-substitutable, and/or non-transferrable. Moreover, no cost of cover calculations may exist, and the construct for dynamic matching based on litigation or patent claim unit marketplaces may not be understood. Further, in such scenarios, legal or physical transformations may not exist for litigation or patent units to trade as commodities or securities, which may prevent the formation of markets that are based upon market dynamic, transparent market price-based inputs in edge weights or edge values for the blockchained litigation or patent claims. In these scenarios, methods and systems may lack the legal and physical calculation mechanics for litigation and patent claim units, which may limit analysis and technology system usefulness.

Deficiencies in market structure may not allow for the efficient transferability of an underlying litigation or patent claim, which may inhibit flexibility to exchange such an asset and may lead to the development of monopolistic systems. Further, in some scenarios, litigation or patent claims may allow for transferability or assignability, but they may lack structures which account for force majeure contingencies, remedies for litigation and patent unit failures, events of default, remedies, calculation formulas for termination payments, or independent valuation transformations. In such scenarios, the ability to trade the value of litigation and patent claims may be limited.

SUMMARY

Described herein are implementations of various technologies relating to a legal claim exchange with price time priority queues. In one implementation, a method may include receiving claim attribute data from a plurality of users for a plurality of legal claims, wherein a respective legal claim corresponds to a compensation claim by a respective user, and wherein the claim attribute data for the respective legal claim comprises data corresponding to a legal claim type for the respective legal claim, a monetary value for the respective legal claim, or combinations thereof. The method may also include receiving device data for the plurality of legal claims from at least a subset of the plurality of users, wherein the device data for the respective legal claim comprises data corresponding to one or more locations associated with the respective legal claim. The method may further include generating a legal claim exchange for a plurality of legal claim units based on the claim attribute data and the device data, wherein a respective legal claim unit corresponds to a contractual right to the respective legal claim available for purchase by the plurality of users.

In another implementation, a computing system may include one or more processors and at least one memory having program instructions executable by the one or more processors to receive claim attribute data from a plurality of users for a plurality of legal claims, wherein a respective legal claim corresponds to a compensation claim by a respective user, and wherein the claim attribute data for the respective legal claim comprises data corresponding to a legal claim type for the respective legal claim, a monetary value for the respective legal claim, or combinations thereof. The at least one memory may also have program instructions executable by the one or more processors to receive device data for the plurality of legal claims from at least a subset of the plurality of users, wherein the device data for the respective legal claim comprises data corresponding to one or more locations associated with the respective legal claim. The at least one memory may further have program instructions executable by the one or more processors to generate a legal claim exchange for a plurality of legal claim units based on the claim attribute data and the device data, wherein a respective legal claim unit corresponds to a contractual right to the respective legal claim available for purchase by the plurality of users.

In yet another implementation, a non-transitory computer-readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to receive claim attribute data from a plurality of users for a plurality of legal claims, wherein a respective legal claim corresponds to a compensation claim by a respective user, and wherein the claim attribute data for the respective legal claim comprises data corresponding to a legal claim type for the respective legal claim, a monetary value for the respective legal claim, or combinations thereof. The plurality of computer-executable instructions which, when executed by the computer, may also cause the computer to receive device data for the plurality of legal claims from at least a subset of the plurality of users, wherein the device data for the respective legal claim comprises data corresponding to one or more locations associated with the respective legal claim. The plurality of computer-executable instructions which, when executed by the computer, may further cause the computer to generate a legal claim exchange for a plurality of legal claim units based on the claim attribute data and the device data, wherein a respective legal claim unit corresponds to a contractual right to the respective legal claim available for purchase by the plurality of users.

The above referenced summary section is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description section. The summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter. Furthermore, the claimed subject matter is not limited to implementations that solve any or all disadvantages noted in any part of this disclosure.

BRIEF DESCRIPTION OF THE DRAWINGS

Implementations of various technologies will hereafter be described with reference to the accompanying drawings. It should be understood, however, that the accompanying drawings illustrate only the various implementations described herein and are not meant to limit the scope of various technologies described herein.

FIG. 1 illustrates a system using virtual hubs in accordance with implementations of various techniques described herein.

FIG. 2 illustrates a network configuration in accordance with implementations of various techniques described herein.

FIG. 3 illustrates a user price-time priority queue system in accordance with implementations of various techniques described herein.

FIGS. 4-14 illustrate a user interface of a computing device in accordance with implementations of various techniques described herein.

FIG. 15 illustrates a network configuration in accordance with implementations of various techniques described herein.

FIG. 16 illustrates a flow diagram of a method in accordance with implementations of various techniques described herein.

FIG. 17 illustrates a user interface of a computing device in accordance with implementations of various techniques described herein.

FIG. 18 illustrates a network topology configuration in accordance with implementations of various techniques described herein.

FIGS. 19-27 illustrate the user interface of a computing device in accordance with implementations of various techniques described herein.

FIG. 28 illustrates a check in and security database configuration for a litigation or patent geolocation claim unit multi-layered network node topology for use with participating, transacting and/or trading transformed litigation and patent geolocation units or securities in accordance with implementations of various techniques described herein.

FIG. 29 illustrates a user accounting configuration for a transformed litigation or patent geolocation claim unit or security multi-layered network node topology for use with participating, transacting and/or trading transformed litigation and patent geolocation unit auctions in accordance with implementations of various techniques described herein.

FIG. 30 illustrates a network configuration for a litigation or patent geolocation claim unit multi-layered network node topology.

FIGS. 31-35 illustrate a market configuration in accordance with implementations of various techniques described herein.

FIGS. 36-39 illustrate an accident logging and gaming configuration in accordance with implementations of various techniques described herein.

FIGS. 40 and 41 illustrate a configuration module in accordance with implementations of various techniques described herein.

FIG. 42 illustrates a market configuration module in accordance with implementations of various techniques described herein.

FIG. 43 illustrates a flow diagram of a method in accordance with implementations of various techniques described herein.

FIGS. 44-46 illustrate a configuration module in accordance with implementations of various techniques described herein.

FIG. 47 illustrates a menu options configuration in accordance with implementations of various techniques described herein.

FIGS. 48-50 illustrate a system in accordance with implementations of various techniques described herein.

FIG. 51 illustrates a schematic diagram of a computing system in which the various technologies described herein may be incorporated and practiced.

FIGS. 52-84 illustrate a geolocation exchange unit legal transformation in accordance with implementations of various techniques described herein.

FIGS. 85-88 illustrate a flow diagram of legal transformation steps in accordance with implementations of various techniques described herein.

FIG. 89 illustrates a system in accordance with implementations of various techniques described herein.

FIGS. 90A and 90B illustrate flow diagrams of a method in accordance with implementations of various techniques described herein.

FIG. 91 illustrates a flow diagram of a method in accordance with implementations of various techniques described herein.

FIG. 92 illustrates a system in accordance with implementations of various techniques described herein.

FIGS. 93-106 illustrate a market configuration in accordance with implementations of various techniques described herein.

FIG. 107 illustrate a node ranked search engine in accordance with implementations of various techniques described herein.

FIG. 108 illustrates a schematic diagram of a method and computing system in which the various technologies described herein may be incorporated and practiced.

FIGS. 109A, 109B, 110A, 110B, 111, 112A, 112B, 113A, 113B, 114, and 115 illustrate a system in accordance with implementations of various techniques described herein.

FIG. 116 illustrates a node ranked search engine configuration in accordance with implementations of various techniques described herein.

FIG. 117 illustrates computer system hardware in accordance with implementations of various techniques described herein.

FIG. 118 illustrates a computing system user interface in which the various technologies described herein may be incorporated and practiced.

FIG. 119 illustrates a flow chart for node ranking in accordance with implementations of various techniques described herein.

FIGS. 120A, 120B, 121A, 121B, 122A, 122B, 123A-123C, 124A-124D, 125A-125C, 126A, 126B, 127A, 127B, 128A, 128B, 129A, 129B, 130A, 130B, 131A-131C, 132A, 132B, 133A, 133B, 134A, 134B, and 135 illustrate a ranking formulation configuration in accordance with implementations of various techniques described herein.

FIGS. 136-138 illustrates implant, ingestion, chemical composition data in which the various technologies described herein may be incorporated and practiced.

FIG. 139 illustrates an ingestion and evaluation sequence configuration in accordance with implementations of various techniques described herein.

FIG. 140 illustrates a node ranking flow chart for chemical or food ingestion in accordance with implementations of various techniques described herein.

FIGS. 141-148 illustrate a computing system user interface in which the various technologies described herein may be incorporated and practiced.

FIG. 149 illustrates a positron emission tomography output in accordance with implementations of various techniques described herein.

FIG. 150 illustrates a low density lipoprotein (LDL) cholesterol output in accordance with implementations of various techniques described herein.

FIGS. 151A and 151B illustrate a ranking formulation configuration in accordance with implementations of various techniques described herein.

FIG. 152 illustrates a node ranking flow chart for biomarker or accident discovery data in accordance with implementations of various techniques described herein.

FIG. 153 illustrates a user profile iteration interface to biomarkers in which the various technologies described herein may be incorporated and practiced.

FIG. 154 illustrates a flow chart for claim payouts in which the various technologies described herein may be incorporated and practiced.

FIG. 155 illustrates a user profile iteration interface to biomarker and location data in which the various technologies described herein may be incorporated and practiced.

FIG. 156 illustrates a flow chart for claim and insurance payouts in which the various technologies described herein may be incorporated and practiced.

FIG. 157 illustrates a plurality of data sources in which the various technologies described herein may be incorporated and practiced.

FIG. 158 illustrates claim ranking from a plurality of objective functions in which the various technologies described herein may be incorporated and practiced.

FIG. 159 illustrates claim ranking from a plurality of objective function vectors in which the various technologies described herein may be incorporated and practiced.

FIG. 160 illustrates automated claim generation algorithms and functions for the portable multifunction device in which the various technologies described herein may be incorporated and practiced.

FIG. 161 illustrates a schematic diagram of a computing system in which the various technologies described herein may be incorporated and practiced.

DETAILED DESCRIPTION

The discussion below is directed to certain specific implementations. It is to be understood that the discussion below is only for the purpose of enabling a person with ordinary skill in the art to make and use any subject matter defined now or later by the patent “claims” found in any issued patent herein. In other instances, well-known methods, procedures, components, circuits, and networks have not been described in detail so as not to unnecessarily obscure aspects of the embodiments.

It will also be understood that, although certain elements of the invention and subject matter will be described in a certain order, the order is not intended to be limiting to the invention as many steps may be performed in a plurality of configurations to accomplish the invention of using various technologies to participate, trade, and transact litigation or patent geolocation claim units as a physical or financial forward commodity, security, swap, option, future, or forward. It will be further understood that the terms “comprises” or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the description of the invention, the singular forms “a,” “an,” and “the” are intended to also include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that the term “and/or” as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

As used herein, the term “if” may be construed to mean “when” or “upon” or “in response to determining” or “in response to detecting,” depending on the context. Similarly, the phrase “if it is determined” or “if [a stated condition or event] is detected” may be construed to mean “upon determining” or “in response to determining” or “upon detecting [the stated condition or event]” or “in response to detecting [the stated condition or event],” depending on the context.

A computing device, as described herein, may include any computing implementation known to those skilled in the art, including mobile computing devices. In some implementations, a fixed stationary computing device, a virtual reality headset, a mixed reality headset, an augmented reality headset, or an audio interfaced computer device may be used instead. In another implementation, the computing device may be used in conjunction with a projection computing device. The computing device may be used with or include any device which communicates and integrates the use of: a network, community route processor, my route processor, sequence route processor, global positioning system (GPS) network, biomarker node ranked instructions, routing algorithms based on dynamic market inputs, servers, forward commodity forward market auction database, security or derivative market auction database, grouping software instructions for hubs, securitization transformations and specifications, accident location servers, game servers, indexing algorithms for litigation and patent geolocation unit securities, forwards, futures, options, swaps, derivatives with various locations, navigation servers, routing sequence algorithms, virtual hub topology methods and systems, transparent open access user interface pricing systems with price time priority queues, blockchain data chains over claims, facial recognition, retina scan recognition, fingerprint recognition or photo recognition of users for security and identity check, and/or algorithms for biomarker, accident or other claim blockchain node ranking and constraints. A computing device, as described herein, may utilize a user interface (e.g., a graphical user interface) formatted on mobile or stationary computing devices over various mediums. Such devices may be connected through a network for the purpose of grouping users into virtual hub sequences of community or social network claim objects as a gateway to participating, transacting, and/or trading litigation and patent geolocation units between combinations of virtual hubs as a forward commodity, security, or derivative in an auction.

Various implementations directed to price time priority queue routing for transportation capacity units will now be described in the following paragraphs with reference to FIGS. 1-160.

FIG. 1 illustrates a system using virtual hubs in accordance with implementations of various techniques described herein. In one implementation as illustrated in FIG. 1, a user 110 may be assigned or may join a virtual legal claim social network community 101, 103 of a litigation and patent geolocation unit, where the claim community 101, 103 is a sequence of one or more virtual hubs or a legal claim of pool of claims. The virtual hub sequence may be assigned a metadata tag 102, such as #MSP_AutoClaim, which may be a shortened name for a longer, full name sequence, such as Medicare Secondary Payer Auto Claim no-fault. The virtual route claim community 101, 103 may include an origin virtual hub 105, which may be a specific address and/or geolocation data. As shown in FIG. 1, the origin virtual hub 105 may be in the city of Ithaca, N.Y. A geolocation exchange unit may encompass the litigation and patent geolocation unit described herein, and those skilled in the art will understand that one or more of the implementations described herein may be applied to the geolocation exchange unit.

As shown in FIG. 1, a route 119 may be disposed between the Ithaca, N.Y. virtual hub 105 and the New York City, N.Y. virtual hub 113, where the route 119 may be a sequence of one or two or more virtual hubs in multi-mode dimension space. As also shown in FIG. 1, one or more trucks 118, cars 117, additional trucks 116, and/or additional cars 114 may be headed in a certain direction along the route 119. Additional vehicles 106, 107, 108, 109, 104, 111 may be headed in the other direction along the route 119 between the two virtual hub points 105, 113. One or more additional users 112 may also join the virtual hub route sequence community 103. In another implementation, the user 110 may be assigned or may join a virtual route community 121, 123, 141, 143, where the virtual route community may be a sequence of one or more virtual hubs in multiple modes or dimensions.

In one implementation, litigation claims and/or patent claim units 101 may be transformed towards forward, future, option, securities, international swap, and derivative agreement configurations using one or more formulas and legal transformations. In some implementations, the formulas may be used to calculate replacement value contracts associated with the litigation or patent claim geolocation units 101. In such implementations, the litigation or patent geolocation claim units 101 may be configured as firm or non-firm legal contracts, where the contracts may be utilized with the one or more formulas. In particular, the one or more formulas may be used to determine liquidated damages, replacement contract values, termination replacement price, termination replacement transactions, termination payments, interest rates, interest discount rates, option premiums, force majeure, early termination dates, and/or default dates.

In a further implementation, a virtual hub sequence, such as route 119 between the Ithaca, N.Y. virtual hub 105 and the New York City, N.Y. virtual hub 113, may be transformed into one or more claim community objects, where the community objects may be assigned a plurality of attributes. The community objects having attributes may be similar to the use of class and class objects having methods in object-oriented programming (e.g., Java). Similar to the use of data transformations in computing languages, the data transformation of a virtual hub sequence into a community object may facilitate communication in an organized manner using modular logic. In some implementations, virtual hub sequences, such as route 119 between virtual hub 105 and virtual hub 113, may be combined with other virtual hub sequences to extend the series sequence.

The attributes of communities and associated legal and calculation transformations may allow for superior communication, accountability, and transactions to occur using a community litigation or patent geolocation claim unit object (i.e., unit 101). In some implementations, the data transformation of a virtual hub sequence community object may allow for a plurality of network members 110, 112 to be assigned to virtual route communities 103 based on a plurality of attributes, prior GPS location histories, claim attributes, insurance attributes, navigation search queries, and/or other attributes. Virtual hub sequences which have been transformed into community objects may provide greater communication and organizational ability for a market in order to transact litigation and patent geolocation claim units and to provide a gateway for litigation and patent geolocation claim unit transactions, as described in U.S. patent application Ser. No. 15/266,326, “Implementations of a Computerized Business Transaction Exchange for Various Users,” filed Sep. 15, 2016 and U.S. patent application Ser. No. 15/877,393, “Electronic Forward Market Exchange for Transportation Seats and Capacity in Transportation Spaces and Vehicles,” filed Jan. 23, 2018, the entireties of which are incorporated by reference herein.

In one implementation, as described in U.S. patent application Ser. No. 17/069,597, “Price-Time Priority Queue Routing for Transportation Capacity Units,” filed Oct. 12, 2019, the entirety of which is incorporated by reference herein, a litigation and patent geolocation unit routing and procurement problem may be defined where a depot, crash site, or accident site is considered to be a single node in a litigation and patent geolocation unit topology, a set of K litigation and patent geolocation claim units may be available to purchase, and a set M of geographically dispersed suppliers/markets may be available from which to choose. A discrete demand d_k may be specified for each k∈K, such that, in turn, transportation capacity units can be purchased from a subset M_k ⊆M of suppliers at a price p_ik>0, i∈M_k. Moreover, a product availability q_ik>0 may also be defined for each product k∈K and each supplier i∈M_k. In some implementations, to guarantee the existence of a feasible purchasing plan with respect to the product demand, the condition Σ_i∈Mkq_ik≥d_k,∀k∈K has to hold. In a further implementation, a route sequence may be defined on a complete directed graph G=(V,A) where V:=M∪{0} is the node set and A:={(i,j):i,j∈V, i≠j} is the arc edge set, where i and j may each refer a city or node. A litigation cost, patent cost, or traveling cost c_ij may be associated with each arc (i,j)∈A. In some implementations, each arc may represent a route between two nodes or cities. An arc set may include a collection of arcs (i.e., routes between two nodes or cities). As such, an arc set may represent a multi-stop route.

The above equations may be used to determine a tour G starting and ending at the depot, visiting a subset of suppliers, and deciding how much to purchase for each product from each supplier in order to satisfy the demand at a minimum traveling and purchasing costs. A goal of the routing algorithm may be to satisfy product demands and node visits. In particular, the convenience to visit a supplier of litigation and patent geolocation units may depend on the trade-off between the additional litigation costs, patent costs, or traveling cost of visiting the node and the possible savings obtained in purchasing other litigation or patent geolocation claim units at lower prices. The litigation or patent geolocation claim unit algorithm may have a bi-objective nature, where the minimization of both traveling and purchasing costs may be linearly combined in a single objective function. The bi-objective function nature may make the problem of selecting the optimal suppliers of litigation or patent geolocation claim units more complex. In particular, the litigation cost, patent cost, or traveling cost optimization pushes the purchaser to select only suppliers that are strictly necessary to satisfy product demand, whereas the purchasing cost minimization pushes to select a more convenient and potentially larger set of suppliers. Such suppliers may include, but are not limited to, the following: lawyers, law firms, claim beneficiaries, patent inventors, claim assignees, and/or other types of claim suppliers.

In some implementations, a first classification may be derived using the routing nature on a directed graph, where the cost c_ij may be potentially different from c_ji, thereby granting the potential for asymmetry, as opposed to the symmetric case where c_ij=c_ji. The asymmetric case may be referred to as a directed graph, whereas the symmetric case may be referred to as an undirected graph. Another classification may concern the availability of products at the suppliers. In particular, if the available quantity of a transportation capacity unit product k∈K in a supplier i∈M_k is defined as a finite value q_ik, which may potentially be smaller than product demand d_k, then the routing algorithm case may be restricted. In a further implementation, the unrestricted case may be where the supply of litigation or patent geolocation claim units is unlimited, such that q_ik≥d_k, k∈K, i∈M_k. The unrestricted case may be a special case, as having an unlimited supply of litigation or patent geolocation units may be equivalent to considering d_k=1 and q_ik=1,∀k∈K, ∀i∈M^k.

In another implementation, the litigation or patent geolocation claim unit routing problem may be considered to be NP-hard in the strong sense as a generalization of the incapacitated facility location problem. In some implementations, the proof may correspond to the following reductions to the generalized case where each supplier offers a product that cannot be purchased elsewhere, each transportation or capacity unit is distinct, and each node corresponds to a supplier and each customer to a litigation and patent geolocation unit, M_k=M for all k∈K,p_ik is the cost of serving customer k from node i, and

$c_{ij}:=\frac{b_i+b_j}{2},$

∀(i,j)∈A with b_i the cost of opening node i. In particular, each destination node may be arrived at from only one origin node, such that the path must be unique. Subsequent paths to a new node must also adhere to this principle. Accordingly, the overall path sequence between all nodes must be exactly one route sequence. There may be only one line path connecting all the nodes, as opposed to multiple paths between the nodes. As such, the portfolio route distance and litigation, patent, or traveling costs of moving that claim object have been minimized, and the cost of movement of the litigation or patent geolocation exchange unit (as further explained below) has been minimized.

In some implementations, some special cases of the litigation or patent geolocation claim unit routing may be solved trivially. One such special case may be the trivial litigation, patent, or traveling cost case. For the trivial traveling case, if traveling costs are null (or negligible such as in the virtual transportation or virtual video case), then an optimal unrestricted supply solution can be found by purchasing each product or litigation and patent geolocation unit from the cheapest supplier, since any tour connecting these suppliers is optimal. In some implementations of the trivial traveling case, for the restricted case, the suppliers may be sorted in non-decreasing order or price for each product k. Then, the optimal solution may be found by purchasing for each k, from its cheapest suppliers, the minimum between the available quantity and the residual demand. Another special case may be the one supplier case. For the one supplier case, if a supplier sells all the products of litigation and patent geolocation units at the lowest price, then only this supplier will be part of the optimal tour. In some implementations of the one supplier case, the restricted litigation or patent geolocation claim unit routing problem remains true if, for each product, the quantity available in that supplier is sufficient to satisfy demand. In particular, the supply must be at least equal to demand, or the path route may not otherwise exist.

In some implementations, the problem of feasibility may be checked polinomially just by inspecting of the input data. In particular, the problem may be checked using all of the variables. In a further implementation, if a product is not available at any supplier, then no solution may exist for the unrestricted litigation and patent geolocation unit routing problem. Similarly, for the restricted litigation and patent geolocation unit routing problem, the infeasibility may occur if there exists a product k such that E_i∈Mkq_ik<d_k. Litigation and patent geolocation units may represent any claim where associated market litigation or patent geolocation claim unit market structure transformations have occurred. In particular, the market structure queues or price time priority queues for transformed litigation or patent geolocation claim units with special configurations mentioned above may be incorporated via industrial and generic communication networks. Such infrastructures may include one or more local area networks collecting traffic of user nodes at the switching centers and of a backbone network that routes high volume traffic among switching centers. Because of reliability and self-healing properties, an optimized network structure may use a ring architecture for the backbone and a star architecture for the local area networks. In some implementations, the litigation and patent geolocation unit routing problem may be to determine a tour on the ring backbone on a subset of the network virtual nodes and connect the remaining nodes to the others in the tour, minimizing the overall connection cost or litigation cost. In such implementations, the problem may be referred to as the ring-star problem, where the graph nodes may correspond to both the suppliers and the set of litigation and patent geolocation units.

In a further implementation, for a Miller Tucker-Zemlin formulation, the node stops (i.e., virtual hubs) may be assigned to index values 1 through n. For such a formulation, the path variable x_ij may equal 1 as the path goes from node i to node j and may equal 0 otherwise. In some implementations, for i=1, . . . , u_i may represent a dummy variable, and c_ij may represent the distance between node i and node j. Further, with the aforementioned assumptions, the litigation or patent geolocation claim unit routing problem may be written as the combination of formulations. In some embodiments, a first set of inequalities may require that each node has been arrived at from exactly one other node, and a second set of inequalities may require that, from each node, there is a departure to exactly one other node. The Miller Tucker-Zemlin formulation may represent a general case upon which more specific, modified cases over new dimensions may be built.

One or more constraints may enforce that there is only one single tour covering all nodes and not two or more disjointed tours that only collectively cover all nodes. To prove this, it may be shown that: (1) every feasible solution may contain only one closed sequence of nodes, and (2) that for every tour covering all nodes, that there may be values for the dummy variables u_i that satisfy the constraints. To prove that every feasible solution may contain only one closed sequence of nodes, it may be demonstrated that every subtour in a feasible solution passes through node 1 (noting that the equalities may ensure there can only be one such tour). For if we sum all the inequalities corresponding to x_ij=1 for any subtour of k steps not passing through node 1, we may obtain: n k≤(n−1)k, which may represent a contradiction. Thus, for every single tour covering all nodes, there may be values for the dummy variables u_i that satisfy the constraints. Without loss of generality, the tour may be defined as originating (and ending) at node 1. In some implementations, it may be determined that u_i=t if node i is visited in step t (i, t=1, 2, . . . , n). Accordingly, it may be determined that u_i−u_j≤n−1, since u_i can be no greater than n and u_j can be no less than 1. Hence, the constraints may be satisfied whenever x_ij=0. In some implementations, for x_ij=1, we may derive the following: u_i−u_j+nx_ij=(t)−(t+1)+n=n−1, which may satisfy the constraint.

In an additional implementation, the #MSP_OpioidClaim 122 may link a litigation claim for a Medicare Secondary Payer opioid claim as a social network object, which may link price time priority queues to trade the litigation and patent claim geolocation units 101, 121, 141. The vehicle data 138, 137, 136, 134, 126, 127, 128, 129, 130, 131 may be used to ascertain the various positions, speeds, or other relevant data of vehicles to form the basis of a crash or accident report linked to the claim object 121.

In an additional implementation, the #CDMA_Wireless 142 patent claim object may also ascertain various position data and use data to verify infringement of certain devices for the respective claim object 141, which may then form the basis of a blockchain of data associated with the claim. Such data which may influence the value of the claim on the price-time priority queue exchange and database server 161. The patent and litigation claim objects 101, 121, 141 may have a plurality of basis claim types, such as, but not limited to, commercial, breach of contract, breach of warranty, libel, slander, nuisance, personal injury, product liability, bad debt, professional malpractice, property damage, patent claims, class action claims, tort claims, equitable claims, and/or other theory legal claims 161. The claim objects 101, 121, 141 may be stored on the server 163, processed with instructions in memory 164, and then sent over a network 160.

FIG. 2 illustrates a network configuration 200 in accordance with implementations of various techniques described herein. As shown, the configuration 200 may include a network of virtual location and claim hubs 201, 203, 205, 207, 212, 225, where each network may represent a virtual claim jurisdiction network of a neighborhood, village, city, county, state, country, continent, or inter-virtual hub networks across geographies. Methods and/or data transformations, as described herein, may be used to transform navigation claim routes 202, which are a virtual hub sequence, between a series of virtual claim hubs 201 and 203, 203 and 212, or multi-leg or multi-modal combinations such as 201 to 203 and 203 to 212. The network configuration 200 may be implemented using one or more computing systems composed of one or more computing devices.

In some implementations, one or more users 213 of the network 214 may input hundreds, thousands, millions, or more of virtual hubs, thereby forming a network topology for litigation or patent claim geolocation unit virtual hub sequences 241. The litigation or patent claim geolocation unit data transformation to a series of virtual litigation or patent claim geolocation unit hubs 245, 253 may allow for network structures 201, 203, 212, 205, 207, 225, 212 to be developed. Further, the structures may be organized in a hub and spoke model or ring and star model, where these models are known to those skilled in the art. Further, using virtual litigation or patent claim geolocation unit hub topologies 241 over road structures 259 may allow for the benefits of data which speeds the process of claims and the basis for claim formation.

In some implementations, once the virtual litigation or patent claim geolocation unit hub networks 201, 203, 212, 205, 207, 225, 212 have been input into the network 214, the community claim processor 217 may transform subsections of the topology of the litigation or patent claim geolocation unit networks 201, 203, 212, 205, 207, 225, 212 into a virtual hub sequence 241. The virtual hub sequence 241 may represent two addresses 245, 253 for the route 259, such as Palo Alto, Calif. 245 to San Francisco, Calif. 253. In particular, each virtual hub address 245, 253 may correspond with a physical address. Virtual litigation or patent claim geolocation unit communities 243 may be one to one, one to two, one to many, and/or any superset or subset combination thereof.

The community claim processor 217 may further process virtual hub combination and virtual litigation or patent claim geolocation unit hub sequences into a specific network member's account on the network member database server 222. The sequence claim processor 221 may be used to connect a plurality of virtual hub sequences 201, 203, 205, 207 in a logical order to complete a path combination 201 to 207 for navigation or community object construction. In some implementations, litigation or patent claim geolocation unit community objects may be derived from simple direct path routes 202 between two virtual hubs 201 and 203, may be derived from multi-virtual hub constructions between two virtual hub sequences 201 to 207 by waypoints of 201 to 203 to 212 to 207, or any combination or superset or subset thereof.

In a further implementation, the virtual community 243 may allow attributes to be assigned to the community objects. In particular, users may be assigned to a plurality or litigation or patent claim geolocation unit community virtual hub sequence objects 241. In some implementations, a network member 213 may be assigned to a virtual community 241 because the user's route history on the GPS satellite network 215 suggests the route has overlap with virtual hub route sequences that the user has used or queried on various search methods on the system. In another implementation, the user 213 may use a CPU client 290 with the network 226 of navigation route communities 243, where the CPU client 290 may include a visual interface, an audio interface, and/or any other type of computing interface known to those skilled in the art. In some embodiments virtual communities 241 may be transformed data structures that form objects to which community users 213 may subscribe, friend, join, or follow to receive information regarding litigation or patent claim geolocation unit transactions, as described in U.S. patent application Ser. No. 15/877,393, “Electronic Forward Market Exchange for Transportation Seats and Capacity in Transportation Spaces and Vehicles,” filed Jan. 23, 2018, the entirety of which is incorporated by reference herein.

FIG. 3 illustrates a user price-time priority queue system 300 in accordance with implementations of various techniques described herein. In particular, the user price-time priority queue system 300 may be used for: transacting or matching transformed litigation or patent geolocation claim unit data; participating, transacting, and/or trading litigation or patent geolocation claim units; representing the transformed litigation or patent claim geolocation unit value as a homogeneous asset specification; and/or representing litigation or patent claim geolocation units as a physical forward commodity or security, swap, option, forward, and/or future between combinations of virtual hubs over various litigation or patent claim geolocation unit modes. In some implementations, one or more user transformed litigation or patent claim geolocation units and/or one or more transformed litigation or patent claim geolocation unit units may be associated with litigation or patent claim geolocation unit community objects and routing sequences in the system 300.

The system 300 may include one or more of the following instructions, transformations, and/or elements, as shown in FIG. 3. As is known to those skilled in the art, different values than those shown in FIG. 3 may be used. In particular, the system 300 may include: transformed litigation or patent claim geolocation unit price-time priority sell queue 320; transformed litigation or patent claim geolocation unit price-time priority buy queue 321; transformed litigation or patent claim geolocation unit price priority bucket 305 in the litigation or patent claim geolocation unit buy queue of $5.10; transformed litigation or patent claim geolocation unit price priority bucket 306 in the litigation or patent claim geolocation unit buy queue of $5.30; transformed litigation or patent claim geolocation unit price priority bucket 310 in the litigation or patent claim geolocation unit buy queue of $5.60; transformed litigation or patent claim geolocation unit price priority bucket 314 in the litigation or patent claim geolocation unit sell queue of $5.70; transformed litigation or patent claim geolocation unit price priority bucket 315 in the litigation or patent claim geolocation unit sell queue of $5.80; and transformed litigation or patent claim geolocation unit price priority bucket 316 in the litigation or patent claim geolocation unit sell queue of $6.60.

The system 300 may also include one or more of the following: transformed litigation or patent claim geolocation unit price-time priority buy price 304 in the first time position of the price priority bucket 305 of $5.10; transformed litigation or patent claim geolocation unit price-time priority buy price 303 in the second time position of the price priority bucket 305 of $5.10; transformed litigation or patent claim geolocation unit price-time priority buy price 302 in the third time position of the price priority bucket 305 of $5.10; transformed litigation or patent claim geolocation unit price-time priority buy price 307 in the first time position of the price priority bucket 306 of $5.30; transformed litigation or patent claim geolocation unit price-time priority buy price 309 in the first time position of the price priority bucket 310 of $5.60; transformed litigation or patent claim geolocation unit price-time priority buy price 308 in the second time position of the price priority bucket 310 of $5.60; transformed litigation or patent claim geolocation unit price-time priority sell price 311 in the first time position of the price priority bucket 314 of $5.70; transformed litigation or patent claim geolocation unit price-time priority sell price 312 in the second time position of the price priority bucket 314 of $5.70; transformed litigation or patent claim geolocation unit price-time priority sell price 313 in the third time position of the price priority bucket 314 of $5.70; transformed litigation or patent claim geolocation unit price-time priority sell price 318 in the first time position of the price priority bucket 315 of $5.80; transformed litigation or patent claim geolocation unit price-time priority sell price 319 in the second time position of the price priority bucket 315 of $5.80; and transformed litigation or patent claim geolocation unit price-time priority sell price 317 in the first time position of the price priority bucket 316 of $6.60.

The system 300 may also include a transformed litigation or patent claim geolocation unit price time priority limit order book (“LOB”) 325, which may be represented by the vector q(t) 301. In particular, the i-th coordinate for i>0, q_i (t), may represent the number of sell limit orders of transformed litigation or patent claim geolocation units that are waiting in the LOB at time t a price iδ (where δ may represent the price unit tick size of the transformed litigation or patent claim geolocation unit). In addition, the number of buy limit orders for transformed litigation or patent claim geolocation units at iδ may be represented with a negative sign q, (t).

Further, the system 300 may also include: a benchmark price 326 of all sell limit orders at time t, which may be computed as s(t)=s(q(t))=min (min {0<iδ: q_i (t)>0}) if q_i (t) is less than or equal to 0 for all i>0, then s (q (t))=infinity; benchmark price 327 of all buy limit orders at time t, which may be computed as b(t)=b(q (t))=max (max {iδ>0: q_i (t)<0}), if q, (t) is greater than or equal to 0 for all i>0, then b(q (t))=negative infinity; order match 328 in the transformed litigation or patent claim geolocation unit limit order book where s(t)=b(t), which may move the method and system to the matched transformed litigation or patent claim geolocation unit limit order confirmation and delivery process; a limit order book status of no order match 329, where s (t)>b(t); if limit order book i-th q_i (t) element 330 of LOB is cancelled, remove from queue; and if i-th qi (t) element is a new transformed litigation or patent claim geolocation unit order 331 in LOB, then insert into respective limit order buy queue 321 or limit order sell queue 320 with priority of price, and then time into the price time priority queues.

In some implementations, the price-time priority queue for transformed litigation or patent claim geolocation units may be assigned to a claim community object 241, where the object 241 may be a waypoint sequence of transformed litigation or patent claim geolocation units. In a further implementation, the price-time priority queue may be assigned to two waypoints as a claim community object 241, or the price-time prior queue may be assigned to a claim community waypoint object sequence of many waypoints 203 to 205 to 207 to 212. The waypoints may have been added together to form one continuous claim community object 241 and respective price-time priority queue for transformed litigation or patent claim geolocation units through processing instructions from the community claim processor 217 and sequence claim processor 221, where the processors may be configured to communicate via the networks 226, 214, and 215. In another implementation, the limit order book 301 vector may be assigned to a specific date and time for the claim community waypoint object which is a forward market price for transformed litigation or patent claim geolocation unit(s) and claim community waypoint object(s) 241. In particular, the value of a route or the value of the path may be assigned between two nodes using the organizing method of the price time priority queue. The benefit of this method is the assignment of a market mechanism to efficiently allocate and organize buyers and sellers across the optimization sequence of both a single claim route between two nodes and also the portfolio path of an entire arc set. The objects may also have legal transformations to securitize or unitize the object, such that it may be traded on exchange with cost of cover, replacement value, liquidated damages, and default remedy calculations that are required to securitize an object.

In a further implementation, a specific transformed litigation or patent claim geolocation unit price-time priority queue limit buy order 304, with a specific price stamp bucket 305 of $5.10, may be cancelled. If the order 304 is cancelled, then the price-time priority limit order book buy queue price at position 303 moves to the higher price-time priority queue position of 304, and price-time priority price of position 302 moves to position 303. Similarly, in a further implementation, the price-time priority limit order sell price 319 of price-time priority bucket price 315 of $5.80 may be cancelled. If price-time priority of the transformed litigation or patent claim geolocation unit is cancelled, then order 317 moves to a higher position in the overall transformed transportation queue 320, even though the limit order book price 317 may remain in the price bucket of position 316 at $6.60.

In another implementation, price-time priority insertion may occur where a new order may be inserted into either the transformed litigation or patent claim geolocation unit buy queue 320 or transformed litigation or patent claim geolocation unit sell queue 321. For example, a new price-time limit order for a transformed litigation or patent claim geolocation unit may be inserted as a sell order at a price of $5.70 at position 313, which would then assume order 312 was also at a price of $5.70 and that order 312 was placed with a time that was before order 313 was placed. In the aforementioned example of the price-time order insertion of 313, price-time orders of 319, 318, and 317 may have moved lower in their relative position, even though they remain in distinctly different price buckets of 315 and 316, respectively. With regard to the price-time priority queue for transformed litigation or patent claim geolocation units, price is first priority, followed by timestamp.

In some implementations, the lowest selling price s(t) 326 may equal the highest buying price b(t) 327. In such an implementation, the highest transformed litigation or patent claim geolocation unit buy queue price bucket 310 may be equal to the lowest transformed litigation or patent claim geolocation unit sell queue 320 selling bucket price 314. In the example of the limit order book 301, the highest transformed unit buy price 310 of $5.60 may be lower than the lowest litigation or patent claim geolocation unit sell queue 320 lowest selling bucket 314 of $3.70. As such, no match may occur because s(t)>b(t) (see box 329). In some implementations, one or more order insertions 331 or order cancellations 330 may occur for transformed litigation or patent claim geolocation units from the claim forward market database server 271 associated with community objects, where the objects may be a series of waypoints 241. The claim forward market database server 271 may also be referred to herein as a litigation or patent geolocation unit forward market or security market database server 271.

In another implementation, the LOB 325 for transformed litigation or patent claim geolocation units may contain many different types of instruction structures and specifications, such as limit orders, market orders, market if touched orders, snap market orders, snap mid orders, snap to primary orders, peg to benchmark orders, or adaptive custom orders. Adaptive custom orders may be custom, customer-designed instructions, as known to those skilled in the art. In some implementations, the LOB 325 for transformed litigation or patent claim geolocation units may also contain instructions for order times, such as good for the day, good till cancelled, immediate or cancel, good till date, day till cancelled, or a plurality of additional custom instructions for the timing of the order of the transformed litigation or patent claim geolocation unit in the LOB 325. In a further implementation, a plurality of additional instructions and specifications may also be unique to each transformed litigation or patent claim geolocation unit in the LOB 325, such as automobile mode, air mode, autonomous vehicle mode, bike mode, boat mode, bus mode, drone mode, limo mode, motorcycle mode, moped mode, shuttle mode, spaceship mode, subway mode, taxi mode, train mode, and fastest optimized mode. Fastest optimized mode may combine many modes or a single mode for a waypoint claim community object 241 or waypoint claim community sequence (e.g., 201 to 203 to 205 to 212 to 207) of many claim communities 241.

In another implementation, the LOB 325 may be assigned to transformed litigation or patent claim geolocation unit packages that have associated claim community objects 241. In such an implementation, the LOB 325 for transformed litigation or patent claim geolocation units may be assigned to cargo, such as a trailer of a rig, a container of a boat, a container on a truck, or any type of cargo that takes up the space of a transformed litigation or patent claim geolocation unit. In a further implementation, the LOB 325 may be assigned to a virtual transformed litigation or patent claim geolocation unit, which may represent claims along a packet moving medium, such as a telecommunications pipeline, satellite telecommunications, and/or wireless telecommunications that move packets of data, where the packets correspond to transformed litigation or patent claim geolocation units.

In another implementation, the LOB 325 may have other configurations and ordering algorithms in the open architecture auction method and system as unitized and as described in U.S. patent application Ser. No. 15/266,326, “Implementations of a Computerized Business Transaction Exchange for Various Users,” filed Sep. 15, 2016, the entirety of which is incorporated by reference herein.

FIG. 4 illustrates a user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for participating, transacting, and/or trading transformed litigation or patent claim geolocation unit as a commodity or security between combinations of virtual hubs over various transportation modes. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, the user interface 210 may also hereinafter be referred to as a graphical user interface (GUI) 210. In addition, the term button as used herein may refer to either physical or displayed virtual buttons on the mobile computing device. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: a virtual hub combination 411; a virtual hub origin/from location 410 with users 412 within the virtual hub location 410; and a claim specification summary of the market, level of service, claim data blockchain of claim associations and court proceedings and time of delivery commencement 427. For example, as shown in FIG. 4, the user interface 210 may display an international virtual market hub combination market, such as within London as a claim against National Health Service as the health provider.

The user interface may also display and/or include one or more of the following elements: a mode of claim type 430; a transaction summary of the last trade auction quantity and price 428 in the local currency or another currency set by the user 110; a virtual hub destination/to location 422 and a user to whom the litigation and patent geolocation unit 423 is being delivered; a bid/buy quantity title header 415 for an exemplary virtual litigation or patent geolocation claim unit hub market; a bid/buy price title header 416 for an exemplary virtual litigation or patent geolocation unit hub market; an offer/sell price title header 419 for an exemplary virtual litigation or patent geolocation unit hub market; and an offer/sell quantity title header 426 for an exemplary virtual litigation or patent geolocation unit hub market.

The user interface may also display and/or include one or more of the following elements: a bid/buy quantity 414 for the best bid quantity from a plurality of users 110 for a litigation or patent geolocation unit virtual hub combination that has undergone a plurality of data transformations according to one or more implementations described herein; a bid/buy quantity 413 for the second-best bid quantity from the plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations according to one or more implementations described herein; a bid/buy price 418 for the best bid price from the plurality of users 110 for a litigation or patent geolocation unit virtual hub combination that has undergone a plurality of data transformations according to one or more implementations described herein; and a bid/buy price 417 for the second-best bid price from the plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations according to one or more implementations described herein.

In addition, the user interface may display and/or include one or more of the following elements: an offer/sell price 421 for the best offer price from the plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations according to one or more implementations described herein; an offer/sell price 420 for the second-best offer price from the plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations according to one or more implementations described herein; an offer/sell quantity 425 for the best offer quantity from the plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations according to one or more implementations described herein; an offer/sell quantity 424 for the second-best offer quantity from the plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations according to one or more implementations described herein; a safety dispatch “911” button 429 to enact video and audio recording of the user's 110 environment and dispatch of that information to authorities; and a hamburger menu button 270 to move back to menu options and settings away from the participation, transaction, trading displayed in the user interface 210.

In some implementations, a user 110 may enter a transaction quantity and price for a transformed litigation and patent geolocation unit securities in order to participate, transact and/or trade via the GUI 210, where the GUI 210 may detect the user's 110 contact with a displayed bid/buy price 418 or offer/sell price 421. The GUI 210 may detect the user's 110 contact with any of the GUI 210 buttons mentioned above. The GUI 210 may also detect user contact with any of the GUI's 210 display and/or buttons 418, 417, 420, 421 or may communicate with the user 110 via a voice interface.

Upon user contact with the display and/or buttons on the GUI 210, instructions may be instantiated which allow the user 110 to change the specifications of the virtual litigation or patent geolocation unit hub combination 411. A plurality of prices and markets may be presented based on a plurality of litigation or patent geolocation unit contract specifications. In some implementations, the best bid/buy price 418 may be moving up in price or down in price depending on the market conditions at any given time. The last auction trade or last transacted price for a given specification may be listed to inform the user 110 as to how the market is moving, which may allow the user 110 to submit a competitive offer/selling price 421 or bid/buying price 414. In some implementations, users 110 may adjust settings of the GUI 210 to show more bid/buying prices 417 or more offer/selling prices 420. The matrix of market quantities and prices 413, 414, 415, 416, 417, 418, 419, 420, 421, 424, 425, 426 displayed in the GUI 210 may be referred to as market depth. In a further implementation, the number of users 110 may be displayed as user icons 412 or 423 for the people logged who desire to transact, trade, or participate in a given virtual hub 410 to virtual hub 422 combination auction. Users 110 may select the litigation or patent geolocation unit mode 430, such that the GUI 210 displays a market for one form of transformed litigation or patent geolocation unit as a commodity or security. In a further implementation, the GUI 210 may show multiple forms of transformed litigation or patent geolocation unit between virtual transportation capacity hubs 410, 422.

In some implementations, the user 110 may select the 911 display and/or button 429, which may activate voice and video recording functions on the mobile computing device and transmit the data with a confirmation from the user 110 to the authorities to provide enhanced security while participating, transacting, or trading forward transformed litigation or patent geolocation units as a commodity or security. The user may toggle between the GUI 210 market view screen in FIG. 4 and other menu 270 options and settings by the user 110 selecting the hamburger button 270, with the mobile computing device detecting the user 110 input or contact on the GUI 210. In some implementations, the mobile computing device may instantiate instructions in its memory, and the device may transmit litigation and patent geolocation data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the litigation or patent geolocation unit forward market or security market database server 271, virtual hub database server 223, network member database server 222, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. These elements may interface together to make a system configured to deliver litigation and patent geolocation units to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of litigation or patent geolocation unit specifications 427 at specific market prices.

FIG. 5 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for listing timing litigation or patent geolocation unit specifications 510 on a portable multifunction device (e.g., a mobile computing device). Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: origin/from virtual hub timing or securitization timing of cash flows on the claim (a data transformation) 510; specification of quality of litigation or patent geolocation unit capacity and associated claim case data blockchain (a data transformation) or type such as physical or financial 520; destination/to virtual hub (a data transformation) 530; setting button 540 to transmit the timings 510 and quality and type specification grade 520 (a data transformation); and hamburger button 270 to instruct the GUI 210 to take the user 110 to the menu screen.

In some implementations, the user 110 may select a plurality of timing options in the timing selection litigation or patent geolocation unit specification 510. The timing specification constraint may be the time at which the transformed litigation and patent geolocation unit security cash flows start from the origin/from litigation or patent geolocation unit virtual hub 510. As in any commodity or security market, if a user 110 is late or defaults on the obligation and they have purchased the litigation or patent geolocation unit, the user must still pay for the litigation and patent geolocation unit, regardless of whether the user 110 is present at the time of departure or not. The user may sell back the litigation or patent geolocation unit if they know they will be late, which may allow the user to sell back the litigation and patent geolocation unit to the market at the then-current price to reverse their obligation. In one example, though not limited to this example, if a user 110 bought a transformed litigation or patent geolocation unit security for £9.90 (as shown at 421 in FIG. 4) and the user 110 realizes they need to adjust their obligation for the 8 AM cash flow or other claim specification 427, then the user 110 may either pay for the litigation or patent claim geolocation unit, even though the user 110 was present and did not take delivery of the litigation or patent claim geolocation unit security, or the user 110 may preemptively sell back the litigation or patent geolocation unit security for forward to the market at the then-current bid price 418. The user 110 would then have offset their obligation in a timely manner and another user 110 on the network 214, 226 may then purchase the available litigation and patent geolocation unit security. By eliminating the initial obligation and by creating an offset obligation, additional data transformation concepts, such as cost of cover, liquidated damages, or force majeure, may be avoided. In some implementations, virtual litigation or patent geolocation unit hub combination units may or may not have the available liquidity if the user 110 were to wait too long before delivery of the transportation capacity unit to make an adjustment. Therefore, the user 110 may need to take delivery even if they are not present.

In some implementations, the user 110 may select a specification 520 for a litigation or patent geolocation unit that is in various stages of processing, a specification for financial swaps and options, or a specification for physical swaps and options of litigation or patent geolocation claim units. For example, a plurality of specification grades may exist, such as “premium,” which may be defined by certain classes of litigation or patent geolocation unit. Such a specification grade may correspond to certain quality levels and/or may correspond to various trial, appellate, state supreme, circuit court, and/or supreme court verdicts. Similarly, for example, a plurality of specification grades may exist, such as “intermediate” or “basic,” which may be defined by certain classes of litigation and patent geolocation unit securities, certain quality levels, and/or lower court precedents. Specification claim levels may also be associated with rating levels, such as for bonds that may correspond to various interest rates for risk versus return considerations for the investors. Such rating levels may include AAA, AA, A, BBB, BB, B, and/or a plurality of high yield ratings.

In some implementations, the user 110 may select the destination/to virtual hub 530 to change the virtual hub combination. In another implementation, the user 110 may contact the “set” button 540 to transmit the transformed litigation or patent geolocation unit security specification data by using the GUI 210. In such an implementation, the mobile computing device may instantiate instructions in its memory, and the mobile computing device may then transmit transportation capacity data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on litigation or patent geolocation unit market database server 217 for forwards, futures, bonds, asset backed securities, index securities, securities, swaps, and/or other derivatives, virtual hub database server 223, network member database server 222, map routing servers, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. The elements may interface together to make a system configured to deliver transformed litigation or patent geolocation unit securities to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.

FIG. 6 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for selecting the term transformation specification 610 on a portable multifunction device (e.g., a mobile computing device). Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: term claim specification options 610 (a data transformation); specification 620 of quality or type, such as financial or physical of litigation and patent geolocation (a data transformation); jurisdiction virtual hub 630 (a data transformation); setting button 640 to transmit the term 610 and quality specification grade 620 (a data transformation); calendar button 650 to select specification start dates and end dates for a plurality of virtual litigation or patent geolocation unit hub combinations (a data transformation); and hamburger button 270 to instruct the GUI 210 to take the user 110 to the menu screen.

The term specification options 610 may be used to participate, transact, and/or trade in a specific litigation or patent geolocation unit virtual hub combination for a specific time period specification. In some implementations, the term 610 may refer to the term structure of the securitized cash flows or simply payment terms in other use cases. Users 110 may set the term to daily, weekly, monthly, annual, weekdays, weekends, specific days, or any combination of term selections. For example, the user 110 may select “weekdays” from among the term specification options 610 during a specific calendar time period of a given year, which may be selected using the calendar button 650. In particular, specific time start dates and end dates may be set by the user with the calendar button 650. For example, a user 110 may select “Mondays” within a specification date window (a data transformation). In another example, the user 110 may select “weekends” during a specification calendar window of dates (a data transformation).

The user 110 may contact the “set” button 640 to transmit the transformed litigation and patent geolocation unit specification data by using the GUI 210. The mobile computing device may instantiate instructions in its memory, and the device may then transmit litigation or patent geolocation unit data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the litigation or patent geolocation unit forward market or security market database server 271, virtual hub database server 223, network member database server 222, map routing servers, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. These elements may interface together to make a system configured to deliver litigation or patent geolocation units to users 110 with reference to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.

FIG. 7 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for selecting order time in force order types 710 (a data transformation) and order types 720 (a data transformation) on a portable multifunction device (e.g., a mobile computing device). Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: order time in force specification options 710 (a data transformation); order type specification options 720 (a data transformation); setting button 740 to transmit the order time in force specification 710 and order type specification option 720 (a data transformation); and/or hamburger button 270 to instruct the GUI 210 to take the user 110 to the menu screen.

In some implementations, the user interface 210 may be used by the user 110 to select a plurality of order time in force litigation or patent geolocation unit specifications 710. The order time in force selections 710 may include one or more of the following: day (DAY) order; good till cancelled order (GTC); immediate or cancel order (IOC); good till date order (GTD); and/or day till cancelled order (DTC). Order time in force specifications 710 may be used to designate how long a user 110 order may be valid. In a further implementation, the GUI 210 may display the definitions of a plurality of order time in force specification 710 characteristics so that the user 110 may select the appropriate order time in force specification for a litigation and patent geolocation unit.

In some implementations, the user interface 210 may be used to select the order type specifications 720. The order type selections 720 may include one or more of the following: Limit, Market, Market if Touched (MIT); Snap to Market; Snap to Mid; Snap to Primary; Peg to Benchmark; and/or Adaptive Custom. In a further implementation, the GUI 210 may display the definitions of a plurality of order type specification 720 characteristics so that the user 110 may select the appropriate order type specification 720 for a litigation and patent geolocation unit.

In some implementations, the user 110 may contact the “set” button 740 to transmit the litigation and patent geolocation unit specification data by using the GUI 210. In such an implementation, the mobile computing device may instantiate instructions in its memory, and the mobile computing device 111 may then transmit litigation and patent geolocation data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the litigation or patent geolocation unit forward market and securities market database server 271, virtual hub database server 223, network member database server 222, map routing server, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. These elements may interface together to make a system configured to deliver transformed litigation or patent geolocation unit securities or forwards or derivatives to user(s) 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.

FIG. 8 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for selecting virtual hub litigation or patent geolocation unit modes 810 (a data transformation) on a portable multifunction device (e.g., a mobile computing device). Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: virtual hub litigation or patent geolocation unit modes 810 (a data transformation); setting button 840 to transmit the virtual hub litigation or patent geolocation unit modes 810; and/or the hamburger button 270 to instruct the GUI 210 to take the user 110 to the menu screen.

In some implementations, the user interface 210 may be used by the user 110 to select a plurality of virtual hub transformed litigation or patent geolocation unit modes 810. The virtual hub litigation or patent geolocation unit mode selections 810 may include one or more of the following: virtual 811; air 812; autonomous vehicle 813; bike 814; boat 815; bus 816; drone 817; limo 818; motorcycle 819; moped 820; shuttle 821; spaceship 822; subway 823; taxi 824; train 825; highest rated 826; Medicare/Medicaid 827; packages 828; in person 829; and/or automobile 830. In one such implementation, a selection of a particular virtual hub litigation or patent geolocation unit mode may correspond to a selection by a user 110 for a virtual litigation and patent geolocation unit relating to a mode or location of a claim incident. In another such implementation, the user 110 of a particular virtual hub litigation or patent geolocation unit mode may correspond to a bid on in person 829 or package capacity 828 in any mode or multi-modal of transformed litigation and patent geolocation between a combination of virtual litigation or patent geolocation claim unit hub locations. In some embodiments, the plurality of virtual hubs may be one hub or many hubs as relating to geolocation data for the claim data block chain. The user 110 may use one or more modes of transportation between a combination of virtual litigation or patent geolocation unit points.

In some implementations, the user 110 may contact the “set” button 840 to transmit the transformed litigation and patent geolocation unit specification mode data by using the GUI 210. In such implementations, the mobile computing device may instantiate instructions in its memory, and the mobile computing device 210 may then transmit litigation or patent geolocation unit data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the claim forward market database server 271, virtual hub database server 223, network member database server 222, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. The elements may interface together to make a system configured to deliver transformed litigation and patent geolocation unit securities, forwards, futures, swaps, options, or other derivatives to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.

FIG. 9 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for identifying the distance the user 110 is from the virtual hub litigation or patent geolocation claim unit from a map and distance perspective on a portable multifunction device (e.g., a mobile computing device). Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following: virtual hub litigation or patent geolocation unit pick up or origin display 910; virtual hub litigation or patent geolocation unit pick up or origin address 920; virtual hub litigation or patent geolocation unit drop off or court address 930; virtual hub litigation or patent geolocation unit pick-up or origin target zone 960; virtual hub transportation capacity drop-off or court target zone 950; setting button 940 to transmit the virtual hub litigation or patent geolocation unit addresses 920, 930; and/or hamburger button 270 to instruct the GUI 210 to take the user 110 to the menu screen.

In some implementations, the user interface 210 may be used by the user 110 to select a plurality of virtual hub litigation or patent geolocation unit address specifications 910. The virtual hub litigation and patent geolocation unit address selections 910 may include one or more of the following: virtual hub pick up address 920; and/or virtual hub drop off address 930. The virtual hub litigation or patent geolocation unit addresses 920 and 930 may be changed before delivery of a virtual litigation or patent geolocation unit. The user interface map and address tool 910 may display the user's 110 distance from the address of the virtual litigation or patent geolocation unit hub. Further, the user interface map and address tool 910 may be used as a map to assist the user 110 in finding the location of the virtual litigation or patent geolocation unit hub for litigation or patent claim data due diligence or data gathering. The user interface 210 may also display the virtual hub pick up zone 960 on a map in context to the user's 110 location. In addition, the user interface 210 may display the virtual hub drop off zone 950 on a map in context to the user's 110 location.

In some implementations, the user 110 may contact the “set” button 940 to transmit the litigation or patent geolocation unit specification address data by using the GUI (graphic user interface) 210. In such an implementation, the mobile computing device may instantiate instructions in its memory, and the mobile computing device 210 may then transmit litigation and patent geolocation data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the litigation or patent geolocation unit forward market or securities market database server 271, virtual hub database server 223, network member database server 222, map routing server, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. These elements may interface together to make a system configured to deliver litigation and patent geolocation units to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.

FIG. 10 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for identifying the constraints and no arbitrage settings 1010 that the user 110 selects on a portable multifunction device (e.g., a mobile computing device) (multiple data transformations). Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: constraint and no arbitrage settings 1010 (a data transformation); setting button 1040 to transmit the virtual hub litigation or patent geolocation unit constraints and no arbitrage settings 1010; and/or hamburger button 270 to instruct the GUI 210 to take the user 110 to the menu screen.

In some implementations, the user interface 210 may be used by the user 110 to select a plurality of virtual hub litigation or patent geolocation unit constraints and no arbitrage settings 1010. The virtual hub litigation or patent geolocation unit constraints and no arbitrage selections 1010 may include one or more of the following: cheapest claim by payout node ranking and default risk ranking 1011 (a data transformation); single claim mode by payout node ranking and default risk ranking 1012 (a data transformation); multi-claim mode by payout node ranking and default risk ranking 1013 (a data transformation); fastest claim pay by payout node ranking and default risk ranking 1014 (a data transformation); largest class or mass tort by payout node ranking and default risk ranking 1015 (a data transformation); highest rating by payout node ranking and default risk ranking 1016 (a data transformation); most available by payout node ranking and default risk ranking 1017 (a data transformation); highest volume by payout node ranking and default risk ranking 1018 (a data transformation); most frequent by payout node ranking and default risk ranking 1019 (a data transformation); service level by litigation work proceeding progress by payout node ranking and default risk ranking 1020 (a data transformation); and/or security and safety by payout node ranking and default risk ranking 1021 (a data transformation). In some implementations the claims may also be privately marketing to comply with securities laws with group restrictions 1022.

Selecting the cheapest claim payout setting 1011 may initiate a standard cost minimization linear program (such as in the cloud and/or local CPUs 290), where the program may be used to assist the user 110 in completing the payout node ranking and default risk ranking between two virtual hubs with the lowest claim payout. The claim payouts may have been probability ranked in the database by low risk and low reward claim payout. Selecting the single mode setting 1012 may set a constraint that the user 110 wishes to complete the litigation or patent geolocation unit claim between two virtual hubs with only one mode of claim. Selecting the multi-claim mode setting 1013 may set a constraint that the user 110 wishes to complete the litigation or patent geolocation unit claim between two virtual hubs with more than one mode of claim type. For example, the claim type may correspond to a vehicle type (e.g., truck, boat, or aircraft) and/or a location (e.g., home, work in a workman's compensation claim, and/or the like). Selecting the fastest claim pay setting 1014 may initiate the use of a standard linear programming equation (such as by the cloud and/or local CPUs 290), where the equation may be used to minimize time for the user 110 to receive a claim payout. The claim payout may be ranked by the multi-factor node database for a claim correlation and/or a payout probability rating, such for instances in which the litigation or patent geolocation unit claim between two virtual hubs is to be completed with the shortest time. In addition, the settings 1010 may set instructions for the price-based litigation or patent geolocation unit claim index and GUI presentation on the interface 210.

Selecting the largest class or mass tort setting 1015 may initiate the use of an algorithm (such as by the cloud and/or local CPUs 290) to determine the highest ratings for a litigation or patent geolocation unit claim payout or lowest risk of default in a node ranked ordered list, where the algorithm may be used to assist the user 110 in completing the transformed litigation or patent geolocation unit claim between two virtual hubs with the highest risk or lowest risk rating depending on the user's 110 selection. Selecting the highest rating setting 1016 may initiate the use of a rating algorithm (such as by the cloud and/or local CPUs 290), where the algorithm may be used to assist the user 110 in completing the litigation or patent geolocation unit claim between two virtual hubs with the highest risk or lowest risk rating. Selecting the most available setting 1017 may initiate the use of an algorithm (such as by the cloud and/or local CPUs 290) to search for the litigation or patent geolocation unit claim with the most litigation or patent geolocation unit claims, where the algorithm may be used to assist the user 110 in completing the litigation or patent geolocation unit claim between two virtual hubs with the most available litigation or patent geolocation claim units. Selecting the highest volume setting 1018 may initiate the use of an algorithm (such as by the cloud and/or local CPUs 290), where the algorithm may be used to select the litigation or patent geolocation unit claim with the highest volume of participants to assist the user 110 in completing the transformed litigation or patent geolocation unit claim between two virtual hubs with the largest number of users 110. Selecting the most frequent setting 1019 may initiate the use of a most frequent route analysis (such as by the cloud and/or local CPUs 290) from a timing constraint perspective, where the analysis may be used to assist the user 110 in completing the litigation or patent geolocation unit claim between two virtual hubs with the most frequent number of claims.

Selecting the service level setting 1020 may be used (such as by the cloud and/or local CPUs 290) to align the constraint and to select the service level in order to assist the user 110 in completing the litigation or patent geolocation unit claim between two virtual hubs with the correct level of service. Selecting the security and safety setting 1021 may initiate safety and security algorithms (such as by the cloud and/or local CPUs 290) on the user 110 based on blockchain performance of plaintiffs and defendants, where the algorithms may be used to assist the user 110 in completing the litigation or patent geolocation unit claim between two virtual hubs with the highest level of safety and security. Selecting the group restricted setting 1022 may initiate grouping limitation algorithms (such as by the cloud and/or local CPUs 290) on the user's 110 market auction based on limiting the pool of plaintiffs and defendants, where the algorithms may be used to assist the user 110 in completing the litigation and patent geolocation unit between two virtual hubs with a limit on the pool of available users. In some implementations, a plurality of settings 1010 which transform the data may be sequenced for presenting as a transformed market or as a transformed market as a layer on a navigation system with indexed claims based on price. A user's 110 pool for group restricted settings 1022 (a data transformation) may limit the user pool displayed by email, security, sex, rating, or a plurality of other restrictions.

The user 110 may contact the “set” button 1040 to transmit the litigation and patent geolocation unit security specification constraint and arbitrage data by using the GUI 210. The mobile computing device may instantiate instructions in its memory, and the mobile computing device may then transmit litigation or patent geolocation unit claim security or forward and safety data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the litigation or patent geolocation unit claim forward market or security market database server 271, virtual hub database server 223, network member database server 222, map routing server, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. These elements may interface together to make a system configured to deliver litigation and patent geolocation units to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices in an auction format.

FIG. 11 illustrates the user interface 210 of a computing device (e.g., a mobile computing device) in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for participating, transacting, and/or trading transformed litigation and patent geolocation unit as a physical forward commodity or security between combinations of virtual hubs over various litigation and patent geolocation unit modes. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: a virtual hub combination 1111; a virtual hub origin/from location 1110 with users 1112 within the virtual hub location 1110; a specification summary of the market, claim type such as Medicare Secondary Payor drug overdose claim 1127; a mode of Medicare Secondary Payor Opioid claim litigation and patent geolocation type 1130; a transaction summary of the last trades quantity and price 1128; a virtual hub claim origin and court location 1122 and user who is party to the claim on the litigation and patent geolocation unit 1123; a bid/buy quantity title header 1115 for a virtual litigation and patent geolocation unit hub market; a bid/buy price title header 1116 for a virtual litigation and patent geolocation unit hub market; an offer/sell price title header 1119 for a virtual litigation and patent geolocation unit hub market; and/or an offer/sell quantity title header 1126 for a virtual litigation and patent geolocation unit hub market.

The user interface may also display and/or include one or more of the following elements: a bid/buy quantity 1114 for the best bid quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; a bid/buy quantity 1113 for the second-best bid quantity from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein; a bid/buy price 1118 for the best bid price from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein; and/or a bid/buy price 1117 for the second-best bid price from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein.

In addition, the user interface 210 may display and/or include one or more of the following elements: an offer/sell price 1121 for the best offer price from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; an offer/sell price 1120 for the second-best offer price from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; an offer/sell quantity 1125 for the best offer quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; an offer/sell quantity 1124 for the second-best offer quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; a safety dispatch “911” button 1129 to enact video and audio recording of the user 110 environment and dispatch of that information to authorities; and/or a hamburger menu button 270 to move back to menu options and settings away from the participation, transaction, trading auction GUI 210.

In some implementations, the user 110 may enter a transaction quantity and price for a transformed litigation and patent geolocation unit securities in order to participate, transact, and/or trade via the GUI 210, where the GUI 210 may detect the user's 110 contact or audio interface with the bid/buy price 1118 or the offer/sell price 1121. The GUI 210 may detect the user's 110 contact with any of the buttons of the GUI 210 mentioned above. Upon user contact or audio interface with the buttons on the GUI 210, instructions may be instantiated in the memory of the mobile computing device, which may allow the user 110 to change the specifications of the respective virtual hub combination 1111.

A plurality of prices and markets may be presented based on a plurality of litigation and patent geolocation claim unit contract specifications. In some implementations, the best bid/buy price 1118 may move up in price or down in price based on the market conditions at any given time. The last trade or last transacted price for a given specification may be listed to inform the user 110 as to how the market is moving, which may allow the user 110 to submit a competitive offer/selling price 1121 or bid/buying price 1118. In some implementations, the user 110 may adjust settings of the GUI 210 to show more bid/buying prices 1117 or more offer/selling prices 1120. The matrix of market quantities and prices 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1124, 1125, 1126 displayed in the GUI 210 may be referred to as market depth. In a further implementation, the number of users 110 may be displayed as user icons 1112 or 1123 for the people logged in who desire to transact, trade, or participate in a given virtual hub patent geolocation claim unit 1110 to virtual hub 1122 combination.

Users 110 may select the patent geolocation claim unit mode 1130, such that GUI 210 displays a market for one form of patent geolocation claim units as a commodity or security. In a further implementation, the GUI 210 may show multiple forms of patent geolocation claim units between virtual patent geolocation claim unit hubs 1110, 1122.

In some implementations, the user 110 may select the 911 button 1129, which may activate voice and video recording functions on the mobile computing device and transmit the data with a confirmation from the user 110 to the authorities to provide enhanced security while participating, transacting, or trading transformed forward patent geolocation claim units as a commodity or security. The user may toggle between the GUI 210 market view screen in FIG. 11 and other menu 270 options and settings by the user 110 selecting the hamburger button 270, with the mobile computing device detecting the user 110 input/contact or audio instruction. In some implementations, the mobile computing device may instantiate instructions in its memory, and the device may then transmit the litigation and patent geolocation data through the network 214 or the wireless GPS network 215. Such data may be acquired using an accelerometer of the mobile computing device, GPS data (e.g., position coordinates) received from a GPS receiver of the mobile computing device, data acquired using a camera of the mobile computing device, data acquired using a microphone of the mobile computing device, and/or the like. For example, such data may correspond to coordinate speed changes, where the data may be generated using the accelerometer, the GPS receiver, the camera, the microphone, and/or the like. In such an example, based on the data acquired using these components of the mobile computing device, the user 110 may be notified of a potential claim from accident triangulation data. In particular, the mobile computing device may transmit the litigation and patent geolocation data through the network 214 or the wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the patent geolocation claim unit forward market or securities market database server 271, virtual hub database server 223, network member database server 222, map routing server, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290.

In some implementations, the accelerometer, the GPS receiver, the camera, the microphone, and/or the like may be used to acquire the litigation and patent geolocation data, where such data may include coordinate speed changes and may also be used to node rank the claim incident by a quality of the data underlying the claim. The node rank may then be associated with a quality ranking or security interest for the claim. In some implementations, algorithms may be used to coordinate the instructions to formulate the claim using the data from the accelerometer, the GPS receiver, the camera, the microphone, and/or the like of the mobile computing device, where the algorithms may be used to node rank the claim incident by the quality of the data and instruction signals. Such implementations are discussed later in further detail with respect to FIG. 160. In another implementation, the litigation and patent geolocation data may be ascertained in the claim blockchain rankings, where such data may include personal health records, motor vehicle crash reports, electronic health records, dietary and medication ingestion data, and/or other claim data in the blockchain. In some implementations, these elements may interface together to make a system configured to deliver litigation or patent geolocation claim units to users 110 from and to a plurality of virtual hubs 1110, 1122 with a plurality of specifications at specific market prices.

FIG. 12 illustrates a user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for participating, transacting, and/or trading transformed litigation and patent geolocation exchange units as a physical forward commodity or security between combinations of virtual hubs over various litigation and patent geolocation exchange unit modes. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: a virtual hub claim combination 1211; a virtual hub claim origin/from location 1210 with users 1212 within the virtual hub location 1210; a specification summary of the patent claim market, level of service, and claim time of commencement for a wireless patent claim specification 1227; a mode of patent claim type 1230; a transaction summary of the last trades quantity and price 1228; a virtual hub destination/to location 1222 and user who is being delivered on the litigation and patent geolocation unit 1223; a bid/buy quantity title header 1215 for a virtual litigation and patent geolocation exchange unit hub market; a bid/buy price title header 1216 for a virtual litigation and patent geolocation exchange unit hub market; an offer/sell price title header 1219 for a virtual litigation and patent geolocation exchange unit hub market; and/or an offer/sell quantity title header 1226 for an exemplary virtual litigation and patent geolocation exchange unit hub market.

The user interface may also display and/or include one or more of the following elements: a bid/buy quantity 1214 for the best bid quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; a bid/buy quantity 1213 for the second-best bid quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; a bid/buy price 1218 for the best bid price from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; and/or an bid/buy price 1217 for the second-best bid price from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein.

In addition, the user interface may display and/or include one or more of the following elements: an offer/sell price 1221 for the best offer price from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; an offer/sell price 1220 for the second-best offer price from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; an offer/sell quantity 1225 for the best offer quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination that has undergone a plurality of data transformations using implementations described herein; an offer/sell quantity 1224 for the second-best offer quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub claim combination that has undergone a plurality of data transformations using implementations described herein; a safety dispatch “911” button 1229 to enact video and audio recording of the user 110 environment and dispatch of that information to authorities; and/or a hamburger menu button 270 to move back to menu options and settings away from the participation, transaction, trading GUI 210.

In some implementations, the user 110 may enter a transaction quantity and price for a litigation and patent geolocation claim units in order to participate, transact, and/or trade via the GUI 210, where the GUI 210 may detect the user's 110 contact with a bid/buy price 1218 or offer/sell price 1221. The GUI 210 may detect the user's 110 contact with any of the GUI 210 buttons mentioned above. Upon user contact with the buttons or audio interface on the GUI 210, instructions are instantiated in the memory of the device which allow the user 110 to change the specifications of the respective virtual hub litigation and patent geolocation claim unit combination 1211.

A plurality of transformed prices and transformed markets may be presented based on a plurality of transformed contract litigation and patent geolocation claim unit specifications. In some implementations, the best bid/buy price 1218 may move up in price or down in price based on the market conditions at any given time. The last trade or last transacted price for a given specification may be listed to inform the user 110 as to how the market is moving, which may allow the user 110 to submit a competitive offer/selling price 1221 or bid/buying price 1218. In some implementations, the user 110 may adjust settings of the GUI 210 to show more bid/buying prices 1217 or more offer/selling prices 1220. The matrix of market quantities and prices 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1224, 1225, 1226 displayed in the GUI 210 may be referred to as market depth.

In a further implementation, the number of users 110 may be displayed as user icons 1212 or 1223 for the people logged in who desire to transact, trade, or participate in a given virtual hub 1210 to virtual hub litigation and patent geolocation claim unit 1222 combination. Users 110 may select the patent claim type mode 1230, such that the GUI 210 displays a market for one form or mode of litigation and patent geolocation claim unit as a commodity or security. In a further implementation, the GUI 210 may show multiple forms (multi-modal) of litigation and patent geolocation claim units between virtual litigation and patent geolocation claim unit hubs 1210, 1222.

In some implementations, the user 110 may select the 911 button 1229, which may activate voice and video recording functions on the mobile computing device and transmit the data with a confirmation from the user 110 to the authorities to provide enhanced security while participating, transacting, or trading transformed forward litigation and patent geolocation claim units as a commodity or security. The user may toggle between the GUI 210 market view screen in FIG. 12 and other menu 270 options and settings by the user 110 selecting the hamburger button 270, with the mobile computing device detecting the user 110 input/contact or audio instructions. In some implementations, the mobile computing device may instantiate instructions in its memory, and the device may then transmit litigation and patent geolocation data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the litigation and patent geolocation claim unit forward market or securities market database server 271, virtual hub database server 223, network member database server 222, map routing servers, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. These elements may interface together to make a system configured to deliver litigation and patent geolocation units to users 110 from and to a plurality of virtual hubs 1210, 1222 with a plurality of specifications at specific market prices.

FIG. 13 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for participating, transacting, and/or trading transformed litigation and patent geolocation claim units as physical forward commodities or securities between combinations of virtual hubs over various litigation and patent geolocation claim unit modes. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: a litigation and patent geolocation claim unit virtual hub combination 1311; a virtual hub origin/from location 1310 with users 1312 within the virtual hub location 1310; a specification summary 1327 of the market, level of service, and time of delivery commencement; a mode of Medicare secondary payer claim type 1330; a transaction summary 1328 of the last trades quantity and price; a virtual hub destination/to location 1322 and user who is being delivered on the litigation and patent geolocation claim unit 1323; a bid/buy quantity title header 1315 for a virtual litigation and patent geolocation claim unit hub market; a bid/buy price title header 1316 for a virtual litigation and patent geolocation claim unit hub market; an offer/sell price title header 1319 for a virtual litigation and patent geolocation claim unit hub market; and/or an offer/sell quantity title header 1326 for a virtual litigation and patent geolocation claim unit hub market.

The user interface 210 may also display and/or include one or more of the following elements: a bid/buy quantity 1314 for the best bid quantity from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein; a bid/buy quantity 1313 for the second-best bid quantity from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein; a bid/buy price 1318 for the best bid price from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein; and/or a bid/buy price 1317 for the second-best bid price from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein.

In addition, the user interface may display and/or include one or more of the following elements: an offer/sell price 1321 for the best offer price from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein; an offer/sell price 1320 for the second-best offer price from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein; an offer/sell quantity 1325 for the best offer quantity from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein; an offer/sell quantity 1324 for the second-best offer quantity from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination that has undergone a plurality of data transformations using implementations described herein; a safety dispatch “911” button 1329 to enact video and audio recording of the user's 110 environment and dispatch of that information to authorities; and/or a hamburger menu button 270 to move back to menu options and settings away from the participation, transaction, trading GUI 210.

In some implementations, the user 110 may enter a transaction quantity and price for a litigation and patent geolocation claim unit in order to participate, transact, and/or trade via the GUI 210, where the mobile computing device (e.g., via the GUI 210) may detect the user's 110 contact or audio instructions with the bid/buy price 1318 or the offer/sell price 1321. The mobile computing device may detect the user's 110 contact with any of the GUI 210 buttons mentioned above. Upon user contact or audio interface with the buttons or audio instructions on the GUI 210, instructions may be instantiated in the memory of the device, which may allow the user 110 to change the specifications of the respective litigation and patent geolocation claim unit virtual hub combination 1311.

A plurality of prices and markets may be presented based on a plurality of transformed contract litigation and patent geolocation claim unit specifications. In some implementations, the best bid/buy price 1318 may move up in price or down in price based on the market conditions at any given time. The last trade or last transacted price for a given transformed specification may be listed to inform the user 110 as to how the market is moving, which may allow the user 110 to submit a competitive offer/selling price 1321 or bid/buying price 1318. In some implementations, the user 110 may adjust settings of the GUI 210 to show more bid/buying prices 1317 or more offer/selling prices 1320. The matrix of market quantities and prices 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1321, 1324, 1325, 1326 displayed in the GUI 210 may be referred to as market depth.

In a further implementation, the number of users 110 may be displayed as user icons 1312 or 1323 for the people logged in who desire to transact, trade, or participate in a given litigation and patent geolocation claim unit virtual hub 1310 to litigation and patent geolocation claim unit virtual hub 1322 transformed combination. Users 110 may select the Medicare secondary payer claim type mode 1330, such that the GUI 210 displays a market for one form of litigation and patent geolocation claim unit as a commodity or security. In a further implementation, to the GUI 210 may show multiple forms of transformed litigation and patent geolocation claim unit or securities between one or more virtual litigation and patent geolocation claim unit capacity hubs 1310, 1322.

In another implementation, transformed litigation or patent claim geolocation units or transformed litigation or patent claim geolocation unit securities may be substitutable between modes if specifications or security cash flows meet the grade category of the transformed litigation or patent claim geolocation unit specification or transformed litigation or patent claim geolocation unit security. For example, a user 110 may have bought a transformed litigation or patent claim geolocation unit with a specification and the delivery mechanism was a physical location court summons. However, the physical location court summons user 110 may buy back their transformed litigation or patent claim geolocation unit or transformed litigation or patent claim geolocation unit security, allowing the original purchaser to be matched with a physical court location summons of another user 110 who will deliver the transformed litigation or patent claim geolocation unit or transformed litigation or patent claim geolocation unit security. The modes of transportation discussed above, including a bus, train, airplane, car, and/or a plurality of other modes, may be substitutable if the transformed litigation or patent claim geolocation unit or transformed litigation or patent claim geolocation unit security meets the delivery transformed specification grade.

In some implementations, the user 110 may select the 911 button 1329, which may activate voice and video recording functions on the mobile computing device and transmit the data with a confirmation from the user 110 to the authorities to provide enhanced security while participating, transacting, or trading forward litigation or patent claim geolocation units as a commodity or security. The user may toggle between the GUI 210 market view screen in FIG. 13 and other menu 270 options and settings by the user 110 selecting the hamburger button 270, with the mobile computing device detecting the user 110 input or contact. In some implementations, the mobile computing device may instantiate instructions in its memory, and the device may then transmit the litigation and patent geolocation data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the litigation or patent claim geolocation unit forward market or securities market database server 271, virtual hub database server 223, network member database server 222, map routing servers, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. The elements may interface together to make a system configured to deliver litigation and patent geolocation units to users 110 from and to a plurality of virtual hubs 1310, 1322 with a plurality of specifications at specific market prices.

FIG. 14 illustrates a user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used for selecting market menu options 1410 on a portable multifunction device (e.g., a mobile computing device). Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: menu options 1410; origin (from)/destination (to) menu option 1411; market menu option 1412; claims and specifications menu option 1413; term and specifications menu option 1414; order time and type menu option 1415; modes menu option 1416; virtual hubs menu option 1417; claim data and settings menu option 1418; orders and confirmations menu option 1419; claim community message menu option 1420; tax and accounting menu option 1421; setting button 1440 to transmit the menu option; and/or hamburger button 270 to instruct the GUI 210 to take the user 110 to the menu screen.

In some implementations, the user interface 210 may be used by the user 110 to select a plurality of menu options 1410. The user 110 may select the claim origin (from)/court destination (to) menu option 1411, which may lead to the GUI 210 displaying an address input rendering (e.g., address input rendering 910 and/or FIG. 2). The user 110 may select the “market” menu option 1412, which may lead to the GUI 210 displaying a market participation, transaction, and/or trading rendering (e.g., as shown in FIG. 4, 11, 12, or 13). The user may toggle between the GUI 210 market view screen in FIG. 14 and other menu options and settings by the user 110 selecting the hamburger button 270, where the mobile computing device may detect the user's 110 input or contact with the GUI 210. The user 110 may select the claims and specifications menu option 1413, which may lead to the GUI 210 displaying a claims and specifications rendering (e.g., as shown in FIG. 5). The user 110 may select the term and specifications menu option 1414, which may lead to the GUI 210 displaying a term and specifications rendering (e.g., as shown in FIG. 6). The user 110 may select the order time and type menu option 1415, which may lead to the GUI 210 displaying an order time and type rendering (e.g., as shown in FIG. 7).

The user 110 may select the modes menu option 1416, which may lead to the GUI 210 displaying a mode rendering. The user 110 may select the virtual hubs menu option 1417, which may lead to the GUI 210 displaying a virtual hubs rendering (e.g., as shown in FIG. 9). The user 110 may select the claim data and settings menu option 1418, which may lead to the GUI 210 displaying a claim data and settings rendering (e.g., as shown in FIG. 10). The user 110 may select the orders and confirmations menu option 1419, which may lead to the GUI 210 displaying the market orders and transaction confirmations for the user 110. The user 110 may select the claim pool community object message menu option 1420, which may lead to the GUI 210 displaying a message to either the actual litigation or patent claim geolocation unit, the opposite seller user, the buyer user, and/or the like. The message displayed may depend on if the user 110 was an opposite buyer or seller of the litigation or patent claim geolocation unit. The user 110 may select the tax and accounting menu option 1421, which may lead to the GUI 210 displaying tax and accounting information for the user 110.

Selecting a particular menu option 1410 may lead to the mobile computing device instantiating instructions in its memory, and the mobile computing device may then transmit litigation or patent claim geolocation unit data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the litigation or patent claim geolocation unit forward market database or securities market server 271, virtual hub database server 223, network member database server 222, map routing server, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. The elements may interface together to make a system configured to deliver litigation and patent geolocation units or securities to users 110 from and to a plurality of virtual hubs 410, 422 with a plurality of specifications at specific market prices.

FIG. 15 illustrates a network configuration 1500 in accordance with implementations of various techniques described herein. In one implementation, the network configuration 1500 may be used for participating, transacting, and/or trading transformed litigation and patent geolocation units or securities. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the network configuration 1500 may include one or more of the following elements: wireless global positioning system (GPS) network 1510; network(s) 1511; additional GPS network 1512; user member portable multifunction device 1513; virtual hub database server 1514; litigation or patent claim geolocation unit forward market or securities market database server 1519; additional user member portable multifunction device 1515; network member database server 1520; network member user 1516; additional network member user 1517; claim correlation and ranking database server 1521; cloud and local CPUs 1522; and/or litigation and patent geolocation unit mode 1518.

In some implementations, the software and/or instructions stored in memory of the cloud & local CPUs 1522 and portable multifunction devices 1513, 1515 (e.g., mobile computing devices) may include additional instructions to instantiate specification requirements, participation, transactions, and/or trading on the litigation and patent geolocation claim unit network 1511. The instructions may include standard database web services with the database as service provider (i.e., calling from the outside in), which may allow the client device 1513 to call the virtual hub database server 1514, the litigation or patent claim geolocation unit forward market or securities market database server 1519, the network member database server 1520, the claim correlation and ranking database server 1521, and/or the cloud & local CPUs 1522 via the wireless GPS network 1510 or network 1511. In some implementations, the virtual hub database server 1514, the litigation or patent claim geolocation unit forward market or securities database server 1519, the network member database server 1520, the claim correlation and ranking database server 1521, and/or the cloud & local CPUs 1522 may each instruct the network(s) 1511 to instantiate the database servers 1514, 1519, 1520, 1521, 1522 as service consumers (i.e., calling from the inside out), which may allow a Structured Query Language (SQL) query or application module in the database session to consume an external web service. In some implementations, users 1516 and/or 1517 may use portable multifunction devices 1513 and/or 1515 to access the litigation and patent geolocation claim unit market, thereby allowing the users 1516 and/or 1517 to participate, transact, and/or trade litigation and patent geolocation claim units.

In some implementations, the virtual hub litigation or patent claim geolocation unit database server 1514 may store map tile data in addition to user location data or accident or incident data, as will later be described from device algorithms in FIG. 160, where such data may be used to display or render, via the GUI 210, locations of claim virtual hubs and user 1516 proximity to those virtual hubs. In some implementations, the litigation or patent claim geolocation unit forward market database server 1519 may store bid and offer data for respective quantities of users, as well as transaction data and a plurality of market data for each virtual hub combination. In some implementations, the network member database server 1520 may store user profile, user claim transaction, user claim trade, user claim settings, user claim specifications, user claim rating, user claim criminal history, background claim check data, facial recognition data, fingerprint recognition data, photo scan recognition data, claim history data, user track record, user bank data, user credit card data, user history data, user tax data, and/or a plurality of other data. In some implementations, the claim correlation and ranking database server 1521 may store data and algorithms to identify user 110 constraints and may run algorithm calculations for users 110 on specific constraints to check for compliance with the constraints. In some implementations, network servers and CPUs 1514, 1519, 1520, 1521, 1522, 1513, 1515 may interface through the network 1511 and/or wireless GPS networks 1510, 1512, such that litigation and patent geolocation claim units may be participated in, transacted, and/or traded efficiently in the context of a market for litigation or patent claim geolocation units or securities. Included aforementioned data elements may be a subset or superset of data used for any specific calculation or transformation to participate, transact, or trade litigation and patent geolocation claim units or securities.

FIG. 16 illustrates a flow diagram of a method 1600 in accordance with implementations of various techniques described herein, where the method 1600 may be used for participating in, transacting, and/or trading transformed litigation or patent claim geolocation units or securities between litigation or patent claim geolocation unit virtual hub combinations. In one implementation, method 1600 may be at least partially performed by a computing system, such as the computing system implementations discussed herein. In particular, the computing system may include one or more of the following: a computing device, a mobile or portable multifunction device, a fixed computing device, a computing device with a touchscreen, a computing device without a touchscreen, an augmented, audio interface computing device, a computing device with a mixed reality non-screen display, and/or any other computing system or device known to those skilled in the art. It should be understood that while method 1600 indicates a particular order of execution of operations, in some implementations, certain portions of the operations might be executed in a different order. Further, in some implementations, additional operations or steps may be added to the method 1600. Likewise, some operations or steps may be omitted.

At block 1610, the computing system may receive and/or detect a user login. In one implementation, the user login may be communicated to a litigation or patent claim geolocation unit network (as described above) for detection and/or any other determination. At block 1620, the computing system may determine a claim origin location based on user input or current GPS coordinate information and may determine a destination address based on user input. In one implementation, data relating to the claim origin location and/or the claim or court destination address may be transmitted using the litigation or patent claim geolocation unit network.

At block 1630, the computing system may, in conjunction with CPUs and/or databases of the network, generate and apply one or more optimization techniques to form a virtual hub with other users that have similar litigation or patent claim geolocation unit requests within a geographic boundary. At block 1640, the computing system may, in conjunction with CPUs and or databases of the network, generate instructions for a plurality of computing devices, network, virtual hub database server, network member database server and litigation or patent claim geolocation unit forward market or securities database server 271. These instructions may be used to form a combination of virtual hubs and transformed contract specifications for delivery of litigation or patent claim geolocation units between the virtual hubs. This combination may be presented via a graphical user interface to allow users to enter forward physical prices to sell (offer) or bid (buy) litigation or patent claim geolocation unit or securities between virtual hub combinations in an open market auction format.

At block 1650, the computing system may, in conjunction with CPUs and or databases of the network, generate instructions to interface a plurality of networks, global positioning systems networks, servers, forward commodity market or security market auctions, map routing servers, grouping instruction software for virtual hubs, navigation servers, transparent open access pricing systems, game servers, blockchain claim history, safety systems, virtual hub servers and systems, and/or no arbitrage constraint condition systems. These elements may form a system configured to implement a forward commodity or security litigation and patent geolocation unit forward market or securities market system.

FIG. 17 illustrates a user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the of the user interface 210 may display one or more options relating to a user's most frequent litigation or patent claim geolocation unit claims 1710, which may be used for participating, transacting, and/or trading litigation and patent geolocation claim units. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements relating to the most frequent my claims: Medicare secondary payer (MSP) claims 1711 (may have subsets of transformed data); automobile claims 1712 (may have subsets of transformed data); truck claims 1713 (may have subsets of transformed data); Vioxx claims 1714 (may have subsets of transformed data); Zyprexa claims 1715 (may have subsets of transformed data); Depakote claims 1716 (may have subsets of transformed data); opioid claims 1717 (may have subsets of transformed data); Risperdal claims 1718 (may have subsets of transformed data); wireless patent claims 1719 (may have subsets of transformed data); drug patent claims 1720 (may have subsets of transformed data); and/or Bextra claims 1721 (may have subsets of transformed data). In addition, the GUI 210 may include other buttons, including those corresponding to: +Add Subject or claim 1722 (may have subsets of transformed data); Edit 1723 or 1750 (may have subsets of transformed data); set button 1740 to transmit the My Claims data; and/or hamburger button 270 to instruct the GUI 210 to take the user 110 to the menu screen.

In some implementations, the GUI 210 may be used to select, store, and/or edit a user's 110 frequent or preferred claims (“MY CLAIMS”) 1710 for more efficient access to litigation or patent claim geolocation unit markets over various modes and specifications of litigation or patent claim geolocation units. In such implementations, the user 110 may select, store, and/or edit address and specification data for MSP claims 1711, automobile claims 1712, truck claims 1713, Vioxx claims 1714, Zyprexa claims 1715, Depakote claims 1716, opioid claims 1717, Risperdal claims 1718, wireless patent claims 1719, drug patent claims 1720, Bextra claims 1721, and/or +Add Subject claim 1722. The My Claims module 1710 may include any claim a user 110 may request on any litigation and patent claim geolocation unit mode and/or specification.

In some implementations, the user may toggle between the market view screen (e.g., as shown in FIG. 4) and other menu options and settings (e.g., options 1410 of FIG. 14) by the user 110 selecting the hamburger button 270, with the mobile computing device detecting the user 110 input or contact. In other implementations, the user 110 may be notified via SMS text, in application, email, and/or a plurality of other known communication methods as to when market activity occurs on a given claim object or litigation or patent claim geolocation unit virtual hub combination. In other words, the “My Claims” 1710 feature may not only allow for one-touch access to a saved claim, but this feature may also perform notification features between users. Lastly, in some implementations, the Edit buttons 1723, 1750 may allow a user 110 to modify a plurality of notification settings, such as email, SMS text, in application, voice, messaging, and/or other notification methods.

FIG. 18 illustrates a network topology configuration 1800 in accordance with implementations of various techniques described herein. In one implementation, the network configuration 1800 may be used for participating, transacting, and/or trading transformed litigation and patent geolocation units or securities. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the network configuration 1800 may include one or more of the following elements: large litigation or patent claim geolocation unit virtual hub nodes 1801, 1802, 1803, 1804, 1805; medium litigation or patent claim geolocation unit virtual hub nodes 1810, 1811, 1809, 1808, 1807, 1806; and/or small litigation or patent claim geolocation unit virtual hub nodes 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1819, 1820, 1821. In particular, the overall network node topology configuration 1800 may include: large virtual hub nodes 1801, 1802, 1803, 1804, 1805; medium virtual hub nodes 1810, 1811, 1809, 1808, 1807, 1806; small virtual hub nodes 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1819, 1820, 1821; and/or a subset or superset thereof.

In some implementations, a user may input a claim starting point of 1815 and a claim ending point of 1818, which may represent specific geographic litigation or patent claim geolocation unit virtual hub locations in a city, multiple cities, a country, or multiple countries. Forward transportation market auctions may occur directly between two exemplary points, such as 1815 and 1818, or the method and system may combine a series of smaller auctions to create a larger auction between two endpoints on the system. In one implementation, a series of smaller auctions may be combined between 1815 and 1811, 1811 and 1802, 1802 and 1805, 1805 and 1808, and 1808 and 1818, which would be added together to make a combined litigation or patent claim geolocation unit virtual hub auction. A combined series of smaller auctions may be constrained by instructions used to form auctions, where such instructions may be based on lowest value litigation or patent claim geolocation unit, single mode or type litigation or patent claim geolocation unit auctions, multi-mode or type litigation or patent claim geolocation unit, fastest litigation or patent claim geolocation unit constraints, most used litigation or patent claim geolocation unit auctions, highest rated litigation or patent claim geolocation unit auctions, most available or liquid litigation or patent claim geolocation unit auctions, highest volume litigation or patent claim geolocation unit auctions, most frequent litigation or patent claim geolocation unit auctions, service level litigation or patent claim geolocation unit auctions, security and safety level auctions, and/or group restricted auctions by sex, email, organization, gender, or other considerations.

In some implementations, the constraints may allow for many types of auctions for transformed litigation or patent geolocation claim units or securities in a forward litigation or patent geolocation claim market. In such implementations, the user 110 may specify instructions that set forward market auction constraints based on one or a plurality of constraints. The constrained auctions may have fungible units which allow many participants to transact in the auctions. The forward market of litigation or patent claim geolocation units between virtual hubs 1801 and 1804, or other combinations along map routes, may include the attributes of a fungible forward contract or security. Such a contract may allow for one litigation or patent claim geolocation unit to be substitutable for another litigation or patent claim geolocation unit, because the unit may have been transformed and defined as a commodity contract or security. For example, assume user A bought a litigation or patent claim geolocation unit from user B between virtual hub 1801 and virtual hub 1804, but then user A was not able to perform the obligation to purchase the litigation or patent claim geolocation unit between virtual hub 1801 and virtual hub 1804 from user B. User A could then resell the litigation or patent claim geolocation unit contract between virtual hub 1801 and virtual hub 1804 to a third party user C on the forward litigation or patent claim geolocation unit auction market between virtual hub 1804 and virtual hub 1801 to retrieve the financial payment made for their original purchase from user B. User C would then replace user A and be matched with user B for the litigation or patent claim geolocation unit transformation between virtual hub 1804 and virtual hub 1801. In some implementations, constrained optimization may be used to form one auction between two points or a series of multiple auctions that form one larger auction.

In some implementations, the forward litigation or patent geolocation claim unit auctions subject to various constraints may be presented as a linear programming cost minimization problem for cases where the user 110 selects the cheapest claim 1011 constraint. For example, the series of auctions that utilize the lowest cost litigation or patent between the claim start point 1815 and the claim ending point 1818 may be combined. Further, in such an example, the linear programming cost minimization function may select the path of 1815 to 1811 to 1802 to 1804 to 1805 to 1808 to 1818 if that combination is the lowest cost auction path.

In another implementation, the user 110 may select instructions for the auction to minimize both cost and shortest route. In such an implementation, the linear programming function may minimize the cost, subject to the constraint that time is shortest along the path. The resulting auction may combine a different and unique series of auctions between the starting point of 1815 and ending point 1818. Accordingly, the path may be optimized to minimize cost subject to the shortest path, which may yield a path of 1815 to 1811 to 1802 to 1805 to 1808 to 1818. The plurality of combinations and permutations of linear programming sequences of auctions for litigation or patent claim geolocation unit units between two points may be infinite.

In some implementations, the forward transformed litigation or patent geolocation claim unit or transformed litigation or patent claim geolocation unit security auctions may be held side by side between two competing claims. For example, a user may input instructions for the method and system to route between virtual hub 1801 and virtual hub 1805. One route may be directly between virtual hub 1801 and virtual hub 1805. Another route may be between virtual hub 1801 and virtual hub 1805 by way of virtual hub 1802. The time between the routes may vary due to accident status, traffic, construction, road conditions, accidents, or a plurality of other exogenous factors. However, the data transformation of the implementations disclosed herein may allow for two auctions to form side by side. Side by side auctions may be displayed on a market based user interface (e.g., as shown in FIG. 13) or as a software layer of instructions over a navigation system. The first litigation or patent claim geolocation unit auction may be directly between virtual hub 1805 and virtual hub 1801 as one auction. A second auction may be formed by combining two smaller auctions between virtual hub 1805 and virtual hub 1802 with the auction between virtual hub 1802 and virtual hub 1801, which could be expressed independently or as a combined auction. The plurality of route auctions for the litigation or patent claim geolocation unit (e.g., the first auction directly between virtual hub 1801 and virtual hub 1805 and the second auction between virtual hub 1801 and virtual hub 1805 by way of virtual hub 1802) may provide transparent price auction information to the user regarding the value of various proposed claims, which may have different price values.

FIG. 19 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used to display a delivery and pick up status configuration 1900 for participating, transacting, and/or trading transformed litigation and patent geolocation units or securities. In particular, the GUI 210 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the delivery and pick up claim status configuration 1900 may include one or more of the following elements: hamburger menu button 270 to move between different application configurations; information 1910 relating to a claim virtual hub 1 pickup address and claim virtual hub 2 destination address having a contract specification with regards to quality, day, date, and time; claim status 1920 indicating the status of “PickUp” for the litigation or patent claim geolocation unit; check-in litigation or patent claim geolocation unit button 1930 for the litigation or patent claim geolocation unit; message button 1940 for messaging texts and instructions between users to facilitate pick up and delivery of litigation and patent geolocation claim units; call button 1950 for placing a call between users, where number masking may be used for privacy and security; GPS map location indicator 1960 of a rider or of a cargo location; GPS map location indicator 1970 of a driver or of a cargo carrier; GPS map 1980 corresponding to the delivery and pick up of the litigation or patent claim geolocation unit; texting message window 1991 used for communication between users; pick up address data window 1992 during the ongoing pick up process; and/or security button 1990 used to report security issues to 911 and system database.

In some implementations, the GUI 210 may transmit claim delivery instructions to the users 110 (e.g., the rider and driver), where the instructions may include a rendering or map of their respective GPS locations, which may be shown via indicators 1960 and 1970. The GUI 210 may display the trip status 1920, where the trip status may include pick up, start, leaving, on-going, in-progress, arriving, arrived, or a plurality of other claim status conditions. Further, the GUI 210 may include check-in litigation or patent claim geolocation unit button 1930, which may be used to confirm that a transformed litigation or patent claim geolocation unit has been moved into the transformed litigation or patent claim geolocation unit object. The transformed litigation or patent claim geolocation unit object may be a person, home, business, car, airplane, autonomous vehicle, bike, boat, ship, bus, drone, limo, motorcycle, moped, shuttle, spaceship, subway, taxi, train, cargo, legal entity, a combination of transformed modes, and/or other modes of litigation or patent claim geolocation units.

In addition, the users 110 may transmit a message using the message button 1940, which may be used to transmit audio, visual, or text messages between users 110. The users 110 may also call each other using the call button 1950, which may be used to communicate claim pick up or delivery instructions. Additionally, a user may message another user using the texting message window 1991, which may be used to facilitate visual, audio, or text communication between users and while logging a claim message history.

In some implementations, the users 110 may toggle to other modes of the application using the menu hamburger button 270. The relative positions of a litigation or patent claim geolocation unit seller (i.e., indicator 1970) and a litigation or patent claim geolocation unit buyer (i.e., indicator 1960) may be displayed on the GPS map 1980 to help users 110 understand each other's claim relative position and location on the map 1980. In some implementations, the GPS location of the litigation or patent geolocation claim unit seller (i.e., indicator 1970) and litigation or patent claim geolocation unit buyer (i.e., indicator 1960) may be tracked in real time with location updates on the map 1980.

FIG. 20 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may display a claim CheckIn configuration 2000, which may be used for participating, transacting, and/or trading litigation and patent geolocation claim units. In particular, the GUI 210 may be used to display a multi-layered network node topology for forward market or securities market of litigation or patent geolocation claim units with security CheckIn features to verify identities involved with the claim. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the user interface 210 may display and/or include one or more of the following elements: a CheckIn button 2050 for a buyer or seller of a litigation or patent claim geolocation unit; a hamburger menu button 270 to move between different application configurations; a buyer or seller of litigation or patent claim geolocation unit scan check window 2051, which may indicate the use of a fingerprint, face scan, and/or picture photo scan to verify the identity of a user; a passenger or freight and litigation or patent claim geolocation unit buyer unit scan check window 2052, which may indicate the use of a fingerprint, face scan, and/or picture photo scan to verify the identity of a claim user as defendant, plaintiff, lawyers or other parties affiliated with the claim; a litigation or patent claim geolocation unit verification confirmation window 2053 to confirm identities of users in the system at the application system level; facial data 2010 for a buyer and/or seller of litigation or patent claim geolocation unit for whom facial recognition confirmation is used; fingerprint data 2020 for a buyer and/or seller of a litigation or patent claim geolocation unit for whom fingerprint recognition confirmation is used; photo data 2030 for a buyer and/or seller of a litigation or patent claim geolocation unit for whom photo recognition confirmation is used;

In some implementations, the computing device may be used to transmit data and confirm the identity of users against identity records in the network member database server 222. The computing device may also be used to confirm security checks for criminal records or other activity that would suspend a user from the platform environment. In a further implementation, the driver verification window 2051 may indicate a failure regarding an identity verification due to a user not being the registered user on the network member database server 222. In other implementations, the passenger, driver, or freight verification window 2052 may indicate a failure regarding an identity verification due to a user not being the registered user on the network member database server 222. In another implementation, the litigation or patent claim geolocation unit verification window 2053 may instruct the user to proceed to a destination if the one or more verifications are successful. The litigation or patent claim geolocation unit verification window 2053 may also instruct the user not to proceed to the destination if the one or more verification are not successful for the multi-factor authentication.

FIG. 21 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used to display a delivery and pick up status configuration 2100 once a litigation or patent claim geolocation unit delivery has started when participating, transacting, and/or trading litigation and patent geolocation claim units, as described above. In particular, the GUI 210 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the delivery and pick up status configuration 2100 may include one or more of the following elements, or a subset or superset thereof:

a hamburger menu button 270 to move between different application configurations; information 2103 relating to a virtual hub 1 litigation or patent claim geolocation unit pickup address and virtual hub 2 litigation or patent claim geolocation unit destination address having a transformed contract specification with regards to quality, day, date, and time of delivery of a litigation or patent claim geolocation unit; claim status 2102 indicating the status of “Started” for the litigation or patent claim geolocation unit or security; a finish trip passenger or freight button 2104 for the litigation or patent claim geolocation unit for use once a litigation or patent claim geolocation unit has been delivered; message button 2105 for messaging texts and instructions between users to facilitate the pick up and delivery of litigation and patent geolocation claim units; call button 2106 for placing a call between system users, where number masking may be used for privacy and security; GPS map location indicator 2109 of a claim party, defendant, plaintiff, rider, driver, pedestrian, business, home, or a cargo location; GPS map location indicator 2108 of a driver or a cargo carrier location; GPS map 2110 corresponding to the delivery and pick up of the litigation or patent claim geolocation unit; texting message window 2112 for communication between users; starting point 2107 of a virtual hub for forward litigation or patent claim geolocation units; security button 2111 to report security issues to 911 and/or a system database; and/or drop off address window 2113 for the delivery of passenger or litigation or patent claim geolocation unit.

In some implementations, the GUI 210 may transmit delivery instructions to the users 110 (e.g., the rider and driver), where the instructions may include a rendering or map of their respective GPS locations, which may be shown via indicators 2108 and 2109. The GUI 210 may display the claim status 2102, where the claim status may include pick up, started, leaving, on-going, in-progress, arriving, arrived, or a plurality of other claim status conditions.

Further, the GUI 210 may include a finish trip passenger or freight button 2104, which may be used to confirm a litigation or patent claim geolocation unit has been delivered or completed by the litigation or patent claim geolocation unit object. The litigation or patent claim geolocation unit object may be a person, object, business, home, property, legal entity, car, airplane, autonomous vehicle, bike, boat, ship, bus, drone, limo, motorcycle, moped, shuttle, spaceship, subway, taxi, train, cargo, and/or other modes of transportation.

In addition, the users 110 may transmit a message using the message button 2105, which may be used to transmit audio, visual, or text messages between users 110. The users 110 may also call each other using the call button 2106, which may be used to communicate claim pick up or delivery instructions or other communications. Additionally, a user may message another user using the texting message window 2112, which may be used to facilitate visual, audio, or text communication between users while logging a blockchain claim message history.

In some implementations, the users 110 may toggle to other modes of the application using the menu hamburger button 270. The relative positions of a transformed litigation or patent claim geolocation unit or security seller (i.e., indicator 2108) and a transformed litigation or patent claim geolocation unit or security buyer (i.e., indicator 2109) may be displayed on the GPS map 2110 to help users 110 understand each other's relative position and location on the map 2110. In some implementations, the GPS location of the litigation or patent geolocation claim unit seller (i.e., indicator 2108) and litigation or patent claim geolocation unit buyer (i.e., indicator 2109) may be tracked in real time with location updates on the map 2110.

FIG. 22 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used to display a claim delivery and pick up status configuration 2200 for a litigation or patent claim geolocation unit delivery that is ongoing when participating, transacting, and/or trading transformed litigation and patent geolocation claim units or securities. In particular, the GUI 210 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the claim delivery and pick up status configuration 2200 may include one or more of the following elements: hamburger menu button 270 to move between different application configurations; information 2201 relating to virtual hub 1 litigation or patent claim geolocation unit pickup address and virtual hub 2 litigation or patent claim geolocation unit destination address having a contract specification with regards to quality, day, date, and time of delivery of a litigation or patent claim geolocation unit; trip status 2202 indicating that the status of “Ongoing” for the litigation or patent claim geolocation unit; finish litigation or patent claim geolocation unit button 2203 for the litigation or patent claim geolocation unit for use once a litigation or patent claim geolocation unit has been delivered; message button 2204 for messaging texts and instructions between users to facilitate the pick-up and delivery of litigation and patent geolocation claim units; call button 2205 for placing a call between system users, number masking may be used for privacy and security; GPS map location indicator 2207 of a rider, cargo, person, or legal entity object location; GPS map location indicator 2208 of a driver, cargo carrier, person, or legal entity object location; GPS map 2209 corresponding to the delivery and pick up of the of litigation or patent claim geolocation unit; texting message window 2211 for communication between users; claim starting point 2206 of a virtual hub for forward litigation or patent claim geolocation units; security button 2210 to report and record security issues to 911 and/or a system database; and/or drop off address window 2212 for the delivery of passenger or litigation or patent claim geolocation unit.

In some implementations, the GUI 210 may transmit delivery instructions to the users 110 (e.g., the rider and driver or claim defendants, claim plaintiffs, or other claim affiliates), where the instructions may include a rendering or map of their respective GPS locations, which may be shown via indicators 2207 and 2208. The GUI 210 may display the claim status 2202, where the claim status 2202 may include pick up, started, leaving, on-going, in-progress, arriving, arrived, or a plurality of other claim status conditions.

Further, the GUI 210 may include a finish litigation or patent claim geolocation unit button 2203, which may be used to confirm a litigation or patent claim geolocation unit or security has been delivered or completed by the litigation or patent claim geolocation unit. The litigation or patent claim geolocation unit object may be a person, legal entity, home, business, group, object, car, airplane, autonomous vehicle, bike, boat, ship, bus, drone, limo, motorcycle, moped, shuttle, spaceship, subway, taxi, train, cargo, and/or other types of transportation modes.

In addition, the users 110 may transmit a message using the message button 2204, which may be used to transmit audio, visual, or text messages between users 110. The users 110 may also call each other using the call button 2205, which may be used to communicate claim pick up or delivery instructions or other necessary communication. Additionally, a user may message another user to facilitate visual, audio, or text communication between users while logging a message history.

In some implementations, the users 110 may toggle to other modes of the application using the menu hamburger button 270. The relative positions of a litigation or patent claim geolocation unit seller (i.e., indicator 2208) and litigation or patent claim geolocation unit buyer (i.e., indicator 2207) may be displayed on the GPS map 2209 to help users 110 understand each other's relative position and location on the map 2209. In some implementations, the GPS location of the litigation or patent geolocation claim unit seller (i.e., indicator 2208) and litigation or patent claim geolocation unit buyer (i.e., indicator 2207) may be tracked in real time with location updates on the map 2209. The GUI 210 may also display the drop off address 2212 of the litigation or patent claim geolocation unit. In some implementations, a user 110 may use a security button 2210 to submit a recording to the system servers and to authorities who are connected to the system if anything has occurred that may compromise the security of any user or litigation or patent claim geolocation unit.

FIG. 23 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used to display a litigation or patent claim geolocation unit delivery and pick up status configuration 2300 once a litigation or patent claim geolocation unit delivery has arrived when participating, transacting, and/or trading litigation and patent geolocation claim units. In particular, the GUI 210 may be used to display implementations which utilize a multi-layered network node topology for forward market or securities market of litigation or patent geolocation claim units. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the litigation or patent claim geolocation unit delivery and pick up status configuration 2300 may include one or more of the following elements: hamburger menu button 270 to move between different application configurations; information 2301 relating to a virtual hub 1 litigation or patent claim geolocation unit pickup address and virtual hub 2 litigation or patent claim geolocation unit destination address having a contract specification with regards to quality, day, date, and time of delivery of a litigation or patent claim geolocation unit; claim status 2302 indicating the status of “Arrived” for the litigation or patent claim geolocation unit; finish litigation or patent claim geolocation unit button 2303 for the litigation or patent claim geolocation unit for use once a litigation or patent claim geolocation unit has been delivered or an incremental status update has been achieved; message button 2304 for messaging texts and instructions between users to facilitate the litigation or patent claim geolocation unit pick up and delivery of litigation and patent geolocation claim units; call button 2305 for placing a call between system users, where number masking may be used for privacy and security; GPS map location indicator 2321 of a rider or cargo or person or claim affiliate location; GPS map location indicator 2320 of a driver or cargo carrier location; GPS map 2308 corresponding to the delivery and pick up of the litigation or patent claim geolocation unit; texting message window 2311 for communication between users; starting point 2306 of a virtual hub for forward transformed litigation or patent claim geolocation units or securities; ending point 2307 of a virtual hub for forward transformed litigation or patent claim geolocation units or securities; security button 2309 to report and record security issues to 911 and/or a system database; and/or drop off address window 2312 for the delivery of litigation or patent claim geolocation units.

In some implementations, the GUI 210 may transmit delivery instructions to the users 110 (e.g., the rider and driver), where the instructions may include a rendering or map of their respective GPS locations, which may be shown via indicators 2320 and 2321. The GUI 210 may display the trip status 2302, where the claim status may include pick up, started, leaving, on-going, in-progress, arriving, arrived, location, or a plurality of other claim status conditions.

Further, the GUI 210 may include a finish litigation or patent claim geolocation unit button 2303, which may be used to confirm a litigation or patent claim geolocation unit has been delivered or completed by the litigation or patent claim geolocation unit object. The litigation or patent claim geolocation unit object may be a person, object, business, legal entity, car, airplane, autonomous vehicle, bike, boat, ship, bus, drone, limo, motorcycle, moped, shuttle, spaceship, subway, taxi, train, cargo, and/or other types of transportation modes.

In addition, the users 110 may transmit a message using the message button 2304, which may be used to transmit audio, visual, or text messages between users 110. The users 110 may also call each other using the call button 2305, which may be used to communicate litigation or patent claim geolocation unit pickup or delivery instructions or other communications. Additionally, a user may message another user using the texting message window 2112, which may be used to facilitate visual, audio, or text communication between users while logging a message history.

In some implementations, the users 110 may toggle to other modes of the application using the menu hamburger button 270. The relative positions of a litigation or patent claim geolocation unit seller (i.e., indicator 2320) and a litigation or patent claim geolocation unit buyer (i.e., indicator 2321) may be displayed on the GPS map 21102308 to help users 110 understand each other's relative position and location on the map 2308. In some implementations, the GPS location of the litigation or patent geolocation claim unit seller (i.e., indicator 2320) and transformed litigation or patent claim geolocation unit or security buyer (i.e., indicator 2321) may be tracked in real time with location updates on the map 2308. The GUI 210 may also display the drop off address 2312 of the transformed litigation or patent claim geolocation unit or security. In some implementations, a user 110 may use a security button 2309 to submit a recording to the system servers and to authorities who are connected to the system if anything has occurred that may compromise the security of any user or litigation or patent claim geolocation unit.

FIG. 24 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used to display a litigation or patent claim geolocation unit delivery and pick up configuration 2400 for a litigation or patent claim geolocation unit multi-layered network node topology for use with participating, transacting, and/or trading litigation and patent geolocation claim units. In particular, the GUI 210 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the delivery and pick up configuration 2400 may include one or more of the following elements: hamburger menu button 270 to move between different application configurations; litigation or patent claim geolocation unit “From” node starting point 2401 of a multi-layered network node topology for a forward market of litigation or patent geolocation claim units; litigation or patent claim geolocation unit “To” or destination node ending point 2402 of a multi-layered network node topology for a forward market of litigation or patent geolocation claim units; litigation or patent claim geolocation unit Date module 2403 of an auction corresponding to a multi-layered network node topology for a forward market of transformed litigation or patent geolocation claim units or securities; litigation or patent claim geolocation unit Time module 2404 for pickup and delivery of an auction corresponding to a multi-layered network node topology for a forward market of litigation or patent geolocation claim units; Go button 2405, which may be used to form an auction corresponding to a multi-layered network node topology for a forward market of transformed litigation or patent geolocation claim units or securities; My Claims button 2406, which may be used to obtain common litigation or patent claim geolocation unit “From” node 2401 or “To” node 2402 points in an auction corresponding to a multi-layered network node topology for a forward market of transformed litigation or patent geolocation claim units for a user on the system; and/or multi-hub networks (i.e., node points) 2407, 2408, 2409, 2410, which may form a single node auction, a dual node auction, and/or any possible node combination or a multi-node auction series corresponding to a multi-layered network node topology for a forward market of litigation or patent geolocation claim units for a user on the system.

In some implementations, the GUI 210 may transmit a litigation or patent claim geolocation unit “From” node 2401 and “To” node 2402 with instructions to the users 110 with a specific date 2403 and time 2404 corresponding to a multi-layered network node topology for a forward market of transformed litigation or patent geolocation claim units. The instructions may include for a user on the system to perform a litigation or patent claim geolocation unit auction by pressing the Go button 2405. The system may use a plurality of constraints, such as, but not limited to, cheapest claim, single claim mode, multi-claim method mode, fastest claim payout, most used claim type, highest rated claim, most available claim type, highest volume claim, most frequent claim, service level claim, security and safety of claim, group restricted email, and/or group criteria. The system may also use any two or more of the node points 2407, 2408, 2409, 2410, including any combination of the points 2407, 2408, 2409, 2410. In some implementations, the system may use no constraints, one constraint, or a plurality of constraints to allow the user 110 to participate, transact, or trade in a multi-layered network node topology for a forward market of litigation or patent geolocation claim units in an auction.

In some implementations, the auction for forward market litigation or patent claim geolocation units or securities may be comprised of an auction at one hub location or between only two points or between a plurality of points, subject to a plurality of constraints. For example, the from point, starting point, or starting virtual hub may be the node point 2407. However, the system may select an auction between node points 2408 and 2409, rather than starting at point 2407, because one or more constraints were selected to frame the auction for forward market litigation or patent claim geolocation units. In some implementations, an auction may be comprised of multiple modes of litigation or patent claim geolocation units, such as an MSP claim auction between points 2407 and 2408, followed by an airplane litigation or patent claim geolocation unit auction between points 2408 and 2409, which may be followed by a truck litigation or patent claim geolocation unit auction between points 2410 and 2409 for litigation or patent claim geolocation units. The various plurality of auctions may be displayed as one auction or a series of auctions. The auctions for a multi-layered network node topology for a forward market of litigation or patent geolocation claim units may consist of any subset or superset of the aforementioned possibilities, including any constraints discussed with respect to FIG. 10 or any plurality of modes discussed with respect to FIG. 8.

FIG. 25 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used to display a setting configuration 2500 for a litigation or patent geolocation claim unit multi-layered network node topology, which may be used for participating, transacting, and/or trading litigation and patent geolocation claim units. In particular, the GUI 210 may be used to display a multi-layered network node topology for forward market of litigation or patent geolocation claim units. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the setting configuration 2500 may include one or more of the following setting elements: hamburger menu button 270 to move between different application configurations; open markets setting toggle 2510, which may allow a user to see all market participants of a given auction of transformed litigation or patent geolocation claim units or securities; restricted markets setting, which may be restricted by organization 2520, by sex 2530, by rating 2540, by security 2550, or by any other restriction the user 110 defines and where the restriction may limit the auction participants for the user; and/or privacy settings, which may include push notification restrictions 2560, location information restrictions 2570, sync with contacts restrictions 2580, and/or other privacy settings.

In some implementations, a user 110 may select the open markets toggle 2510, which may be used to show every participant in a given auction for a multi-layered network node topology for a forward market of litigation or patent geolocation claim units. The users 110 may also select to restrict the market view of the GUI 210, such as by organization 2520 (may be based on email), by sex 2530, by rating 2540 of driver or user, by security 2550, and/or by any other restriction. Users 110 may also change privacy settings, which may change push notification restrictions 2560, location settings restrictions 2570, sync with contacts settings restrictions 2580, and/or any other settings. The toggle switches 2510, 2520, 2530, 2540, 2550, 2560, 2570, 2580 may be set to off or on depending on if they hold a right or left toggle switch position. The restricted market settings 2520, 2530, 2540, 2550 may be a subset or superset of the aforementioned in the formation of an open market auction for a multi-layered network node topology for a forward market of litigation or patent geolocation claim units. In particular, the overall input sets may be restricted by sex, organization, rating, security, privacy, location, and/or other attributes. As such, optimizations may occur over limited subsets for the litigation or patent geolocation claim units.

FIG. 26 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used to display a claims data scan configuration 2600 for a transformed litigation or patent geolocation claim unit multi-layered network node topology for use with participating, transacting, and/or trading litigation and patent geolocation claim units. In particular, the GUI 210 may be used to display implementations which utilize a multi-layered network node topology for a forward market of litigation or patent geolocation claim units. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In some implementations, the claim data configuration 2600 may include one or more of the following elements: hamburger menu button 270 to move between different application configurations; claims data scan module 2610, which may be used to document the status and position of transformed forward market litigation or patent claim geolocation units or security; package/cargo inbound or received module 2692, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit identifier or security; package/cargo inbound scan toggle switch 2620, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit identifier or security; cargo unit inbound scan toggle switch 2640, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit identifier or security; trailer unit inbound scan toggle switch 2650, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit identifier or security; and/or container unit inbound scan toggle switch 2660, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit identifier or security

The claim data scan configuration 2600 may also include one or more of the following elements: package/cargo outbound or delivered module 2693, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit or security identifier or security; package/cargo outbound or delivered scan toggle 2670, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit identifier or security; cargo outbound or delivered scan toggle 2680, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit identifier; trailer outbound or delivered scan toggle 2690, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit identifier; and/or container unit outbound or delivered scan toggle 2691, which may be used to scan a picture, universal product code barcode, QR code, or other transformed litigation or patent geolocation claim unit identifier.

In some implementations, a user 110 may select the claims data scan module 2610 to scan or take a picture of a package or cargo identification code, such as a QR code, Uniform Product code, and/or other identifying package or cargo characteristic. The user 110 may select the package/cargo inbound scan toggle switch 2620, which may capture the identification characteristic, such as QR Codes, Uniform Product Codes, Serial Numbers, and/or other cargo identification characteristics of a package/cargo litigation or patent geolocation claim unit. Cargo claims may be a larger unit or structure than a package, where the cargo may be, for example, a crate or large movable unit with the identification characteristics mentioned above. For such larger units, the user 110 may use the cargo claim unit inbound scan toggle switch 2640 to capture the cargo identification characteristic for inbound receipt of the litigation or patent geolocation claim unit. The trailer unit inbound scan toggle switch 2650 option may be used by the user 110 to instruct the system configuration that a large trailer unit, such as an eighteen wheel trailer unit or smaller trailer, may be scanned to identify the litigation or patent geolocation claim unit in order to confirm receipt. The container unit inbound scan toggle switch 2660 may be utilized to track the receipt or location of a shipping container.

In some implementations, the user 110 may select the package/cargo outbound or delivered module 2693 to scan or take a picture of a package or cargo identification code, such as a QR code, Uniform Product code, and/or other identifying package or cargo characteristics to confirm delivery to a delivery address of the litigation or patent geolocation claim unit. The user 110 may select the package/cargo outbound or delivered scan toggle 2670, which may be used to capture the identification characteristic of a package or cargo litigation or patent geolocation claim unit once the unit is delivered to the delivery address. For such larger units, such as cargo, the user 110 may use the cargo outbound or delivered scan toggle 2680 to capture the cargo identification characteristic for outbound receipt of the transformed litigation or patent geolocation claim unit or security. The trailer outbound or delivered scan toggle 2690 may be used by the user 110 to instruct the system that a large trailer unit, such as an eighteen wheel trailer unit or smaller trailer, may be scanned to identify the litigation or patent geolocation claim unit and confirm claim delivery. The container unit outbound or delivered scan toggle 2691 may be utilized to track the delivery or location of a shipping container which has been delivered. Transformed litigation or patent geolocation claim units or securities may be a subset or superset of the aforementioned in the formation of an open forward market auction for a multi-layered network node topology for a forward market of transformed litigation or patent geolocation claim units or securities. In particular, the overall input sets may be restricted by claim cargo type, claim package type, claim data type, virtual type, and/or other attributes. As such, optimizations may occur over limited subsets for the litigation or patent geolocation claim units.

FIG. 27 illustrates the user interface 210 of a computing device in accordance with implementations of various techniques described herein. In particular, the user interface 210 may be used to display an MSP Auto Claim configuration 2700 for a transformed litigation or patent geolocation claim unit or security multi-layered network node topology, which may be used for participating, transacting, and/or trading transformed litigation and patent geolocation claim units or securities. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

The user interface 210 may display and/or include one or more of the following elements: a virtual hub combination 2711 from a shipping center location (a data transformation); a virtual hub origin/from location 2710 with users or claim freight originators 2712 within the virtual hub location 2710 (a data transformation); a specification summary 2727 of the market, level of service and time of delivery commencement (a data transformation); a mode of ground litigation and patent geolocation type 2730 (a data transformation); a transaction summary 2728 of the last trades quantity and price; a virtual hub destination/to location 2722 and user who is being delivered on the litigation and patent geolocation unit 2723 (a data transformation); a bid/buy quantity title header 2715 for a virtual litigation or patent geolocation claim unit hub market (a data transformation); a bid/buy price title header 2716 for a virtual litigation or patent geolocation claim unit hub market (a data transformation); an offer/sell price title header 2719 for a virtual litigation or patent geolocation claim unit hub market (a data transformation); and/or an offer/sell quantity title header 2726 for a virtual litigation or patent geolocation claim unit hub market (a data transformation).

The user interface 210 may also display and/or include one or more of the following elements: a bid/buy quantity 2714 for the best bid quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination 2711 (a data transformation); a bid/buy quantity 2713 for the second-best bid quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination 2711 (a data transformation); a bid/buy price 2718 for the best bid price from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination 2711 (a data transformation); a bid/buy price 2717 for the second-best bid price from a plurality of users 110 for a litigation and patent geolocation virtual hub combination 2711 (a data transformation). In addition, the user interface 210 may display and/or include one or more of the following elements: an offer/sell price 2721 for the best offer price from a plurality of users 110 for a litigation and patent geolocation claim unit virtual hub combination 2711 (a data transformation); an offer/sell price 2720 for the second-best offer price from a plurality of users 110 for a litigation and patent geolocation virtual hub combination 2711 (a data transformation); an offer/sell quantity 2725 for the best offer quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination 2711 (a data transformation); an offer/sell quantity 2724 for the second-best offer quantity from a plurality of users 110 for a litigation and patent geolocation virtual hub combination 2711 (a data transformation); a safety dispatch “911” button 2729 to enact video and audio recording of the user's 110 environment and dispatch of that information to authorities and system servers; and/or a hamburger menu button 270 to move back to menu options and settings away from the participation, transaction, trading auction GUI 210.

In some implementations, the user 110 may enter a transaction quantity and price for a litigation and patent geolocation units in order to participate, transact, and/or trade via the GUI 210, where the mobile computing device (e.g., via the GUI 210) may detect the user's 110 contact or audio interface with the bid/buy price 2718 or offer/sell price 2721. The mobile computing device may detect user's 110 contact with any of the GUI 210 buttons mentioned above. Upon user contact or audio interface with buttons on the GUI 210, instructions may be instantiated in the memory of the device, which may allow the user 110 to change the specifications of the respective virtual hub combination 2711.

A plurality of prices and markets may be presented based on a plurality of transformed contract specifications. In some implementations, the best bid/buy price 2718 may move up in price or down in price based on the market conditions at any given time. The last trade or last transacted price for a given specification may be listed to inform the user 110 as to how the market is moving, which may allow the user 110 to submit a competitive offer/selling price 2721 or bid/buying price 2718. In some implementations, the user 110 may adjust settings of the GUI 210 to show more bid/buying prices 2717 or more offer/selling prices 2720. The matrix of market quantities and prices 2713, 2714, 2715, 2716, 2717, 2718, 2719, 2720, 2721, 2724, 2725, 2726 displayed in the GUI 210 may be referred to as market depth.

In a further implementation, the number of users 110 may be displayed as user icons 2712 or 2723 for the people logged in who desire to transact, trade, or participate in a given virtual hub 2710 to virtual hub 2722 combination for litigation or patent geolocation claim units. Users 110 may select the transportation mode 2730, such that the GUI 210 displays a market for one form of transformed litigation and patent geolocation claim unit as a commodity or security. In a further implementation, the GUI 210 may show multiple forms of litigation and patent geolocation claim unit between virtual litigation or patent geolocation claim unit hubs 2710, 2722.

In some implementations, a user 110 may select the 911 button 2729, which may activate voice and video recording functions on the mobile computing device and transmit the data with a confirmation from the user 110 to the authorities and system servers to provide enhanced security while participating, transacting, or trading forward transformed transportation or freight as a commodity or security. The user may toggle between the GUI 210 market view screen in FIG. 27 and other menu 270 options and settings by the user 110 selecting the hamburger button 270, with the mobile computing device detecting the user 110 input/contact or audio instruction. In some implementations, the mobile computing device may instantiate instructions in its memory, and the device may then transmit transformed litigation and patent geolocation claim unit data through the network 214 or wireless GPS network 215 to call upon instruction routines and instruction sub-routines on the litigation or patent geolocation claim unit forward market or securities market database server 271, virtual hub database server 223, network member database server 222, map routing servers, no arbitrage condition database server, and/or instructions in the memory of the cloud and local CPUs 290. These elements may interface together to make a system configured to deliver litigation or patent geolocation claim units to users 110 from and to a plurality of virtual hubs 2710, 2722 with a plurality of specifications at specific market prices.

FIG. 28 illustrates a check in and security database configuration 2800 for a litigation or patent geolocation claim unit multi-layered network node topology for use with participating, transacting, and/or trading transformed litigation and patent geolocation claim units or securities in accordance with implementations of various techniques described herein. The configuration 2800 may be implemented using the mobile computing device mentioned above, where the device may include the GUI 210. In particular, the GUI 210 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units. The litigation or patent geolocation claim unit security may be the same as those discussed above. While the implementations disclosed herein may be discussed using a mobile computing device, any other form of computing device known to those skilled in the art may be used, as well. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In particular, the check in and security database configuration 2800 may include one or more of the following elements: a uniform crime reporting (“UCR”) database 2854 from international agencies who report crime; an international, state, and/or provincial crime reporting database 2855 from international governments who report crime; an international National Incident-Based Reporting System (“NIBRS”) crime reporting database 2856 from international governments who report crime; an International Criminal Police Organisation (INTERPOL) crime reporting database 2857 from international governments who report crime which connects National Central Bureaus (“NCBs”); an international application program interface and ABC (“API/ABC”) crime reporting database 2860 from international governments who report crime; a national crime reporting database 2858 from international governments who report crime; and/or an internal system crime reporting database 2859 from crimes which occurred on system.

The check in and security database configuration 2800 may also include one or more of the following elements: a facial scan to identify a user against a plurality of crime databases based on a facial image 2810; a fingerprint scan to identify a user against a plurality of crime databases based on a fingerprint image 2820; a photo scan to identify a user against a plurality of crime databases based on a photo image 2830; a voice scan to identify a user against a plurality of crime databases based on vocal data; hamburger menu button 270 to move between different application configurations displayed by the GUI 210; a claim driver, claim buyer, or claim seller interface 2851 to confirm an identity against a plurality of crime databases using one or more verification methods; a participant user interface 2852 to confirm an identity against a plurality of crime databases using one or more verification methods; and/or a handshake verification user interface 2853 to confirm both buyer and seller of litigation or patent geolocation claim units were correctly verified against crime databases which may reduce criminal activity or money laundering issues which could arise.

In some implementations, one or more crime databases may be used to confirm whether a user 110 has a criminal history. Such crime databases may include the UCR Database 2854, the international, state, and/or provincial crime reporting database 2855, the international NIBRS database 2856, the INTERPOL database 2857, the API/ABC database 2860, the national crime reporting database 2858, the internal system crime reporting database 2859, and/or any other crime database known to those skilled in the art. Such security checks may be automated and may be utilized for various modes of transportation, such as those discussed above, which may improve the overall safety of these transportation modes.

In some implementations, a user may be rejected from using a verified transport if the user fails a safety check based on one or more of the crime databases. In contrast, a user that has been confirmed has having no crime history or money laundering red flag issues or users that do not have activity reported in the crime databases mentioned above may be provided a claim verified status 2853 in the system.

FIG. 29 illustrates a user accounting configuration 2900 for a transformed litigation or patent geolocation claim unit or security multi-layered network node topology for use with participating, transacting, and/or trading transformed litigation and patent geolocation claim unit auctions in accordance with implementations of various techniques described herein. The configuration 2900 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include the GUI 210. In particular, the GUI 210 may be used to display implementations which utilize a multi-layered network node topology for a forward market of litigation or patent geolocation claim units. The litigation or patent geolocation claim unit security may be the same as those discussed above. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. Further, while the implementations disclosed herein may be discussed in terms of the user 110, the implementations may be used by other types of users, as well.

In particular, the user accounting configuration 2900 may include one or more of the following elements, at least some of which may be implemented using the GUI 210: a hamburger menu button 270 to move between different application configurations of the mobile computing device; an account button 2910 to edit or confirm user account data; a deposit button 2920 to add transaction funds, transaction currency, or transaction balances to the user account; a deposit method button 2930 to add transaction funds, transaction currency, or transaction balances to the user account through debit, credit, cash, check, virtual currency, digital currency, or any other payment method known to those skilled in the art; a withdrawal button 2940 to send transaction funds, transaction currency, or transaction balances to the user account in a different institution; a withdrawal method button 2970 to send transaction funds, transaction currency, or transaction balances to the user account at a different institution through debit, credit, cash, check, virtual currency, digital currency, or any other payment method known to those skilled in the art; a balances button 2950 to confirm user account balances; a tax button 2960 to track user account activity for taxation reporting; a month to date tax reporting button 2980; a year to date tax reporting button 2990; a prior year tax reporting button 2991; a 911 security button 2992; a network member database server 222; and/or a cloud and local CPU network configuration 290 to send and receive network member account data.

The account button 2910 may be used to edit or confirm the user account data such that, in response to the user operating (e.g., contacting) the account button 2910, the mobile computing device may provide the user account data to the user via display or vocal output. As noted above, the deposit button 2920 may be used to add transaction funds, transaction currency, or transaction balances to the user account such that, in response to the user operating (e.g., contacting) the deposit button 2920, the mobile computing device may provide user deposit data to the user via display or vocal output. Further, as noted above, the deposit method button 2930 may be used to add transaction funds, transaction currency, or transaction balances to the user account through debit, credit, cash, check, virtual currency, digital currency, or any other payment method known to those skilled in the art. In particular, the deposit method button 2930 may be used to select the method by which the user adds transaction funds, transaction currency, or transaction balances to the user account. In response to the user operating (e.g., contacting) the deposit method button 2930, the mobile computing device may provide user deposit method data to the user via display or vocal output.

As noted above, the withdrawal button 2940 may be used to send transaction funds, transaction currency, or transaction balances to the user account in a different institution such that, in response to the user operating (e.g., contacting) the withdrawal button 2940, the mobile computing device may provide user withdrawal data to the user via display or vocal output. Further, as noted above, the withdrawal method button 2970 may be used to send transaction funds, transaction currency, or transaction balances to the user account at a different institution through debit, credit, cash, check, virtual currency, digital currency, or any other payment method known to those skilled in the art. In particular, the withdrawal method button 2970 may be used to select the method by which the user sends transaction funds, transaction currency, or transaction balances to the user account. In response to the user operating (e.g., contacting) the withdrawal method button 2970, the mobile computing device may provide user withdrawal method data to the user via display or vocal output.

As noted above, the balances button 2950 may be used to confirm user account balances such that, in response to the user operating (e.g., contacting) the balances button 2950, the mobile computing device may provide user balances data to the user via display or vocal output. The tax button 2960 may be used to track user account activity for taxation reporting such that, in response to the user operating (e.g., contacting) the tax button 2960, the mobile computing device may provide user tax data to the user via display or vocal output. Operating (e.g., contacting) the month to date tax reporting button 2980, the year to date tax reporting button 2990, and the prior year tax reporting button 2991 may lead to the mobile computing device providing related data to the user via display or vocal output. In some implementations, accounting and tax information may be stored in the network member database server 222 and transmitted via the cloud and local CPUs 290 to the mobile computing device.

FIG. 30 illustrates a network configuration 3000 for a litigation or patent geolocation claim unit multi-layered network node topology. In particular, the network configuration 3000 may be used for participating, transacting, and/or trading litigation and patent geolocation claim unit auctions.

In some implementations, the network configuration 3000 may include one or more of the following elements: a wireless GPS network and server 3083; a wireless (e.g., mobile) computing device 3082 that may provide an audio, video, screen, and/or non-screen interface; a network member database server 3050; a litigation or patent geolocation claim unit forward market or securities market database server 3060; a no arbitrage condition database server 3070; a virtual hub database server 3080; a network, network cloud, and local CPUs 3081; and/or a network multi-layered network virtual hub node topology (e.g., virtual hub nodes) 3010, 3020, 3030, 3040 for forward market transportation of freight unit auctions.

In some implementations, the network topology 3010 may utilize the computing device 3082 to interface with system and method instructions over the network, network cloud, and local CPUs 3081. The instructions may be used on CPUs to order a constrained or unconstrained virtual hub network topology auction over two or more virtual hub nodes 3010, 3020, 3030, 3040, where the auction may apply to one or more modes of transportation or freight. Further, the instructions and data may be derived using the virtual hub database server 3080, the no arbitrage condition database server 3070, the litigation or patent geolocation claim unit forward market or securities market database server 3060, the network member database server 3050, and/or the wireless GPS network and server 3083. Network data may be provided via the wireless computing device, where the device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art.

FIG. 31 illustrates a market configuration 3100 in accordance with implementations of various techniques described herein, where the market configuration 3100 may integrate the implementations disclosed herein as a layer on a map software platform. The map software platform may include third-party map software platforms or any other map software platforms known to those skilled in the art. Further, the configuration 3100 may be used for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration 3100 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 3105. The user interface 3105 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 3105 may be used to display implementations which utilize a multi-layered network node topology for a forward market of litigation or patent geolocation claim units. Further, the transformed transportation capacity unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a stand-alone application.

The market configuration 3100 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 3105:

a claim route request 3175, where the request 3175 is input by a user; a claim route node structure 3190 that satisfies the user claim route request 3175, where the claim route node structure may also be referred to as a route; an alternative claim route node structure 3180 that satisfies the user route request 3175, along with an associated time 3181, and where the route node structure may be referred to as a claim route; a time estimate 3185 for the claim route 3190; a live litigation or patent geolocation claim unit auction price value 3110 for the claim route 3190; an alternative live auction price value 3116 for the route 3180; a navigation mode button 3171; a game mode button 3172; a date and time modification button 3195 for the route request 3175; a transformed forward litigation or patent claim geolocation unit auction value and modification feed 3115 and selection GO button 3145 to transact for a basic litigation or patent claim geolocation unit or security feature and characteristic for the route 3190; and/or an alternative transformed forward litigation or patent claim geolocation unit auction value and modification feed 3120 and selection GO button 3150 to transact for a basic litigation or patent claim geolocation unit or security feature and characteristic for the alternative route 3180.

The market configuration 3100 may also display and/or include one or more of the following elements, some of which may be implemented via the interface 3105: a transformed forward litigation or patent claim geolocation unit auction value and modification feed 3125 and selection GO button 3155 to transact for an intermediate litigation or patent claim geolocation unit or security feature and characteristic for the claim route 3190; an alternative transformed forward litigation or patent claim geolocation unit auction value and modification feed 3130 and selection GO button 3160 to transact for an intermediate litigation or patent claim geolocation unit or security feature and characteristic for the alternative claim route 3180; a transformed forward litigation or patent claim geolocation unit auction value and modification feed 3135 and selection GO button 3165 to transact for a premium litigation or patent claim geolocation unit or security feature and characteristic for the claim route 3190; an alternative transformed forward litigation or patent claim geolocation unit auction value and modification feed 3140 and selection GO button 3166 to transact for a premium litigation or patent claim geolocation unit or security feature and characteristic for the alternative claim route 3180; and/or a market display button 3170, which may be configured to display the forward transformed litigation or patent claim geolocation unit market auction as an overlay onto a map claim routing platform for the user request 3175.

In some implementations, the interface 3105 may display one or more map routing interfaces or layers on interfaces, such as those provided via third-party map software platforms. In particular, the interface 3105 may integrate the implementations disclosed herein and display the transformed forward litigation or patent claim geolocation unit or security market auction. The interface 3105 may display the auction price along one or more routes based on one or more virtual hub topologies over a user-defined route request 3175. In a further implementation, the mobile computing device may present the forward transformed litigation or patent claim geolocation unit auction price 3110 for the route 3190 via the interface 3105 or any visual, audio, other communication method known to those skilled in the art.

In another implementation, the mobile computing device may communicate (e.g., via the interface 3105) to a user the forward transformed litigation or patent claim geolocation unit or security auction price 3116 of the alternative claim route 3180. The user may view the prices 3116 and 3110 and then select either route 3190 or 3180. The prices 3110 and 3116 may be generated from a plurality of users between two virtual hubs corresponding to the user-defined claim route request 3175. The forward market litigation or patent claim geolocation unit auction may be provided (e.g., via the interface 3105) on an on-demand basis, representing the current time and day. In another implementation, the forward market litigation or patent claim geolocation unit auction may be provided on a forward basis, such as by using the date and time modification button 3195 to display the market pricing for future time intervals for the routes 3190 and 3180 corresponding to the user-defined route request 3175. The user-defined route request 3175 may also be referred to as a user-requested virtual hub combination.

In one implementation, virtual hubs may represent the end points corresponding to the route request 3175. In another implementation, virtual hubs may represent points along a route corresponding to the route request 3175, but not including the endpoints. In yet another implementation, virtual hubs may represent points at locations that are not along the route corresponding to the user-defined route request 3175. Virtual hub combinations may transform litigation or patent geolocation claim units into a forward market or security market, which may allow users to transact in the physical market by either: a) delivering transformed litigation or patent claim geolocation units as a driver of a vehicle or capacity holder, or b) by receiving the units as a passenger or receiving a package (i.e., if the unit is a package rather than a person). In particular, a litigation or patent claim geolocation unit or security may represent space which may be filled by a person or a package. Further, the market display button 3170 may overlay the forward transformed litigation or patent claim geolocation unit market or securities auction as a layer on a GPS map routing software platform/display. In one such implementation, the overlay of the market auction may be displayed as an alternative to time based routing or mileage based routing.

The forward litigation or patent claim geolocation unit market may include specifications, such as basic (as shown in feeds 3115 and 3120), intermediate (as shown in feeds 3125 and 3130), and premium (as shown in feeds 3135 and 3140). These specifications may also have one or more other characteristics or levels that form the basis of a fungible transformed contract or substitutable contract between users. The contract may be exchangeable with the same terms and conditions if one user is unable to fulfill his or her contract obligations for the transformed litigation or patent claim geolocation unit. The navigation mode button 3171 may be used to display turn-by-turn directions along the price-based claim navigation route 3190. The game mode button 3172 may be used to display a game-based overlay on the price-based claim navigation route 3190. The market display button 3170 may be used to display a market-based overlay on the priced-based claim navigation route 3190.

As noted above, the configuration 3100 may display one or more prices for routes corresponding to the route request 3175. For example, interface 3105 may display the litigation or patent claim geolocation unit auction prices 3110 and 3116. As shown in FIG. 31, two route prices (e.g., $3 and $3.10) are shown for the live auction price value 3110. The live auction price value 3110 may represent one or more price queues, such as those discussed in implementations described herein. The first price of $3 may represent the price at which a user is willing to buy or pay for a litigation or patent claim geolocation unit along the claim route 3190. The second price of $3.10 may represent the price at which a user is willing to sell a litigation or patent claim geolocation unit along the claim route 3190. The auction may be configured to match, such as through software instructions, the highest bidding price of $3 with the lowest selling price in the price queue when the prices match. For example, if a user wanted to sell a litigation or patent claim geolocation unit at the current forward market auction queue 3110 for route 3190, the user would enter a price of $3, which is the current highest bidding price in the queue 3110. In another example, another user may desire to buy a litigation or patent claim geolocation unit for the forward transformed litigation or patent claim geolocation unit auction route 3190. To match, the user would enter a price of $3.10, which is the lowest selling price of a seller on the forward market litigation or patent claim geolocation unit auction queue 3110.

FIG. 32 illustrates a market configuration 3200 in accordance with implementations of various techniques described herein, where the market configuration 3200 may integrate the implementations herein as a layer on another map software platform. The map software platform may include third-party map software platforms or any other map software platforms known to those skilled in the art. Further, the configuration 3200 may be use for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration 3200 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 3205. The user interface 3205 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 3205 may be used to display implementations which utilize a multi-layered network node topology for forward market or securities market of litigation or patent geolocation claim units. Further, the transformed transportation capacity unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a standalone application.

The market configuration 3200 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 3205:

a claim route request 3210, where the request 3210 is input by user; a claim route node structure that satisfies the user route request 3210, where the claim route node structure may also be referred to as a claim route; an alternative claim route node structure 3230 that satisfies the user route request 3210 with an associated time, where the claim route node structure may be referred to as a claim route; a time estimate 3225 for the route 3295; a navigation mode button 3291; a game mode button 3292; a market mode button 3293; a live auction price value 3220 for the claim route 3295; an alternative live auction price value 3231 for the route 3230; a date and time modification button 3296 for the claim route request 3210; a transformed forward litigation or patent claim geolocation unit or security auction value and modification feed 3235 and selection GO button 3265 to transact for a basic litigation or patent claim geolocation unit feature and characteristic for the route 3295; and/or an alternative transformed forward litigation or patent claim geolocation unit or security auction value and modification feed 3240 and selection GO button 3270 to transact for a basic litigation or patent claim geolocation unit feature and characteristic for the alternative claim route 3230.

The market configuration 3200 may also display and/or include one or more of the following elements, some of which may be implemented via the interface 3105: a transformed forward litigation or patent claim geolocation unit or security auction value and modification feed 3245 and selection GO button 3275 to transact for an intermediate litigation or patent claim geolocation unit feature and characteristic for the claim route 3295; an alternative transformed forward litigation or patent claim geolocation unit or security auction value and modification feed 3250 and selection GO button 3280 to transact for an intermediate litigation or patent claim geolocation unit feature and characteristic for the alternative route 3230; a transformed forward litigation or patent claim geolocation unit or security auction value and modification feed 3255 and selection GO button 3285 to transact for a premium litigation or patent claim geolocation unit feature and characteristic for the route 3295; an alternative transformed forward litigation or patent claim geolocation unit or security auction value and modification feed 3260 and selection GO button 3290 to transact for a premium transformed litigation or patent claim geolocation unit feature and characteristic for the alternative claim route 3230; and/or a market display feature 3215, which may be configured to display the forward transformed litigation or patent claim geolocation unit market auction as an overlay onto a map routing platform for the user request 3210.

In some implementations, the interface 3205 may display one or more map routing interfaces, such as those provided via third-party map software platforms. In particular, the interface 3205 may integrate the implementations disclosed herein and display the transformed forward litigation or patent claim geolocation unit or security market auction price. The interface 3205 may display the auction along one or more routes based on one or more virtual hub topologies over a user-defined route request 3210. In a further implementation, the mobile computing device may present the forward transformed litigation or patent claim geolocation unit or security auction price 3220 for the route 3295 via the interface 3205 or any visual, audio, other communication method known to those skilled in the art.

In another implementation, the mobile computing device may communicate (e.g., via the interface 3205) to a user the forward transformed litigation or patent claim geolocation unit auction price 3231 of the alternative route 3230. The user may view the prices 3231 and 3220 and then select either route 3295 or 3230. The prices 3231 and 3220 may be generated from a plurality of users between two virtual hubs corresponding to the user-defined route request 3210 and instructions to generate a price queue for buyers and sellers of litigation or patent claim geolocation units long given routes. In some implementations, the user may alter the date using the date and time modification button 3296, such that the transformed litigation or patent claim geolocation unit or security may be updated with user-submitted prices for forward looking time periods. The forward market transformed litigation or patent claim geolocation unit or security auction may be provided (e.g., via the interface 3205) on an on-demand basis, representing the current time and day. In another implementation, the forward market litigation or patent claim geolocation unit auction may be provided on a forward basis, such as by using the date and time modification button 3296 to display the market pricing for future time intervals for the routes 3295 and 3230 corresponding to the user-defined route request 3210. The user-defined route request 3210 may also be referred to as a user-requested virtual hub combination

In one implementation, virtual hubs may represent the end points corresponding to the route request 3210. In another implementation, virtual hubs may represent points along a route corresponding to the route request 3210, but not including the endpoints. In yet another implementation, virtual hubs may represent points at locations that are not along the route corresponding to the user-defined route request 3210. Virtual hub combinations may transform transportation capacity units or securities into a forward market, which may allow users to transact in the physical market by either: a) delivering transformed litigation or patent claim geolocation units as a driver of a vehicle or capacity holder, or b) by receiving the units as a passenger or receiving a package (i.e., if the unit is a package rather than a person). In particular, a transformed litigation or patent claim geolocation unit may represent space which may be filled by a person or a package. Further, the market display feature 3215 may overlay the forward transformed litigation or patent claim geolocation unit market auction as a layer on a GPS map routing software platform/display. In one such implementation, the overlay of the market auction may be displayed as an alternative to time based routing.

The forward litigation or patent claim geolocation unit market or securities market may include specifications, such as basic (as shown in feeds 3235 and 3240), intermediate (as shown in feeds 3245 and 3250), and premium (as shown in feeds 3255 and 3260) which may or may not have associated credit and default risk ratings. These specifications may also have one or more other characteristics or levels that form the basis of a fungible contract or substitutable contract between users. The contract may be exchangeable with the same terms and conditions if one user is unable to fulfill his or her contract obligations for the transformed litigation or patent claim geolocation unit. The navigation mode button 3291 may be used to display turn-by-turn directions along the price-based navigation route 3295. The game mode button 3292 may be used to display a game-based overlay on the price-based navigation route 3295. The market mode button 3293 may be used to display a market-based overlay on the priced-based navigation route 3295.

As noted above, the configuration 3200 may display one or more prices for routes corresponding to the route request 3210. For example, interface 3205 may display the transformed litigation or patent claim geolocation unit or security auction prices 3220 and 3231. As shown in FIG. 32, two route prices (e.g., $3 and $3.10) are shown for the live auction price value 3110. The live auction price value 3110 may represent one or more price queues, such as those discussed in implementations described herein. The first price of $3 may represent the price at which a user is willing to buy or pay for a litigation or patent claim geolocation unit along the claim route 3295. The second price of $3.10 may represent the price at which a user is willing to sell a litigation or patent claim geolocation unit along the route 3295. The auction may be configured to match, such as through software instructions, the highest bidding price of $3 with the lowest selling price in the price queue when the prices match. For example, if a user wanted to sell a litigation or patent claim geolocation unit at the current forward market auction queue 3220 for route 3295, the user would enter a price of $3, which is the current highest bidding price in the queue 3220. In another example, another user may desire to buy a transformed litigation or patent claim geolocation unit for the forward transformed litigation or patent claim geolocation unit or security auction route 3295. To match, the user would enter a price of $3.10, which is the lowest selling price of a seller on the forward market transformed litigation or patent claim geolocation unit auction queue 3220.

FIG. 33 illustrates a market configuration 3300 in accordance with implementations of various techniques described herein, where the market configuration 3300 may integrate the implementations disclosed herein as a layer on a map software platform. The map software platform may include third-party map software platforms or any other map software platforms known to those skilled in the art. Further, the configuration 3300 may be used for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration 3300 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 3335. The user interface 3335 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 3335 may be used to display implementations which utilize a multi-layered network node topology for forward market or securities market of litigation or patent geolocation claim units. Further, the transformed transportation capacity unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a stand-alone application.

The market configuration 3300 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 3335:

a route node structure 3340 that satisfies user route request with an associated time and price, where the route node structure may also be referred to as a route; an alternative route node structure 3345 that satisfies the user route request with an associated time and price, where the route node structure may also be referred to as a route; another alternative route node structure 3350 that satisfies the user route request with an associated time and price, where the route node structure may also be referred to as a route; a live auction price value 3305 for the price-based route 3340; a navigation mode button 3391; a game mode button 3392; a market mode button 3393; a go 3330 button to transact or modify the price based routing; a go 3325 button to transact or modify the price based routing; a go 3320 button to transact or modify the price based routing; an alternative live auction price value 3310 for the route 3345; an alternative live auction price value 3315 for the route 3350; a date and time modification button 3355 for the route 3340; a date and time modification button 3360 for the route 3345; and/or a date and time modification button 3365 for the route 3350.

In some implementations, the interface 3335 may display one or more map routing interfaces, such as those provided via third-party map software platforms. In particular, the interface 3335 may integrate the implementations disclosed herein and display the transformed forward litigation or patent claim geolocation unit market auction. The interface 3335 may display the auction price along one or more routes based on one or more virtual hub topologies over a user-defined route request. In a further implementation, the mobile computing device may present the forward transformed litigation or patent claim geolocation unit or security auction price 3305 for the route 3340 via the interface 3335 or any visual, audio, other communication method known to those skilled in the art.

In another implementation, the mobile computing device may communicate (e.g., via the interface 3335) to a user the forward transformed litigation or patent claim geolocation unit auction price 3310 of the alternative route 3345. The user may view the prices 3305, 3310, and 3315 and then select one of route 3340, 3345, or 3350. The prices 3305, 3310, and 3315 may be generated from a plurality of users between two virtual hubs corresponding to the user-defined route request and generated using a price queue for buyers and sellers of litigation or patent claim geolocation units along the routes 3340, 3345, or 3350. The forward market transformed litigation or patent claim geolocation unit or security auction may be provided (e.g., via the interface 3335) on an on-demand basis, representing the current time and day. In another implementation, the forward market litigation or patent claim geolocation unit auction may be provided on a forward basis or with various cash flow durations to match obligations of a plurality of fixed income portfolios, pension funds, retirement funds, or endowments, such as by using the date and time modification buttons 3355, 3360, 3365 to display the market pricing for future time intervals for the routes 3340, 3345, and 3350 corresponding to the user-defined claim route request. The user-defined route request may also be referred to as a user-requested virtual hub combination. In a further implementation, the user may use the date and time modification buttons 3355 to alter the date, such that the transformed litigation or patent claim geolocation unit or security may be updated with user-submitted prices 3305 for forward looking time periods.

In one implementation, virtual hubs may represent the end points corresponding to the route defined by the user. In another implementation, virtual hubs may represent points along a route corresponding to the user-defined route request, but not including the endpoints. In yet another implementation, virtual hubs may represent points at locations that are not along the route corresponding to the user-defined route request. Virtual hub combinations may transform litigation or patent geolocation claim units into a forward market, which may allow users to transact in the physical market by either: a) delivering litigation or patent claim geolocation units as a driver of a claim vehicle or claim capacity holder, or b) by receiving the units as a passenger or receiving a claim package (i.e., if the unit is a claim or package rather than a person). In particular, a litigation or patent claim geolocation unit may represent space which may be filled by a litigation or patent geolocation claim unit of any type. Further, the forward litigation or patent claim geolocation unit market auction overlay may be a layer on a GPS map routing software platform/display. In one such implementation, the overlay of the market auction may be displayed as an alternative to time based routing.

The forward litigation or patent claim geolocation unit market may include specifications, such as basic (as shown with respect to values 3305, 3310, and 3315). These specifications may also have one or more other transformed characteristics or levels that form the basis of a fungible contract or substitutable contract specifications between users. The contract may be exchangeable with the same terms and conditions if one user is unable to fulfill his or her contract obligations for the transformed litigation or patent claim geolocation unit or security. The navigation mode button 3391 may be used to display turn-by-turn directions along a price-based navigation route. The game mode button 3392 may be used to display a game-based overlay on a price-based navigation route. The market mode button 3393 may be used to display a market-based overlay on a priced based navigation route.

As noted above, the configuration 3300 may display one or more prices for routes corresponding to the route request. For example, interface 3335 may display the litigation or patent claim geolocation unit auction prices 3305, 3310, and 3315. As shown in FIG. 33, two or more prices may correspond to each route. For example, two route prices (e.g., $3 and $3.10) are shown for the live auction price value 3305. The live auction price value 3305 may represent one or more price queues, such as those discussed in implementations described herein. The first price of $3 may represent the price at which a user is willing to buy or pay for a litigation or patent claim geolocation unit along the route 3340. The second price of $3.10 may represent the price at which a user is willing to sell a litigation or patent claim geolocation unit along the route 3340. The auction may be configured to match, such as through software instructions, the highest bidding price of $3 with the lowest selling price in the price queue when the prices match. For example, if a user wanted to sell a litigation or patent claim geolocation unit at the current forward market auction queue 3305 for the route 3340, then the user would enter a price of $3, which is the current highest bidding price in the queue 3305. In another example, another user may desire to buy a litigation or patent claim geolocation unit for the forward litigation or patent claim geolocation unit auction for the route 3340. To match, the user would enter a price of $3.10, which is the lowest selling price of a seller on the forward market litigation or patent claim geolocation unit auction queue 3305.

FIG. 34 illustrates a market configuration 3400 in accordance with implementations of various techniques described herein, where the market configuration 3400 may integrate the implementations disclosed herein as a layer on a map software platform. The map software platform may include third-party map software platforms or any other map software platforms known to those skilled in the art. Further, the configuration 3400 may be used for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration 3400 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 3405. The user interface 3405 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 3405 may be used to display implementations which utilize a multi-layered network node topology for a forward market of litigation or patent geolocation claim units. Further, the transformed transportation capacity unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a stand-alone application.

The market configuration 3400 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 3405: a route 3410; a live auction price value 3430 for the route 3410; an alternative live auction claim price value 3426 for a claim route 3425; a navigation claim mode button 3491; a game mode button 3492; a market mode button 3493; a date and time modification button 3435 for the route 3410; a mileage estimate 3455 for the claim route 3410; a claim route estimate 3450 for the route 3410; a transformed forward litigation or patent claim geolocation unit auction value and modification feed 3415 and selection GO button 3440 to transact for a basic litigation or patent claim geolocation unit or security feature and characteristic for the route 3425; and/or a transformed forward litigation or patent claim geolocation unit or security auction value and modification feed 3420 and selection GO button 3445 to transact for a premium litigation or patent claim geolocation unit feature and characteristic for the route 3410.

In some implementations, the navigation mode button 3491 may be used to display turn-by-turn directions along the price-based navigation route 3410. The game mode button 3492 may be used to display a game-based overlay on the price-based navigation route 3410. The market mode button 3493 may be used to display a market-based overlay on the priced-based navigation route 3410.

FIG. 35 illustrates a market configuration 3500 in accordance with implementations of various techniques described herein, where the market configuration 3500 may integrate the implementations disclosed herein as a layer on a map software platform in the setting of a vehicle GPS navigation system. The map software platform may include third-party map software platforms or any other map software platforms known to those skilled in the art. Further, the configuration 3500 may be used for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration 3500 may be implemented using a computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 3550. The user interface 3550 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 3550 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units. Further, the transformed transportation capacity unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a stand-alone application.

The market configuration 3500 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 3550: a vehicle litigation or patent claim geolocation unit carrier unit 3505; a vehicle litigation or patent claim geolocation unit steering wheel 3510; a claim navigation mode button 3581; a game mode button 3580; a market mode button 3530; a user 3515 of litigation or patent claim geolocation unit, such as a seller or a driver; address information 3545 for a claim route 3546, where the claim route 3546 satisfies a user request; a date and time modification button 3540 for the claim route 3546; a transformed forward litigation or patent claim geolocation unit auction value and modification feed 3525 and selection GO button 3535 to transact for a basic litigation or patent claim geolocation unit feature and characteristic for the route 3546 that satisfies the user claim route request; a live auction price value 3555 for the route 3546; a live auction price value 3561 for an alternative route 3560 satisfying the user request; and/or a market layer routing overlay 3530.

In some implementations, the configuration 3500 may be implemented using a vehicle unit GPS navigation system. In particular, the interface 3550 may be used to display and/or may be integrated with the vehicle unit GPS navigation system. The user 3515 may input driving address information 3545 having an origin location and a destination location. In some implementations, the crash incident GPS algorithms and system may link to the vehicle to automatically produce the claim upon detection. In additional implementations, the vehicle cameras, microphones, and accelerometer may be linked to the multifunction device to automate the claim origination process. In some implementations, the user 3515 may communicate with the interface 3550 through a touchscreen 3520, an audio interface, or another interface. The user 3515 may use the date and time modification button 3540 to change the displayed pricing for the route 3546 from an on-demand (i.e., current time) to a forward time or date (i.e., future time). The market auction based pricing for the route 3546 may vary by date and time due to a plurality of market factors. The user 3515 may edit the displayed market-based auction price for the litigation or patent claim geolocation units by modifying the transformed forward litigation or patent claim geolocation unit auction value and modification feed 3525. Further, the user 3515 may transact for the litigation or patent claim geolocation unit at a particular auction price by selecting the GO button 3535. The navigation mode button 3581 may be used to display turn-by-turn directions along the price-based navigation route 3546. The game mode button 3580 may be used to display a game-based overlay on the price based navigation route 3546. The market mode button 3530 may be used to display a market-based overlay on the priced-based navigation route 3546.

The configuration 3500 may display one or more prices for routes corresponding to a user route request. For example, interface 3550 may display the litigation or patent claim geolocation unit auction prices 3555 and 3561. As shown in FIG. 35, two route prices (e.g., $3 and $3.10) are shown for the live auction price value 3555. The live auction price value 3555 may represent one or more price queues, such as those discussed in implementations described herein. The first price of $3 may represent the price at which a user is willing to buy or pay for a litigation or patent claim geolocation unit along the route 3546. The second price of $3.10 may represent the price at which a user is willing to sell a litigation or patent claim geolocation unit along the claim route 3546. The auction may be configured to match, such as through software instructions, the highest bidding price of $3 with the lowest selling price in the price queue when the prices match. For example, if a user 3515 wanted to sell a litigation or patent claim geolocation unit at the current forward market auction queue 3555 for claim route 3546, then the user 3515 would enter a price of $3, which is the current highest bidding price in the queue 3555. In another example, another user may desire to buy a litigation or patent claim geolocation unit for the forward transformed litigation or patent claim geolocation unit or security auction route 3546. To match, the user would enter a price of $3.10, which is the lowest selling price of a seller on the forward market transformed litigation or patent claim geolocation unit or security auction queue 3555.

In some implementations, alternative routes, such as claim route 3560, having prices in alternative litigation or patent claim geolocation unit auctions may have different prices based on supply and demand conditions. In some embodiments the market layer routing overlay button 3530 may be used to provide an alternative to time-based routing or mileage-based routing, which are fundamentally different premises. In a further implementation, the overall software system and associated instructions may ask the user 3515, such as through the interface 3550 or any other interface (e.g., audio), if he or she would like to monetize their claims upon starting any navigation sequence for transformed litigation or patent claim geolocation units or securities.

FIG. 36 illustrates a gaming configuration 3600 in accordance with implementations of various techniques described herein, where the gaming configuration 3600 may integrate the implementations disclosed herein as a game layer on a map software platform or general platform to help assist with data collection and claim processing. The map software platform may include an internal map software platform, a third-party map software platform, or any other map software platforms known to those skilled in the art. Further, the configuration 3600 may be used for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration 3600 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 3605. The user interface 3605 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 3605 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units. Further, the transformed litigation or patent geolocation claim unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a stand-alone application.

The gaming configuration 3600 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 3605:

a game overlay user score indicator 3610; a game overlay user power indicator 3615; a game overlay single occupancy vehicle (SOV) claim count indicator 3620; a game overlay weapon strength indicator 3625; a claim game overlay account balance indicator 3630; a claim game overlay passenger pick ups indicator 3688; a claim game overlay SOV target 3645; a claim game overlay SOV weapon 3650; a claim game overlay GPS standard map view button 3655; a game overlay augmented or mixed reality view button 3660; a game overlay passenger mode button 3687; a game overlay fire button 3665; a game overlay multi-purpose direction button 3670; a game overlay go button 3680; a game overlay stop button 3675; a navigation overlay button 3686; a game overlay button 3689; a market overlay button 3685; market overlay weapon selection buttons 3683, 3682, 3681, 3694; and/or a market overlay aim finder toggle 3684.

In some implementations, a user may use the claim game overlay button 3689 to generate a game layer over the displayed mapping, where the claim game layer may also be displayed using the interface 3605. The user may use the game layer to engage with a gaming environment that interacts with the transformed litigation and patent geolocation unit auction described above. The claim gaming environment and game layer be implemented using instructions and a computing system, as known to those skilled in the art. In one implementation, the gaming environment may be used to award scores and/or points for reporting accident or incident data targeted using the SOV count indicator 3620, to compute and distribute positive or negative litigation or patent claim geolocation unit game auction strategy points (e.g., the points displayed using the score indicator 3610, the power indicator 3615, and/or the account balance indicator 3630) based on one or more of the following: price 3635, route mileage, number of claims processed, number of claims (as shown in claim pick-ups indicator 3688), claim time estimates, litigation or patent claim geolocation unit claim route 3640, litigation or patent claim geolocation unit specifications, litigation or patent claim geolocation unit model type, litigation or patent claim geolocation unit make type, litigation or patent claim geolocation unit age, matched litigation or patent claim geolocation unit specification, matched litigation or patent claim geolocation unit fuel type, matched litigation or patent claim geolocation unit emission specification, cumulative user litigation or patent claim geolocation unit specifications, litigation or patent claim geolocation unit rating, litigation or patent claim geolocation unit safety, litigation or patent claim geolocation unit time, litigation or patent claim geolocation unit delay, litigation or patent claim geolocation unit driver rating, litigation or patent claim geolocation unit participant rating, litigation or patent claim geolocation unit timeliness relative to contract specification, and/or other specifications.

In some implementations, the game overlay button 3689 may be used to generate the game layer via the interface 3605. The game layer may display a plurality of weapon or scoring configurations, such as a rifle 3683, an axe 3681, a flower gift 3682, and a X logo 3694. The weapon or scoring configurations may be used to take away points or gain points from other users on the system. In a further implementation, the scoring may be independent of other players on the system but dependent on the user's actions in the game overlay. In particular, a selected weapon (e.g., the SOV weapon 3650) may be used to log accident vehicles within the gaming environment. The user may use the go button 3680 to accelerate and avoid an attack or fire or incident report. In addition, the user may use the stop button 3675 to slow down or stop in order to avoid enemy fire or attack. In some implementations, the stop button 3675 may interface with an autonomous driving system of a vehicle to pick up claims along a price-based navigation route to increase the score of the player (as shown in score indicator 3610) and increase the balances awarded to the player (as shown in balance indicator 3630) by earning money on the system. A user may be identified by the X logo or by a person logo, where the user may be a bidder on the price-based navigation claim route 3640 who can increase scores and balances. In some implementations, a user may scan navigation view (such as through the button 3655) or augmented reality view (such as through the button 3660) to look for SOV targets 3645 or X logos for users who are bidding on the price-based navigation route 3640.

In some implementations, the strategy of the price-based navigation gaming environment is to pick up as many passengers or bidders as possible along the price-based navigation route 3640, destroy as many single occupancy vehicles as possible along the price-based navigation route 3640, and to give flowers 3682 and rewards to litigation or patent claim geolocation unit providers who have more than one person in the vehicle along the price-based claim navigation route 3640. Users may work independently or collectively in tribes to maximize user score in strategy.

FIG. 37 illustrates a gaming configuration 3700 in accordance with implementations of various techniques described herein, where the gaming configuration 3700 may integrate the implementations disclosed herein on a map software platform. The map software platform may include an internal map software platform, a third-party map software platform, a navigation software platform, and/or any other map software platforms known to those skilled in the art. Further, the configuration 3700 may be used for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration 3700 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 3705. The user interface 3705 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 3705 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units. Further, the transformed litigation or patent geolocation claim unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a stand-alone application.

The gaming configuration 3700 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 3705: a game overlay user score indicator 3710; a game overlay user power indicator 3720; a game overlay SOV count indicator 3730; a game overlay weapon strength indicator 3715; a game overlay account balance indicator 3725; a game overlay claim pick ups indicator 3788; a claim game overlay SOV target 3735; a claim game overlay SOV weapon 3771; a game overlay GPS standard map view button 3740; a game overlay augmented or mixed reality view button 3745; a game overlay passenger mode button 3790; a game overlay fire button 3750; a game overlay multi-purpose direction button 3755; a game overlay go button 3767; a game overlay stop button 3760; a navigation overlay button 3765; a game overlay button 3792; a market overlay button 3768; market overlay weapon selection buttons 3775, 3770, 3769, 3796; and/or a market overlay aim finder toggle 3780.

In some implementations, a user may use the game overlay button 3792 to generate a game layer over the displayed mapping, where the game layer may also be displayed using the interface 3705. The user may use the game layer to engage with a gaming environment that interacts with the transformed litigation and patent geolocation unit auction described above. The gaming environment and game layer may be implemented using instructions and a computing system, as known to those skilled in the art. In one implementation, when interacting with the gaming environment and game layer, the interface 3705 may alert the user to a SOV target 3735. The user may interact with the gaming environment to use weapons 3775 or 3769 to destroy the SOV target 3735, which may increase user score displayed in the user score indicator 3710.

In another implementation, the user may identify a vehicle as having more than one claim and may then choose to reward or gift flowers (e.g., via the button 3770) to the vehicle or the system user of the vehicle in the gaming environment. The user may also choose to use a weapon (e.g., via the button 3775 or 3769) against a SOV target 3735 within the gaming environment, at which point the vehicle may explode in the gaming environment and the passenger would be left without a vehicle. In a further implementation, the results of the gift or weapon usage may be viewed in an augmented reality view (e.g., via button 3745) or a GPS view (e.g., via button 3740). The user may also choose, within the gaming environment, to award flowers (e.g., via button 3770) to a vehicle with more than one passenger, which may increase the user's score (displayed in the user score indicator 3710) and the add to score of the user that has more than one passenger in their vehicle.

FIG. 38 illustrates a gaming configuration 3800 in accordance with implementations of various techniques described herein, where the gaming configuration 3800 may integrate the implementations disclosed herein on a map software platform. The map software platform may include an internal map software platform, a third-party map software platform, a navigation software platform, and/or any other map software platforms known to those skilled in the art. Further, the configuration 3800 may be used for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration 3800 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 3805. The user interface 3805 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 3805 may be used to display implementations which utilize a multi-layered network node topology for a forward market or securities market of litigation or patent geolocation claim units. Further, the transformed litigation or patent geolocation claim unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a stand-alone application.

The gaming configuration 3800 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 3805: a game overlay user score indicator 3810; a game overlay user power indicator 3815; a game overlay SOV count indicator 3820; a game overlay weapon strength indicator 3825; a game overlay account claim balance indicator 3830; a game overlay claim pick ups indicator 3888; a game overlay flower gift 3896; a game overlay GPS standard map view button 3845; a game overlay augmented or mixed reality view button 3840; a game overlay claim mode button 3885; a game overlay fire button 3850; a game overlay multi-purpose direction button 3855; a game overlay go button 3865; a game overlay stop button 3860; a navigation overlay button 3866; a game overlay button 3897; a market overlay button 3868; market overlay weapon selection buttons 3869, 3870, 3875, 3898; and/or a market overlay aim finder toggle 3880.

In some implementations, a user may use the game overlay button 3897 to generate a game layer over the displayed mapping, where the game layer may also be displayed using the interface 3805. The user may use the game layer to engage with a gaming environment that interacts with the transformed litigation and patent geolocation unit auction described above. The gaming environment and game layer be implemented using instructions and a computing system, as known to those skilled in the art. In one implementation, when interacting with the gaming environment and game layer, the interface 3805 may alert the user to a vehicle 3899 with more than one passenger, which may prompt the user to gift a flower to the other user within the gaming environment. In some implementations, the game interface 3800 user 110 may log accident or incident data to score reward points. In some implementations, the game interface may log photo, video, voice, and/or sound data to record car crashes, pedestrian injuries, vehicle injuries, truck injuries, accidents, road hazards, air hazards, claim case data and facts, ambulance locations, ambulance photos and video, police locations, police photos and videos, and/or other claim evidence or data within the claim data block chain.

FIG. 39 illustrates a gaming configuration 3900 in accordance with implementations of various techniques described herein, where the gaming configuration 3900 may integrate the implementations disclosed herein on a map software platform. The map software platform may include an internal map software platform, a third-party map software platform, a navigation software platform, and/or any other map software platforms known to those skilled in the art. Further, the configuration 3900 may be used for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration 3900 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 3905. The user interface 3905 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 3905 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units. Further, the transformed litigation or patent geolocation claim unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a stand-alone application.

In gaming configuration 3900 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 3905: a claim game overlay user score indicator 3910; a claim game overlay user power indicator 3915; a claim game overlay SOV count indicator 3920; a claim game overlay weapon strength indicator 3925; a claim game overlay account balance indicator 3930; a claim game overlay claim pick ups indicator 3988; a game overlay weapon 3968; a game overlay GPS standard map view button 3940; a game overlay augmented or mixed reality view button 3967; a game overlay claim mode button 3985; a game overlay fire button 3945; a game overlay multi-purpose direction button 3950; a game overlay go button 3961; a game overlay stop button 3960; a navigation overlay button 3955; a market overlay button 3962; market overlay weapon selection buttons 3963, 3966, 3965, 3979; a market overlay aim finder toggle 3964; and/or a user 3935 in an augmented reality view who has had his or her SOV destroyed or claim processed.

In some implementations, a user may use the game overlay go button 3961 to generate a game layer over the displayed mapping, where the game layer may also be displayed using the interface 3905. The user may use the game layer to engage with a gaming environment that interacts with the transformed litigation and patent geolocation claim unit auction described above. The gaming environment and game layer be implemented using instructions and a computing system, as known to those skilled in the art. In one implementation, when interacting with the gaming environment and game layer, the interface 3905 may show the user 3935 who has had his or her SOV destroyed within the gaming environment or a claim has been processed, which may increase the score of the current user (i.e., the score shown in user score indicator 3910). In addition, the user may target and destroy additional SOVs along the price-based navigation route with the gaming environment.

FIG. 40 illustrates a configuration module 4000 in accordance with implementations of various techniques described herein, where the configuration module 4000 may be used to record one or more vehicle specifications for a user participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration module 4000 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 4010. The user interface 4010 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 4010 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units for claim price-based navigation.

The configuration module 4000 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 4010: a litigation or patent claim geolocation unit model make heading 4015; a litigation or patent claim geolocation unit model type heading 4025; a litigation or patent claim geolocation unit model year heading 4035; a system menu toggle button 4051; a litigation or patent claim geolocation unit model fuel type heading 4045; a litigation or patent claim geolocation unit model make selection box 4020; a litigation or patent claim geolocation unit model type selection box 4030; a litigation or patent claim geolocation unit model year selection box 4040; and/or a litigation or patent claim geolocation unit model fuel type selection box 4050.

In some embodiments, the configuration module 4000 may allow the user to record vehicle specifications for the user's vehicle, which may allow the user to participate, transact, and/or trade in transformed litigation and patent geolocation unit auctions, as described above. The vehicle specifications may include model make, model type, model year, model fuel type, and/or any other specification known to those skilled in the art. Further, those skilled in the art will understand that the vehicle specifications are not limited to those shown in FIG. 40.

In one implementation, the user may select a model make for the vehicle under the model make heading 4015, such as, for example, by selecting the model make selection box 4020 to indicate that the vehicle is an Acura. Similarly, the user may select a model type for the vehicle under the model type heading 4025 by selecting the model type selection box 4030, may select a model year for the vehicle under the model year heading 4035 by selecting the model year selection box 4040, and may select a model fuel type for the vehicle under the model fuel type heading 4045 by selecting the model fuel type selection box 4050.

In addition, the implementations described herein may be used to perform a data transformation with respect to a litigation or patent claim geolocation unit or security, such that one or more of the selected vehicle specifications (e.g., model make, model type, model year, model fuel type, and/or the like) may be linked to create specification pools. With respect to the transformed litigation and patent geolocation unit auctions described herein, the combinations of similar selected vehicle specifications may be fungible or substitutable when participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. In other implementations, specifications relating to transformed litigation or patent claim geolocation units or securities for travel by bus, subway, train, air, private automobile, and/or other transportation modes may similarly be substitutable. In particular, broad specifications of the transformed transportation or security pool may be substitutable, provided that the broad transformed specifications are met for delivery within the transformed litigation or patent claim geolocation unit or security pool.

FIG. 41 illustrates a configuration module 4100 in accordance with implementations of various techniques described herein, where the configuration module 4100 may be used to record rider or driver litigation or patent claim geolocation unit specification ratings for a user participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration module 4100 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 4110. The user interface 4110 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 4110 may be used to display implementations which utilize a multi-layered network node topology for a forward market of litigation or patent geolocation claim units for claim price-based navigation.

The configuration module 4100 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 4110: a menu toggle button 4115; a rider litigation or patent claim geolocation unit rating category heading 4120; a rider litigation or patent claim geolocation unit rating label 4125; a rider litigation or patent claim geolocation unit rating X logo amount 4126; a rider litigation or patent claim geolocation unit rating score 4130 for a navigation route; a rider litigation or patent claim geolocation unit rating lifetime score 4135; a rider litigation or patent claim geolocation unit SOV kills count 4140; a rider litigation or patent claim geolocation unit settlements count 4145; a rider litigation or patent claim geolocation unit ride safety score 4146; a driver litigation or patent claim geolocation unit rating category heading 4150; a driver litigation or patent claim geolocation unit rating label 4155; a driver litigation or patent claim geolocation unit rating X logo amount 4180; a driver litigation or patent claim geolocation unit rating score 4160 for a navigation route; a driver litigation or patent claim geolocation unit rating lifetime score 4165; a driver litigation or patent claim geolocation unit SOV kills 4170; a driver litigation or patent claim geolocation unit settlements count 4175; and/or a driver litigation or patent claim geolocation unit ride safety score 4185.

In some implementations one or more elements of the configuration module 4100 may be used to account for user actions in the gaming configurations and market configurations mentioned above for use in participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions.

FIG. 42 illustrates a market configuration module 4200 in accordance with implementations of various techniques described herein, where the configuration module 4200 may be used to display and/or implement the rider or driver transformed litigation or patent claim geolocation unit or security specifications and the market framework for the transformation for a specified plurality of routes. Further, the configuration module 4200 may be used for participating, transacting, and/or trading in transformed litigation and patent geolocation unit auctions. The litigation or patent geolocation claim unit security may be the same as those discussed above.

The configuration module 4200 may be implemented using the computing device (e.g., mobile computing device) mentioned above, where the device may include a user interface 4205. The user interface 4205 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 4205 may be used to display implementations which utilize a multi-layered network node topology for a forward market of litigation or patent geolocation claim units. Further, the transformed litigation or patent geolocation claim unit market auction, as described in implementations disclosed herein, may be fully functional as a layer in map routing software or as a stand-alone application.

The market configuration module 4200 may display and/or include one or more of the following elements, at least some of which may be implemented via the interface 4205: a primary price-based navigation route 4211 of a transformed litigation or patent claim geolocation unit or security; a secondary price-based navigation route 4231 of a transformed litigation or patent claim geolocation unit or security; an estimated time 4210 of the primary route 4211; one or more market prices 4233 of a buyer and seller of the primary route 4211; an estimated time 4212 of the secondary routes 4231; one or more market prices 4230 of a claim buyer and seller of the secondary route 4231; a claim starting point virtual hub 4206 of the routes 4211, 4231; an ending point virtual hub 4232 of the routes 4211, 4231; location information 4213 for a claim ending point and a starting point address of the virtual hubs for the claim routes 4211, 4231; and/or a date and time specification button 4229 for the routes 4211, 4231.

The market configuration module 4200 may also display and/or include one or more of the following elements, at least some of which may be implemented via the interface 4205: a number or quantity 4215 of offers to buy/bids by riders for transformed litigation or patent claim geolocation units or securities corresponding to the secondary route 4231, where the offers to buy/bids are displayed first in a rider queue that is indexed by highest price; a price 4214 for offers to buy/bids by riders for transformed litigation or patent claim geolocation units or securities corresponding to the secondary claim route 4231, where the offers to buy/bids are displayed first in the rider queue that is indexed by highest price; a price 4216 for offers to buy/bids by riders for transformed litigation or patent claim geolocation units or securities corresponding to the secondary route 4231, where the offers to buy/bids are displayed second in the rider queue that is indexed by highest price; and/or a number or quantity 4217 of offers to buy/bids by riders for transformed litigation or patent claim geolocation units or securities corresponding to the secondary route 4231, where the offers to buy/bids are displayed second in a rider queue that is indexed by highest price.

The market configuration module 4200 may further display and/or include one or more of the following elements, at least some of which may be implemented via the interface 4205: a number or quantity 4226 of offers to sell by drivers for transformed litigation or patent claim geolocation units or securities corresponding to the secondary route 4231, where the offers to sell are displayed first in a driver queue that is indexed by lowest price; a price 4228 for offers to sell by drivers for transformed litigation or patent claim geolocation units or securities corresponding to the secondary claim route 4231, where the offers to sell are displayed first in the driver queue that is indexed by lowest price; a number or quantity 4224 of offers to sell by drivers for transformed litigation or patent claim geolocation units or securities corresponding to the secondary claim route 4231, where the offers to sell are displayed second in the driver queue that is indexed by lowest price; and/or a price 4225 for offers to sell by drivers for transformed litigation or patent claim geolocation units or securities corresponding to the secondary claim route 4231, where the offers to sell are displayed second in the driver queue that is indexed by lowest price.

The market configuration module 4200 may additionally display and/or include one or more of the following elements, at least some of which may be implemented via the interface 4205: an order entry submit button 4218 configured to submit a user order; information 4223 for an order by a driver to sell a specified quantity of transformed litigation or patent claim geolocation units or securities; an order confirmation 4222 for an order by the driver, where the confirmation indicates the driver sold two units of transformed litigation or patent claim geolocation units or securities; a market view button 4222, where the market view button 4222 may be used to display a claim price-based navigation layer with indexed prices for one or more routes between two virtual hubs; a game view layer button 4220 for the transformed litigation or patent claim geolocation units or securities; and/or a navigation view layer button 4219 for the transformed litigation or patent claim geolocation units or securities.

As noted above with respect to FIG. 40, a user of one or more configurations (e.g., configuration module 4000) described herein may be used to record vehicle specifications for the user's vehicle. For example, as described above with respect to FIG. 40, the user may select a model make for the vehicle under the model make heading 4015, such as, for example, by selecting the model make selection box 4020 to indicate that the vehicle is an Acura. Returning to FIG. 42, in some implementations, the user's vehicle may be assigned to one or more specification pools, where each specification pool may represent an aggregate of participants or units with a similar selected vehicle specification. In other implementations, the user may be assigned to one or more specification pools, where each specification pool may represent an aggregate of participants with a similar selected specification.

The market configuration module 4200 may then be used to display one or more user-selected navigation routes (e.g., routes 4211, 4231) between the claim starting point virtual hub 4206 and the ending point virtual hub 4232. The market configuration module 4200 may also display one or more prices associated with the one or more user-selected claim navigation routes. For example, the market configuration module 4200 may display the one or more market prices 4230 for the claim secondary route 4231, where the one or more market prices 4230 may correspond to a buy price from the highest bidder or rider for the claim route 4231.

Further details pertaining to the one or more market prices 4230 may be displayed in the market configuration module 4200, such as in a rider queue display in the module 4200. In particular, as shown in FIG. 42, the price 4214 may correspond to the highest bid price by a rider for the route 4231, where the price 4214 may have an associated quantity 4215 of transformed litigation or patent claim geolocation units or securities. Similarly, as shown in FIG. 42, the price 4228 may correspond to the lowest offer or sale price by a driver for the route 4231, where the price 4228 may have an associated quantity 4226 of transformed litigation or patent claim geolocation units or securities. In some implementations, the quantity 4215 of offers to buy/bids by riders for transformed litigation or patent claim geolocation units or securities corresponding to the secondary route 4231 may represent one or more units. As shown in FIG. 42, the quantity 4215 may include three units, which may represent 1-3 claim investors who desire to purchase the transformed litigation or patent claim geolocation units or securities for the route 4231. As also shown in FIG. 42, the indexed price 4214 may be queued to the top based on a highest price index and time stamp for a given specification of a transformed litigation or patent claim geolocation unit or security.

In some implementations, the offers to buy/bids by buyers and offers to sell by sellers may be for transformed litigation or patent claim geolocation units or securities having one or more specific specification, attributes, and/or the like. In such implementations, these transformed litigation or patent claim geolocation units or securities may represent a pool of transformed litigation or patent claim geolocation units or securities for a user-selected route having one or more similar specifications, attributes, and/or the like. These one or more specifications, attributes, and/or the like may include one or more of the following: vehicle mode make, vehicle mode model type, vehicle model year, cheapest claim, single claim mode, multi claim modal, fastest claim pay, most probable claim pay, highest claim rating, most available claim, highest volume claim, most frequent, service level, security and safety, group restricted, modes, automobile, air, autonomous vehicle, bike, boat, bus, drone, limo, home, business, legal entity, motorcycle, moped, shuttle, spaceship, subway, taxi, train, fastest optimized, cheapest route, packages, cargo, virtual, order types, term specification, timing specification, virtual hub end point and start point, and/or a plurality of other specifications, attributes, and/or the like.

In some implementations, the market configuration module 4200 may be used to match a buyer with a seller for a transformed litigation or patent claim geolocation unit or security in instances where the rider's offer is the highest price 4214 in the buyer queue, the seller's offer is the lowest price 4228 in the driver queue, and the price 4214 is equal to the price 4228. In a further implementation, if no such match of prices occur between the driver and rider queues for a given specification of a transformed litigation or patent claim geolocation unit or security, then the prices/offers may remain in the queues until a match or a new order entry re-indexes the order of all the deals. For example, the rider queue may be re-indexed if a newly-offered price is higher than the current highest bid price 4214. In another example, the buyer queue may be re-indexed after an order has been placed, with the rider queue being indexed and ranked such that a highest rider price is placed at the top of the queue and the remaining rider prices are displayed in descending order based on price and then based on time of order entry with all other things being equal. The seller price queue may be similarly indexed and ranked such that a lowest driver offer/price 4228 is placed at the top of the queue and the remaining driver prices are displayed in ascending order based on price and then based on time of order entry with all other things being equal (e.g., for a given pool specification of transformed litigation or patent claim geolocation units or securities).

In some implementations, the plurality of claim routes (e.g., 4231 and 4211) may be displayed as price-based navigation options that are indexed by market pricing. The user may select one or more routes (e.g., one, two, three, and so forth) to be displayed as options between their virtual hubs in order to perform calculations that may maximize the number of litigation or patent claim geolocation units or securities they sell for a given claim route specification data blockchain, the prices they may obtain, and/or any combination of other specifications or objectives.

FIG. 43 illustrates a flow diagram of a method 4300 in accordance with implementations of various techniques described herein, where the method 4300 may be used for participating in, transacting, and/or trading transformed litigation or patent geolocation claim unit or securities between virtual hub combinations. In one implementation, method 4300 may be at least partially performed by a computing system, such as the computing system implementations discussed herein. In particular, the computing system may include one or more of the following: a computing device, a mobile or portable multifunction device, a fixed computing device, a computing device with a touchscreen, a computing device without a touchscreen, an augmented, audio interface computing device, a computing device with a mixed reality non-screen display, and/or any other computing system or device known to those skilled in the art. It should be understood that while method 4300 indicates a particular order of execution of operations, in some implementations, certain portions of the operations might be executed in a different order. Further, in some implementations, additional operations or steps may be added to the method 4300. Likewise, some operations or steps may be omitted.

In one implementation, the method 4300 may correspond to a user experience during a transformed litigation or patent claim geolocation unit or security life cycle. At 4301, the user may login to the computing system, where the user may be similar to the user 110 described above. At 4302, the user may be required to go to a plurality of menu options. At 4311, the user may provide inputs relating to an origin and destination of virtual hubs, and, at 4312, the user may provide inputs relating to time and date for a given specification for the transformed litigation or patent claim geolocation unit or security.

In a further implementation, the specification for the transformed litigation or patent claim geolocation unit or security for a particular route may include one or more of the following specifications, attributes, and/or the like, as specified by the user: vehicle mode make, vehicle mode model type, vehicle model year, cheapest claim, single claim mode, multi claim modal, fastest route, most scenic, highest rating, most available, highest volume, most frequent, service level, security and safety, group restricted, modes, automobile, air, autonomous vehicle, bike, boat, bus, drone, limo, motorcycle, moped, shuttle, spaceship, subway, taxi, train, fastest optimized, cheapest claim, packages, cargo, virtual, order types, term specification, timing specification, virtual hub end point and start point, and/or a plurality of other specifications, attributes, and/or the like. At 4313, the user may save a route to the “My Claims” section of the computing system. At 4314, the user may save a route to the “Add My Claims” section of the computing system. In some implementations, the user's route may be saved at 4313 and/or 4314 in the computing system for one touch retrieval in the future.

At 4303, the user may enter a price or quantity to buy or sell the transformed litigation or patent claim geolocation unit or security for a given specification or specification combination. At 4304, one or more steps may be used for the transformation of the litigation or patent claim geolocation unit or security. At 4305, the computing system may perform one or more additional data transformations to process the litigation or patent claim geolocation unit or security, may determine one or more market navigation route options and indexing, may determine one or more virtual hub or virtual hub combination data transformations, may determine one or more litigation or patent claim geolocation unit transformations, and may determine one or more transformed litigation or patent claim geolocation unit combinations and combination specifications.

At 4306, the computing system may determine if a transformed litigation or patent claim geolocation unit or security matches in price and specification (e.g., offers to buy and sell are equally priced). At 4308, if there is a match, then the computing system may begin the delivery process for the transformed litigation or patent claim geolocation unit or security. At 4309, the computing system may continue the delivery process, which may include steps such as electric signal handoff, security checks, 911 system checks, GPS server and user position checks, money laundering checks, litigation or patent claim geolocation unit rating checks, and/or other possible checks for the data elements of the transformed litigation or patent claim geolocation unit or security. The check mentioned herein may be used for verification of delivery of the unit or security. At 4307, if the prices of the buyer and seller queue do not match, then the steps described with respect to 4304, 4305, and 4306 may repeat until a match is made or an order is cancelled before it expires for the transformed litigation or patent claim geolocation unit or security.

FIG. 44 illustrates a configuration module 4400 in accordance with implementations of various techniques described herein, where the configuration module 4400 may be used to for accessing one or more functions associated with the My Claims implementations mentioned above. In particular, as mentioned above, a computing system may be used to select, store, and/or edit a user's preferred claims, which may be referred to as My Claims, for more efficient access to litigation or patent geolocation claim unit markets over various modes and specifications of transportation capacity.

The configuration module 4400 may be implemented using a computing device (e.g., the mobile computing device mentioned above), where the device may include a user interface 4410. The user interface 4410 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 4410 may be used to display implementations which utilize a multi-layered network node topology for a forward market of litigation or patent geolocation claim units for claim price-based navigation.

As shown in FIG. 44, the user interface 4410 may display a My Claims Community heading 4411. The user interface 4410 may also display a menu option button 4451 configured to allow the user to access other areas of the method and system implemented on the computing device. In one implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more MSP claims may be represented as an object via the interface 4410 with a metadata tag #MSP_Claim 4412. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #MSP_Claim 4412 tag may have an associated option button 4426 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #MSP_Claim 4412 tag. In some implementations, the associated option button 4426 may indicate a number of followers or network members who have joined the associated community, which is shown to be 502,000 in FIG. 44.

In another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more automobile claims may be represented as an object via the interface 4410 with a metadata tag #AutoClaims 4413. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #AutoClaims 4413 tag may have an associated option button 4427 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #AutoClaims 4413 tag. In some implementations, the associated option button 4427 may indicate a number of followers or network members who have joined the associated community, which is shown to be 100,000 in FIG. 44

In another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more workman's compensation claims may be represented as an object via the interface 4410 with a metadata tag #WorkmanComp 4414. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #WorkmanComp 4414 tag may have an associated option button 4428 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #WorkmanComp 4414 tag. In some implementations, the associated option button 4428 may indicate a number of followers or network members who have joined the associated community, which is shown to be 42,000 in FIG. 44.

In another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more motorcycle claims may be represented as an object via the interface 4410 with a metadata tag #MotorcycleClaims 4415. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #MotorcycleClaims 4415 tag may have an associated option button 4429 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #MotorcycleClaims 4415 tag. In some implementations, the associated option button 4429 may indicate a number of followers or network members who have joined the associated community, which is shown to be 15,000 in FIG. 44.

In yet another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more corporate claims may be represented as an object via the interface 4410 with a metadata tag #CorporateClaims 4416. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #CorporateClaims 4416 tag may have an associated option button 4430 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #CorporateClaims 4416 tag. In some implementations, the associated option button 4430 may indicate a number of followers or network members who have joined the associated community, which is shown to be 3,000 in FIG. 44.

In yet another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more Pacific Gas and Electric Company (PG&E) fire claims may be represented as an object via the interface 4410 with a metadata tag #PGE_fireClaims 4417. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #PGE_fireClaims 4417 tag may have an associated option button 4431 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #PGE_fireClaims 4417 tag. In some implementations, the associated option button 4431 may indicate a number of followers or network members who have joined the associated community, which is shown to be 1,000 in FIG. 44.

In another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more wrongful death claims may be represented as an object via the interface 4410 with a metadata tag #WrongfulDeath 4418. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #WrongfulDeath 4418 tag may have an associated option button 4432 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #WrongfulDeath 4418 tag. In some implementations, the associated option button 4432 may indicate a number of followers or network members who have joined the associated community, which is shown to be 380,000 in FIG. 44.

In yet another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more mesothelioma claims may be represented as an object via the interface 4410 with a metadata tag #MesotheliomaClaims 4419. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #MesotheliomaClaims 4419 tag may have an associated option button 4433 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #MesotheliomaClaims 4419 tag. In some implementations, the associated option button 4433 may indicate a number of followers or network members who have joined the associated community, which is shown to be 400,000 in FIG. 44.

In another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more personal injury claims may be represented as an object via the interface 4410 with a metadata tag #PersonalInjury 4420. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #PersonalInjury 4420 tag may have an associated option button 4434 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #PersonalInjury 4420 tag. In some implementations, the associated option button 4434 may indicate a number of followers or network members who have joined the associated community, which is shown to be 380,000 in FIG. 44.

In yet another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more Allergan claims may be represented as an object via the interface 4410 with a metadata tag #Allergan 4421. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #Allergan 4421 tag may have an associated option button 4435 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #Allergan 4421 tag. In some implementations, the associated option button 4435 may indicate a number of followers or network members who have joined the associated community, which is shown to be 19,000 in FIG. 44.

In another implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more Merck claims may be represented as an object via the interface 4410 with a metadata tag #Merck 4422. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #Merck 4422 tag may have an associated option button 4436 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #Merck 4422 tag. In some implementations, the associated option button 4436 may indicate a number of followers or network members who have joined the associated community, which is shown to be 100,000 in FIG. 44.

In some implementations, the computing system may recommend one or more virtual litigation or patent geolocation claim unit hub sequences to the user, which may be displayed via the interface 4410 under a My Claims To Follow Recommended heading 4423. In one such implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more claims involving Aranesp by Amgen may be represented as an object via the interface 4410 with a metadata tag #AranespAmgen 4424. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #AranespAmgen 4424 tag may have an associated option button 4437 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #AranespAmgen 4424 tag. In some implementations, the associated option button 4437 may indicate a number of followers or network members who have joined the associated community, which is shown to be 89,000 in FIG. 44.

In another such implementation, a virtual litigation or patent geolocation claim unit hub sequence representing one or more claims involving Xarelto by Johnson & Johnson may be represented as an object via the interface 4410 with a metadata tag #XareltoJ&J 4425. In a further implementation, the virtual litigation or patent geolocation claim unit hub sequence having the #XareltoJ&J 4425 tag may have an associated option button 4438 configured to allow the user to follow, join, subscribe to, or add an online community (which may be represented by a community object transformed data structure within the computing system) associated with the virtual litigation or patent geolocation claim unit hub sequence having the #XareltoJ&J 4425 tag. In some implementations, the associated option button 4438 may indicate a number of followers or network members who have joined the associated community, which is shown to be 39,000 in FIG. 44.

FIG. 45 illustrates a configuration module 4500 in accordance with implementations of various techniques described herein, where the configuration module 4500 may be used to display and/or choose options for a virtual litigation or patent geolocation claim unit hub sequence with an associated online community (which may be represented by a community object transformed data structure within the computing system).

The configuration module 4500 may be implemented using a computing device (e.g., the mobile computing device mentioned above), where the device may include a user interface 4510. The user interface 4510 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 4510 may be used to display implementations which utilize a multi-layered network node topology for forward market or securities market of litigation or patent geolocation claim units for price-based navigation.

As shown in FIG. 45, the user interface 4510 may display a My Claim Communities heading 4515. The user interface 4510 may display one or more options for a particular virtual hub sequence, such as the transformed data structure of a transformed community virtual litigation or patent geolocation claim unit hub sequence representing one or more Pfizer claims with a metadata tag #Pfizer 4520.

As shown, the interface 4510 may display long form claim details relating to the particular virtual hub sequence (e.g., the virtual litigation or patent geolocation claim unit hub sequence having the #Pfizer tag) in the About This Claim section 4522. Further, the interface 4510 may display an option to follow button 4560 the online community associated with the virtual litigation or patent geolocation claim unit hub sequence, where the button 4560 may also indicate a number of followers or network members who have joined the associated community. In addition, the interface 4510 may display a share button 4555, where the button 4555 may allow the user to share the associated community group to others via another social network, text, email, and/or other network protocol. The interface 4510 may also display a public button 4550 and a private button 4545, which may be used to change the privacy settings for the associated online community. Additionally, the interface 4510 may display a buy/sell button 4540, which may be used to provide a gateway to buy or sell litigation or patent claim geolocation units corresponding to the virtual litigation or patent geolocation claim unit hub sequence.

The interface 4510 may also display address information 4535 relating to a virtual hub litigation or patent geolocation claim unit pick up location and address information 4530 relating to a virtual hub drop off litigation or patent geolocation claim unit location for the virtual litigation or patent geolocation claim unit hub sequence. The interface 4510 may further display activity information 4525 relating to statistics and data for the virtual litigation or patent geolocation claim unit hub sequence and/or its associated online community, such as statistics and data relating to the number of riders, number of claims, number of defendants, number of plaintiffs, number of drivers, number of seats, number of trades, frequency of litigation or patent claim geolocation units, volume of litigation or patent claim geolocation units, daily high price for litigation or patent claim geolocation units, daily low price for litigation or patent claim geolocation units for the virtual litigation or patent geolocation claim unit hub sequence community object, yearly high price, yearly low price, news, research, trending, feeds for the virtual hub sequence, and/or the like.

FIG. 46 illustrates a configuration module 4600 in accordance with implementations of various techniques described herein, where the configuration module 4600 may be used to transform virtual litigation or patent geolocation claim unit hub sequences with two virtual hubs into virtual litigation or patent geolocation claim unit hub sequences with more than two virtual hubs. In particular, the virtual litigation or patent geolocation claim unit hub sequences with more than two virtual hubs may be composed of two or more series of virtual litigation or patent geolocation claim unit hub sequences.

The configuration module 4600 may be implemented using a computing device (e.g., the mobile computing device mentioned above), where the device may include a user interface 4610. The user interface 4610 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 4610 may be used to display implementations which utilize a multi-layered network node topology for forward market of litigation or patent geolocation claim units for claim price-based navigation.

As shown in FIG. 46, the user interface 4610 may display a My Claim Sequences heading 4615. In one implementation, the interface 4610 may display a multi-leg virtual litigation or patent geolocation claim unit hub sequence 4620 representing an origin virtual hub claim sequence of CVS claims (with a metadata tag #CVS) followed by a secondary sequence of opioid claims (with a metadata tag #Opiods). Multi-leg virtual hub sequences may allow for the linking of villages, cities or states using a network litigation or patent geolocation claim unit topology structure for multiple providers of litigation or patent claim geolocation units, which may provide higher levels of frequency and market opportunity to link public and private systems. In a further implementation, the multi-leg virtual litigation or patent geolocation claim unit hub sequence 4620 having the #CVS #Opiods tags may have an associated option button 4680 configured to allow users to join, follow, subscribe to, or become a member of an online community (which may be represented by a community object transformed data structure within the computing system) associated with the multi-leg virtual litigation or patent geolocation claim unit hub sequence 4620, which may help to alleviate potential data collection issues within claim processing systems.

In another implementation, the interface 4610 may display a multi-leg virtual litigation or patent geolocation claim unit hub sequence 4625 representing an origin virtual hub claim sequence of statin claims (with a metadata tag #Statin) followed by a secondary sequence of Walgreens claims (with a metadata tag #Walgreens). In such an implementation, the multi-leg virtual litigation or patent geolocation claim unit hub sequence 4625 may allow for a litigation or patent claim geolocation unit seller or buyer to connect two disparate insurance or data or litigation or patent geolocation claim unit networks to provide data gap detail at the lowest market cost, because each leg or series of virtual litigation or patent geolocation claim unit hub sequences may have an independent market associated with the leg or virtual hub sequence. In a further implementation, the multi-leg virtual litigation or patent geolocation claim unit hub sequence 4625 having the #Statin #Walgreens tags may have an associated option button 4675 configured to allow users to join, follow, subscribe to, or become a member of an online community (which may be represented by a community object transformed data structure within the computing system) associated with the multi-leg virtual litigation or patent geolocation claim unit hub sequence 4625, which may help to alleviate potential data gap issues within claim processing and court systems.

In a further implementation, the configuration module 4600 may be used to transform virtual litigation or patent geolocation claim unit hub sequences composed of three or more series of virtual litigation or patent geolocation claim unit hub sequences. In one such implementation, the interface 4610 may display a multi-leg virtual litigation or patent geolocation claim unit hub sequence 4635 representing an origin virtual hub claim sequence of Xarelto claims (with a metadata tag #Xarelto), followed by a sequence of Remicade claims (with a metadata tag #Remicade), and followed by a sequence of Johnson & Johnson claims (with a metadata tag #JohnsonJohnson). In particular, a user may use a litigation or patent claim geolocation unit for the initial sequence with tag #Xarelto, uses another litigation or patent claim geolocation unit for the sequence with tag #Remicade, and then uses yet another litigation or patent claim geolocation unit for the sequence with tag #JohnsonJohnson. The multi-leg virtual litigation or patent geolocation claim unit hub sequence 4635 may help to alleviate data gap issues. In particular, multi-leg virtual litigation or patent geolocation claim unit hub sequence 4635 and the associated sequence community object transformation may help users understand options and piece multiple claim systems onto a single community based object to aggregate communication and transaction benefits of the system.

In some implementations, computing system may use prior history navigation searches and locations to build recommended additional multi-leg virtual litigation or patent geolocation claim unit hub sequences to the user, which may be displayed via the interface 4610 under a My Claims Sequences To Follow Recommended heading 4640. In one such implementation, the computing system may recommend a multi-leg virtual hub route sequence composed of four or more virtual hub sequences, combinations of already linked virtual hub sequences, and/or the like. For example, as shown in FIG. 46, the interface 4610 may display a multi-leg virtual litigation or patent geolocation claim unit hub sequence 4645, which may be similar to the sequence 4635 with the additional sequence of CVS in Houston, Tex. to a Purdue Pharma claim in Houston, Tex. (with metadata tags #CVS, #PurduePharma, and #DrFeelGood). The multi-leg virtual litigation or patent geolocation claim unit hub sequence 4645 may help to provide a data gap sequence to a user on the system. In a further implementation, the multi-leg virtual litigation or patent geolocation claim unit hub sequence 4645 may have an associated option button 4660 configured to allow users to join, follow, subscribe to, or become a member of an online community (which may be represented by a community object transformed data structure within the computing system) associated with the multi-leg virtual litigation or patent geolocation claim unit hub sequence 4645.

In another example, as shown in FIG. 46, the interface 4610 may display a multi-leg virtual litigation or patent geolocation claim unit hub sequence 4650, which may be similar to the sequence 4620 with the additional sequence of Geikko claims and MSP claims (with metadata tags #Geikko and #MSP_Claim). The multi-leg virtual litigation or patent geolocation claim unit hub sequence 4650 may help to provide a data gap sequence to a system user or insurance company, attorney, beneficiary, or other general use case. In a further implementation, the multi-leg virtual litigation or patent geolocation claim unit hub sequence 4650 may have an associated option button 4655 configured to allow users to join, follow, subscribe to, or become a member of an online community (which may be represented by a community object transformed data structure within the computing system) associated with the multi-leg virtual litigation or patent geolocation claim unit hub sequence 4650.

Traversing a series of linked claims via a multi-leg virtual litigation or patent geolocation claim unit hub sequence may allow for the cost of non-linked claims to be dramatically lower due to using a series of connected local systems, as the private systems may be more expensive and potentially do not communicate or share data. The transformed virtual hub sequence methodology may allow for claims systems to be integrated in ways that were not formerly possible because the systems were disparate or simply did not allow for linked claims or linked community objects that could optimize topological network structures over existing inefficient structures.

FIG. 47 illustrates a menu options configuration 4700 in accordance with implementations of various techniques described herein, where the menu options configuration 4700 may be used to display one or more menu options for use with the implementations and configurations described herein.

The menu options configuration 4700 may be implemented using a computing device (e.g., the mobile computing device mentioned above), where the device may include a user interface 4710. The user interface 4710 may be a GUI or any other user interface known to those skilled in the art. Further, the computing device may be voice-enabled device, a screen-enabled device, a non-screen enabled device, or any computing device known to those skilled in the art. In particular, the interface 4710 may be used to display implementations which utilize a multi-layered network node topology for a forward market of litigation or patent geolocation claim units for price-based navigation.

The menu options configuration 4700 may include a buy/sell/trade option 4716, which may be configured to allow the user to access the litigation or patent claim geolocation unit gateway trading platform for virtual hub litigation or patent geolocation claim unit combinations and virtual hub sequences. The menu options configuration 4700 may include a search option 4717, which may be configured to allow the user to access a search module for claim price based search or claim selection based on cost or earnings from a claim, as described in: a) U.S. patent application Ser. No. 16/242,967, “Price Based Navigation,” filed Jan. 8, 2019, the entirety of which is incorporated by reference herein; and b) U.S. patent application Ser. No. 15/877,393, “Electronic Forward Market Exchange for Transportation Seats and Capacity in Transportation Spaces and Vehicles,” filed Jan. 23, 2018, the entirety of which is incorporated by reference herein.

The menu options configuration 4700 may also include a My Claims or My Subjects option 4718, which may be configured to allow the user to access claims that are associated to their user profile or behavior and may be stored in the network member database. The menu options configuration 4700 may also include a schedule option 4719, which may be configured to allow the user to access a schedule status or delivery view. The menu options configuration 4700 may also include an orders option 4720, which may be configured to allow the user to cancel or adjust orders in the system that are unfilled. The menu options configuration 4700 may also include an accounts option 4721 to allow the user to toggle to an account page, a communities option 4722 to allow the user to toggle to a communities object page, and/or a claim or time sequences option 4723 to allow the user to toggle to a claim or time sequences page.

Further, the menu options configuration 4700 may include an additional hubs option 4724 to allow the user to add additional hubs or may include a gaming option 4725 to allow the user to a litigation or patent geolocation claim unit gaming interface. In addition, the menu options configuration 4700 may also include a package scanner option 4726 to allow the user to scan freight litigation or patent claim geolocation units. Additionally, the menu options configuration 4700 may also include a reward program option 4727 to allow users to access a reward and may include a dashboard option 4728 to allow users to access a dashboard module. The menu options configuration 4700 may also include a music option 4729 and a shop option 4730. Further, the menu options configuration 4700 may include a help option 4731 and/or a settings option 4732 to allow the user to update account information or privacy settings. In addition, the menu options configuration 4700 may include an invite friends option 4733 to allow the user to earn rewards, bonuses, cash, or credits. The menu options configuration 4700 may also include a logout option 4734 to allow the user to log out of the system.

FIG. 48 illustrates a network configuration 4800 in accordance with implementations of various techniques described herein. The network configuration 4800 may correspond to a network architecture of a typical litigation or patent claim geolocation unit object with a price-time priority queue and resulting delivery sequence and integration with the litigation or patent claim geolocation unit linked virtual community object. In some embodiments, the multi-layered network node topology of participating, transacting, and/or trading transformed litigation or patent claim geolocation units or securities for litigation or patent claim geolocation unit community linked objects 4800 includes the following elements, or a subset or superset thereof:

exemplary litigation or patent claim geolocation unit community object waypoint origin 4801;

exemplary litigation or patent claim geolocation unit community object waypoint destination 4802;

exemplary litigation or patent claim geolocation unit community object during transit 4803;

exemplary litigation or patent claim geolocation unit community object 4840 to which a user may subscribe, join, friend, follow, and/or the like;

exemplary litigation or patent claim geolocation unit storage unit 4804 at a litigation or patent claim geolocation unit community waypoint origin;

exemplary technology storage security device 4805 which electronically locks or unlocks the litigation or patent claim geolocation unit community object for claims at waypoint origin;

exemplary litigation or patent claim geolocation unit community object user 4806 at waypoint origin;

exemplary litigation or patent claim geolocation unit community object unit in the form of a claim 4807 at the litigation or patent claim geolocation unit community waypoint origin;

exemplary litigation or patent claim geolocation unit community object unit in the form of a computing device 4808 at the litigation or patent claim geolocation unit community waypoint origin;

exemplary storage security device 4809 which electronically locks or unlocks the litigation or patent claim geolocation unit community object for transport at destination litigation or patent claim geolocation unit waypoint;

exemplary litigation or patent claim geolocation unit community object user 4810 at waypoint destination;

exemplary litigation or patent claim geolocation unit community delivery computing device 4811 for electronic confirmation of arrival at waypoint destination for litigation or patent claim geolocation unit community unit;

exemplary litigation or patent claim geolocation unit community unit transport vehicle 4816 in transit between origin and destination waypoint;

exemplary litigation or patent claim geolocation unit community unit 4815 in transit between origin and destination waypoint;

exemplary litigation or patent claim geolocation unit community unit transport driver 4814 in transit between origin and destination waypoint;

exemplary litigation or patent claim geolocation unit community unit transport mobile computer device method and system interface 4813 in transit between origin and destination waypoint;

exemplary litigation or patent claim geolocation unit community unit transport mobile computer device method and system security interface 4812 in transit between origin and destination waypoint;

exemplary litigation or patent claim geolocation unit community object tag 4817 between origin and destination waypoint(s) for a specified litigation or patent geolocation claim unit community object;

exemplary litigation or patent claim geolocation unit community linked transport unit user 4818 at origin waypoint;

exemplary litigation or patent claim geolocation unit community linked virtual claim object 4828;

exemplary litigation or patent claim geolocation unit community linked claim user 4830;

exemplary litigation or patent claim geolocation unit community linked object origin waypoint 4819 with users and litigation or patent geolocation claim units;

exemplary litigation or patent claim geolocation unit community linked object destination waypoint 4826 with users and litigation or patent claim geolocation units;

exemplary litigation or patent claim geolocation unit community linked object unit claim vehicles on an exemplary waypoint combination 4833, 4832, 4831, 4829, 4820, 4821, 4822, 4823, 4824, 4825.

In some embodiments, users 4806, 4810, 4814, 4818, 4830, 4819, 4826 may follow, subscribe, or friend a litigation or patent claim geolocation unit community linked virtual route or claim route 4828 for a particular litigation or patent claim geolocation unit 4817, such as an MSP workman's compensation claim and/or the like. In some embodiments, the litigation or patent claim geolocation unit community linked litigation or patent claim geolocation unit attribute specification unit 4817 may correspond to drug claims, personal injury claims, business claims, open air lot claims, covered lot claims, assigned spot claims, street claims, handicapped claims, work claims, school claims, private home claims, private garage claims, claims with an electric charge, large vehicle, and/or a plurality of other claim types. In some embodiments, the litigation or patent claim geolocation unit community linked unit 4817 may correspond to trucks 4808, cars 4807, and/or other vehicle types or litigation or patent claim geolocation unit types. In some embodiments, the litigation or patent claim geolocation unit community linked claim unit user 4806 may be a community member who owns litigation or patent claim geolocation unit inventory 4807 at a waypoint origin 4819 and desires to participate or transact in the price-time priority queue for a certain litigation or patent claim geolocation unit 4807 on a waypoint sequence 4819, 4826 or 4801, 4802.

In one implementation, the litigation or patent claim geolocation unit community linked transport unit user may be an end consumer, restaurant, hotel, carpenter, and/or other end user 4810 who desires to participate in the price-time priority queue for certain litigation or patent claim geolocation units 4807, 4808. In some implementations, the end user 4810 or origin owner 4806 of the litigation or patent claim geolocation unit community linked object with waypoints 4804 may use a mobile, fixed, visual, or audio interface computer unit 4813 to enter price-time priority queue based transactions for litigation or patent claim geolocation units 4807, 4808, 4819, 4826, 4815 along a litigation or patent claim geolocation unit community linked waypoint combination path 4827.

In another implementation, litigation or patent claim geolocation unit communities may serve as virtual claim markets with associated price time priority queues and GPS tracking of the litigation or patent claim geolocation unit units through the scanning of litigation or patent claim geolocation units at litigation or patent claim geolocation unit waypoint origin 4801, waypoint destination 4802, or along the waypoint sequence path 4803. In some implementations, the user 4806 may transfer litigation or patent claim geolocation units by using the scan feature of the mobile, fixed, visual, or audio interface computer unit 4813 to a litigation or patent claim geolocation unit community linked claim user 4814 in the litigation or patent claim geolocation unit community linked vehicle 4816 as a security authorized transaction participant 4812 of the price-time priority queue of the litigation or patent claim geolocation unit community linked claim unit 4815. In some embodiments, the litigation or patent claim geolocation unit community linked claim unit 4815 may be delivered to an end user 4810 at an end user destination waypoint 4802 by using the mobile, fixed, visual, or audio interface computer unit 4813 unlock sequence 4809 interface to deliver the litigation or patent claim geolocation unit community linked transport unit 4815 to a secure delivery claim unit. In some embodiments, scanning procedures of the mobile, fixed, visual, or audio interface computer unit 4813 may comprise secure transfer and records or the litigation or patent claim geolocation unit community linked claim unit 4815 for both pickup transfer at the litigation or patent claim geolocation unit community unit object origin 4801, waypoint combination transfer claim 4803, and waypoint destination delivery 4802.

FIG. 48 may be incrementally defined as shown in boxes 4801 and 4802 with reference to U.S. patent application Ser. No. 17/069,597, “Price-Time Priority Queue Routing for Transportation Capacity Units,” filed Oct. 12, 2019, the entirety of which is incorporated by reference herein, with supplemental reference to diagrams from the aforementioned application. In particular, as shown in the incorporated application, y_i, i∈M may be a binary variable with a value of 1 if supplier i is selected. The binary variable may have a value of 0 otherwise. Further, x_ij(i,j) E A may be a binary variable with a value of 1 if arc(i,j) is traversed. The binary variable may have a value of 0 otherwise. In addition, Z_ik,k∈K, i∈M_k, may be a variable representing the number of units of product k purchased by supplier i. Moreover, for any subset V′ of nodes, the following equations may be defined:

δ+(V′):={(i,j)∈A:i∈V′,j∈V′}  (1)

δ−(V′):{(i,j)∈A:i∈V′,j∈V′}  (2).

Further, as shown in the incorporated application, for the price-time priority queue routing:

$\begin{array}{cc}\min \sum _{\left(i,j\right)\in A}^n{c}_{ij}{x}_{ij}\sum _{k\in K}\sum _{i\in M_k}{P}_{ik}{Z}_{ik}:.& \left(3\right)\end{array}$

which may be subject to the following equations, as shown below:

Σ_i∈MkZ_ik=d_k,k∈K  (4)

Z _ik ≤q _ik y _i ,k∈K,i∈M _k  (5)

Σ_{(i,j)∈δ+({h})}x_ij=Σ_{(i,j)∈δ−({h})}x_ij=y_h h∈M  (6)

Σ_{(i,j)∈δ−(M′)}x_ij≥y_h=M′cM,h∈M′  (7)

x _ij∈{0,1},(i,j)∈A  (8)

y _i∈{0,1},i∈M  (9)

z _iik≥0,k∈K,i∈M_k  (10).

In some implementations, the objective function of Equation 3 may be used for the joint minimization of the traveling and purchasing costs. Further, Equation 4 may ensure that each product demand is satisfied. The constraint equations in Equation 5 may impose that each supplier has to visit to purchase a litigation or patent geolocation claim unit product from it and the purchased quantity should not exceed the corresponding availability. The constraints in Equations 6 and 7 may be used to decide the visiting tour feasibility. In particular, Equation 6 may impose that, for each visited supplier, exactly one arc is to enter and leave the relative node. In particular, the price-time priority queue may be used to provide value for each path of an individual node pair. As such, an overall route sequence for a litigation or patent geolocation claim unit, where the sequence may include a transit of people, packages, data, electricity, space and time, virtual transit, and/or the like. The sequence may also be organized by price-time priority queue for value and then aggregated into a complete arc set.

Further, the inequalities of Equation 7 may be connectively constraints that prevent the creation of sub-tours, not including the depot, by imposing that at least one arc must enter each subset M′ of suppliers in which at least one supplier h has visited. In addition, the constraints of Equations 8, 9, and 10 may impose binary and non-negative conditions on variables. In some implementations, no integrality conditions may be required for z variables, even if they actually represent the number of litigation or patent geolocation claim units purchased for each product in each supplier. In some implementations, if all input data are integers, then an optimal solution where all z-variables have integer values may exist.

FIG. 49 illustrates a user interface 4900 in accordance with implementations of various techniques described herein. The user interface 4900 may correspond to a litigation or patent geolocation claim unit community inventory uplink interface used to upload litigation or patent geolocation claim unit community linked transport unit inventory to the litigation or patent geolocation claim unit linked virtual community object. In some implementations, the uplink element of the multi-layered network node topology of participating, transacting, and/or trading transformed litigation or patent geolocation claim unit or securities for litigation or patent geolocation claim unit community linked objects includes the following elements, or a subset or superset thereof:

exemplary litigation or patent geolocation claim unit community object unit uplink interface 4901 for litigation or patent geolocation claim unit inventory automation;

exemplary litigation or patent geolocation claim unit community object unit header interface 4902;

exemplary litigation or patent geolocation claim unit community object unit product type, quantity, specification, price, date and time 4903;

exemplary litigation or patent geolocation claim unit community unit object of specification wireless patent claim 4904 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object of specification neck injury claim 4905 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object of specification opioid claim 4906 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object of a workman's compensation claim 4907 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object of an implant claim 4908 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object of a pedestrian claim 4909 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object of truck accident claim 4911 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object of motorcycle accident claim 4912 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object of a commercial business litigation claim 4913 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object of an employment claim 4914 with a plurality of additional specifications;

exemplary litigation or patent geolocation claim unit community unit object at origin waypoint 4916;

exemplary litigation or patent geolocation claim unit community linked litigation or patent geolocation claim unit attribute specification unit object transfer or bypass waypoint 4917;

exemplary litigation or patent geolocation claim unit community linked litigation or patent geolocation claim unit attribute specification unit object transfer or bypass waypoint 4918;

exemplary litigation or patent geolocation claim unit community linked litigation or patent geolocation claim unit attribute specification unit object destination waypoint 4919 and fixed area delivery litigation or patent geolocation claim unit 4920;

In some implementations, the method and system of litigation or patent geolocation claim unit community linked litigation or patent geolocation claim unit attribute specification units 4916 with litigation or patent geolocation claim unit community linked litigation or patent geolocation claim unit attribute specification price-time priority queues may utilize an uplink module interface 4901 to upload litigation or patent geolocation claim unit inventory to the litigation or patent geolocation claim unit community linked litigation or patent geolocation claim unit attribute specification unit object, which may also be a form of a virtual litigation or patent geolocation claim unit market interface to users of the method and system. In other implementations, the litigation or patent geolocation claim unit may include, but are not limited to, a subset or superset of the following litigation or patent geolocation claim unit examples: wireless patent claim 4904, neck injury claim 4905, opioid claim 4906, workman's compensation claim 4907, implant claim 4908, pedestrian injury claim 4909, truck accident claim 4911, motorcycle accident claim 4912, commercial business litigation claim 4913, employment claim 4914, and/or a plurality of other commercial units common to the litigation market. In addition, the litigation or patent geolocation claim units may include specifications and specification profiles in the specifications to standardize the units in the data transformations of the litigation or patent geolocation claim units 4916. FIG. 49 further may illustrate a system 4900 in accordance with implementations of various techniques described herein and with reference to U.S. patent application Ser. No. 17/069,597, “Price-Time Priority Queue Routing for Transportation Capacity Units,” filed Oct. 12, 2019, the entirety of which is incorporated by reference herein and may also incrementally be described with reference to the aforementioned application diagram figure. In one implementation, an asymmetric litigation or patent geolocation claim unit routing problem with trivial preprocessing may be defined as shown in the incorporated application. In particular, a first trivial preprocessing can be applied:

$\begin{array}{cc}\stackrel{\mathrm{def}}{=}{M}^{*}:=\left\{0\right\}\bigcup \left\{i\in M:\exists k\in K\mathrm{such}\mathrm{that}{\sum }_{j\in M_k/\left\{i\right\}}{q}_{\mathrm{ik}}<d_k\right\}.& \left(11\right)\end{array}$

In particular, the node set shown in Equation 11 may be part of any feasible solution.

Further:

K*:={k∈K:Σ _{i∈M k} q _ik =d _k}  (12),

as the product set for which suppliers' selection and purchasing plan decisions may be predetermined. Thus, the constraints of Equation 9 may be replaced by

y _ti=1 when i∈M*  (13)

and the constraints of Equation 4 may be replaced by:

z _ik =q _ik when k∈K*,i∈M_k  (14).

In some implementations, the formulations may not be implemented through a commercial solver (e.g., solvers available in commercial spreadsheet programs) even for small size instances, since the number of constraints (e.g., Equation 7) may be exponentially larger than the size of M. In particular, the commercial solver may be limited due to one or more of the following reasons: a lack of price-time priority queue input ingest to organize inputs; failure to limit or organize the solution to minimize distance and maximize profit; failure to transform the underlying litigation or patent geolocation claim unit into a form that would work legally or technically with such a queue, in that it has not be unitized or securitized as a homogenous unit; and/or the like. However, there may exist other subtour elimination constraints that yield, expanding the variables subspace, litigation, or patent geolocation claim unit route sequence formulations with one or more polynomial constraints cardinality for compact formulations.

FIG. 50 illustrates a user interface 5000 in accordance with implementations of various techniques described herein. The user interface 5000 may correspond to a litigation or patent geolocation claim unit community search interface used to search for a litigation or patent geolocation claim unit linked to the litigation or patent geolocation claim unit linked virtual community object. In some implementations, the search element of the multi-layered network node topology of participating, transacting, and/or trading transformed litigation or patent geolocation claim unit capacity units or securities for litigation or patent geolocation claim unit community linked objects include the following elements, or a subset or superset thereof:

exemplary litigation or patent geolocation claim unit community unit object search interface 5001 of a mobile, fixed, or audio computer unit;

exemplary litigation or patent geolocation claim unit community unit object search interface title 5003;

exemplary search input interface 5002 for a litigation or patent geolocation claim unit community unit object search;

exemplary litigation or patent geolocation claim unit community unit object category title header 5004, such as litigation or patent geolocation claim unit product, distance to litigation or patent geolocation claim unit, price of transformed litigation or patent geolocation claim unit, availability of transformed litigation or patent geolocation claim unit, and/or a buy option for associated price-time priority queue of transformed litigation or patent geolocation claim unit;

exemplary litigation or patent geolocation claim unit community unit object of a litigation or patent geolocation claim unit specification 5005 corresponding to a counterparty of GEIKKO, having a type of auto claim from the user, at a price of $5.00 in the price-time priority queue, with an immediate availability, and an associated buy now option button 5010;

exemplary litigation or patent geolocation claim unit community unit object of a litigation or patent geolocation claim unit specification 5006 corresponding to a counterparty of Will Smith, a type of workman's compensation claim for a user, at a price of $5.00 in the price-time priority queue, with an immediate availability, and an associated buy now option button 5011;

exemplary litigation or patent geolocation claim unit community unit object of a general liability litigation or patent geolocation claim unit specification 5007 corresponding to a counterparty of SwissRE, for a user at a price of $10.00 in the price-time priority queue, with an immediate availability, and an associated buy now option button 5012;

exemplary litigation or patent geolocation claim unit community unit object of a General RE litigation or patent geolocation claim unit 5008 with a counterparty of General RE user at a price of $5.00 in the price-time priority queue with an immediate availability and an associated buy now option button 5013;

exemplary litigation or patent geolocation claim unit community unit object of an intellectual ventures fund litigation or patent geolocation claim unit 5009 corresponding to a type of patent claim for the user at a price of $5.00 in the price-time priority queue, with an immediate availability and an associated buy now option button 5014.

In some implementations, the search function 5002 for the litigation or patent geolocation claim unit community object with a price-time priority queue auction may index the search result with the following prioritization: first, the litigation or patent geolocation claim unit; second, the distance of the litigation or patent geolocation claim unit from the user in the community object sequence; then, by price-time priority. In another implementation, the search function may prioritize price-time prioritization as a second priority, followed by distance as a third index ranking.

Further, the search function 5002 may provide instructions for the graphical user interface 5001 to state if the transformed litigation or patent geolocation claim unit is immediately available, available the next day, or available at any other time and/or date. In some implementations, the litigation or patent geolocation claim unit community object 5005 may correspond to only the lowest price $5.00 of the then-current price-time priority queue for the specific object requested in the search function 5002. In addition, the transformed litigation or patent geolocation claim unit may be a commuter auto liability litigation or patent geolocation claim unit 5005, a workman's compensation litigation or patent geolocation claim unit 5006, a general liability litigation or patent geolocation claim unit 5007, a general commercial liability litigation or patent geolocation claim unit 5008, a general technology patent claim 5009, and/or a plurality of other alternative transformed litigation or patent geolocation claim units.

The specific transformed litigation or patent geolocation claim unit may have a buy now button 5010. The buy now button 5010 may instantiate instructions that lead to a consummation of a transaction with geolocation, where the transaction may include step-by-step delivery of litigation or court instructions. The user interface may show such instructions based on the match of the user who owns the transformed litigation or patent geolocation claim unit with the user who seeks to buy the transformed litigation or patent geolocation claim unit.

FIG. 50 further may illustrate a system 5000 in accordance with implementations of various techniques described herein and with reference to U.S. patent application Ser. No. 17/069,597, “Price-Time Priority Queue Routing for Transportation Capacity Units,” filed Oct. 12, 2019, the entireties of which are incorporated by reference herein and with reference to the aforementioned application diagram figures. In one implementation, an asymmetric litigation or patent geolocation claim unit routing problem with introductions of a non-negative variable may be defined. In particular, a non-negative variable u_i, may be introduced for each supplier i∈M representing the total number of suppliers already visited when leaving supplier i. Further, the inequality of Equation 7 may be substituted with:

u _i −u _j +|M|x _ij ≤|M|−1i,j∈M,i≠j  (15).

Using Equation 15 may prevent the creation of subtours by controlling the order of visit of the suppliers.

In another implementation, a non-negative flow variable f_ij may be defined for each arc (i,j) E A representing the quantity of a commodity on the vehicle when it leaves supplier i and arrives in j. The single commodity flow formulation may be obtained by substituting the inequalities of Equations 6 and 7 with the following:

Σ_j∈Mf_0j=Σ_k∈Kd_k  (16)

Σ_{j(i,j)∈δ+({h})}f_ij−Σ_{(i,j)∈δ−({h})}f_ij=−Σ_k∈Kz_hk h∈M  (17)

f _ij ≤x _ijΣ_k∈Kd_k(i,j)∈A  (18).

FIG. 51 illustrates a system 5100 in accordance with implementations of various techniques described herein. The system 5100 may correspond to a system that uses a litigation or patent geolocation claim unit object community and associated litigation or patent geolocation claim unit creation method structure.

In one implementation, a litigation or patent geolocation claim unit, such as an MSP claim unit with a tag of #MSP_Claim 5102, may be constructed as a litigation or patent geolocation claim unit community to which people or users may subscribe or follow. The claim unit may have an associated price time and priority queue for the relevant MSP litigation or patent geolocation claim unit community object 5101. A user 5110 may subscribe the to the MSP claim object community 5102. There may be a plurality of delivery methods for the virtual geolocation exchange unit or litigation or patent geolocation claim unit community 5103 that corresponds to the MSP claim object 5102. In one implementation, the delivery method may be physical and/or virtual, such as through the use of a truck 5118, car 5117, truck 5116, small car 5114, virtual 5119 and 5109, multi-vehicle 5111, 5106, 5107,5108, or bus 5104 for the plurality of users 5110 and 5112 between two physical or virtual locations 5105, 5113.

In another implementation, the creation process 5134 for the litigation or patent geolocation claim unit may include a plurality of investors 5120, 5121. The investors 5120, 5121 may invest in a broker account 5123 or 5124, where the investment may then alert the litigation or patent geolocation claim unit creation processor 5125 that collateral has been posted. In some implementations, a plurality of buyers 5128, 5129 may directly purchase the litigation or patent geolocation claim units. In addition, the market maker or specialist 5130 may help to facilitate transactions for the litigation or patent geolocation claim unit exchange 5131 and clearinghouse 5132. The creation process for a litigation or patent geolocation claim unit may interact with the system network 5160 to form a legal transformation for: a litigation or patent geolocation claim unit exchange unit ISDA, Forward, Future, Swap, Security, Derivative, or Option contract 5162; a replacement value contract 5163; and a firm legal contract 5164. One or more of these contracts may be the basis for the transactions on the litigation or patent geolocation claim unit exchange market or securities market database server 5161.

FIG. 51 further may illustrate a system in accordance with implementations of various techniques described herein and with reference to U.S. patent application Ser. No. 17/069,597, “Price-Time Priority Queue Routing for Transportation Capacity Units,” filed Oct. 12, 2019, the entirety of which is incorporated by reference herein. In particular, a Euler diagram of a litigation or patent geolocation claim unit routing problem with introduction solution sets and subsets is disclosed in the incorporated reference. In one implementation, a Euler diagram for P, NP, NP-complete, and NP-hard set of problems are also disclosed. The left side may be valid under the assumption that P≠NP, while the right side may be valid under the assumption that P=NP (except that the empty language and its complement are never NP-complete, and in general, not every problem in P or NP is NP-complete).

FIG. 52 illustrates a formula structure 5200 in accordance with implementations of various techniques described herein. The formula structure 5200 may correspond to a preamble formula structure 5200 for a litigation or patent geolocation claim unit, where the unit may represent a litigation or patent geolocation claim unit securities, forwards, swaps, options, futures, exchange traded funds (ETFs), derivative unit securities, unitization structures, and/or any exchange traded asset or derivative thereof.

In particular, to avoid doubt with respect to the legal transformations with respect to the claim unit, a “Geolocation Exchange Unit” may be synonymous with a “Litigation or Patent Geolocation Claim Unit,” a “Transportation Capacity Unit,” and/or a “Freight Capacity Unit.” In other words, the Geolocation Exchange Unit may refer more broadly to an exchange traded structure or instrument that may be in the form of stock, fixed income, debt, foreign exchange, futures, forwards, swaps, options, derivatives, exchange traded fund, blockchain traded asset, private placement structure, and/or public market structure.

In some implementations, the disclosed method and system may relate to the sale, purchase, resale, repurchase, transfer, and/or assignment of the geolocation exchange units or litigation or patent geolocation claim units. In one implementation, CirclesX or LitigationsX may relate to the sale, purchase, resale, and/or repurchase of the geolocation exchange units or litigation or patent geolocation claim units. In another implementation, CirclesX may relate to the sale, purchase, resale, and/or repurchase of the litigation or patent geolocation claim units. In yet another implementation, a SimpsX Trade Hub may be synonymous with a Virtual Hub. In another implementation, CirclesX, HoursX, PortalsX, WondersX, FarmsX, RoutesX, SidesX, CurbsX, and/or TollsX Trade Hub may be synonymous with a Virtual Hub. In another implementation, PortalsX Geolocation Exchange Units may correspond to a capacity of advertising impressions though a plurality of operating system applications and web browsers associated with a data vault of a user specification of geolocation attributes and geolocation exchange unit attributes. In yet another implementation, FarmsX Geolocation Exchange Units may correspond to a capacity of agricultural units with a plurality of agriculture exchange units as a specification of geolocation attributes and geolocation exchange unit attributes. Further, U.S. patent application Ser. No. 16/290,278, “Agriculture Community Objects with Price-Time Priority Queues for Transformed Agricultural Units,” filed Mar. 1, 2019, is hereby incorporated by reference in its entirety.

In another implementation, Rent It X Geolocation Exchange Units may correspond to a capacity of rental tool, farm equipment, heavy machinery, and/or general appliance units with a plurality of rental exchange units as a specification of geolocation attributes and geolocation exchange unit attributes. Further, U.S. patent application Ser. No. 16/293,712, “Tool Appliance Community Objects with Price-Time Priority Queues for Transformed Tool Units”, filed Mar. 6, 2019, is hereby incorporated by reference in its entirety. In yet another implementation, Renewable EnergyX Geolocation Exchange Units may correspond to a capacity of renewable energy units with a plurality of energy exchange units as a specification of geolocation attributes and geolocation exchange unit attributes. Further, U.S. patent application Ser. No. 16/357,241, “Social Community Objects with Price Time Priority Queues for Transformed Renewable Energy Units,” filed Mar. 18, 2019, is hereby incorporated by reference in its entirety.

In another implementation, TutorsX Geolocation Exchange Units may correspond to capacity of educational or tutoring units with a plurality of educational exchange units as a specification of geolocation attributes and geolocation exchange unit attributes. Further, U.S. patent application Ser. No. 16/397,685, “Social Community Objects with Price-Time Priority Queues for Transformed Educational Units,” filed Apr. 29, 2019, is hereby incorporated by reference in its entirety. In yet another implementation, ParkedX Geolocation Exchange Units may correspond to a capacity of parking units with a plurality of parking exchange units as a specification of geolocation attributes and geolocation exchange unit attributes. Further, U.S. patent application Ser. No. 16/359,841, “Social Community Objects with Price-Time Priority Queues for Transformed Parking Units,” filed Mar. 20, 2019, is hereby incorporated by reference in its entirety.

In yet another implementation, CurbsX Geolocation Exchange Units may correspond to a capacity of curb space for parking or storage though a plurality of parking spots or curb storage specifications of geolocation attributes and geolocation exchange unit attributes. In another implementation, TollsX Geolocation Exchange Units may correspond to a capacity of tolling space or congestion management space for road or city congestion though a plurality of tolling or congestion management specifications of geolocation attributes and geolocation exchange unit attributes. The term geolocation exchange unit may be used interchangeably with any trading unit utilizing geolocation attributes in geolocation exchanged based methods.

FIG. 53 illustrates a formula extension structure 5300 in accordance with implementations of various techniques described herein. The formula extension structure 5300 may correspond to a preamble formula extension structure for a transformed Geolocation Exchange Unit, which may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. In addition, the disclosed method and system may relate to the sale, purchase, resale, repurchase, transfer, and/or assignment of the litigation or patent geolocation claim units. Further, CirclesX or SimpsX may relate to the purchase, sale, repurchase, and/or resale of litigation or patent geolocation claim units.

FIG. 54 illustrates a formula structure 5400 in accordance with implementations of various techniques described herein. The formula structure 5400 may correspond to a definition formula structure 5400 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Affiliate, Agreement, Applicable Interest Rate, Assigning Party, Bankrupt entity, and/or other terms in accordance with some implementations. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 54.

FIG. 55 illustrates a formula structure 5500 in accordance with implementations of various techniques described herein. The formula structure 5500 may correspond to a definition formula structure 5500 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Business Day, Buyer, Claiming Party, Claims, Confirmation, Contract Price, Contract Value, Contractual Currency, and/or other terms in accordance with some implementations. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 55.

FIG. 56 illustrates a formula structure 5600 in accordance with implementations of various techniques described herein. The formula structure 5600 may correspond to a definition formula structure 5600 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Cost, Defaulting Party, Default Rate, Delivery, Early Termination Date, Effective Date, Event of Default, Force Majeure, and/or other terms in accordance with some implementations. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 56.

FIG. 57 illustrates a formula structure 5700 in accordance with implementations of various techniques described herein. The formula structure 5700 may correspond to a definition formula structure 5700 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: GTCs, Independent Amount, Letters of Credit, Margin Party, Non-Defaulting Party, Option, Option Buyer, Option Seller, Party or Parties, Party B, Payment Date, Performance Assurance, and/or other terms in accordance with some implementations. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 57.

FIG. 58 illustrates a formula structure 5800 in accordance with implementations of various techniques described herein. The formula structure 5800 may correspond to a definition formula structure 5800 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Person, Premium, Present Value Discount Rate, Ask Yield, Product, Recording, Replacement Value, Seller, Settlement Amount, and/or other terms in accordance with some implementations. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 58.

FIG. 59 illustrates a formula structure 5900 in accordance with implementations of various techniques described herein. The formula structure 5900 may correspond to a definition formula structure 5900 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Taxes, Term, Terminated Transaction, Termination Payment, Termination Replacement Price, Termination Replacement Transaction, and/or other terms in accordance with some implementations. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 59.

FIG. 60 illustrates a formula structure 6000 in accordance with implementations of various techniques described herein. The formula structure 6000 may correspond to a definition formula structure 6000 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Trade Date, Transaction, Geolocation Exchange Unit (or GXU, which may be used interchangeably), and/or other terms in accordance with some implementations. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 60.

FIG. 61 illustrates a formula structure 6100 in accordance with implementations of various techniques described herein. The formula structure 6100 may correspond to a definition formula structure 6100 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Confirmation and/or other terms in accordance with some implementations. In addition, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Recording of Transactions and/or other terms in accordance with some implementations. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 61.

FIG. 62 illustrates a formula structure 6200 in accordance with implementations of various techniques described herein. The formula structure 6200 may correspond to a definition formula structure 6200 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Inconsistency with these established formulas for a plurality of transformed transportation unit formulas. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 62.

FIG. 63 illustrates a formula structure 6300 in accordance with implementations of various techniques described herein. The formula structure 6300 may correspond to a definition formula structure 6300 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Force Majeure with these established formulas for a plurality of transformed transportation unit formulas. In some implementations, Force Majeure may occur and be written in one or more business days from the Force Majeure event. In addition, Remedies for Product Delivery Failures may be caused by failure of the Buyer or Seller to deliver the Geolocation Exchange Unit, litigation or patent geolocation claim unit, and/or the like. In such an implementation, the non-failing party may be entitled to the formula of the then-current price of the GXU as liquidated damages. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 63.

FIG. 64 illustrates a formula structure 6400 in accordance with implementations of various techniques described herein. The formula structure 6400 may correspond to a definition formula structure 6400 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: events of default and remedies with these established formulas for a plurality of transformed litigation or patent geolocation claim unit formulas. In some implementations, the formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 60. Further, events of default may include failure to make payment when required, making false representations, failure to perform to deliver the GXU, post-merger or reorganization failing to support the obligations of the GXU or litigation or patent geolocation claim unit transactions. In other implementations, events of default may include credit default or failure to delivery performance assurance or margin.

FIG. 65 illustrates a formula structure 6500 in accordance with implementations of various techniques described herein. The formula structure 6500 may correspond to a definition formula structure 6500 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: effect of default for a plurality of transformed litigation or patent geolocation claim unit formulas. In some implementations, effect of default may occur and be written in one or more business days from the Effect of an event of Default. In addition, the calculation of a termination payment may be “Settlement Amount” for the Terminated Transaction and may be the difference between the Replacement Value and the Contract Value of the Terminated Transaction, as calculated by the Non-Defaulting Party as follows:

i. If the Non-Defaulting Party in respect of a Terminated Transaction is Seller and the Replacement Value is greater than the Contract Value, then the Settlement Amount shall be the amount of such excess plus the pro rata portion of the Contract Value attributable to any Contract Price actually paid by Buyer and shall be payable by the Non-Defaulting Party to the Defaulting Party;

ii. If the Non-Defaulting Party in respect of a Terminated Transaction is Seller and the Replacement Value is less than the Contract Value, then the Settlement Amount shall be the amount of such difference less the pro rata portion of the Contract Value attributable to any Contract Price actually paid by Buyer and shall be payable by the Defaulting Party to the Non-Defaulting Party. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 65.

FIG. 66 illustrates a formula structure 6600 in accordance with implementations of various techniques described herein. The formula structure 6600 may correspond to a definition formula structure 6600 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: effect of default for a plurality of transformed transportation unit formulas. In some implementations, effect of default may occur and may be written in one or more business days from the Effect of an event of Default. In addition, the calculation of a termination payment may be “Settlement Amount” for such Terminated Transaction and may be the difference between the Replacement Value and the Contract Value of such Terminated Transaction, as calculated by the Non-Defaulting Party as follows:

iii. If the Non-Defaulting Party in respect of a Terminated Transaction is Buyer and the Replacement Value is greater than the Contract Value, then the Settlement Amount shall be the amount of such excess plus the pro rata portion of the Contract Value attributable to any Contract Price actually paid by Buyer and shall be payable by the Defaulting Party to the Non-Defaulting Party; and

iv. If the Non-Defaulting Party in respect of a Terminated Transaction is Buyer and the Replacement Value is less than the Contract Value, then the Settlement Amount shall be the amount of such difference less the pro rata portion of the Contract Value attributable to any Contract Price actually paid by Buyer and shall be payable by the Non-Defaulting Party to the Defaulting Party.

v. If the sum of the Settlement Amounts payable by the Defaulting Party is greater than the sum of Settlement Amounts payable by the Non-Defaulting Party, then a single payment in the amount of such excess will be payable to the Non-Defaulting Party by the Defaulting Party on the date specified in Section 5.4. If the sum of the Settlement Amounts payable by the Non-Defaulting Party is greater than the sum of the Settlement Amounts payable by the Defaulting Party, then a single payment in the amount of such excess Settlement Amounts will be payable by the Non-Defaulting Party to the Defaulting Party on the date specified in Section 5.4. The formula for the transformed litigation or patent geolocation claim unit may be present within the definitions stated in FIG. 66.

FIG. 67 illustrates a formula structure 6700 in accordance with implementations of various techniques described herein. The formula structure 6700 may correspond to a definition formula structure 6700 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Notice of Payment of Termination Payment of transformed transportation unit formulas. In some implementations, Notice of Payment of Termination Payment may occur and may be written in one or more business days from the Notice of Payment of Termination Payment. In addition, as soon as practicable after the calculation of the Termination Payment, the Non-Defaulting Party may notify the Defaulting Party in writing of the amount of the Termination Payment and whether the Termination Payment is due to or due from the Non-Defaulting Party. The notice may include a written statement explaining in reasonable detail the calculation of such Termination Payment to the Defaulting Party and SimpsX, CirclesX, HoursX, PortalsX, or SeatsX. If the Termination Payment is due to the Non-Defaulting Party, the Defaulting Party may pay the Termination Payment within five (5) Business Days after receipt of such notice, together with interest thereon (before as well as after judgment) at the Default Rate, to the extent permitted under applicable law, compounded daily, from (and including) the Early Termination Date to (but excluding) the day such amount is paid. However, to the extent that the Termination Payment is calculated in respect of a termination pursuant to Article 3 5900, no such interest shall be payable. If the Termination Payment is due from the Non-Defaulting Party, the Non-Defaulting Party may pay such Termination Payment, without interest, within twenty (20) Business Days after delivery of such notice.

FIG. 68 illustrates a formula structure 6800 in accordance with implementations of various techniques described herein. The formula structure 6800 may correspond to a definition formula structure 6800 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Notice of Payment of Termination Payment of transformed litigation or patent geolocation claim unit formulas. In some implementations, Notice of Payment of Termination Payment may occur and may be written in one or more business days from the Notice of Payment of Termination Payment. In addition, as soon as practicable after the calculation of the Termination Payment, the Non-Defaulting Party may notify the Defaulting Party in writing of the amount of the Termination Payment and whether the Termination Payment is due to or due from the Non-Defaulting Party. The notice may include a written statement explaining in reasonable detail the calculation of such Termination Payment to the Defaulting Party and SimpsX, CirclesX, HoursX, PortalsX, or SeatsX. If the Termination Payment is due to the Non-Defaulting Party, the Defaulting Party may pay the Termination Payment within five (5) Business Days after receipt of such notice, together with interest thereon (before as well as after judgment) at the Default Rate, to the extent permitted under applicable law, compounded daily, from (and including) the Early Termination Date to (but excluding) the day such amount is paid. However, to the extent that the Termination Payment is calculated in respect of a termination pursuant to Article 3 5900, no such interest shall be payable. If the Termination Payment is due from the Non-Defaulting Party, the Non-Defaulting Party shall pay such Termination Payment, without interest, within twenty (20) Business Days after delivery of such notice.

FIG. 69 illustrates a formula structure 6900 in accordance with implementations of various techniques described herein. The formula structure 6900 may correspond to a definition formula structure 6900 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit, where such a unit may represent a litigation or patent geolocation claim unit security, a derivative unit security, or a unitization structure. Further, a plurality of definitions may be set from a superset, subset, or a combination of the following structure: Closeout Setoff features 6900. After calculation of a Termination Payment in accordance with Section 5.3 (unless such Termination Payment was calculated as a result of a termination pursuant to Article 3), if the Defaulting Party would be owed the Termination Payment, the Non-Defaulting Party may be entitled, at its option and in its discretion, to set off against the Termination Payment any amounts due and owed by the Defaulting Party to the Non-Defaulting Party under any other agreements, instruments, or undertakings between the Defaulting Party and the Non-Defaulting Party. Such agreement may not be related to the SimpsX, CirclesX, PortalsX, HoursX, or SeatsX Trade Hub. The remedy provided for in this Section may be without prejudice and in addition to any right of setoff, combination of accounts, lien, or other right to which any Party is at any time otherwise entitled (whether by operation of law, contract or otherwise). Notwithstanding the foregoing, the Non-Defaulting Party may not be required to pay to the Defaulting Party any amount owing by the Non-Defaulting Party under this Agreement until the Non-Defaulting Party receives confirmation satisfactory to it in its reasonable discretion that all obligations of the Defaulting Party to make any payments of any kind whatsoever to the Non-Defaulting Party or any of its Affiliates or otherwise which are due and payable as of the Early Termination Date have been fully and finally paid in cash in some embodiments.

FIG. 70 illustrates an exemplary definition formula structure 7000 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of definitions are set from a superset or subset or combination of the following structure to include Disputes of Invoices and Payments of transformed litigation or patent geolocation claim unit formulas. In some embodiments, a plurality of limitation of remedies, liability and damages are set from a superset or subset or combination of the following structure to include limitation of remedies, liability and damages of transformed litigation or patent geolocation claim unit formulas. In some embodiments, remedies are limited to the formulas of Replacement Value and Contract Value structured in 6400 and 6500 and 6600.

FIG. 71 illustrates an exemplary definition formula structure 7100 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit. In some embodiments, a plurality of limitation of remedies, liability and damages are set from a superset or subset or combination of the following structure to include limitation of remedies, liability and damages of transformed litigation or patent geolocation claim unit formulas. In some embodiments, remedies are limited to the formulas of Replacement Value and Contract Value structured in 6400 and 6500 and 6600.

FIG. 72 illustrates an exemplary definition formula structure 7200 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of limitation of remedies, liability and damages are set from a superset or subset or combination of the following structure to include limitation of remedies, liability and damages of transformed transportation unit formulas. In some embodiments, remedies are limited to the formulas of Replacement Value and Contract Value structured in 6400 and 6500 and 6600. In some embodiments, financial information may be requested to satisfy performance assurance 5700 formulas for credit support 7300 of litigation or patent geolocation claim unit.

FIG. 73 illustrates an exemplary definition formula structure 7300 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of credit support formulas are set from a superset or subset or combination of the following structure to include credit protection in the form of performance assurance and grants of security interest and remedies of transformed litigation or patent geolocation claim unit formulas. In some embodiments, credit support may follow the formulas in the definition of performance assurance 5700. In some embodiments, credit support and performance assurance calculations may include value at risk calculations that consider duration of the contract, price volatility formulas, price correlation formulas, closeout setoff formulas, cross-default formulas and other formulas that may consider the value and credit fluctuations of the credit worthiness of a counterparty and the market value and Replacement Value of such contracts of transformed litigation or patent geolocation claim units.

FIG. 74 illustrates an exemplary definition formula structure 7400 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed litigation or patent geolocation claim unit formulas. In some embodiments, general formulas may follow the formulas in the definition of performance assurance 5700, representation and warranties formulas to determine the variance of financial results of a counterparty to quantify a truthfulness score. In some embodiments, a credit score or truthfulness score may use earnings manipulation formulas that seek variance thresholds on cash flow, inventories, receivables, payables, goodwill, and other accounting standards that may be placed in a model to determine the general variability of the credit worthiness of the counterparty.

FIG. 75 illustrates an exemplary definition formula structure 7500 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed litigation or patent geolocation claim unit formulas. In some embodiments, these formulas may include cross checks on criminal background, driver license scores, indemnification scores, or scores to determine the likelihood of litigious actions.

FIG. 76 illustrates an exemplary definition formula structure 7600 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed litigation or patent geolocation claim unit formulas. In some embodiments, these formulas may include credit support for successors and assignments to provide scores of the likelihood a counterparty assuming the transportation or freight capacity unit may handle the credit obligations without triggering an event of default.

FIG. 77 illustrates an exemplary definition formula structure 7700 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed litigation or patent geolocation claim unit formulas. In some embodiments, these formulas may include dispute resolution formulas and threshold formulas to methodically evaluate and settle dispute amounts.

FIG. 78 illustrates an exemplary definition formula structure 7800 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed litigation or patent geolocation claim unit formulas. In some embodiments, these formulas may include dispute resolution formulas and threshold formulas to methodically evaluate and settle dispute amounts and arbitration awards.

FIG. 79 illustrates an exemplary definition formula structure 7900 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed litigation or patent geolocation claim unit formulas. In some embodiments, these formulas may include dispute resolution formulas and threshold formulas to methodically evaluate and settle dispute amounts and arbitration awards.

FIG. 80 illustrates an exemplary definition formula structure 8000 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed litigation or patent geolocation claim unit formulas. In some embodiments, these formulas may include dispute resolution formulas and threshold formulas to methodically evaluate and settle dispute amounts and arbitration awards.

FIG. 81 illustrates an exemplary definition formula structure 8100 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed litigation or patent geolocation claim unit formulas. In some embodiments, these formulas may include notice formulas and threshold formulas to methodically evaluate and settle dispute amounts and arbitration awards and counterparty information updates.

FIG. 82 illustrates an exemplary definition formula structure 8200 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed transportation unit formulas. In some embodiments, these formulas may include notice formulas and threshold formulas to methodically evaluate and settle severability and intent and regulation and exchange rule.

FIG. 83 illustrates an exemplary definition formula structure 8300 for a transformed Geolocation Exchange Unit or litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional formulas of transformed transportation unit formulas. In some embodiments, these formulas may include termination, liquidation, net out, offset, and plurality of counterpart formulas and threshold formulas to methodically evaluate and settle termination, liquidation, net out, offset, and plurality of counterpart formulas.

FIG. 84 illustrates an exemplary notice of correspondence 8400 for a transformed litigation or patent geolocation claim unit which may represent a litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure. In some embodiments, a plurality of general formulas are set from a superset or subset or combination of the following structure to include additional notice of correspondence.

FIG. 85 illustrates an exemplary notice step flowchart and application of one or more which may represent a Geolocation Exchange Unit litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure litigation or patent geolocation claim unit transformations 8500. In some embodiments, at a computing device with a touchscreen interface, audio interface, augmented reality interface, mixed reality interface, brain wave interface, visual interface, detect a litigation or patent geolocation claim unit 8502, the method and system may apply one or more litigation or patent geolocation claim unit capacity unit transformations to create a new litigation or patent geolocation claim unit 8503. In some embodiments, the transformation may include the following transformations of the litigation or patent geolocation claim unit or a superset or subset thereof:

apply an interest rate to discount forward litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure capacity units 8504;

apply a contract price to the forward litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure capacity units 8505;

apply a default interest rate to the forward litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure capacity units 8506;

apply an early termination date to the forward litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure capacity units 8507;

apply a force majeure event for forward litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure capacity units 8508;

apply a letter of credit or performance assurance for forward litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure capacity units 8509;

apply a termination replacement price meaning with respect to a Termination Replacement Transaction, the price which the Non-Defaulting Party acting in a commercially reasonable manner, pays or receives or could pay or receive in connection with the Termination Replacement Transaction (plus Costs reasonably incurred by the Non-Defaulting Party in entering into the Termination Replacement Transaction) for forward transportation or freight capacity units 8510.

In some embodiments, the aforementioned steps and transformations may be processed to transform the litigation or patent geolocation claim unit 8511.

FIG. 86 illustrates an exemplary notice step flowchart and application of one or more Geolocation Exchange Units or litigation or patent geolocation claim unit securities or unitization structure capacity unit transformations 8600. In some embodiments, at a computing device with a touchscreen interface, audio interface, augmented reality interface, mixed reality interface, brain wave interface, visual interface, detect a transportation or freight capacity unit 8602, the method and system may apply one or more litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure capacity unit transformations to create a new litigation or patent geolocation claim unit 8603. In some embodiments, the transformation may include the following transformations of the litigation or patent geolocation claim unit or a superset or subset thereof:

apply a Termination Replacement Transaction 8604 meaning a transaction for the purchase or sale, as applicable, of a Product(s) for any remaining period or part thereof to be purchased or sold in connection with the Terminated Transaction, provided that, the transaction replacing any Terminated Transaction or portion thereof shall be deemed to have a term:

commencing on the Early Termination Date; and

ending on the last day of the term

for forward litigation or patent geolocation claim units;

apply a trade confirmation for forward litigation or patent geolocation claim units 8605;

apply a recorded confirmation for forward litigation or patent geolocation claim units 8206;

apply remedies for product delivery failures for forward litigation or patent geolocation claim units as liquidated damages 8607;

apply events of default for forward litigation or patent geolocation claim units as liquidated damages 8608;

In some embodiments, the aforementioned steps and transformations may be processed to transform the litigation or patent geolocation claim unit 8609.

FIG. 87 illustrates an exemplary notice step flowchart and application of one or more Geolocation Exchange Unit or litigation or patent geolocation claim unit securities or derivative unit securities or unitization structure capacity unit transformations 8700. In some embodiments, at a computing device with a touchscreen interface, audio interface, augmented reality interface, mixed reality interface, brain wave interface, visual interface, detect a litigation or patent geolocation claim unit 8702, the method and system may apply one or more litigation or patent geolocation claim unit transformations to create a new litigation or patent geolocation claim unit 8703. In some embodiments, the transformation may include the following transformations of the litigation or patent geolocation claim unit or a superset or subset thereof:

Apply a Calculation of a Termination Payment 8704.

a. If an Early Termination Date is designated with respect to any Transaction, the “Settlement Amount” for such Terminated Transaction shall be the difference between the Replacement Value and the Contract Value of such Terminated Transaction, as calculated by the Non-Defaulting Party as follows:

If the Non-Defaulting Party in respect of a Terminated Transaction is Seller and the Replacement Value is greater than the Contract Value, then the Settlement Amount shall be the amount of such excess plus the pro rata portion of the Contract Value attributable to any Contract Price actually paid by Buyer and shall be payable by the Non-Defaulting Party to the Defaulting Party;

If the Non-Defaulting Party in respect of a Terminated Transaction is Seller and the Replacement Value is less than the Contract Value, then the Settlement Amount shall be the amount of such difference less the pro rata portion of the Contract Value attributable to any Contract Price actually paid by Buyer and shall be payable by the Defaulting Party to the Non-Defaulting Party;

for forward litigation or patent geolocation claim units.

In some embodiments, the aforementioned steps and transformations may be processed to transform the litigation or patent geolocation claim units 8705.

FIG. 88 illustrates an exemplary notice step flowchart and application of one or more Geolocation Exchange Unit or litigation or patent geolocation claim unit securities or unitization structure capacity unit transformations 8400. In some embodiments, at a computing device with a touchscreen interface, audio interface, augmented reality interface, mixed reality interface, brain wave interface, visual interface, detect a transportation or freight capacity unit 8402, the method and system may apply one or more transportation or freight capacity unit transformations to create a new litigation or patent geolocation claim unit 8803. In some embodiments, the transformation may include the following transformations of litigation or patent geolocation claim unit or a superset or subset thereof:

apply a Calculation of a Termination Payment 8804;

If the Non-Defaulting Party in respect of a Terminated Transaction is Buyer and the Replacement Value is greater than the Contract Value, then the Settlement Amount shall be the amount of such excess plus the pro rata portion of the Contract Value attributable to any Contract Price actually paid by Buyer and shall be payable by the Defaulting Party to the Non-Defaulting Party; and

If the Non-Defaulting Party in respect of a Terminated Transaction is Buyer and the Replacement Value is less than the Contract Value, then the Settlement Amount shall be the amount of such difference less the pro rata portion of the Contract Value attributable to any Contract Price actually paid by Buyer and shall be payable by the Non-Defaulting Party to the Defaulting Party.

If the sum of the Settlement Amounts payable by the Defaulting Party is greater than the sum of Settlement Amounts payable by the Non-Defaulting Party, then a single payment in the amount of such excess will be payable to the Non-Defaulting Party by the Defaulting Party on the date specified in Section 5.4 6800. If the sum of the Settlement Amounts payable by the Non-Defaulting Party is greater than the sum of the Settlement Amounts payable by the Defaulting Party, then a single payment in the amount of such excess Settlement Amounts will be payable by the Non-Defaulting Party to the Defaulting Party on the date specified in Section for forward litigation or patent geolocation claim units.

FIG. 89 illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 89 illustrates the general schema for the creation of a litigation or patent geolocation claim unit security. In some embodiments, a plurality of investors 8970, 8980 and 8990 invest in the litigation or patent geolocation claim unit securities that have been created through the geolocation exchange 8910, exchange 8920 to construct a geolocation exchange unit portfolio 8930 which may have a brokerage house 8940 to coordinate authorized participants 8950 to place the portfolios 8930 on the stock market 8960 as an exchange traded product in one of many forms of the litigation or patent geolocation claim unit or time unit interval portfolios.

FIGS. 90A and 90B illustrate flow diagrams of a method in accordance with implementations of various techniques described herein. In some implementations, exemplary steps of FIGS. 90A and 90B may be used to create exchange traded products from the geolocation exchange units or litigation or patent geolocation claim units. The first step is that the Geolocation Exchange Unit Portfolio sells Creation Basket to Authorized Participant 9010 followed by Authorized Participant sells Units in the Secondary Market 9020 in FIG. 90A. In some embodiments, Authorized Participant Purchases Units in Secondary Market 9030 followed by Authorized Participant redeems Geolocation Exchange Unit Portfolio 9040 in FIG. 90B. In some embodiments, the process outlined in diagrams 8900 and 9000 and 9100 may be used to make Initial Public Offerings or (“IPOs”) of the geolocation exchange unit or litigation or patent geolocation claim unit that was created. By way of example, but not limiting by example, the system and method may IPO Medicare Secondary Payer Claim for a no fault neck strain in an auto accident as a listed geolocation exchange unit defined in the specification for the litigation or patent geolocation claim unit of a virtual or in person litigation or patent geolocation claim unit delivery with the associated Medicare Secondary Payer claim. In some embodiments, investors 8970, 8980, 8990 may pre-bid on the exchange to gauge value and interest in the IPO for a given geolocation exchange unit or litigation or patent geolocation claim unit prior to the IPO where the geolocation exchange basket 9010 is then released for secondary trading in a secondary market 9020 such as a stock exchange, commodity exchange or general trading exchange. In some embodiments, once a litigation or patent geolocation claim unit or geolocation exchange unit for a certain specification has been created as an IPO for secondary market trading, then a plurality of investors may freely buy or sell the legally transformed litigation or patent geolocation claim units for a specification of Medicare Secondary Payer Claim or a plurality of other claims which may be by example but not limiting by example business commercial claims, personal injury claims, Medicare claims, Medicaid claims, mass tort claims, patent claims, class action claims, or any litigation or patent geolocation claim unit that may be defined under a given specification. As with anyone skilled in the art would ascertain, certain steps may be added or skipped to complete the method and system transformation.

FIG. 91 illustrates a flow diagram of a method in accordance with implementations of various techniques described herein. In some implementations, exemplary steps of FIG. 91 may be used to create baskets of geolocation exchange units which may also have secondary listings on a plurality of exchanges 9100. In some embodiments, Geolocation Exchange Unit Portfolio invests in Geolocation Exchange Units 9110 followed by Geolocation Exchange Unit Portfolio maintains margin requirements 9120 followed by Geolocation Exchange Unit Portfolio maintains remaining investments in Cash and/or Treasuries and/or Digital Currency 9130 followed by Geolocation Exchange Unit Portfolio sells Geolocation Exchange Units 9140 which may be repeated to cycle through the steps as new baskets are created, bought and sold. As with anyone skilled in the art, certain steps may be added or skipped to complete the method and system transformation.

FIG. 92 illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 92 illustrates exemplary schema, in some embodiments for the creation of geolocation exchange units 9210. In some embodiments, a geolocation exchange processor 9213 creates a geolocation exchange unit incorporating a plurality of geolocation exchange data 9214 from a geolocation exchange database 9214 which may use system memory 9217, an operating system 9217 as well as a plurality of instructions from a geolocation exchange application 9219. In some embodiments, the geolocation exchange application 9219 may use a network 9211 with geolocation exchange unit attributes of longitude, latitude, altitude or other dimension coordinates over a GPS wireless location network 9212 which may gather and process the geolocation exchange data 9214 for further processing 9215 while interacting with the geolocation exchange data bus portal 9220 as a gateway to interface with a plurality of user interfaces such as a mobile central processing unit or (“CPU”), stationary CPU, augmented reality device, mixed reality device, audio computing device, visual computing device, sensory computing device or a plurality of other computing devices 9221 with then have an input and output interface with the geolocation exchange units 9222 for trading or initial public offerings to create the baskets of litigation or patent geolocation claim unit s or singular litigation or patent geolocation claim unit s or secondary market trading.

FIG. 93 illustrates exemplary geolocation exchange unit or litigation or patent geolocation claim unit community social object of MSP (Medicare Secondary Payer) Auto claim 9322. In some embodiments, the computing interface 9310 displays a menu option 9351 for the geolocation exchange unit social network structure 9315 with a short name of #MSP_Auto 9320 as well as a longer name which illustrates about the community object such as Medicare Secondary Payer Auto claim 9322. In some embodiments, the geolocation exchange unit community social network object 9320 may have a feature for users to follow the object 9360, share the object 9355 on other platforms, make the object a public object 9350 or a private object 9345 which may be invite only or require certain identity verification to follow or become a member of the community, as well as a feature to buy or sell the geolocation exchange unit social network object litigation or patent geolocation claim unit 9340. In some embodiments, the virtual hub pick up may be done physically with an in person litigation or patent geolocation claim unit meeting or on a virtual platform such as skype, zoom, facetime, WebEx, in person, teams, or more such video or augmented reality or virtual reality or mixed reality communication platforms 9335. In some embodiments, the virtual hub drop off may be done physically with an in person litigation or patent geolocation claim unit meeting or on a virtual platform such as skype, zoom, facetime, WebEx, in person, teams, or more such video or augmented reality or virtual reality or mixed reality communication platforms 9335. In some embodiments, the activity statistics for the geolocation exchange unit such as the amount of buyers, amount of sellers, claims which have transacted, trades which have been completed, frequency of trades, volume of trades, the daily high price of the trades, the daily low price of the trades, the yearly high price of the trades, the yearly low price of the trades, additional news, weather or research on the geolocation exchange unit community objects, the trending feeds for other related or non-related geolocation exchange unit community objects 9325.

FIG. 94 illustrates an exemplary transaction layer 9409 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of a Workman's Comp Claim from a Medicare Secondary Payer Claim with a cash flow delivery time of Wednesday, May 1, 2020 at 8 am for virtual or in person delivery specification 9411. In some embodiments, the transaction layer 9409 may list the user account balance 9410 and available balance given outstanding transactions and trades 9410. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or litigation or patent geolocation claim unit for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 9412, the second price time priority queue quantity buy limit order book position 9413, the third price time priority queue quantity buy limit order book position 9414. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 9412 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 9413 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 9414 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 9423, the second price time priority queue quantity sell limit order book position 9424, the third price time priority queue quantity sell limit order book position 9425. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 9423 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 9424 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 9425 also contains a price of $160. In some embodiments, the system and method transaction layer 9409 may contain both limit buy order features 9415 and market order features for buy now 9416 functionality. In some embodiments, the system and method transaction layer 9409 may contain limit order sell features 9426 and market order features for sell now 9427 functionality. In some embodiments, limit buy orders 9415 or limit sell orders 9426 allow the user to enter prices manually into the action block 9417 with input field 9418 for buy or sell as well as quantity selection order input field 9419 where the user may select their order quantity as well as a price input field 9420 where the user may select their limit order or other type of order price as well as a type input label 9428 and type label input field 9421 as well as a button to submit 9436 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 9401 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 9411. In some embodiments, the virtual or in person delivery layer 9401 may show the video and or picture of the physician 9402 to the patient Sally Doe 9404. In some embodiments, the delivery layer 9401 may include the blockchain of the medical record history 9405, the blockchain symptoms or personal health file 9406, chat and text between the buyer (patient) 9404 and seller (doctor) 9431 as well as insurance and cash and payment details 9408. In some embodiments, the patient 9429 or doctor 9402 may have a mute button 9438 during the video call as well as the name of the doctor 9431, the education and credentials of the defendant or plaintiff 9432, the credit rating of the claim 9433, the HIPAA compliance of the doctor 9434 and chat and text records between the buyer (patient) and seller (doctor, defendant, lawyer, plaintiff or other claim party) 9435. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 9411 may have many types for business claim, personal injury claim, patent claim, telemedicine, legal, musicians, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 9401 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces.

FIG. 95 illustrates an exemplary transaction layer 9509 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of Insurance YYZ no fault Hip Fracture and morphine claim with a delivery time of Wednesday, May 1, 2022 at 8 am for cash flows or non-cash flow for virtual or in person delivery specification 9511. In some embodiments, the transaction layer 9509 may list the user account balance 9510 and available balance given outstanding transactions and trades 9510. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or litigation or patent geolocation claim unit for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 9512, the second price time priority queue quantity buy limit order book position 9513, the third price time priority queue quantity buy limit order book position 9514. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 9512 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 9513 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 9514 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 9523, the second price time priority queue quantity sell limit order book position 9524, the third price time priority queue quantity sell limit order book position 9525. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 9523 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 9524 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 9525 also contains a price of $160. In some embodiments, the system and method transaction layer 9509 may contain both limit buy order features 9515 and market order features for buy now 9516 functionality. In some embodiments, the system and method transaction layer 9509 may contain limit order sell features 9526 and market order features for sell now 9527 functionality. In some embodiments, limit buy orders 9515 or limit sell orders 9526 allow the user to enter prices manually into the action block 9517 with input field 9518 for buy or sell as well as quantity selection order input field 9519 where the user may select their order quantity as well as a price input field 9520 where the user may select their limit order or other type of order price as well as a type input label 9528 and type label input field 9521 as well as a button to submit 9536 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 9501 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 9511. In some embodiments, the virtual or in person delivery layer 9501 may show the video and or picture or emoji of the athlete 9502 to the buyer Sally Smith 9504. In some embodiments, the delivery layer 9501 may include the blockchain of the location history 9505, the blockchain rating 9506, chat and text between the buyer (investor) 9504 and seller (plaintiff) 9531 as well as in person or virtual meeting details 9508. In some embodiments, the defendant 9529 or plaintiff 9502 may have a mute button 9538 during the video call as well as the name of the athlete 9531, the claim counterparty 9532, the rating and qualification claim 9533, the chat or text of the counterparty 9534 and meeting type such as virtual or in person between the buyer (investor) and seller (plaintiff) 9535. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 9511 may have many types for patent claims, business commercial claims, insurance claims, personal injury claims, employment claims, workman's compensation claims, telemedicine claims, legal claims, musicians, chefs, cooks, business persons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 9501 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces.

FIG. 96 illustrates an exemplary transaction layer 9609 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of a Pediatrician 4 star rated who speaks Spanish with a malpractice claim with US medical board certifications with a delivery time of Wednesday, May 8, 2021 at 6 am for virtual or in person delivery specification 9611. In some embodiments, the transaction layer 9609 may list the user account balance 9610 and available balance given outstanding transactions and trades 9610. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or time unit interval for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 9612, the second price time priority queue quantity buy limit order book position 9613, the third price time priority queue quantity buy limit order book position 9614. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 9612 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 9613 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 9614 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 9623, the second price time priority queue quantity sell limit order book position 9624, the third price time priority queue quantity sell limit order book position 9625. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 9623 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 9624 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 9625 also contains a price of $160. In some embodiments, the system and method transaction layer 9609 may contain both limit buy order features 9615 and market order features for buy now 9616 functionality. In some embodiments, the system and method transaction layer 9609 may contain limit order sell features 9626 and market order features for sell now 9627 functionality. In some embodiments, limit buy orders 9615 or limit sell orders 9626 allow the user to enter prices manually into the action block 9617 with input field 9618 for buy or sell as well as quantity selection order input field 9619 where the user may select their order quantity as well as a price input field 9620 where the user may select their limit order or other type of order price as well as a type input label 9628 and type label input field 9621 as well as a button to submit 9636 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 9601 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 9611. In some embodiments, the virtual or in person delivery layer 9601 may show the video and or picture of the physician 9602 to the patient Huy Nuy 9604. In some embodiments, the delivery layer 9601 may include the blockchain of the medical record history 9605, the blockchain symptoms 9606, chat and text between the buyer (patient) 9604 and seller (doctor) 9631 as well as insurance and cash and payment details 9608 and vitals 9638. In some embodiments, the patient 9629 or doctor 9602 may have a mute button 9638 during the video call as well as the name of the doctor 9631, the education and credentials of the doctor 9632, the certifications and boards of the doctor 9633, the HIPAA compliance of the doctor 9634 and chat and text records between the buyer (patient) and seller (doctor) 9635. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 9611 may have many types for malpractice claims, mass tort claims, telemedicine, legal, musicians, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 9601 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces.

FIG. 97 illustrates an exemplary transaction layer 9709 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of an insurance XYZ no fault neck strain with an additional opioid claim with a delivery time of Wednesday, May 8, 2020 at 5 am for virtual or in person delivery specification 9711. In some embodiments, the transaction layer 9709 may list the user account balance 9710 and available balance given outstanding transactions and trades 9710. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or litigation or patent geolocation claim unit for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 9712, the second price time priority queue quantity buy limit order book position 9713, the third price time priority queue quantity buy limit order book position 9714. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 9712 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 9713 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 9714 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 9723, the second price time priority queue quantity sell limit order book position 9724, the third price time priority queue quantity sell limit order book position 9725. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 9723 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 9724 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 9725 also contains a price of $160. In some embodiments, the system and method transaction layer 9709 may contain both limit buy order features 9715 and market order features for buy now 9716 functionality. In some embodiments, the system and method transaction layer 9709 may contain limit order sell features 9726 and market order features for sell now 9727 functionality. In some embodiments, limit buy orders 9715 or limit sell orders 9726 allow the user to enter prices manually into the action block 9717 with input field 9718 for buy or sell as well as quantity selection order input field 9719 where the user may select their order quantity as well as a price input field 9720 where the user may select their limit order or other type of order price as well as a type input label 9728 and type label input field 9721 as well as a button to submit 9736 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 9701 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 9711. In some embodiments, the virtual or in person delivery layer 9701 may show the video and or picture of the patient Yuhang Ma 9702 to the patient Yhang Ma 9704. In some embodiments, the delivery layer 9701 may include the blockchain of the medical record history 9705, the blockchain symptoms 9706, chat and text between the buyer (investor) 9704 and seller (beneficiary) 9731 as well as insurance and cash and payment details 9708 and vitals 9738. In some embodiments, the patient 9729 or doctor 9702 may have a mute button 9738 during the video call as well as the name of the doctor 9731, the education and credentials of the doctor 9732, the certifications and boards of the doctor 9733, the HIPAA compliance of the doctor 9734 and chat and text records between the buyer (patient) and seller (doctor) 9735. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 9711 may have many types for malpractice, telemedicine, legal, musicians, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 9701 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces.

FIG. 98 illustrates an exemplary transaction layer 9809 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of a Gynecologist 4.5 star rated who speaks Hindi with US medical board certifications with a delivery time of Wednesday, May 8, 2020 at 5 am for virtual or in person delivery specification of a specific malpractice claim 9811. In some embodiments, the transaction layer 9809 may list the user account balance 9810 and available balance given outstanding transactions and trades 9810. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or litigation or patent geolocation claim unit for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 9812, the second price time priority queue quantity buy limit order book position 9813, the third price time priority queue quantity buy limit order book position 9814. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 9812 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 9813 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 9814 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim units may display the limit order book such as the first price time priority queue position quantity sell limit order book position 9823, the second price time priority queue quantity sell limit order book position 9824, the third price time priority queue quantity sell limit order book position 9825. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 9823 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 9824 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 9825 also contains a price of $160. In some embodiments, the system and method transaction layer 9809 may contain both limit buy order features 9815 and market order features for buy now 9816 functionality. In some embodiments, the system and method transaction layer 9709 may contain limit order sell features 9826 and market order features for sell now 9827 functionality. In some embodiments, limit buy orders 9815 or limit sell orders 9826 allow the user to enter prices manually into the action block 9817 with input field 9818 for buy or sell as well as quantity selection order input field 9819 where the user may select their order quantity as well as a price input field 9820 where the user may select their limit order or other type of order price as well as a type input label 9828 and type label input field 9821 as well as a button to submit 9836 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 9801 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 9811. In some embodiments, the virtual or in person delivery layer 9801 may show the video and or picture of the physician 9802 to the patient Latika May 9804. In some embodiments, the delivery layer 9801 may include the blockchain of the medical record history 9805, the blockchain symptoms 9806, chat and text between the buyer (patient) 9704 and seller (doctor) 9831 as well as insurance and cash and payment details 9808 and vitals 9838. In some embodiments, the patient 9829 or doctor 9802 may have a mute button 9838 during the video call as well as the name of the doctor 9831, the education and credentials of the doctor 9832, the certifications and boards of the doctor 9833, the HIPAA compliance of the doctor 9834 and chat and text records between the buyer (patient) and seller (doctor) 9835. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 9811 may have many types for malpractice claim, Medicare claims, telemedicine claims, legal claims, musicians, patent claims, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 9801 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces. In some embodiments, raw claims which have not been processed may be matched with a processor and legal representative before the security or cash flow creation module places in the claim on the exchange.

FIG. 99 illustrates an exemplary transaction layer 9909 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of a Medicare secondary payer claim who speaks English with US medical board certifications with a delivery time of Wednesday, May 8, 2020 at 9 am for virtual or in person delivery specification 9911. In some embodiments, the transaction layer 9909 may list the user account balance 9910 and available balance given outstanding transactions and trades 9910. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or time unit interval for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 9912, the second price time priority queue quantity buy limit order book position 9913, the third price time priority queue quantity buy limit order book position 9914. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 9912 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 9913 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 9914 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 9923, the second price time priority queue quantity sell limit order book position 9924, the third price time priority queue quantity sell limit order book position 9925. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 9923 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 9924 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 9925 also contains a price of $160. In some embodiments, the system and method transaction layer 9909 may contain both limit buy order features 9915 and market order features for buy now 9916 functionality. In some embodiments, the system and method transaction layer 9909 may contain limit order sell features 9926 and market order features for sell now 9927 functionality. In some embodiments, limit buy orders 9915 or limit sell orders 9926 allow the user to enter prices manually into the action block 9917 with input field 9918 for buy or sell as well as quantity selection order input field 9919 where the user may select their order quantity as well as a price input field 9920 where the user may select their limit order or other type of order price as well as a type input label 9928 and type label input field 9921 as well as a button to submit 9936 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 9901 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 9911. In some embodiments, the virtual or in person delivery layer 9901 may show the video and or picture of the physician 9902 to the patient Mary May 9904. In some embodiments, the delivery layer 9901 may include the blockchain of the medical record history 9905, the blockchain symptoms 9906, chat and text between the buyer (patient) 9904 and seller (doctor) 9931 as well as insurance and cash and payment details 9908 and vitals 9938. In some embodiments, the patient 9929 or doctor 9902 may have a mute button 9938 during the video call as well as the name of the doctor 9931, the education and credentials of the doctor 9932, the certifications and boards of the doctor 9933, the HIPAA compliance of the doctor 9934 and chat and text records between the buyer (patient) and seller (doctor) 9935. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 9911 may have many types for Medicare claims, Medicaid claims, patent claims, telemedicine claims, legal claims, musicians, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 9901 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces.

FIG. 100 illustrates an exemplary transaction layer 10009 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of a Medicare Secondary Payer Opioid Claim who speaks English with state certifications with a delivery time of Wednesday, May 8, 2020 at 9 am for virtual or in person delivery specification 10011. In some embodiments, the transaction layer 10009 may list the user account balance 10010 and available balance given outstanding transactions and trades 10010. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or time unit interval for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 10012, the second price time priority queue quantity buy limit order book position 10013, the third price time priority queue quantity buy limit order book position 10014. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 10012 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 10013 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 10014 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 10023, the second price time priority queue quantity sell limit order book position 10024, the third price time priority queue quantity sell limit order book position 10025. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 10023 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 10024 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 10025 also contains a price of $160. In some embodiments, the system and method transaction layer 10009 may contain both limit buy order features 10015 and market order features for buy now 10016 functionality. In some embodiments, the system and method transaction layer 10009 may contain limit order sell features 10026 and market order features for sell now 10027 functionality. In some embodiments, limit buy orders 10015 or limit sell orders 10026 allow the user to enter prices manually into the action block 10017 with input field 10018 for buy or sell as well as quantity selection order input field 10019 where the user may select their order quantity as well as a price input field 10020 where the user may select their limit order or other type of order price as well as a type input label 10028 and type label input field 10021 as well as a button to submit 10036 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 10001 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 10011. In some embodiments, the virtual or in person delivery layer 10001 may show the video and or picture of the plumber 10002 to the customer address 10004. In some embodiments, the delivery layer 10001 may include the blockchain of the claim record history 10005, the blockchain problem 10006, chat and text between the buyer (customer) 10004 and seller (plumber) 10031 as well as insurance and cash and payment details 10008 and data 10038. In some embodiments, the customer 10029 or plumber 10002 may have a mute button 10038 during the video call as well as the name of the lawyer 10031, the education and credentials of the lawyer 10032, the certifications and boards of the lawyer 10033, the state registration 10034 and chat and text records between the buyer (customer) and seller (plumber) 10035. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 10011 may have many types for Medicare Claims, telemedicine claims, legal claim, musicians, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 10001 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces.

FIG. 101 illustrates an exemplary transaction layer 10109 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of a Medicare Secondary Payer No Fault Auto Claim with state certifications with a delivery time of Wednesday, May 8, 2020 at 9 am for cash flows or non-cash flows for virtual or in person delivery claim specification 10111. In some embodiments, the transaction layer 10109 may list the user account balance 10110 and available balance given outstanding transactions and trades 10110. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or time unit interval for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 10112, the second price time priority queue quantity buy limit order book position 10113, the third price time priority queue quantity buy limit order book position 10114. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 10112 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 10113 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 10114 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 10123, the second price time priority queue quantity sell limit order book position 10124, the third price time priority queue quantity sell limit order book position 10125. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 10123 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 10124 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 10125 also contains a price of $160. In some embodiments, the system and method transaction layer 10109 may contain both limit buy order features 10115 and market order features for buy now 10116 functionality. In some embodiments, the system and method transaction layer 10109 may contain limit order sell features 10126 and market order features for sell now 10127 functionality. In some embodiments, limit buy orders 10115 or limit sell orders 10126 allow the user to enter prices manually into the action block 10017 with input field 10118 for buy or sell as well as quantity selection order input field 10119 where the user may select their order quantity as well as a price input field 10120 where the user may select their limit order or other type of order price as well as a type input label 10128 and type label input field 10121 as well as a button to submit 10136 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 10101 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 10111. In some embodiments, the virtual or in person delivery layer 10101 may show the video and or picture of the lawyer 10102 to the customer address 10104. In some embodiments, the delivery layer 10101 may include the blockchain of the home record history 10105, the blockchain problem 10106, chat and text between the buyer (insurance company) 10104 and seller (lawyer) 10131 as well as insurance and cash and payment details 10108 and data 10138. In some embodiments, the customer 10129 or lawyer 10102 may have a mute button 10138 during the video call as well as the name of the lawyer 10131, the education and credentials of the lawyer 10132, the certifications and boards of the lawyer 10133, the state registration 10134 and chat and text records between the buyer (customer) and seller (lawyer) 10135. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 10111 may have many types for telemedicine, legal, musicians, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 10101 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces. In some embodiments, insurance company payers of claim liability may buy the claim to settle the claim online rather than waiting for a judgement which could change the value of the claim.

FIG. 102 illustrates an exemplary transaction layer 10209 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of a Jimmy Page the lead guitarist of Led Zeppelin 5.0 star rated who speaks English with a music infringement claim with state certifications with a delivery time of Wednesday, May 8, 2020 at 9 am for virtual or in person delivery specification 10211. In some embodiments, the transaction layer 10209 may list the user account balance 10210 and available balance given outstanding transactions and trades 10210. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or time unit interval for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 10212, the second price time priority queue quantity buy limit order book position 10213, the third price time priority queue quantity buy limit order book position 10214. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 10212 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 10213 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 10214 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 10223, the second price time priority queue quantity sell limit order book position 10224, the third price time priority queue quantity sell limit order book position 10225. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 10223 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 10224 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 10225 also contains a price of $160. In some embodiments, the system and method transaction layer 10209 may contain both limit buy order features 10215 and market order features for buy now 10216 functionality. In some embodiments, the system and method transaction layer 10209 may contain limit order sell features 10226 and market order features for sell now 10227 functionality. In some embodiments, limit buy orders 10215 or limit sell orders 10226 allow the user to enter prices manually into the action block 10217 with input field 10218 for buy or sell as well as quantity selection order input field 10219 where the user may select their order quantity as well as a price input field 10220 where the user may select their limit order or other type of order price as well as a type input label 10228 and type label input field 10221 as well as a button to submit 10236 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 10201 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 10211. In some embodiments, the virtual or in person delivery layer 10201 may show the video and or picture of the musician Jimmy Page 10202 to the customer address 10204. In some embodiments, the delivery layer 10201 may include the blockchain of the home record history 10205, the blockchain problem 10206, chat and text between the buyer (customer) 10204 and seller (musician Jimmy Page) 10231 as well as insurance and cash and payment details 10208 and data 10238. In some embodiments, the customer 10229 or musician Jimmy Page 10202 may have a mute button 10238 during the video call as well as the name of the musician Jimmy Page 10231, the education and credentials of the musician Jimmy Page 10232, the certifications and boards of the musician Jimmy Page 10233, the state registration 10234 and chat and text records between the buyer (customer) and seller (musician Jimmy Page) 10235 and practice plan 10239. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 10211 may have many types for infringement claims, telemedicine, legal claims, musicians, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 10201 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces.

FIG. 103 illustrates an exemplary transaction layer 10309 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of a certain specification wireless technology patent claim with state certifications with a delivery time of Wednesday, May 8, 2020 at 9 am for virtual or in person cash flow or non-cash flow delivery specification 10311. In some embodiments, the transaction layer 10309 may list the user account balance 10310 and available balance given outstanding transactions and trades 10310. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or litigation or patent geolocation claim unit for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 10312, the second price time priority queue quantity buy limit order book position 10313, the third price time priority queue quantity buy limit order book position 10314. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 10312 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 10313 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 10314 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 10323, the second price time priority queue quantity sell limit order book position 10324, the third price time priority queue quantity sell limit order book position 10325. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 10323 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 10324 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 10325 also contains a price of $160. In some embodiments, the system and method transaction layer 10309 may contain both limit buy order features 10315 and market order features for buy now 10216 functionality. In some embodiments, the system and method transaction layer 10309 may contain limit order sell features 10326 and market order features for sell now 10327 functionality. In some embodiments, limit buy orders 10315 or limit sell orders 10326 allow the user to enter prices manually into the action block 10317 with input field 10318 for buy or sell as well as quantity selection order input field 10319 where the user may select their order quantity as well as a price input field 10320 where the user may select their limit order or other type of order price as well as a type input label 10328 and type label input field 10321 as well as a button to submit 10236 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, delivery 10301 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 10311. In some embodiments, the virtual or in person delivery layer 10301 may show the video and or picture of the chef Gordon Ramsey 10302 to the customer address 10304. In some embodiments, the delivery layer 10301 may include the blockchain of the home record history 10305, the blockchain problem 10306, chat and text between the buyer (investor) 10304 and seller (Qualcomm as licensor) 10331 as well as insurance and cash and payment details 10208 and data 10338. In some embodiments, the customer 10329 or chef Gordon Ramsey 10302 may have a mute button 10338 during the video call as well as the name of the Qualcomm 10331, the education and credentials of the chef Gordon Ramsey 10332, the certifications and boards of the court filing blockchain 10333, the case status 10334 and chat and text records between the buyer (investor) and seller (Qualcomm) 10335 and practice or maintenance plan 10339. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 10311 may have many types for patent claims, telemedicine, legal claims, musicians, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the delivery layer 10301 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces.

FIG. 104 illustrates an exemplary transaction layer and computing interface 10401 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of a specification legal claim with forwards, securities, futures, financial swaps and financial indexes around the physical underlying value of the litigation or patent geolocation claim unit or geolocation unit for a certain specification. In some embodiments, the computing interface 10401 with a menu 10402, and an index monitor to measure the current index value and delta change for the index over a given time increment 10404 of the litigation or patent geolocation claim unit or geolocation exchange unit for the security interest in the claim or general interest or assignment in the claim 10404. In some embodiments, the order entry system may include a submit button for orders 10405, a buy or sell action button toggle 10406 a quantity input field 10407 a price entry field 10409 and a type field 10408. In some embodiments, the system and interface may include a quantity buy label for the price time priority queue for a given selection of forwards, securities, futures, options, swaps, derivatives, financial indexes or other trading instruments both physical and financial and derivative values 10410. In some embodiments, the system and interface may include a price buy label for the price time priority queue for a given selection of forwards, futures, options, swaps, derivatives, financial indexes or other trading instruments both physical and financial and derivative values 10412. In some embodiments, the system and interface may include a quantity sell and quantity price label for the price time priority queue for a given selection of forwards, securities, futures, options, swaps, derivatives, financial indexes or other trading instruments both physical and financial and derivative values 10411. In some embodiments, the system and interface may include a given tenure of instrument for the trading instrument such as daily for same day delivery 10431 or next day delivery 10430 or balance of the week 10429 or balance of the month 10428, or next month such as September 2019 10426 or two months forward such as October 2019 10426 or three months forward such as November 2019 10425 or the following year or two years forward for date calendar or a security with a certain interest rate duration or equity or general interest in the claim asset 2021 with reference of 10424 for the price time priority queue for a given selection of forwards, securities, futures, options, swaps, derivatives, financial indexes or other trading instruments both physical and financial and derivative values 10411. In some embodiments, the quantity buy in the price time priority queue is quantity of five for that column 10423 or the price buy in the price time priority queue is price of $5.10 10422 and price sell of $5.20 in the price time priority sell queue 10421 and quantity sell of eight in the price time priority sell queue 10420. In some embodiments, each tenor may have an associated sell quantity for a given tenure such as quantity of one for the daily tenure 10413, quantity of 4 for the next day sell queue tenure 10414, quantity of 2 for the balance of week tenure sell queue 10415, quantity of 2 for the balance of month sell queue tenure 10416, quantity of 12 for the September 19 month sell queue tenure 10417, quantity of 18 for the October 19 month sell queue tenure 10418, quantity of 55 for the November 19 month sell queue tenure 10419.

FIG. 105 illustrates an exemplary transaction layer 10509 for a geolocation exchange unit or litigation or patent geolocation claim unit for the exemplary case of the Jim Adler the hammer who is 5 star rated who speaks English with state certifications with a delivery time of Wednesday, May 8, 2020 at 9 am for virtual or in person delivery specification 10511. In some embodiments, the transaction layer 10509 may list the user account balance 10510 and available balance given outstanding transactions and trades 10510. In some embodiments, a limited view of the price time priority transaction queue limit order book is displayed for the geolocation exchange unit or litigation or patent geolocation claim unit for the given specification and the exemplary components of the price time priority queue such as the first price time priority queue position quantity buy limit order book position 10512, the second price time priority queue quantity buy limit order book position 10513, the third price time priority queue quantity buy limit order book position 10514. In some embodiments, the first price time priority limit order buy queue position quantity of three with figure reference of 10512 also contains a price of $149. In some embodiments, the second price time priority limit order buy queue position quantity of one with figure reference of 10513 also contains a price of $140. In some embodiments, the third price time priority limit order buy queue position quantity of four with figure reference of 10514 also contains a price of $130. In some embodiments, an exemplary limit order sell queue for the geolocation exchange unit or litigation or patent geolocation claim unit s may display the limit order book such as the first price time priority queue position quantity sell limit order book position 10523, the second price time priority queue quantity sell limit order book position 10524, the third price time priority queue quantity sell limit order book position 10525. In some embodiments, the first price time priority limit order sell queue position quantity of two with figure reference of 10523 also contains a price of $150. In some embodiments, the second price time priority limit order sell queue position quantity of one with figure reference of 10524 also contains a price of $155. In some embodiments, the third price time priority limit order sell queue position quantity of five with figure reference of 10525 also contains a price of $160. In some embodiments, the system and method transaction layer 10509 may contain both limit buy order features 10515 and market order features for buy now 10516 functionality. In some embodiments, the system and method transaction layer 10509 may contain limit order sell features 10526 and market order features for sell now 10527 functionality. In some embodiments, limit buy orders 10515 or limit sell orders 10526 allow the user to enter prices manually into the action block 10517 with input field 10518 for buy or sell as well as quantity selection order input field 10519 where the user may select their order quantity as well as a price input field 10520 where the user may select their limit order or other type of order price as well as a type input label 10528 and type label input field 10521 as well as a button to submit 10536 a relevant order. In some embodiments, upon order price match of the limit order book buy queue with the limit order book sell queue, calendar layer 10301 may occur virtually or in person for the contract specification date and time and quality and litigation or patent geolocation claim unit specification 10511 with integration into the user calendar once a trade is matched and complete to help the user keep track of the litigation or patent geolocation claim unit obligations. In some embodiments, the virtual or in person delivery layer 10501 may show the video and or picture of the buyer and seller 10502 to the calendar 10503. In some embodiments, the calendar layer 10501 may include the integration features with outlook calendar, google calendar, or a plurality of other calendar programs. In some embodiments, all parties or some of the parties to the claim may video call 10510, 10511, 10512, 10504, 10507, 10508, 10509. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit 10511 may have many types for telemedicine, legal claims, musicians, chefs, cooks, businesspersons, tutors, athletes, celebrities, professionals, teachers, engineers or more generally anyone or any topic selling or buying their litigation or patent geolocation claim unit for a given specification. In some embodiments, the geolocation exchange unit or litigation or patent geolocation claim unit may IPO or initial public offering once they commence selling to create the geolocation exchange unit specification which then may trade many times in the secondary market under the price time priority queue transformation structure and associated legal transformations to the litigation or patent geolocation claim unit or geolocation exchange unit. In some embodiments, the calendar layer 10501 may provide supplemental data as the meeting is in person or it may provide supplemental data and virtual meeting structure through mobile CPU devices, stationary CPU devices, augmented reality CPU devices, virtual reality CPU devices, mixed reality CPU devices or a plurality of other CPU types or audio interfaces or sensory interfaces. In some embodiments, the virtual delivery layer 10510 may be one on one or one to many with video virtual delivery of the time unit interval unit. In some embodiments, the seller 10504 may present to many users 10511, 10512, 10506, 10507, 10508 with video communications or text or voice communications 10505, 10509.

FIG. 106 illustrates exemplary geolocation exchange unit object 10620 for the Dermatologist 5 star malpractice claim with the US board certification and ability to speak Spanish and English 10622 over a plurality of delivery methods that may be in person physically or virtually through augmented reality, mobile video computing, stationary video computing, mixed reality, virtual reality, audio computing devices, sensory computing devices or other computing devices with the ability to text 10625 in the community social network object which has been transformed into a security or tradable asset or commodity. In some embodiments, the community social network object transformation for the time unit interval or geolocation exchange unit may allow users to follow 10660, share 10655, keep private 10645, allow public access 10650 or move to a buy and sell price time priority queue 10640 for the given specification 10622.

FIG. 107 illustrates an exemplary search interface for mapping biomarkers to medical records for claim formation, securitization or derivative transformation to the geolocation exchange unit object for trading on the geolocation exchange. For the purpose of efficiency in this document we will interchangeably use the term “User” and “plaintiff” or “defendant” or “claim party.” Also, for the purpose of efficiency, “blood chemistry” may be used as short form or interchangeably with any superset or subset of blood, saliva, hair, urine, stool, fingernail, height, laser proxy scans, photo image scans, weight and skin sampling analysis or other biomarkers such by example but not limiting by example echocardiogram, nuclear perfusion studies, magnetic resonance imaging, positron emission tomography with biomarker chemistry data. In one exemplary implementation as illustrated in FIG. 107, a searchable food and beverage ranked node database interface 10710 may display a plurality of food and beverage selections 10770 to a user 10720 which may link to claim formation and securitization or transformation into a geolocation exchange unit. In one embodiment, a user 10720 may provide a blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis 10750 to a certified biomarker laboratory 151 through a plurality of options. In one embodiment a user 10720 may provide a positron emission tomography scan 10752 to the database to allow the machine learning recursive food and beverage optimization and search engine 10760 to display a plurality of ranked foods and beverages 10770. In one embodiment a user 10720 may provide an electrocardiogram, nuclear stress test, angiogram, computed tomography or magnetic resonance imaging data 10753 to the database to allow the machine learning recursive food and beverage optimization and search engine 10760 to display a plurality of ranked foods and beverages 10770. In another embodiment a user 10720 may provide a plurality of biometric samples 10750 to the database to allow the machine learning recursive food and beverage optimization and search engine 160 to display a plurality of ranked drugs, implants, foods and beverages 10770. In some embodiments, the machine learning recursive food and beverage optimization engine node ranks a database 10770 based on machine learning models 160 that estimate dependent claim variables on independent drugs, implants, foods, biomarker and beverages inputs 10770 based on predictive and historical samples of drugs, implants, foods, biomarker and beverages compared to a plurality of biomarker test results from labs including but not limited to blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis 10750.

The embodiment illustrated in FIG. 108, illustrates the certified laboratory 10890 may then transmit the biometric test results from the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis 10880 to a claim network 10830 which then archives the data in a biomarker blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis claim database server 10820. The network 10830 also interacts with the user 10881 and a food and drug and implant database server 10840 which has compiled a plurality of nutrition information on food and drug and chemical ingredients from a plurality of global resources. Food providers of raw food ingredients or prepared dishes use the graphical user interface 10870 of a CPU 10870 to upload ingredient information 10840 to the claim network 10830 which then stores the chemical and nutrition information in the claim food and drug and chemical database server 10840. The user 10881 interacts with the network 10830 through the graphical user interface 10870 by selecting a plurality of options regarding claims, medical conditions, chemicals, nutrition, health, variety, flavoring, style, ethnicity and delivery of prepared and raw ingredients. The cloud based CPU 10860 contains algorithms and machine learning sequences of linear and non-linear equations which use a plurality of vectors to determine the optimal nutrition ingredients or prepared dishes which optimize blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis of the user 10881 by interaction with the network 10830 and pulling data recursively from the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis database server 10820 and food database server 10840. In some embodiments, the node ranked implant, drug, food, chemistry objects are also ranked by negative influence on the objective function optimization equation algorithm. In some embodiments, the drug, food and beverage results may be node ranked in relation to moving the user 10810 towards a biomarker target with the highest efficiency and lowest variance or lowest efficiency and greatest amount of harm. The user 10881 may submit blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis 10880 to the certified laboratory 10870 through a plurality of methods to update the network 10830 and blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis database server 10820 in a plurality of frequencies to improve the ability of the algorithms in the cloud CPU 10860 to optimize ingredients and rank food and beverage selections from the drug, chemical, implant, food database server 10840. The food database server 10840 contains a schema for individual ingredients as well as combinations of ingredients from recipes which have been uploaded by a plurality of users 10881 through the graphical user interface 10870. The graphical user interface 10870 may be obtained on a stationary CPU, mobile device, augmented reality device, mixed reality device, audio interface or any device capable of presenting a graphical user interface 10870 or audio interface 10870 to a user 10881. The form of the graphical user interface may be a globe with flags of countries, a map with geographic location of countries, country listing, voice listing of countries or other representations of geographic and cultural areas 10870 or a plurality of food and beverage selections from the food database server 10840 over the network 10830 and wireless GPS network 10850. The user 10810 and network 10830 and graphical user interface 10870 may interact with the wireless GPS location network 10850 to obtain position of the user 10881 relative to the user 10881 to consider delivery mechanisms of the formed claim to the user and to constrain the optimization equations for claim recovery. The embodiment illustrated in FIG. 108. illustrates further a user 10881 interacting with a wireless network 10850 and a network 10830 that connects a blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling 10880 analysis database server 10820 based on blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis and test results from a user 10881 with a drug, chemical, implant, food database server 10840 which contains nutrition data on raw ingredients and combinations of raw ingredients in the form of recipes and prepared food and drugs in combinations of nutrition, side effects, health, variety, flavoring, style, ethnicity and delivery. The user 10881 may access the wireless network 10850, claim network 10830, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis database server 10820, drug and implant and incident and food database server 10840, cloud CPU 10860 or other CPUs accessible through the claim network 10830 through the graphical user interface 10870. The user 10881 continuously updates the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling 10880 analysis database server 10820 by having a certified laboratory or certified home collection kit collect blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis samples 10880 on a plurality of intervals to optimize claim selection from the food and drug and chemical and implant database server 10840.

FIG. 109A illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 109A illustrates a user 10910 selecting a country of origin for food flavor, variety, style, ethnicity preference from the graphical user interface 10930. The user 10910 may select the claim, side effects, flavor, variety, style, ethnicity preference 10940 which then initiates a method of setting up a recursive process of performing optimization equations on linear and nonlinear algebra vectors of various food combinations that optimize the side effects, claim issue, chemistry of blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis. FIG. 109B illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 109B illustrates the user 10910 directing a tool 10980 from the graphical user interface to select a plurality of prepared or raw food options such as a combination of meat, potatoes and other vegetables 10970, rice, Indian sauces, and breads 10960, seafood pasta 10950. In some embodiments, the user may also select implants, chemicals, drugs 10972 or other contact sources with the body to run the optimization equations over biomarkers. The user 10910 may scroll the suggested options 10970, 10960, 10950 by sliding, rolling, swiping or other intuitive movements to the graphical user interface 10990 user controlled pointer 10980. In some embodiments, the configuration of the device and user 10910 data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

FIG. 110A illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 110A illustrates a user 11010 selecting with the graphical user interface pointer 11040 a store or brand of food 11020 which carries raw drugs, implants, food or prepared foods that have been uploaded by the vendor 11020 so that the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis optimization equations may select raw ingredients, combinations of raw ingredients and prepared foods which optimize the users 11010 blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry. The user 11010 may also select restaurants or pharmacies 11030 that have uploaded drug and food menus or input choices that have been optimized for the users 11010 blood, side effects, claim effects, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry. FIG. 110B illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 110B illustrates a user 11050 directing a graphical user interface pointer 11080 in one configuration amongst many configurations where the user 11050 may select a drink such as coffee, hot statin ingredient chemical structure, tea, wine, milk, water, carbonated drink, juice, beer, cider, or spirit from a vendor 11060, 11070 who participates in the system. In some embodiments, vendors 11060, 11070 may provide food, drugs, pharmaceuticals, implants or other contact with the body. In some embodiments, the configuration of the device data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

FIG. 111 illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 111 illustrates a user 11110 selecting with the graphical user interface pointer 11140 a style or country or flavor or ethnicity of food 11130 as an input to the vector based system of linear and non-linear equations to optimize blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis of a user 11110 taking into account the style or country or flavor or ethnicity that the user 11110 desires. In some embodiments, the configuration of the device data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

FIG. 112B illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 112B illustrates a user 11260 selecting with the graphical user interface a drink 11270 and combination of ingredients in the form of a recipe which includes raw ingredients or prepared food 11290 which can then be picked up at a specified location or delivered to the user 11260 via a drone 11280 or a plurality of other delivery methods. FIG. 112A illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 112A illustrates that a user 11260 may be connected to the claim network of stores that use the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis optimized database structure and schema 11220 to optimize side effect data, claim data, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry considering food consumption. A plurality of pick up or delivery methods may be utilized that include but are not limited to programmed drones 11210, 11230, 11240, 11250. The drones may be operated by humans or may be autonomous. In some embodiments, the configuration of the device data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

FIG. 113B illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 113B illustrates a user 11360 selecting with the graphical user interface a drink 11370 and combination of ingredients in the form of a recipe or prescription which includes raw ingredients or drugs or implants or prepared food 11390 which can then be picked up at a specified location or delivered to the user 11360 via a vehicle 11380 or a plurality of other delivery methods. In similar embodiments, claim data may also be delivered with the delivery network. FIG. 113A illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 113A illustrates a user 11360 that may be connected to the claim network of stores that use the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis optimized database structure and schema 11330 to optimize claim outcomes, side effects, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry considering food consumption. A plurality of pick up or delivery methods may be utilized that include but are not limited to programmed vehicles 11310, 11320, 11340, 11350. The vehicles 11380 may be operated by humans or may be autonomous. In some embodiments, the configuration of the device data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

FIG. 114 illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 114 illustrates a user 11410 may select with the graphical user interface blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis optimized food or drugs which are ready for pickup 11420 from a store or restaurant or cooking node or claim formation node, which is connected to the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis optimized claim network 11430. Grocery stores, food warehouses, co-ops, food distribution centers, restaurants, pharmacies, labs, hospitals, certified kitchens, or a plurality of other nodes capable of providing raw or prepared food, drugs or implants may be connected to the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis optimized nutrition claim network 830. Grocery stores, food warehouses, co-ops, food distribution centers, restaurants, drug stores, certified kitchens, or a plurality of other nodes capable of providing raw or prepared food may prepare the food for pickup 11420 or distribute the claim data or drugs or food via drone or delivery vehicle. In some embodiments, the configuration of the device data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

FIG. 115 illustrates a system in accordance with implementations of various techniques described herein. In particular, FIG. 115 illustrates a user 11510 may select with the graphical user interface pointer 11580 blood and saliva optimized food which may have a certain type of food designation such as gluten free 11520, halal 11530, kosher 11540, peanut free 11550, sugar free 11560, vegetarian 11570, or drug allergies, or drugs or a plurality of other designations that would be in the preference portfolio vector of the user 11510. In some embodiments, the configuration of the device data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

In one implementation as illustrated in FIG. 116, they method and system may maximize 11610 foodie score, user utility, nutrient content, flavoring, ethnicity, variety, style, preference, health, delivery subject to a plurality of contribution, constraint and variance data comprised from blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis samples 10880 to a certified laboratory 10890 through a plurality of options. In some embodiments the biomarker settings may consider blood type, phosphorus levels, platelets, HDL Cholesterol, Thyroid, Hemoglobin, Iron, Vitamin B12, Hematocrit, Ketones, Amylase, Mean Corpuscular Volume, LDL cholesterol, serum protein, blood glucose, magnesium, complete blood count, potassium, red blood cells, calcium, progesterone, white blood cells, electrolytes, creatine kinase, triglycerides, allergen profile, troponin, coagulation panel, celiac, budget, HLA-DQ8 Gene, HLA-DQ2 gene, sums of ingredients, allergies, weight constraints, beta amyloid, serum docosahexaenoic acid, tau phosphorylation, serum low density lipoprotein (LDL), narcotics, hallucinogens, opioids, depressants, anabolic steroids, alcohol, stimulants, statins, human growth hormone, HMG-CoA reductase inhibitors and other measurable biomarkers 11620. In some embodiments, the configuration of the device data and analysis of the data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

The embodiment illustrated in FIG. 117, illustrates the mobile network based ball CPU projection device 11725. In some embodiments, the biomarker optimized food methods and system may be used on any CPU device which is stationary or mobile with access to a network. In one implementation, one configuration of a CPU device which can process the biomarker optimized food methods and system may be the device 11725 which may include a memory 11702, a memory controller 11703, one or more processing units (CPUs) 11704, a peripherals interface 11705, RF circuitry 11706, audio circuitry 11708, one or more speakers 11707 and 11715, a microphone 11709, an input/output (I/O) subsystem 11710, input control devices 11711, an external port 11712, optical sensors 11716, camera 11713, one or more laser projection systems 11714, power supply 11717, battery 11718, Wi-Fi module 11719, GPS receiver 11720, accelerometer 11721, Ambient light sensor 11722, location sensor 11723, barometer 11724, USB port 11725. The device 11725 may include more or fewer components or may have a different configuration or arrangement of components. The CPUs 11704 run or execute various instructions compiled by software and applications which are stored in the memory 11702 that perform various functions on the device 11725 such as the biomarker optimized food methods and system. The RF circuitry 11706 receives and sends RF signals. The RF circuitry 11706 converts electrical signals to/from electromagnetic signals and communicates with communications claim networks 10830 and 10850 and other communication devices via the electromagnetic signals. The instructions to perform the mathematic algorithm optimization may be on a local CPU such as 1125 or a cloud based CPU 190. The RF circuitry may be comprised of but not limited to an antenna system, a tuner, a digital signal processor, an analogue signal processor, various CODECs, a SIM card, memory, amplifiers, an oscillator and a transceiver. The wireless communication components may use a plurality of standard industry protocols such as Global System for Mobile Communication (“GSM”), Voice over internet protocol (“VOIP”), long-term evolution (“LTE”), code division multiple access (“CDMA”), Wireless Fidelity (“Wi-Fi”), Bluetooth, Post office Protocol (“POP”), instant messaging, Enhanced Data GSM Environment (“EDGE”), short message service (“SMS”), or other communication protocol invented or not yet invented as of the filing or publish date of this document. The input/output subsystem 11710 couples with input/output peripherals 11705 and other control devices 11711 and other laser projection systems 11714 to control the device 11725. The laser projection system 11714 and camera 11713 take infrared tracking information feedback from the user 10881 into the peripheral interface 11725 and CPU 11704 to combine the data with instructions in the CPU 11704 and memory 11702 that provide an iterative instruction for the graphical user interface which is displayed in the waveguide lens or screen after comparison with information in the memory from the database server 10840. The input control devices 11711 may be controlled by user 10881 movements that are recorded by the laser projection system 11714 and camera 11713. The audio circuitry 11708, one or more speakers 11707 and 11715 and the microphone 11719 provide an audio interface between the user and the device 11725. The audio circuitry 11708 receives audio data from the peripherals interface 11705, converting the data to an electrical signal, and transmits the electrical signal to the speakers 11707 and 11715. The speakers 11707 and 11715 convert the electrical signals to human audible sound waves which are mechanotransducted into electrical impulses along auditory nerve fibers and further processed into the brain as neural signals. The audio circuitry 11708 also receives electrical signals converted by the microphone 11709 from sound waves. The audio circuitry 11708 converts the electrical signal to audio data and transmits the audio data to the peripherals interface 11705 for processing. Audio data may be retrieved and/or transmitted to memory 11702 and/or the RF circuitry 11706 by the peripherals interface 11705. In some embodiments the RF circuitry may produce ultra-high frequency waves that transmit to wireless headphones which then convert the electrical signals to human audible sound waves which are mechanotransducted into electrical impulses along auditory nerve fibers and further processed into the brain as neural signals. The device 11725 also includes a power supply 11717 and battery 11718 for powering the various components. The USB port 11725 may be used for providing power to the battery 11718 for storage of power. The location sensor 11723 couples with the peripherals interface 11705 or input/output subsystem 11710 to disable the device if the device 11725 is placed in a pocket, purse or other dark area to prevent unnecessary power loss when the device 11725 is not being used. The software instructions stored in the memory 11702 may include an operating system (LINUX, OS X, WINDOWS, UNIX, or a proprietary operating system) of instructions of various graphical user interfaces 1200. In some embodiments, the configuration of the device data and device and analysis of the data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

In some embodiments, the embodiment illustrated in FIG. 118, illustrates the graphical user interface of the system which may include a network based ball CPU projection device 11725. In some embodiments, system may include instructions for object hologram embodiments of a calendar 11801, photos 11812, camera 11812, videos 11809, maps 11811, weather 11802, credit cards 11815, banking 11815, crypto currency 11815, notes, clocks 11813, music 11806, application hosting servers 11820, settings 11820, physical fitness 11803, news 11816, video conferencing 11809, home security 11808, home lighting 11808, home watering systems 11808, home energy 11808 or temperature settings 11808, home cooking 11807, phone 11814, texting services, mail 11818, internet 11817, social networking 11819, blogs 11819, investments 11810, books, television 11809, movies 11809, device location, flashlights, music tuners 11806, airlines 11805, transportation 11805, identification 11819, translation, gaming 11821, real estate 11808, shopping, food 11807, commodities 11815, technology 11817, memberships, applications 11820, web applications 11817, audio media 11806, visual media 11809, mapping or GPS 11811, touch media 11817, drugs and implants 11826, general communication 11814, internet 11817, mail 11818, contacts 11819, cloud services 11820, games 11821, translation services 11823, virtual drive through with geofence location services for nearby restaurants to allow advance ordering of food and payment 11824 such as the claim biomarker based algorithm to optimize claim formation, side effect data, claim payout, claim damage measurement, personal nutrition, virtual shopping with custom measurements through infrared scans 11825 and/or the like, and facilitates communication between various hardware and software components. The biomarker optimized drug and food algorithm application may appear as represented in object 11807 or 11824. The application 11807 or 11824 may scan pictures of drugs or food which has been set for consumption by the user which has not been ordered through the system so that the ingredients or chemicals or implants may be identified, and the data included in the blood and saliva based optimization models of biomarker chemistry. In some embodiments, the configuration of the device data and device and analysis of the data then allows for claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

In some embodiments, the process flow diagram in FIG. 119, illustrates implementations of methods and the system where a user 10881 uses the system and methods. In some embodiments, a user 10881 starts 11910 the implementation of the methods and systems by selecting a plurality of options regarding drugs, side effects claims, nutrition, health, variety, flavoring, style, ethnicity and delivery. In some embodiments, the system takes the inputs to execute on a processor instructions configured to 11920 complete the following instructions. In one implementation of the methods, the system maps systems of linear and non-linear blood, saliva, hair, urine, stool, fingernail, height, weight, biomarker, and skin sampling analysis vectors from databases in the system 11930. The map of the system of linear and non-linear blood, saliva, hair, urine, stool, fingernail, height, biomarker, weight and skin sampling analysis vectors forms a matrix which will then form the basis of part of the system of optimization equations used to select food options for the user. The system and methods further map systems of linear and non-linear food and drug and implant ingredient vectors from databases in the system 11940 which form a matrix of drug and implant and food nutrition content. The matrices are then multiplied to optimize the weights of ingredients to ensure optimal side effects, claim damage, claim recovery, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry for the user's body. The variance-covariance matrix is square and symmetric. In some embodiments, The optimization equation weights have also considered groups of drug and food ingredients that form the basis of prepared meals or prescriptions and recipes which are combinations of ingredients. In some embodiments, the system then provides the user claim formation data, delivery and pick-up options for selected combinations of foods or drugs 11960. The implementation of methods is recursive, and the optimal weights are being adjusted after each human body contact considering the historical ingredients consumed and biomarkers, claim data, side effects, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis data that is submitted into the database of the system for node rankings. The techniques and methods discussed herein may be devised with variations in many respects, and some variations may present additional advantages and/or reduce disadvantages with respect to other variations of these and other techniques and methods. Moreover, some variations may be implemented in combination, and some combinations may feature additional advantages and/or reduced disadvantages through synergistic cooperation and reweighting of the models through recursive optimization. The variations may be incorporated in various embodiments to confer individual and/or synergistic advantages upon such embodiments. In some embodiments, the configuration of the device data and device and analysis of the data then allows for method and system claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

FIGS. 120A and 120B illustrate a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIGS. 120A and 120B may correspond to a representative food or drug market with heterogeneous expectations. Traditionally the buyer and seller have very different information (e.g., doctor and patient). In an exemplary scenario, the seller, manufacturer, physician, or cook knows the ingredient attributes whereas the buyer may make a purchase without knowing the ingredient attributes or their chemistry effect on the blood, body or other biomarkers. Surely the buyer can do research on all the ingredients, but generally the buyer does not have the same resources as the producer of the food who has food scientists and research staff to understand the effects of the ingredient attributes on biomarkers or other aspects of human health. Similarly, a mother or father may make a batch of cookies for their child thinking that the act of making cookies is showing love to their child if consumed in reasonable quantities. However, if the father or mother did not know their child was gluten intolerant or had celiac disease in fact they were unknowingly inflicting pain on their child through the dietary choice. The implementation of the method and system also considers the asymmetric information between pharmaceutical companies (great amounts of scientists, chemists, PhDs, etc.) and those who are prescribed the drugs and products (consumers with considerably less resources). The implementation of the method considers that it is very costly for buyers and sellers of food or drugs to have homogeneous information or even to reduce heterogeneous information so that people make less sub-optimal drug or food choices as consumers or that stores offer the wrong types of food to their primary demographics and customers. The implementation of the method has provided a solution for these problems and has greatly reduced or nearly eliminated the problem of heterogeneous information on food ingredients relative to personal biomarkers, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry. The implementation of the method allows both the pharmaceutical company, hospital, physician, restaurant and the customer or patient to speak the same language of food and drug chemistry for the respective biomarker chemistry while considering side effects, claim data, flavor, ethnicity, or style preferences. The implementation of the method allows both the family meal cook and the family member or friend to speak the same language of food chemistry for the respective blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry while considering flavor, ethnicity, or style preferences. The implementation of the method allows both host of a party and all the guests to speak the same language of food chemistry for the respective blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry of guests while considering flavor, ethnicity, or style preferences. Blood tests and saliva samples and biomarker samples historically have been costly which add to the problem of heterogeneous information between food, drug, implant provider and consumer. The implementation of the method and system may cover the cost of the biomarker, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis test which can be self-administered with system equipment or administered by a lab in the system and method network. The method and system may reduce the overall food consumption of the user by providing mathematically rigorous drug side effect analysis, food nutritional for the consumer's biomarkers, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis which reduces food waste, medical malpractice, predatory pharmaceutical practices and wasted calorie consumption. The biomarker blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis test may be self-administered through method and system equipment that is sent to the user or administered by a lab in the system. To quantify embodiments of the method and system 12000, FIG. 120A illustrates a general claim utility function. The system and method assigns a utility function or “Foodie Score” or “Claim utility” or “side effect utility” 12010 to their medical or incident claim issue or diet preferences which ranks through a series of neural network feedback on drug chemistry, body biomarker feedback, claim recovery, food styles, ethnicity, variety, flavoring. The equation 12010 has the following variables, F(foodie score) or F(biomarker score) which is the utility function, E(Bblood chemistry) which is the current biomarkers, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry of a portfolio of ingredients minus 0.005 which is a scaling convention that allows the system and method to express the current biomarkers, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry of a portfolio of ingredients and the standard deviation of those ingredients to be a percentage rather than a decimal. The term A in 12010, is an index of the user's preference which is derived from using neural networks that have been trained on the users preferences. In some embodiments, the term A in 12010 is continually updated in a recursive fashion to reflect the user's preferences in style, ethnicity, flavoring or other characteristics. In some embodiments, the sigma term squared in 12010 is the variance is of the blood chemistry of a portfolio of ingredients. In some embodiments, the biomarker utility function or foodie score 12010 represents the notion that the biomarker utility is enhanced or goes up when the biomarker, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry is within target and diminished or reduced by high variance blood chemistry or blood chemistry which brings the user out of target ranges. In some embodiments, the utility function may be inverted to solve for claim damages or high side effect levels from certain implants or drugs in chemistry testing. In some embodiments, the extent by which the plaintiff, foodie or user is negatively affected by blood chemistry variance biomarker variance or biomarker, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry variance outside of target ranges depends on the term A in 12010 which is the user's preference index. More dietary sensitive foodies or user's may have a higher term A index value as their blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry is disadvantaged more by biomarker, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry variance and out of range blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry. Claim Plaintiff's or Foodie's or user's may pick meals or portfolios of ingredients based on the highest F(biomarker score) or F(foodie score) in the equation 12010 which also may be inverted to measure maximum negative utility as well as positive utility. In some embodiments, search recipe for drug or implant or food and beverage combinations may be node ranked based on claim recovery ranking, claim credit, or on the distance of the drug or food combination portfolio value and the foodie utility function 12010 or a plurality of other factors. If a drug or implant or food ingredient or portfolio of ingredients has no variance to blood chemistry of the user then a selection will have a utility or biomarker score or Foodie Score of the expected biomarker chemistry without variance as the sigma term in equation 12010 is equal to zero. Equation 12010 provides a benchmark for the system and method to evaluate drug or implant ingestion or meals effect on biomarker chemistry. In some embodiments, in the implementation of the method according to equation 12010, the term A determines preferences of the user which then may cause as certain drugs or implants or meals to be accepted or rejected based upon the effect to blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry.

In some embodiments, the implementation of the system and method is further represented in equations 12020 to take a simple two state case of biomarker chemistry for an exemplary user. In some embodiments, if a user has an initial biomarker blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry (each biomarker may be represented as short form “blood chemistry”) represented as a vector of attributes and assume two possible results after eating an ingredient or a portfolio of ingredients as a meal with a vector of blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry attributes. The probability of state one is p for state of Blood Chemistry 1 and a probability of (1−p) for the state two of blood chemistry 2. In some embodiments, accordingly, the expected value of blood chemistry as illustrated in the set of equations 1430 is E(Blood chemistry) equals probability p multiplied by blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry state 1 plus probability (1−p) multiplied by blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry state 2. The variance or sigma squared of the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry is represented in 12040. In some embodiments, the configuration of the device data and device and analysis of the data then allows for method and system claim formation of the geolocation exchange unit of litigation and patent geolocation claim units.

FIG. 121A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 121A represents the tradeoff between the standard deviation of biomarker, blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry of a drug or meal and the expected return of the blood, saliva, hair, urine, stool, fingernail, height, weight and skin sampling analysis chemistry of a drug or meal 12110. Meal or Drug or Ingredient combination M 12110 is preferred by Foodies or users with a high term A index value 12010 to any alternative meal in quadrant IV 12010 because the expected value of the blood chemistry of the meal is expected to be equal to or greater than any meal in quadrant IV and a standard deviation of the meal blood chemistry is smaller than any drug or meal combination in that quadrant. Conversely, any meal or drug M in quadrant I is preferable to meal or drug M 12010 because its expected blood chemistry is higher than or equal to meal M 12010 and the standard deviation of the blood chemistry of the meal or drug M is equal to or smaller than meal or drug M 12010. FIG. 121B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 121B represents the inequality condition. Accordingly, if the expected value of the blood chemistry of a certain meal 1 is greater than or equal to the expected value of the blood chemistry of a certain meal 2 12020 and the standard deviation of the blood chemistry of a certain meal or drug 1 is less than or equal to the standard deviation of the blood chemistry of a certain meal or drug 2 12020, at least one inequality is strict which rules out inequality 12020.

FIG. 122A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 122A supposes a user, claim plaintiff or Foodie identifies all the drug combinations or meals that are equally attractive from a utility and blood chemistry perspective to meal or drug M1 12210, starting at point meal or drug M1 12210, an increase in standard deviation of the blood chemistry of the meal lowers utility and must be compensated for by an increase in the expected value of the blood chemistry. In some embodiments, thus meal, drug, or implant M2 is equally desirable to the claim plaintiff or user or Foodie as meal or drug M1 along the indifference curve 12210. Foodies are equally attracted to meals with higher expected value of blood chemistry and higher standard deviation of blood chemistry as compared to meals with lower expected value of blood chemistry and lower standard deviation of blood chemistry along the indifference curve 12210. Equally desirable drug combinations or meals lie on the indifference meal curve that connects all meals or drugs or implants with the same utility value 12210.

FIG. 122B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 122B examines meals along a claim plaintiff, user or Foodie's indifference curve with utility values of several possible meals or drug or implant combinations for a claim plaintiff, user or Foodie with a term A index value of 4. 12220. The table of combinations of meals 12220 illustrates as one embodiment an expected value of blood chemistry of a meal or drug index of 10 and a standard deviation of the blood chemistry of the meal of 20% 12220. In some embodiments, accordingly the biomarker score or Foodie Score or utility function is therefore 10 minus 0.005 multiplied by 4 multiplied by 400 equals 2 as a utility score. FIG. 122B also illustrates 3 additional examples of various expected values of meal blood chemistry and standard deviation of a meals blood chemistry 12220.

FIG. 120A, FIG. 120B, FIG. 121A, FIG. 121B, FIG. 122A, and FIG. 122B discuss the blood chemistry of a meal for a particular claim plaintiff, user or Foodie. Such meals, implants or drug combinations are composed of various types of ingredients. In some embodiments, claim plaintiffs, users, Foodies may eat or ingest single ingredients or drugs or implants or meals which combine ingredients. In some embodiments, adding a certain ingredient increased the utility of a Foodie's blood chemistry, while in some embodiments adding an ingredient decreases the utility. In many contexts, “Health Food” offsets the effects of “Unhealthy Food.” In one embodiment, a drug such as statins may reduce cholesterol but reduce platelet count or cause diarrhea or constipation. In one embodiment, dark statin ingredient chemical structure is a power source of antioxidants which raises the utility of the blood chemistry. In one embodiment, statin ingredient chemical structure may raise HDL cholesterol and protect LDL Cholesterol against oxidization. In another embodiment, too much statin ingredient chemical structure may lower the utility of blood chemistry as it is high in saturated fat and sugar. In another embodiment, excessive sugar spikes the blood glucose chemistry which contributes to calories that do not have much nutrient value for the blood chemistry utility function which puts as risk weight gain and other health complications. In one implementation of the method and system, a claim plaintiff, user or Foodie may think it is counterintuitive adding a seemingly indulgent ingredient or recipe that may actually increase the blood chemistry performance as it can reduce the build-up of unwanted attributes and reduce the risk or standard deviation of the Foodie's blood chemistry towards and unwanted outcome. Although statin ingredient chemical structure in and of itself may have an uncertain outcome and a negative effect on blood chemistry. Statin ingredient chemical structure combined with other ingredients and recipes may have an overall benefit towards blood chemistry. The helpful effects come from a negative correlation of individual ingredients. The negative correlation has the effect of smoothing blood chemistry variance for a certain Foodie user.

FIG. 123A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 123A examines one exemplary probability distribution of a particular ingredient affecting the blood chemistry of a Foodie or user 12310. State 1 probability of the opioid ingredient chemical structure is 0.5 in table 12310 and the expected value of the opioid ingredient chemical structure is to increase the blood chemistry by 25% towards the target blood chemistry range 12310, State 2 probability of the opioid ingredient chemical structure is 0.3 in table 12310 and the expected value of the opioid ingredient chemical structure is to increase the blood chemistry by 10% towards the target blood chemistry range 12310, State 3 probability of the opioid ingredient chemical structure is 0.2 in table 12310 and the expected value of the opioid ingredient chemical structure is to decrease the blood chemistry by 25% towards the target blood chemistry range 12310. In some embodiments, accordingly the effect on the claim plaintiff, user, or Foodie's blood chemistry is the mean or expected return on blood chemistry of the ingredient is a probability weighted average of expected return on blood chemistry in all scenarios 12320. Calling Pr(s) the probability scenario s and r(s) the blood chemistry return in scenario s, we may write the expected return E(r) of the ingredient on blood chemistry, as is done in 12320. FIG. 123B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 123B illustrates that, when applying the formula of expected return of opioid ingredient chemical structure on blood chemistry 12320 with the three possible scenarios in 12310, the expected return of opioid ingredient chemical structure on blood chemistry of the claim plaintiff, user, or Foodie is 10.5% toward the target range in example 12320. FIG. 123C illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 123C shows that the variance and standard deviation of opioid ingredient chemical structure on blood chemistry is 357.25 for variance and 18.99% for standard deviation 12330.

In some embodiments, exemplary embodiments of scenario probabilities vary amongst blood types and composites, so the method and system is not limited to a single set of weights, but rather the system learns new weights using neural network probability weightings with iterative feedback from biomarker sampling to ascertain recursive effects of food chemistry onto blood chemistry.

FIG. 124A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 124A shows that the blood chemistry of a vector of ingredients is the weighted average of the biomarker or blood chemistry of each individual ingredient, so the expected value of the biomarker or blood chemistry of the meal is the weighted average of the blood chemistry of each individual ingredient 12410. In the exemplary two ingredient combination of opioid ingredient chemical structure and statin ingredient chemical structure in 12410, the expected value of the combined blood chemistry is 7.75% toward the target blood chemistry range. The weight of an ingredient may be represented to incorporate serving size and calorie count as part of the measure 12410 of how ingredients affect blood chemistry.

FIG. 124B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, the standard deviation of the blood chemistry of the combined ingredients is represented in 12420 of FIG. 124B.

Because the variance reduction in the combination since the foods were not perfectly correlated, the exemplary implementation of the method and system illustrates that a Foodie or User may be better off in their blood chemistry by adding ingredients which have a negative correlation yet positive expected value gain to blood chemistry because the variance of the blood chemistry has been reduced. To quantify the diversification of various drug and implant and food ingredients we discuss the terms of covariance and correlation. The covariance measures how much the blood chemistry of two ingredients or meals move in tandem. A positive covariance means the ingredients move together with respect to the effects on blood chemistry. A negative covariance means the ingredients move inversely with their effect on blood chemistry. To measure covariance, we look at surprises of deviations to blood chemistry in each scenario. FIG. 124C illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, as stated in 12430 of FIG. 124C, the product will be positive if the blood chemistry of the two ingredients move together across scenarios if both ingredients exceed their expectations on effect on blood chemistry or both ingredients fall short together. If the ingredients effect on blood chemistry move in such a way that when Opioid ingredient chemical structure has a positive effect on blood chemistry and statin ingredient chemical structure has a negative effect on blood chemistry, then the product of the equation in 12430 would be negative. FIG. 124D illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, Equation 12440 in FIG. 124D is a good measure of how the two ingredients move together to effect blood chemistry across all scenarios which is defined as the covariance.

An easier statistic to interpret than covariance is the correlation coefficient which scales the covariance to a value between negative 1 (perfect negative correlation) and positive 1 (perfect positive correlation). The correlation coefficient between two ingredients equals their covariance divided by the product of the standard deviations. FIG. 125A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, using the Greek letter rho as shown in FIG. 125A, we find in equation 12510 the formula for correlation in an exemplary embodiment. The correlation equation 12510 can be written to solve for covariance or correlation. Studying equation 12510, one may observe that foods which have a perfect correlation term of 1, have their expected value of blood chemistry as just the weighted average of the any two ingredients. If the correlation term in 1910 has a negative value, then the combination of ingredients lowers the standard deviation of the combined ingredients. The mathematics of equations 12510 and 12520 show that drugs or implants or foods can have offsetting effects which can help overall target blood chemistry readings and health. Combinations of ingredients where the ingredients are not perfectly correlated always offer a better combination to reduce blood chemistry volatility while moving more efficiently toward target ranges.

FIG. 125B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, the impact of the covariance of individual ingredients on blood chemistry is apparent in the formula 12520 of FIG. 125B for biomarker or blood chemistry variance.

The most fundamental decision of a claim plaintiff, user or Foodie is how much of each drug or food should one eat? And how will it affect my health and blood chemistry. Therefore, one implementation of the method and system covers the blood chemistry tradeoff between combinations of ingredients or dishes or various portfolios of ingredients or recipes or meals or prepared dishes or restaurant entrees.

FIG. 125C illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, recalling the biomarker score or Foodie Score or Utility equation of a user 12010, the Foodie attempts to maximize his or her utility level or Foodie score by choosing the best allocation of a portfolio of ingredients or menu selection written as equation 12530 of FIG. 125C. Note that to anyone skilled in the art the negative scenario could be similarly modeled to optimize for the worst or most negative influence on biomarkers or most harmful influence.

Constructing the optimal portfolio of ingredients or a drug combination or recipe or menu or meal is a complicated statistical task. The principle that the method and system follow is the same used to construct a simple two ingredient recipe or combination in an exemplary scenario. FIG. 126A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. To understand the formula for the variance of a portfolio of ingredients more clearly, we must recall that the covariance of an ingredient with itself is the variance of that ingredient such as is shown in FIG. 126A. Wing1 and Wing2 12610 are short for the weight associated with ingredient or meal 1 and ingredient or meal 2. The matrix 12610 is simply the bordered covariance matrix of the two ingredients or meals.

FIG. 126B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, the descriptive statistics for two ingredients are listed as the expected value and standard deviation as well as covariance and correlation between the exemplary ingredients 12620 of FIG. 126B. The parameters for the joint probability distribution of returns is shown in FIG. 126B.

FIGS. 127A and 127B illustrate a ranking formulation configuration in accordance with implementations of various techniques described herein. In some implementations, different proportions may be used to observe the effect on the expected blood chemistry and variance of blood chemistry. Suppose the proportion of the meal weight of opioid ingredient chemical structure is changed. The effect on the blood chemistry is plotted in FIG. 127A. When the proportion of the meal that is opioid ingredient chemical structure varies from a weight of zero to one, the effect on blood chemistry change toward the target goes from 13% (expected blood chemistry of statin ingredient chemical structure) to 8% (expected blood chemistry of opioid ingredient chemical structure). Of course, varying proportions of a meal also has an effect on the standard deviation of blood chemistry. FIG. 127B presents various standard deviation for various weights of opioid ingredient chemical structure and statin ingredient chemical structure 12720.

FIG. 128A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 128A shows an implementation in which the meal combination blood chemistry standard deviation when correlation rho is at 0.30. The thick curved black line labeled rho=0.3 in FIG. 12810. Note that the combined meal blood chemistry of opioid ingredient chemical structure and statin ingredient chemical structure is a minimum variance combination that has a standard deviation smaller than that of either opioid ingredient chemical structure or statin ingredient chemical structure as individual ingredients. FIG. 128A highlights the effect of ingredient combinations lowering overall standard deviation. The other three lines in FIG. 128A show how blood chemistry standard deviation varies for other values of the correlation coefficient, holding the variances of the ingredients constant. The dotted curve where rho=0 in FIG. 128A depicts the standard deviation of blood chemistry with uncorrelated ingredients. With the lower correlation between the two ingredients, combination is more effective and blood chemistry standard deviation is lower. The minimum standard deviation of the meal combination in table 12720 of FIG. 127B shows a value of 10.29% when rho=0. Finally, the upside down triangular broken dotted line represents the potential case where rho=−1 and the ingredients are perfectly negatively correlated 12710. In the rho=−1 case, the solution for the minimum variance combination is an opioid ingredient chemical structure weight of 0.625 and a statin ingredient chemical structure weight of 0.375, as shown in FIG. 128A. The method and system can combine FIG. 127A and FIG. 128A to demonstrate the relationship between the ingredients combination's level of standard deviation to blood chemistry and the expected improvement or decline in expected blood chemistry given the ingredient combination parameters.

FIG. 128B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 128B shows that, for any pair of ingredients or meals which may be illustrated for an exemplary case, but not limited to the exemplary case w(statin ingredient chemical structure) and w(opioid ingredient chemical structure), the resulting pairs of combinations from 12810 and 12720 and 12710 are plotted in 12820. The solid curved line in 12820 labeled with rho=0.3 shows the combination opportunity set while correlation equals 0.3. The name opportunity set is used because it shows the combination of expected blood chemistry and standard deviation of blood chemistry of all combinations that can be constructed from the two available ingredients. The broken dotted lines show the combination opportunity set for the other values of the correlation coefficient. The line farthest to the right, which is the straight line connecting the combinations where the term rho equals one, shows there are no benefits to blood chemistry from combinations between ingredients where the correlation between the two ingredients is perfectly positive or where the term rho equals one. The opportunity set is not “pushed” to the northwest. The curved dotted line to the left of the curved solid line where the term rho equals zero shows that there are greater benefits to biomarker or blood chemistry when the correlation coefficient between the two ingredients is zero than when the correlation coefficient is positive, as shown in 12820. Finally, the broken line where the term rho equals negative one shows the effect of perfectly negative correlation between ingredients. The combination opportunity set is linear but offers the perfect offset between ingredients to move toward target blood chemistry, as shown in 12820. In summary, although the expected blood chemistry of any combination of ingredients is simply the weighted average of the ingredients expected blood chemistry, this is not true for the combination of ingredients standard deviation. Potential benefits from combinations of ingredients arise when correlation is less than perfectly positive. The lower the correlation coefficient, the greater the potential benefit of combinations. In the extreme case of perfect negative correlation between ingredients, the method and system show a perfect offset to blood chemistry, and we can construct a zero-variance combination of ingredients, as shown in 12820.

In another embodiment, suppose a claim plaintiff, or user, or Foodie wishes to select the optimal combination from the opportunity set. The best combination will depend upon the Foodie's preferences and aversion to the standard deviation of ingredients. Combinations of ingredients to the northeast, as shown in FIG. 128B, provide higher movements towards expected target blood chemistry but impose greater levels of volatility of ingredients on blood chemistry. In some embodiments, the best trade-off among these choices is a matter of personal preference. In other embodiments, Foodie's with greater desire to avoid volatility in their blood chemistry will prefer combinations of ingredients in the southwest, with lower expected movement toward target blood chemistry, but lower standard deviation of blood chemistry, as shown in 12820.

In the embodiment illustrated in FIG. 128B, most Foodie's recognize the really critical decision is how to divvy up their selection amongst ingredients or drug combinations or meal combinations. FIG. 129A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, in FIG. 129A, the exemplary diagram is a graphical solution. FIG. 129A shows the opportunity set generated from the joint probability distribution of the combination of ingredients opioid ingredient chemical structure and statin ingredient chemical structure using the data from FIG. 127B. In some embodiments, two possible allocation lines are drawn and labeled “Foodie allocation line.” The first Foodie allocation line (A) is drawn through the minimum variance ingredient combination point A which is divided as 82% opioid ingredient chemical structure and 18% statin ingredient chemical structure. The ingredient combination has an expected target blood chemistry movement of 8.9% and its standard deviation is 11.45% blood chemistry 12910. FIG. 129B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, the reward to variability ratio or slope of the Foodie allocation line combining a zero variance ingredient (which may be certain types of water) with opioid ingredient chemical structure and statin ingredient chemical structure with the aforementioned weights of 82% opioid ingredient chemical structure and 18% statin ingredient chemical structure, forms an equation as shown in FIG. 129B. In some embodiments, accordingly the exemplary slope 12920 of Foodie Allocation Line (A) is 0.34. Considering the embodiment in FIG. 129A of Foodie allocation line (B), the ingredient combination was 70% opioid ingredient chemical structure and 30% statin ingredient chemical structure, the expected movement towards target blood chemistry is 9.5%. In some embodiments, thus the reward to variability ration or slope of Foodie allocation line(B) is 9.5 minus 5 divided by 11.7 which equals 0.38 or a steeper slope as illustrated in FIG. 129A. If the Foodie allocation line (B) has a better reward to variability ratio than the Foodie allocation line (A), then for any level of standard deviation that a Foodie is willing to bear, the expected target blood chemistry movement is higher with the combination of point B. FIG. 129B illustrates the aforementioned exemplary case, showing that Foodie allocation line (B) intersection with the opportunity set at point B is above the Foodie allocation line (A) intersection with the opportunity set point A. In this case, point B allocation combination dominates point A allocation combination. In fact, the difference between the reward to variability ratio is the difference between the two Foodie allocation line (A) and (B) slopes 12920. The difference between the two Foodie allocation line slopes is 0.38−0.34=0.04. This means that the Foodie gets four extra basis points of expected blood chemistry movement toward the target with Foodie allocation line (B) for each percentage point increase in standard deviation of blood chemistry 12910. If the Foodie is willing to bear a standard deviation of blood chemistry of 4%, the Foodie can achieve a 5.36% (5+4×0.34) expected blood chemistry movement to the target range along Foodie allocation line (A) and with Foodie allocation line (B) the Foodie can achieve an expected movement of blood chemistry to the target of 6.52% (5+4×0.38) 12910. Why stop at point B? In some embodiments, the Foodie can continue to ratchet up the Foodie allocation line until it ultimately reaches the point of tangency with the Opportunity set 12910. This aforementioned exemplary scenario in FIG. 129A must yield the Foodie allocation line with the highest feasible reward to variability ratio.

FIG. 130A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 130A shows the highest sloping Foodie allocation line (C) at point P intersecting with the opportunity set. Point P is the tangency combination of ingredients where the expected blood chemistry target movement is the highest relative to the opportunity set and standard deviation of ingredients or meal combinations 13010. The optimal combination or allocation of ingredients is labeled point P. At Point P, the expected blood chemistry movement to the target is 11% while the standard deviation of point P is 14.2%. In practice, we obtain the solution to the method and system with a computer program with instructions to perform the calculations for the Foodie 13010. The method process to obtain the solution to the problem of the optimal mix of ingredients or drug combinations or implants or dish combinations of weight opioid ingredient chemical structure and weight statin ingredient chemical structure or any other combination of ingredients is the objective of the method and system. In some embodiments, node rankings from the food and beverage database may be determined by the relative ranking of the ratio of expected blood chemistry target to the opportunity set and standard deviation of the ingredients and meal combinations 13010.

In some embodiments, there are many approaches toward optimization which are covered under method and system to optimize blood chemistry through food ingredients which may be utilized for computational efficiency, but the method and system may use as one approach of many approaches where the method finds the weights for various ingredients that result in the highest slope of the Foodie allocation line (C) 13010. In other words, the method and system may find the weights that result in the variable combination with the highest reward to variability ratio. In some embodiments, therefore the objective function of the method and system may maximize the slope of the Foodie allocation line for any possible combination of ingredients 13010. FIG. 130B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In some implementations, the objective function of the method and system may show the slope as the ratio of the expected blood chemistry of the combination of ingredients less the blood chemistry of a zero standard deviation blood chemistry ingredient (perhaps water) divided by the standard deviation of the combination of ingredients is illustrated in FIG. 130B. For the combination of ingredients with just two ingredients, the expected blood chemistry movement toward the target and standard deviation of blood chemistry of the combination of ingredients is illustrated in FIG. 130B. When the method and system maximize the objective function which is the slope of the foodie allocation line subject to the constraint that the combination weights sum to one or one hundred percent 13020. In some embodiments, in other words the weight of the opioid ingredient chemical structure plus the weight of the statin ingredient chemical structure must sum to one. FIG. 131A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, the method and system may solve a mathematical problem formulated as FIG. 131A which is the standard problem in calculus. Maximize the slope of the foodie allocation line subject to the condition that the sum of the weight of all the ingredients will sum to one.

In some implementations, the exemplary case may include two ingredients or meal combinations, but the system and method are able to process any amount of ingredients or meal combinations with an extension of the calculus equations 13110. FIG. 131B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 131B illustrates the solution for the weights of the optimal blood chemistry combination of ingredients. In some embodiments, data from 12710, 12720, 12910, 13010, 13020, and 13110 have been substituted in to give the weights of opioid ingredient chemical structure and statin ingredient chemical structure, as shown in FIG. 131B. The expected blood chemistry has moved 11% toward the target blood chemistry which incorporates the optimal weights for opioid ingredient chemical structure and statin ingredient chemical structure in this exemplary case 13010 and the standard deviation is 14.2% in FIG. 130A. The foodie allocation line using the optimal combination in 13110 and 13120 has a slope of 0.42=(11−5)/14.2 which is the reward to variability ratio of blood chemistry. Notice how the slope of the foodie allocation line exceeds the slope of foodie allocation line (B) and foodie allocation line (A) in FIG. 129A as it must if it is to be the slope of the best feasible foodie allocation line. A foodie with a coefficient term A in FIG. 129A equal to 4 would then make a combination as shown in FIG. 131C. FIG. 131C illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In some embodiments, thus the foodie would select 74.39% of her/his food allocation in the combination of opioid ingredient chemical structure and statin ingredient chemical structure and 25.61% in water or an ingredient which has zero standard deviation to blood chemistry, as shown in 13130 of FIG. 131C. Of the 74.39% of the food ingredient selection, 40% of the 74.39% or (0.4×0.7439=0.2976) would go to opioid ingredient chemical structure and 60% of 74.39% or (0.60×0.7439=0.4463) would go toward statin ingredient chemical structure FIG. 132A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, the graphical solution of the equations in FIG. 131A, FIG. 131B and FIG. 131C is illustrated in FIG. 132A.

FIG. 132B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, once the specific two ingredient case has been explained for the method and system, generalizing the embodiment to the case of many ingredients is straightforward. The summarization of steps are outlined in FIG. 132B.

FIG. 133A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIG. 133A illustrates a combination of ingredients for the optimal combination in the form of a pie chart. Before moving on it is important to understand that the two ingredients described could be meals or combinations of ingredients. In some embodiments, accordingly the method and system may consider the blood chemistry characteristics of single ingredients or combinations of ingredients which can then form an ingredient as a meal which would function as an ingredient which characteristics such as expected blood chemistry, variance and covariance and correlation. In some embodiments, accordingly there can be diversification within ingredients as some ingredients are combinations of ingredients.

In some embodiments, now we can generalize the two ingredient embodiment of the method and system to the case of many ingredients alongside water or an ingredient with near zero blood chemistry variance or standard deviation. In some embodiments, as in the case of the two ingredient embodiment, the problem is solved by the method and system in three parts. First, we identify the expected blood chemistry contribution of the ingredient and standard deviation of that ingredient contribution to blood chemistry. Second, the method and system identifies the optimal combination of ingredients by finding the combination weights that result in the steepest foodie allocation line. Last, the method and system may choose an appropriate complete combination by mixing the combination of water or a zero blood chemistry standard deviation ingredient with the combination of ingredients that carry various standard deviation and correlations. The ingredient opportunities available to the Foodie must be determined in the method and system. These ingredient opportunities are summarized by the minimum variance blood chemistry frontier of ingredients. In some embodiments, this frontier is a graph of the lowest possible combination variances that can be attained for a given combination of expected blood chemistry contribution. Given the set of data for expected blood chemistry contribution, variances and covariance's of blood chemistry and expected covariance's of blood chemistry of combinations, we can calculate the minimum blood chemistry variance combination for any targeted blood chemistry contribution. IN some embodiments, performing such as calculation for many such expected blood chemistry combinations results in a paring between expected blood chemistry contributions and minimum variance blood chemistry contribution that offer the expected blood chemistry contributions. FIG. 133B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, the plot of these expected blood chemistry contribution and standard deviation pairs are presented in FIG. 133B. Notice that all ingredients lie to the right of the frontier. This tells us that combinations that consist only of a single ingredient are inefficient relative to combinations. Adding many ingredients leads to combinations with higher expected blood chemistry contribution and lower standard deviations 13320. All the combinations in FIG. 133B that lie on the minimum variance frontier from the global minimum variance portfolio and upward, provide the best expected blood chemistry contribution and standard deviation of blood chemistry combinations and thus are candidates for the optimal combination 13320. In some embodiments, the part of the frontier that lies above the global minimum variance combination is called the efficient frontier 13320. In some embodiments, for any combination on the lower portion of the minimum variance frontier, there is a combination with the same standard deviation of blood chemistry, but higher expected blood chemistry contribution positioned directly above it. Hence the bottom part of the minimum variance frontier is inefficient.

The second part of the optimization plan involves water or a zero standard deviation blood chemistry ingredient. As before, the method and system search for the foodie allocation line with the highest reward to variability ratio (that is the steepest slope) as shown in FIG. 132A. The foodie allocation line that is supported by the optimal combination point P 13210, is, as before, the combination that is tangent to the efficient frontier. This foodie allocation line dominates all alternative feasible lines. Therefore, combination P in FIG. 132A is the optimal ingredient combination.

In some embodiments, finally, the last part of the embodiment of the method and system, the Foodie choses the appropriate mix between the optimal ingredient combination and a zero blood chemistry variance ingredient which may include water. In FIG. 132A, the point where Foodie allocation line (C) has a zero standard deviation value is where the expected blood chemistry target movement is 5% or point F 13210.

In some embodiments, now let us consider in the method and system each part of the combination construction problem in more detail. In the first part of the Foodie problem, the analysis of the expected blood chemistry of the ingredient, the Foodie needs as inputs, a set of estimates of expected blood chemistry target movement for each ingredient and a set of estimates for the covariance matrix which the method and system provide for the Foodie through the system application.

In some embodiments, suppose that the time period of the analysis for the combination of ingredients between biomarker tests was one year. In some embodiments, therefore all calculations and estimates pertain to a one year plan under the method and system. The database system contains the variable n ingredients where n could be any amount of ingredients. As of now, time zero, we observed the expected biomarker chemistry of the ingredients such that each ingredient is given the variable label i and an index number of n at time zero. Then the system and method determine how the ingredient effects the Foodies blood chemistry at the end of one year or time equal to one year. The covariance's of the ingredients effects on blood chemistry are usually estimated from historical data for both the Foodie and from Foodie users in the database with similar characteristics. Through the method and system, the Foodie is now armed with the n estimates of the expected effect on blood chemistry of each ingredient and then the n x n estimates in the covariance matrix in which the n diagonal elements are estimates of the variances of each ingredient and then the n squared minus n equals n multiplied by the quantity of n minus 1 off diagonal elements are the estimates of the covariances between each pair of ingredient blood chemistries. We know that each covariance appears twice in the aforementioned table, so actually we have n(n−1)/2 different covariance estimates. In some embodiments, if the claim plaintiff, user or Foodie user considers 50 ingredients or meal combinations, the method and system needs to provide 50 estimates of expected blood chemistry results for each respective ingredient or meal combination and (50×49)/2=1,225 estimates of covariance's which is a daunting task without the assistance of the method and system computer application program. FIG. 134A illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, once these estimates are compiled by the method and system, the expected blood chemistry and variance of any combination of ingredients with weights for any of the respective ingredients can be calculated by the general formulas shown in FIG. 134A.

The general embodiment of an exemplary case of the method and system in FIG. 134A states the expected blood chemistry toward the target blood chemistry of each ingredient and the variance of the blood chemistry of each ingredient such that the weights of each ingredient can be calculated as shown in 13410 of FIG. 134A. While many people say, “eat a wide variety of food” “take your medication” or “eat a balanced diet” or “don't put all your eggs in one basket”, no method or system has attempted to accurately quantify these statements in such a way that mathematics and science can be used to easily make a map for eating. The system and method have coined the phrase, as GPS is to driving, Foodie Body or the blood and saliva and biomarkers to drug and food algorithms are to eating. In some embodiments, no longer will Foodies or user guess at how drugs or nutrition is affecting their blood and overall health, math and science will map their progress with a quantitative method and system. In some embodiments, further the asymmetric information gap can be narrowed from the securitization or financial market auction with the litigation and patent geolocation claim exchange units with their ranked node outcomes from the aforementioned equations. The principle behind the method and system is that a foodie can quantify the set of ingredient combinations that give the highest blood chemistry result to maximize human health and productivity. Alternatively, the efficient frontier in FIG. 133B is the set of ingredient combinations that minimize the variance of blood chemistry for any target blood chemistry. In some embodiments, In some embodiments, node rankings from the food and beverage database may be determined by the relative ranking of the ratio of expected blood chemistry target to the opportunity set and standard deviation of the drug ingredients, ingredients and meal combinations which are represented by the plurality of meals or recipe combinations that are points with expected blood chemistry values and blood chemistry variances in the opportunity set from the search input term 13320. The result is the most efficient method empirically and quantitatively to consume food for human health.

FIG. 134B illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, the points marked by rectangles in FIG. 134B are the result of variance−minimization calculations in the method and system. First, we draw the constraint, that is, a horizontal line at the level of required expected blood chemistry target. We then look for the combination of ingredients (point P) with the lowest standard deviation that plots on the Foodie allocation line shown in 13420 of FIG. 134B. We then discard the bottom of the minimum variance frontier below the global minimum variance combination as it is inefficient, as shown in 13420, and points above the global minimum variance combination have higher blood chemistry contribution to the target, but a similar standard deviation. Restating the solution that the method and system has completed thus far. The estimate generated by the Foodie utilizing the method and system transformed ingredients and ingredient combinations into a set of expected blood chemistry statistics toward the user's blood chemistry and a covariance matrix of how the ingredients are correlated. This group of estimates shall be called the input list. This input list is then fed into the optimization system and method. Before we proceed to the second step of choosing the optimal combination of ingredients for blood or saliva chemistry, some Foodies may have additional constraints. For example, many Foodies have allergies which preclude certain food ingredient types. The list of potential constraints is large, and the method and system allows for the addition of constraints in the optimization method and system. Foodie users of the system and method may tailor the efficient set of ingredients to conform to any desire of the Foodie. Of course, each constraint carries a price tag in the sense that an efficient frontier constructed subject to extra constraints may offer a reward to variability ratio inferior to that of a less constrained set. The Foodie is made aware of this cost through the system and method application and should carefully consider constraints that are not mandated by law or allergies.

In some embodiments, proceeding to step two in the method and system, this step introduces water or a zero variance blood chemistry ingredient that has positive blood chemistry attributes. As before we ratchet up the Foodie allocation line by selecting different combinations of ingredients until combination P is reached, as shown in 13420, which is the tangency point of a line from point F to the efficient frontier 13420. Ingredient combination P maximizes the reward to variability ratio, the slope of the Foodie allocation line from point F to combinations on the efficient frontier set, as shown in 13420.

FIG. 135 illustrates a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, in some implementations, the method and system embodiment of the general exemplary case may be written in one form as shown in FIG. 135. In some embodiments, vectors are used to capture variable d inputs or as many inputs as are required to weight, as shown in FIG. 135. In some embodiments, the method as system may use other techniques to express combination blood and saliva expected target chemistry and variances, but it is convenient to manage large combinations of ingredients in matrix form, as shown in FIG. 29.

In some embodiments, The method and system embodiment in FIG. 136, FIG. 137 and FIG. 138 illustrate one exemplary entry in the system database which measures the nutrition content and standard deviation toward blood and saliva chemistry for egg, yolk, raw, frozen or pasteurized. The method and system database for drugs and food 10840 may have a mixture of United States Department of Agriculture data and proprietary merchant or cook food data that has higher degrees of differentiation in nutrition levels.

In some embodiments, the method and system embodiment illustrated in FIG. 139 may be one of many claim testing and distribution and education channels where a retail concept store combines a drug and food database laboratory and a dining experience for the foodie or user. In some embodiments, a Foodie may walk into the door 13910 of the retail experience and be given an opportunity to move into the blood laboratory 13930 where they will be given appetizers in a high tech learning center blood lab 13930. Monitor screens or projection devices both in 2D and 3D and mixed reality or augmented reality may project visualizations of blood chemistry interactions with food chemistry 13920. After the lab technician secures a blood and saliva sample from the foodie 13940, the user may go into the dining room 13950. In some embodiments, in the dining room of the concept retail experience 13950 Foodie experts will assist Foodies with menu selection of blood and saliva optimized food 3360. While FIG. 139 illustrates a retail concept store for the method and system, the method and system may have many outlets such as any hospital, biomarker lab, pharmacy, blood lab, doctors' office, grocery store, restaurant, computing device or food or drug distribution point.

In some embodiments, the flow chart illustrated in FIG. 140 for an exemplary scenario of the method and system, a Foodie goes to a lab or orders a self-diagnostic kit 14010. Depending on the Foodies decision 14010 the Foodie either sends in self-test to system 3420 or the lab sends in the results to the system 14030. The blood and/or saliva or biomarker samples are then entered into the blood and saliva database 14040. The user or Foodie interacts with the system and method to update or select constraints and preferences in their account profile on the system 14050. The method and system recursively updates the algorithm weights and selection combination ingredients based on the optimization program from the system and method based on the foodie's blood and saliva chemistry 14060. The claim plaintiff, or user or Foodie or user then selects either pick up at a drug or food distribution point (pharmacy, grocery store, convenience store, restaurant or other food distribution point) or selects delivery to a point the user desires 14070. The user or foodie may take delivery 14090 or pick up the food at a drug or food distribution point 3480.

In some embodiments, FIG. 141 illustrates a drug and food and beverage and implant database search interface 14110 in accordance with some embodiments. In some embodiments, the user 14120 profile may have uploaded biomarker data into their user profile or signed an agreement for a lab or physician or other medical provider to release their biomarker data to the biomarker database 10820. In some embodiments the user 14120 may input a searchable term or sequence of terms into the search database interface input window 14130. The searchable term or searchable term sequence input window 14130 may suggest similar input terms based on the foodie opportunity set of highest (or lowest to give the most negative) ratio of blood chemistry contribution to blood chemistry variance or location or other constraints. In some embodiments, the user may use voice interface, visual interface, gesture interface or type input and button interface 14140 to instantiate the query of node ranked food and beverage items from the food and beverage database 10840 in a category based on drug or food type, ethnicity, style, flavor, location, nutrition, health, variety and delivery of prepared and raw ingredients. In some embodiments by way of example but not limiting by example, the user 14120 may have entered “Italian” as the search term into the search interface input window 14130 and the resulting output interface 14150 may rank a plurality of biomarker ranked food and beverage options based on the highest ratio of blood chemistry contribution to blood chemistry variance or location or other constraints of the exemplary user 14120. In some embodiments for a specific user 14120, mushroom lasagna 14159 may be the highest ratio of blood chemistry contribution to blood chemistry variance in the opportunity set node ranked database for a search input category such as Italian. In some embodiments, the user 14120 may select the Make button 14151 to perform instructions to display a how to ingredient recipe and how to ingredient video of the food or beverage recipe. In some embodiments, the user 14120 may select the Order button 14152 to either pick up the food or beverage combination at a distribution point or have the food or beverage combination delivered to a specified location. In some embodiments, a partial ingredient list, picture, audio, and food score may accompany an additional specific food or beverage combination such as antipasta 14160 with partial ingredients of eggplant, zucchini, artichoke, red pepper, mushroom and a plurality of other ingredients that may be displayed on further drill down search database options. In some embodiments for a specific user 14120, antipasta 14160 may be the second highest ratio of blood chemistry contribution to blood chemistry variance in the opportunity set node ranked database for a search input category such as Italian. In some embodiments, the user 14120 may select the Make button 14154 to perform instructions to display a how to ingredient recipe and how to ingredient video of the food or beverage recipe. In some embodiments, the user 14120 may select the Order button 14153 to either pick up the food or beverage combination at a distribution point or have the food or beverage combination delivered to a specified location. In some embodiments, a partial ingredient list, picture, audio, and food score may accompany a specific food or beverage combination such as antipasta 14160 with partial ingredients of eggplant, zucchini, artichoke, red pepper, mushroom and a plurality of other ingredients that may be displayed on further drill down search database options. In some embodiments, a partial ingredient list, picture, audio, and food score may accompany an additional specific food or beverage combination such as pasta primavera 14162 with partial ingredients of tomatoes, brown rice, onion, garlic, almond and a plurality of other ingredients that may be displayed on further drill down search database options. In some embodiments for a specific user 14120, pasta primavera 14160 may be the third highest ratio of blood chemistry contribution to blood chemistry variance in the opportunity set node ranked database for a search input category such as Italian. In some embodiments, the user 14120 may select the Make button 14156 to perform instructions to display a how to ingredient recipe and how to ingredient video of the food or beverage recipe. In some embodiments, the user 14120 may select the Order button 14155 to either pick up the food or beverage combination at a distribution point or have the food or beverage combination delivered to a specified location. In some embodiments, a partial ingredient list, picture, audio, and food score may accompany a specific food or beverage combination such as pasta primavera 14162 with partial ingredients of tomatoes, brown rice, onion, garlic, almond and a plurality of other ingredients that may be displayed on further drill down search database options. In some embodiments for a specific user 14120, opioids 14161 may be the fourth highest ratio of blood chemistry contribution to blood chemistry variance in the opportunity set node ranked database for a search input category such as pain killer. In some embodiments, the user 14120 may select the Make button 14158 to perform instructions to display a how to ingredient recipe and how to ingredient video of the drug or food or beverage recipe. In some embodiments, the user 14120 may select the Order button 14157 to either pick up the drug or food or beverage combination at a distribution point or have the food or beverage combination delivered to a specified location. In some embodiments, a partial ingredient list, picture, audio, and food score may accompany a specific food or beverage combination such as opioids 14161 with partial brands of oxycontin, toxicodone, oxecta, oxaydo, xtampza, percodan and a plurality of other ingredients that may be displayed on further drill down search database options.

FIG. 142 illustrates a drug and food and beverage database search interface 14210 in accordance with some embodiments with additional drill down to a specific search selection. In some embodiments, search engine exemplary logo, foodie body 14220 or another exemplary logo may be displayed. In some embodiments, an exemplary search input window 14230 may allow a user additional search input or input variation from a current search term and drug and food or beverage combination. In some embodiments, the search input visual or audio interface window 14230 may be instantiated from a search term button or an optimize button 14240. In some embodiments, a picture of the drill down drug or food or beverage combination such as mushroom lasagna 14270 may be displayed with a text or audio title 14280. In some embodiments, detailed ingredient lists may accompany the food or beverage combination title 14280. In some embodiments, an ingredient quantity list 14291 and instructions may accompany the selection. In some embodiments a preparation instruction or cooking or chef video may accompany the selection 14290. In some embodiments, a list of participating food or beverage distribution locations 14250 may accompany the food or beverage combination with an option to order from the food distribution location 14250 or receive delivery. In some embodiments, an option to order the food or beverage combination may accompany the selection to order from a pharmacy or restaurant or receive delivery 14260.

FIG. 143 illustrates a food and beverage database search interface 14310 in accordance with some embodiments with additional drill down to a specific search selection. In some embodiments, the recipe interface 14310 may be converted into an order quantity interface 14310 for a specific food and beverage combination. In some embodiments, search engine exemplary logo, foodie body 14320 or another exemplary logo may be displayed. In some embodiments, an exemplary search input window 14330 may allow a user additional search input or input variation from a current search term and food or beverage combination. In some embodiments, the search input visual or audio interface window 14330 may be instantiated from a search term button or an optimize button 14340. In some embodiments, the recipe or food combination list 3691 is converted to a check out ready order list 14370, 14380 by associating the recipe quantity with unit sizes at the food or beverage distribution location. In some embodiments, prescription or recipe order sizes 14390 may be modified to higher or lower quantities 14390 to serve the customer selection along with information on unit pricing 14391. In some embodiments, an add to cart button 14350 may allow for further shopping or check out now button options 14360 for order conclusion and confirmation.

FIG. 14400 illustrates a food and beverage database search interface 14410 in accordance with some embodiments with user biomarker information and options to modify user 14438 biomarker data or upload merchant seller data 14436 to the marketplace. In some embodiments, the user profile 14432 includes name, date of birth, height, weight, most current upload date, and a plurality of other data 14442. In some embodiments, the percentage of available biomarker uploads included for a specific user profile is indicated 14435. In some embodiments, search engine exemplary logo, foodie body 14420 or another exemplary logo may be displayed. In some embodiments, an exemplary search input window 14430 may allow a user additional search input or input variation from a current search term and food or beverage combination. In some embodiments, the search input visual or audio interface window 14430 may be instantiated from a search term button or an optimize button 3837. In some embodiments, a user 14438 or 14432 may update their profile by uploading additional biomarker information with the upload biomarker button 14431. In some embodiments, the user 14432 or 14438 may upload additional eating or consumption data 14433 from a plurality of search, audio, photo, visual or network inputs. In some embodiments, the user 14432 or 14438 may analyze eating and biomarker data by pushing the analyze button 14434. In some embodiments, merchants may upload products 14436 that conform to proprietary standards or the standards of USDA verified or European FIR verified 14436. In some embodiments, merchants my upload products and nutrition data through the upload nutrition data button 14439. In some embodiments, the merchant or user 14432 or 14438 may advertise on the search engine and marketplace method and system of biomarker optimized food and beverage search 14430. In some embodiments, a user 14432 or 14438 may upload a recipe 14441 to the method and system for optimization on the biomarker network and network algorithms. In some embodiments, the search engine and optimization network allows a marketplace for users to contribute recipe content 14441, cooking content 14441, chef preparation content 14441, biomarker content 14431, nutrition content 14439 and user profile 14432 and merchant profile content 14436.

FIG. 145 illustrates a drug and food and beverage database search interface 14510 in accordance with some embodiments with user biomarker information and options to modify user biomarker uploads as well as monitor biomarker performance contemporaneously and over time in time series to the marketplace and biomarker search engine. In some embodiments, the percentage of available biomarker uploads included for a specific user profile 14561 is indicated 14560. In some embodiments, search engine exemplary logo, foodie body 14520 or another exemplary logo may be displayed. In some embodiments, an exemplary search input window 14530 may allow a user 14550 additional search input or input variation from a current search term and food or beverage combination. In some embodiments, the search input visual or audio interface window 14530 may be instantiated from a search term button or an optimize button 14540. In some embodiments, the user profile data 14568 may include a superset or subset of name, date of birth, height, weight, date of last upload or other biomarker data 14568. In some embodiments, the percentage of available biomarker upload data fields utilized 14560 by a user 14561 may be displayed. In some embodiments, user 14561 LDL cholesterol levels may be shown for analysis 14562, fasting glucose levels 14564, fasting triglyceride levels 14567, HDL cholesterol levels 14563, iron levels 14565, calcium levels 14566 and a plurality of other biomarkers may be accessed through the continuation to next biomarker data 14510. In some embodiments, over 800 biomarkers are utilized from various measurable biomarker chemistry sources which change due to food and beverage input into the body. In some embodiments, biomarker chemistry may be measured by graph or scan data to represent changes in the body in magnetic resonance imaging tests, echocardiogram tests, nuclear perfusion studies, positron emission tomography tests or thousands of other biomarker scan and chemistry tests where data may be measured with numeric representations.

FIG. 146 illustrates a food and beverage database search interface 14610 in accordance with some embodiments with merchant nutrition 14690 and product upload 14670 or batch product upload 14680 for participation in the biomarker search engine for food and beverages. In some embodiments, search engine exemplary logo, foodie body 14620 or another exemplary logo may be displayed. In some embodiments, an exemplary search input window 14630 may allow a user 14650 additional search input 4030 or input variation from a current search term and food or beverage combination. In some embodiments, the search input visual or audio interface window 14630 may be instantiated from a search term button or an optimize button 14640. In some embodiments, an exemplary food or beverage distribution vendor or supplier 4060 may be displayed for their account 14650 to upload nutrition information for entire batches 14680 or single products 14670. In some embodiments, vendors 14660 may license the method and system to participate in the search for drug or food and beverages based on a plurality of biomarker data of individual users.

FIG. 147 illustrates a drug and food and beverage database search interface 14710 in accordance with some embodiments with recipe or cooking content videos 14790 for the biomarker based search engine for food and beverages. In some embodiments, search engine exemplary logo, foodie body 14720 or another exemplary logo may be displayed. In some embodiments, an exemplary search input window 14730 may allow a user 14750 additional search input 14730 or input variation from a current search term and food or beverage combination. In some embodiments, the method and system may recommend additional food and recipe videos 14791 based on popularity, linked recipe types, efficient ratios of blood chemistry expected values to blood variance values in the opportunity set. In some embodiments, the user 14750 may upload a video 14760 with cooking content and recipe content that has been optimized for the user's biomarkers. In some embodiments, the user may upload recipes and nutrition data to the network for ranking in the search node ranking database or related video ranked node database with nutrition data of the underlying recipe from the food database 10840. In some embodiments, the user 14750 may receive rewards such as foodie body pay 14780 for videos that are popular or receive high views 14780 because they are well done with efficient blood chemistry values to blood chemistry variance as a ratio.

FIG. 148 illustrates a drug and food and beverage database search interface 148 in accordance with some embodiments with additional recipe or cooking content videos 14880 for the biomarker based search engine for drugs and food and beverages. In some embodiments, search engine exemplary logo, foodie body 14810 or another exemplary logo may be displayed. In some embodiments, an exemplary search input window 14820 may allow a user 14840 additional search input 14820 or input variation from a current search term and food or beverage combination video 14880. In some embodiments, the method and system may recommend additional food and recipe videos 14890 based on popularity, linked recipe types, efficient ratios of blood chemistry expected values to blood variance values in the opportunity set. In some embodiments, the user 14840 may upload a video 14850 with cooking content and recipe content that has been optimized for the user's biomarkers. In some embodiments, the user 14840 may upload recipes and nutrition data 14860 to the network for ranking in the search node ranking database or related video ranked node database with nutrition data of the underlying recipe from the food database 10840. In some embodiments, the user 14840 may receive rewards such as foodie body pay or claim pay 14870 for videos that are popular or receive high views 14870 because they are well done with efficient blood chemistry values to blood chemistry variance as a ratio.

FIG. 149 illustrates a positron emission tomography output 14900 in accordance with implementations of various techniques described herein. In particular, the positron emission tomography output 14900 may correspond to a plurality of various conditions such as a health brain with low levels of beta amyloid 14910, high levels of beta-amyloid 14930 and resulting Alzheimer's, healthy levels of hyperphosphorylated protein tau 14920 and no resulting Alzheimer's and high levels of hyperphosphorylated protein tau 14940 with resulting Alzheimer's. In some embodiments, data is transformed with progressive machine learning equation fitting models including but not limited to linear regression, logistic regression, linear discriminant analysis, classification or regression trees, naïve bayes, k nearest neighbors, leaning vector quantization, support vector machines, bagging and random forest, boosting and adaboost models to update best fit historical equations for a user's time series data of biomarker panels considering food and beverage consumption. In some embodiments, exemplary models may include but are not limited to the following machine learning model outputs such as Alzheimer's indicator equation 14950 beta amyloid plaque level equaling 141.76 plus 63.46 multiplied by X sub i index which represents cholesterol intake less the quantity of 12.96 X squared sub i index which represents cholesterol intake plus 0.93 multiplied by X cubed sub i, where X is again the level of cholesterol intake over time period i. In some embodiments, exemplary models may include but are not limited to the following machine learning model outputs such as Alzheimer's indicator equation 14960 hyperphosphorylated protein tau level equaling 11.76 plus 66.6 multiplied by X sub i index which represents cholesterol intake less the quantity of 1.21 X squared sub i index which represents cholesterol intake plus 0.32 multiplied by X cubed sub i, where X is again the level of cholesterol intake over time period i. In some embodiments, exemplary models may include but are not limited to the following machine learning model outputs such as Alzheimer's indicator equation 14970 neurofibrillary tangles level equaling 8.88 plus 15.47 multiplied by X sub i index which represents cholesterol intake less the quantity of 2.06 X squared sub i index which represents cholesterol intake plus 0.10 multiplied by X cubed sub i, where X is again the level of cholesterol intake over time period i. In some embodiments, exemplary models may include but are not limited to the following machine learning model outputs such as Alzheimer's indicator equation 14980 ApoE3 beta amyloid plaques level equaling 1.2 plus dummy variable δ sub 0 which indicates the presence of the ApoE3 gene plus 63.46 multiplied by X sub i index which represents cholesterol intake less the quantity of 12.96 X squared sub i index which represents cholesterol intake plus 0.93 multiplied by X cubed sub i, where X is again the level of cholesterol intake over time period i. In some embodiments, machine learning models continue to iterate model fitting until error minimization has been achieved and therefore, model fitting in the method is not limited to equations 14950, 14960, 14970, 14980, but rather the method to fit models to minimize the error terms in obtaining the food and beverage sequences which maximize the ratio of the biomarker chemistry value improvement over the variance of the biomarker chemistry resulting in the most efficient path to health improvement as measured by biomarker analysis as well as the node ranking of a plurality of search category food and beverage items as defined by their ranking of maximizing the ratio of biomarker chemistry improvement over the variance of the biomarker chemistry improvement. In some embodiments, the machine learning model fitting technique and resulting node ranking of food and beverage sequences which maximize the ratio of the biomarker chemistry value improvement over the variance of the biomarker chemistry improvement resulting in the most efficient path to health improvement as measured by biomarker analysis may be applied to any biomarker indicator of health condition such as Alzheimer's, heart disease, echocardiogram, nuclear perfusion studies, magnetic resonance imaging, hemoglobin A1C diabetes test, glycohemoglobin test, leukocyte antigen HLA-DQ2 or HLA-DQ8 tests, TSH thyroid stimulating hormone or total T4 free thyroxine, free T4, total T3, free T3, reverse T3, anti TPO ab, anti-thyroglobulin Ab, broad thyroid panels, iron, vitamin D, vitamin b12, magnesium, calcium, complete metabolic panels, complete blood count, homocysteine, hsCRO inflammatory marker, homocysteine level, amino acid levels, white blood cell count, red blood cell count, hemoglobin, hematocrit, mean corpuscular volume, platelet count, LDL low density lipoprotein cholesterol, HDL high density lipoprotein cholesterol, sodium, potassium, chloride, carbon dioxide, blood urea nitrogen, creatine, glucose, total protein, albumin, bilirubin, alkaline phosphatase, aspartate aminotransferase, alanine aminotransferase, methylmalonic acid, glycated hemoglobin, prothrombin time, international normalized ratio (prothrombin time), brain natriuretic peptide, ferritin, bone marrow biopsy, barium enema, bone scan, breast MRI, colonoscopy, computed tomography scan, digital rectal exam, hypercholesterolemia, atherosclerotic plaque level, plasma level, endoscopy, fecal occult blood tests, mammography, MUGA scan, pap test, sigmoidoscopy, circulating tumor cell, flow cytometry, cytogenetic analysis, immunophenotyping, fluorescence in situ hybridization, karyotype test, polymerase chain reaction, white cell differential, general biopsies with change analysis, narcotic tests, chemical test indicator variables or any biomarker test.

FIG. 150 illustrates a low density lipoprotein (LDL) cholesterol output 15000 in accordance with implementations of various techniques described herein. In particular, the LDL) cholesterol output 15000 may correspond to a time series between two points in time with the user eating foods and beverages recommended by the search engine that node ranks the ratio of biomarker chemistry change over biomarker chemistry variance during the time period from a starting point at time of t=0 before changing diet to items recommended by search engine. In some embodiments, the biomarker of low density lipoprotein LDL cholesterol may be measured over time 15010 as the user eats the search items node ranked by the method. In some embodiments, machine learning models may fit the user relationship of cholesterol in food and beverages to low density lipoprotein with the equation 15011 where low density protein equals negative 1.2 multiplied by the natural log of X sub i, where X is the level of cholesterol in food and beverages ingested between time period t=0 and t=i plus 140+a dummy variable δ sub 0 that may indicate the presence of phytosterols, soluble fibers, phospholipids, stearic acid or other cholesterol absorption inhibitors. In some embodiments, each biomarker time series represented in the machine learning model 15010 may have different best fit models for each user as each model is generated from time series of users or users with similar characteristics as a proxy until appropriate time series may be logged in the biomarker database server 10820. In some embodiments, calcium biomarkers may be measured from a base state of time equaling zero 15020 before the user commences use of the method to maximize the biomarker ratio or ratio sequence of biomarker value contribution over biomarker variance contribution in the node ranked database which may be utilized in search engine results. In some embodiments, the biomarker calcium contribution may be measured by calcium biomarker sub i equals 1.3 multiplied by the natural log of X sub i, where X is the food or beverage contribution to the biomarker in the form of calcium plus 8.8. In some embodiments, the users may be represented by time series in the graph 15020 each having their own minimization of error machine learning model in accordance with then the maximization of the ratio of biomarker value contribution over biomarker variance contribution in the node ranked claim database.

FIGS. 151A and 151B illustrate a ranking formulation configuration in accordance with implementations of various techniques described herein. In particular, FIGS. 151A and 151B illustrate an exemplary embodiment of the plaintiff claim user or foodie allocation line relative to the opportunity set of food and beverage combinations 15100 as ranked by the node food and beverage node database server 10840. In some embodiments, the expected value of the biomarker chemistry value is represented by the vertical Y axis as the contribution of food or beverage to the representative biomarker or vector of biomarkers in N dimensional space 15110. In some embodiments, the variance of the biomarker chemistry value is represented by the X horizontal axis in N dimensional space 15110. In some embodiments, portfolios of various drug and food and beverage combinations, recipes, meals, restaurant or food ordered deliveries are shown at various levels which may be node ranked in a database based on the ratio of expected contribution of biomarker chemistry contribution value to a target over the variance of the biomarker chemistry value contribution. In some embodiments, an optimal or most efficient food and beverage combination represented by point P in diagram 15110 may be achieved at the highest point where the foodie allocation line matches the minimum variance frontier for the plurality of various drug and food and beverage combinations for a specific user. In some embodiments, the general framework 15110 may select a vector or matrix of food combinations and a vector and matrix of biomarkers which may be fundamentally different than another vector and matrix of biomarkers or food and beverage combinations represented in model 15120. In some embodiments, node ranked food and beverage combinations based on the efficiency ratio of expected biomarker value contribution over variance of biomarker value considering the foodie allocation line and efficient minimum variance frontier may be updated based on machine learning model updates for minimization of errors in food and beverage combination contribution to biomarker values.

FIG. 152 illustrates an exemplary embodiment of a flow chart construction of the iterative loop for constructing sets of biomarker panels 15220, drug and food and beverage contribution to biomarker global minimum variance frontiers and portfolios 15221, foodie allocation lines 15222, machine learning models 15232, 15227, 15224, 15231, 15228, 15225, 15230, 15229, 15226, 15233, 15234 to test historical datasets of user food and beverage interaction with biomarker values which form the basis of the method to node rank food and beverage combinations for users 15200. In some embodiments, the user 10810 obtains self-test or lab test biomarkers and updates the system 4620 to form the basis of a time series or comparison data for comparable users. In some embodiments, the computation of the global minimum variance frontier of drug and food and beverage contributions to biomarker values and variance of biomarker values to form ratios of biomarker value contribution over variance of biomarker contributions in the node ranked database for food and beverage combinations 15221. In some embodiments, the foodie allocation line is constructed based on a plurality of utility attributes of the user such as but not limited to flavor, ethnicity, location, style, hunger, genetics or other utility characteristics 15222. In some embodiments, the search input may then instruct the system to iterate the foodie allocation line over a minimum variance frontier of drug and food and beverage combination categories 15223. In some embodiments, the machine learning models determine the best fit by minimizing errors of a plurality of functions 15224 for food and beverage contribution to expected biomarker values of users and the resulting maximization of the ratio of expected biomarker contribution value over expected biomarker contribution variance and then node ranking lower from the highest ratio value in accordance with the foodie allocation line 15222 and minimum variance frontier 15221. In some embodiments, machine learning best fit models determining food and beverage contribution to biomarker values or ratio of biomarker values over variance of biomarker value may be comprised of but not limited to linear regression 15232, logistic regression 15227, linear discriminant analysis 15224, classification or regression trees 15231, naïve bayes 15228, k nearest neighbors 15225, learning vector quantization 15230, support vector machines 15229, bagging and random forest 15226, boosting and adaboost 15233, ARIMA processes, Box-Jenkins, posterior density functions, natural conjugate prior, recursion, Bayesian pretest, ridge regression, independent stochastic regressors, general stochastic regression models, general non-linear hypothesis, LaGrange multiplier test, Likelihood ratio test, autoregressive processes, moving average processes, ARMA processes, GLS, EGLS, NLS, ML estimation, AR(1), AR(2), Wald test, Durbin-Watson test, King's locally optimal bounds, Geary's sign change test, MA(1), Monte Carlo, finite distributed lags, almon distributed lag, polynomial spline distributed lag, Shiller's distributed lag, Harmonic Lag, gamma distributed lag, exponential lag, heteroscedastic specifications, Breusch-Pagan Test, Barlett Test, Godfeld Quandt test, Szroeters Class of tests, Whites Test, nonparametric tests, vector ARMA processes, ARMAX models, vector autoregressive processes, path analysis, binary choice models, multinomial logit, multinomial probit, truncated samples, two stage models, Amemiya's principle model, simultaneous equation model, piecewise regression, seasonality models, Akaike information Criterion, Jeffrey-Bayes Posterior odds ratio, conditional mean, Stein-Rule formulation model, Cox test model, J test model, quasi-Newton method model, Gauss method model, gradient method model, Marquardt's method model, Gauss-Seidel model, Grid Search, reparameterization model, penalty function model, augmented Lagrangian method model, Kalman Filter model or other models for use in determining food and beverage contribution to biomarkers in construction of a ratio to place the expected contribution value of the biomarker over the variance of the biomarker contribution value for a node ranked database for food and beverage combinations. In some embodiments, each of the aforementioned processes and transformations are then iterated continuously 15235 based on updates to machine learning fit models, food and beverage inputs, biomarker test results, computation of minimum variance frontiers, computation of foodie allocation lines, plaintiff claim user lines or other model updates.

FIG. 153 illustrates an exemplary embodiment of a user profile iteration update from a search order 15320, search for making a prescription or recipe 15330, or search from photo 15340, audio or visual recognition of drugs, implants, foods or beverages. In some embodiments, a CPU device 15380 with visual, photo, recognition, voice or other interface may update from a plurality of inputs including, but not limited to, visual scan recognition of ingredients or food or beverage 15382. In some embodiments, a manual override 15381 may allow the user to update the search or order of food and beverage to update the user profile intake of drugs or food and beverage. In some embodiments a sequence of foods 15350, 15360, 15370 may be input into the system by a user using the CPU device 15380. In some embodiments, food and beverage search, ordering, making of recipes, audio interface, scan interface or photo interface 15382 may update the user profile 15310 with food and beverage combinations 15350 to the system may estimate user performance between biomarker test periods.

FIG. 154 illustrates an exemplary user profile reward schema for confirmed biomarker improvements for target biomarker input in the system as a result of drug and food and beverage combination improvements to the user 15400. In some embodiments, it is well known that diets do not work, or they are unsustainable, it is also well known that companies or governments usually do not pay or incentivize people with any significant reward to eat well with the opportunity independently confirmed and rewarded by an independent biomarker measurement lab or facility. In some embodiments, it is also well known that pharmaceutical companies take advantage of users with less information and give them drugs that are not needed or provide bodily harm such as the opioid epidemic. In some embodiments, a typical user profile reward schema 15410 may include a baseline biomarker test on time t=0 confirmed by an independent test or lab 15420. In some embodiments, a user may perform or be evaluated by a second biomarker test or lab at time t=1 15430. In some embodiments, a reward may be given to the user based on achieving a specified biomarker test level over a period of time which may include one time period or a sequence of time periods or other combinations of time. In some embodiments, the biomarker test result or court result or settlement result 15440 is performed or evaluated by an independent biomarker lab and court. In some embodiments, if the biomarker target value was not achieved, no reward is given to the user, or a penalty may be given in the form of legal fees for the claim 15450. In some embodiments, if the target biomarker test result is achieved or a court case or settlement was achieved 15451, a reward may be given 15452. In some embodiments, rewards 4852 may include but are not limited to litigation pay 4853, claim insurance 15459, claim avatar 15458, patent pay 15457, accident pay 15455, claim skins 15454, claim reward 15456 or other rewards 15452. In some embodiments, the user profile award pool 15460 may be comprised of but not limited to corporates 15470, government 15471, private sector 15472, other entities 15474, public entities 15473. In some embodiments, the reward pool 4860 may be calculated in conjunction with performance of reducing an employer's insurance payout, government insurance payout or other payouts due to high health care costs which have been avoided or reduced, pharmaceutical company fraud, other claim fraud, infringement, environmental benefits, pollution reduction, based on improved biomarker performance or any other metric chosen by an entity contributing to the reward pool. In some embodiments the user profile reward schema 15410 may be updated instantly or over time.

FIG. 155 illustrates an exemplary user iteration update 15510 based on search order input 15520, search that was made form a searched recipe 15530, search from an audio or visual or photo input 15540 from a CPU device 15580. In some embodiments, the user CPU device 4980 may update with a food distribution point menu 15583 with node ranked search results based on the user's location from a wireless GPS network 15585. In some embodiments, the food distribution point may be a restaurant 15585 or any drug or food distribution establishment. In some embodiments, the user GPS location of the CPU device 15580 may improve the speed or feature display to pre-update ranked menu offerings 15583 based on node ranking from the food and beverage contribution to biomarker contribution to a target. In some embodiments, the food and beverage contribution may be the food and beverage contribution to the biomarker change or optimized by the ratio of the biomarker contribution value over the variance of the biomarker contribution value considering the foodie allocation line and minimum variance frontier of the drug or food and beverage contribution to the biomarker.

FIG. 156 illustrates an exemplary machine learning model using the biomarker time series data to price health insurance or price legal claims 15600. In some embodiments, the process of pricing health insurance starts 15610 with the user inputting historical biomarker panels 15620. In some embodiments, the search node ranking, and scoring may be derived from the computation of the expected value of the biomarker contribution from food or beverage combinations divided by the variance of the biomarker contribution from food or beverage combinations 15621. In some embodiments, actuary tables or tables of health care cost 15622 of various health conditions may be stored as a general table in the biomarker database 10820. In some embodiments, machine learning models may best fit minimizing the errors of health care costs from the table of health care costs 15622 in the biomarker database 10820 compared to a time series of biomarkers 15620 and probabilities health care costs are needed for a user. In some embodiments, health care cost models may be fit against biomarker samples and panels with linear regression 15632, logistic regression 15627, linear discriminant analysis 15624, classification or regression trees 15631, naïve bayes 15628, k nearest neighbors 15625, learning vector quantitation 15630, support vector machines 15629, bagging and random forest 15626, boosting and adaboost models 15633, other best fit models may include, but are not limited to, ARIMA processes, Box-Jenkins, posterior density functions, natural conjugate prior, recursion, Bayesian pretest, ridge regression, independent stochastic regressors, general stochastic regression models, general non-linear hypothesis, LaGrange multiplier test, Likelihood ratio test, autoregressive processes, moving average processes, ARMA processes, GLS, EGLS, NLS, ML estimation, AR(1), AR(2), Wald test, Durbin-Watson test, King's locally optimal bounds, Geary's sign change test, MA(1), Monte Carlo, finite distributed lags, almon distributed lag, polynomial spline distributed lag, Shiller's distributed lag, Harmonic Lag, gamma distributed lag, exponential lag, heteroscedastic specifications, Breusch-Pagan Test, Barlett Test, Godfeld Quandt test, Szroeters Class of tests, Whites Test, nonparametric tests, vector ARMA processes, ARMAX models, vector autoregressive processes, path analysis, binary choice models, multinomial logit, multinomial probit, truncated samples, two stage models, Amemiya's principle model, simultaneous equation model, piecewise regression, seasonality models, Akaike information Criterion, Jeffrey-Bayes Posterior odds ratio, conditional mean, Stein-Rule formulation model, Cox test model, J test model, quasi-Newton method model, Gauss method model, gradient method model, Marquardt's method model, Gauss-Seidel model, Grid Search, reparameterization model, penalty function model, augmented Lagrangian method model, Kalman Filter model or other models 15634. In some embodiments, the overall insurance pricing process may be iterated 15635 over many times and time period combinations. In some embodiments, probabilities of health conditions may be updated given user interaction with the plurality of interfaces of the food and beverage node rankings, searching, scoring and consumption patterns. In some embodiments, by example, but not limiting by example, annual health care costs of a type II diabetes user may be $14,000 USD each year as a cost to the employer. In some embodiments, the user may submit biomarker data to the method and system and use the node ranking system for selecting food and beverage choices. In some embodiments, the type II diabetes condition may be reversed eliminating the $14,000 annual health cost of the condition. In some embodiments the reward schema 15400 may pay the user $4,000 as a reward from an employer for reversing the type II diabetes condition through verified test results 15440 over a period of time. In some embodiments, machine learning models may calculate the reduced medical costs of the user and provide outputs which price insurance based or legal claims on biomarker patterns from the method and system considering but not limited to the following models of linear regression 15632, logistic regression 15627, linear discriminant analysis 15624, classification or regression trees 15631, naïve bayes 15628, k nearest neighbors 15625, learning vector quantitation 15630, support vector machines 15629, bagging and random forest 15626, boosting and adaboost models 15633, other best fit models may include, but are not limited to, ARIMA processes, Box-Jenkins, posterior density functions, natural conjugate prior, recursion, Bayesian pretest, ridge regression, independent stochastic regressors, general stochastic regression models, general non-linear hypothesis, LaGrange multiplier test, Likelihood ratio test, autoregressive processes, moving average processes, ARMA processes, GLS, EGLS, NLS, ML estimation, AR(1), AR(2), Wald test, Durbin-Watson test, King's locally optimal bounds, Geary's sign change test, MA(1), Monte Carlo, finite distributed lags, almon distributed lag, polynomial spline distributed lag, Shiller's distributed lag, Harmonic Lag, gamma distributed lag, exponential lag, heteroscedastic specifications, Breusch-Pagan Test, Barlett Test, Godfeld Quandt test, Szroeters Class of tests, Whites Test, nonparametric tests, vector ARMA processes, ARMAX models, vector autoregressive processes, path analysis, binary choice models, multinomial logit, multinomial probit, truncated samples, two stage models, Amemiya's principle model, simultaneous equation model, piecewise regression, seasonality models, Akaike information Criterion, Jeffrey-Bayes Posterior odds ratio, conditional mean, Stein-Rule formulation model, Cox test model, J test model, quasi-Newton method model, Gauss method model, gradient method model, Marquardt's method model, Gauss-Seidel model, Grid Search, reparameterization model, penalty function model, augmented Lagrangian method model, Kalman Filter model or other models 15634.

FIG. 157 illustrates an exemplary Medicare Secondary Payer Recovery Portal, Benefits Coordination Recovery Center as well as data sources for the securitization of a patent or litigation geolocation claim unit 15700. In some embodiments, Medicare Secondary Payer Claims have a recovery portal run by the government 15710 as well as a benefits coordination and recovery center 15720. In some embodiments, the Medicare Secondary Payer Claims have not been linked to primary payer data such as motor vehicle crash reports 15750 or personal health records 15760 or electronic health records 15770 or dietary and medication ingestion data 15780. In some embodiments, further there are no viable crash reports where the system uses the novel crash device report 160000 to fill in data gaps and more quickly ascertain relevant claim data that is not available from other resources.

FIG. 158 illustrate an exemplary plurality of claims may be node ranked from the ratio based biomarker algorithms 13500 or crash reports 16000 or other data sources including, but not limited to, vehicle crash reports 15750 or personal health records 15760 or electronic health records 15770 or dietary and medication ingestion data 15780.

FIG. 159 illustrate an exemplary iteration process for node ranking the plurality of claim data by looping over the nodes and updating with ratio based biomarker algorithms 13500 or crash reports 16000 or other data sources including, but not limited to, vehicle crash reports 15750 or personal health records 15760 or electronic health records 15770 or dietary and medication ingestion data 15780.

FIG. 160 illustrates an exemplary algorithm to take the device data and ascertain a crash report to process a claim which will then be converted into a litigation or patent geolocation claim unit for trading on the exchange 16000. In some embodiments the device may instantiate instructions to log continuous speeds 16010 in a GPS speed change loop 10620 which may then node rank speed changes with weightings of the amount of the speed change as a deceleration ratio in corroboration from the speed of the change in the accelerometer 16030 as well as logging pictures and video from the camera on the navigation device 16040 as well as logging sound data from the microphone and audio 16050 on the device which continuously loop to node rank simultaneous data events which then are transmitted to the claim data processor 16060 and are logged in the claim database. In some embodiments, the claim data processor may instantiate instructions to send a claim notification from the claim notification manager to various claim plaintiffs or users who may wish to start a claim with the device and method data. In some embodiments, the claim notification manager 16080 may send notifications over the network 16085 with GPS position data 16086 to log data in the claim database 16070 and send a notification to the user with the portable multifunction device 16090. In some embodiments, the exemplary algorithm to log crash or accident data may be augmented with navigation system data 16095 or game data 3600 or other data sources to include in the litigation or patent geolocation claim unit blockchain for trading on the litigation or patent geolocation claim unit exchange.

FIG. 161 illustrates a block diagram of a hardware configuration 16100 in which one or more various technologies described herein may be incorporated and practiced. The hardware configuration 16100 can be used to implement the computing systems discussed above (e.g., the computing devices mentioned above). The hardware configuration 16100 can include a processor 16110, a memory 16120, a storage device 16130, and an input/output device 16140. Each of the components 16110, 16120, 16130, and 16140 can, for example, be interconnected using a system bus 16150. The processor 16110 can be capable of processing instructions for execution within the hardware configuration 16100. In one implementation, the processor 16110 can be a single-threaded processor. In another implementation, the processor 16110 can be a multi-threaded processor. The processor 16110 can be capable of processing instructions stored in the memory 16120 or on the storage device 16130.

The memory 16120 can store information within the hardware configuration 16100. In one implementation, the memory 16120 can be a computer-readable medium. In one implementation, the memory 16120 can be a volatile memory unit. In another implementation, the memory 16120 can be a non-volatile memory unit.

In some implementations, the storage device 16130 can be capable of providing mass storage for the hardware configuration 16100. In one implementation, the storage device 16130 can be a computer-readable medium. In various different implementations, the storage device 16130 can, for example, include a hard disk device/drive, an optical disk device, flash memory or some other large capacity storage device. In other implementations, the storage device 16130 can be a device external to the hardware configuration 16100. Various implementations for the memory 16120 and/or the storage device 16130 are further discussed below.

The input/output device 16140 can provide input/output operations for the hardware configuration 16100. In one implementation, the input/output device 16140 can include one or more display system interfaces, sensors and/or data transfer ports.

The subject matter of this disclosure, and/or components thereof, can be realized by instructions that upon execution cause one or more processing devices to carry out the processes and functions described above. Such instructions can, for example, comprise interpreted instructions, such as script instructions, e.g., JavaScript or ECMAScript instructions, or executable code, or other instructions stored in a computer readable medium.

Implementations of the subject matter and the functional operations described in this specification can be provided in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Embodiments of the subject matter described in this specification can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a tangible program carrier for execution by, or to control the operation of, data processing apparatus.

A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, or declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.

The processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output thereby tying the process to a particular machine, e.g., a machine programmed to perform the processes described herein. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).

Computer readable media (e.g., memory 16120 and/or the storage device 16130) suitable for storing computer program instructions and data may include all forms of non-volatile memory, media, and memory devices, including, by way of example, any semiconductor memory devices (e.g., EPROM, EEPROM, solid state memory devices, and flash memory devices); any magnetic disks (e.g., internal hard disks or removable disks); any magneto optical disks; and any CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.

The aforementioned description, for purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the invention and its practical applications, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as are suited to the particular use contemplated.

Claims

1. A method, comprising: receiving claim attribute data from a plurality of users for a plurality of legal claims, wherein a respective legal claim corresponds to a compensation claim by a respective user, and wherein the claim attribute data for the respective legal claim comprises data corresponding to a legal claim type for the respective legal claim, a monetary value for the respective legal claim, or combinations thereof;receiving device data for the plurality of legal claims from at least a subset of the plurality of users, wherein the device data for the respective legal claim comprises data corresponding to one or more locations associated with the respective legal claim; andgenerating a legal claim exchange for a plurality of legal claim units based on the claim attribute data and the device data, wherein a respective legal claim unit corresponds to a contractual right to the respective legal claim available for purchase by the plurality of users.

2. The method of claim 1, wherein the legal claim type for the respective legal claim comprises a Medicare secondary payer claim, an automobile injury claim, an opioid claim, a products liability claim, a personal injury claim, a patent infringement claim, a workman's compensation claim, a commercial litigation claim, a breach of contract claim, a breach of warranty claim, a libel claim, a slander claim, a nuisance claim, a debt collection claim, a malpractice claim, a property damage claim, a class action claim, a tort claim, a negligence claim, or combinations thereof.

3. The method of claim 1, wherein the monetary value for the respective legal claim corresponds to a monetary amount previously paid by the respective user for the respective legal claim.

4. The method of claim 1, wherein the respective user comprises an individual, a corporation, a business, an insurance company, an employer, or combinations thereof.

5. The method of claim 1, wherein the device data comprises data acquired using one or more mobile computing devices of at least the subset of the plurality of users.

6. The method of claim 1, wherein the device data comprises accelerometer data, satellite navigation data, recorded video data, photographic data, audio data, or combinations thereof.

7. The method of claim 1, wherein the device data comprises data acquired at a time proximate to a time associated with the legal claim, data acquired after the time associated with the legal claim, or combinations thereof.

8. The method of claim 1, wherein the data corresponding to the one or more locations associated with the respective legal claim comprises data acquired at a first location proximate to an injury location associated with the respective legal claim.

9. The method of claim 1, wherein the contractual right to the respective legal claim available for purchase by the plurality of users comprises a right to receive reimbursement for a monetary amount previously paid by the respective user for the respective legal claim, a right to receive compensatory damages associated with the respective legal claim, a right to receive punitive damages associated with the respective legal claim, or combinations thereof.

10. The method of claim 1, further comprising receiving transaction input data from the plurality of users, wherein the transaction input data comprises data corresponding to one or more bid prices and one or more offer prices for the plurality of legal claim units, acceptance of a respective bid price or a respective offer price, or combinations thereof.

11. The method of claim 10, further comprising generating an interface on a computing device, wherein the interface is configured to receive the transaction input data, and wherein the transaction input data comprises fixed input data, visual input data, audio input data, or combinations thereof.

12. The method of claim 1, further comprising generating a priority queue of the plurality of legal claim units using the legal claim exchange, wherein the priority queue orders the plurality of legal claim units.

13. A computing system, comprising: one or more processors; andone or more memory comprising program instructions executable by the one or more processors to: receive claim attribute data from a plurality of users for a plurality of legal claims, wherein a respective legal claim corresponds to a compensation claim by a respective user, and wherein the claim attribute data for the respective legal claim comprises data corresponding to a legal claim type for the respective legal claim, a monetary value for the respective legal claim, or combinations thereof;receive device data for the plurality of legal claims from at least a subset of the plurality of users, wherein the device data for the respective legal claim comprises data corresponding to one or more locations associated with the respective legal claim; andgenerate a legal claim exchange for a plurality of legal claim units based on the claim attribute data and the device data, wherein a respective legal claim unit corresponds to a contractual right to the respective legal claim available for purchase by the plurality of users.

14. The computing system of claim 13, wherein the legal claim type for the respective legal claim comprises a Medicare secondary payer claim, an automobile injury claim, an opioid claim, a products liability claim, a personal injury claim, a patent infringement claim, a workman's compensation claim, a commercial litigation claim, a breach of contract claim, a breach of warranty claim, a libel claim, a slander claim, a nuisance claim, a debt collection claim, a malpractice claim, a property damage claim, a class action claim, a tort claim, a negligence claim, or combinations thereof.

15. The computing system of claim 13, wherein the monetary value for the respective legal claim corresponds to a monetary amount previously paid by the respective user for the respective legal claim.

16. The computing system of claim 13, wherein the contractual right to the respective legal claim available for purchase by the plurality of users comprises a right to receive reimbursement for a monetary amount previously paid by the respective user for the respective legal claim, a right to receive compensatory damages associated with the respective legal claim, a right to receive punitive damages associated with the respective legal claim, or combinations thereof.

17. A non-transitory computer-readable medium having stored thereon a plurality of computer-executable instructions which, when executed by a computer, cause the computer to: receive claim attribute data from a plurality of users for a plurality of legal claims, wherein a respective legal claim corresponds to a compensation claim by a respective user, and wherein the claim attribute data for the respective legal claim comprises data corresponding to a legal claim type for the respective legal claim, a monetary value for the respective legal claim, or combinations thereof;receive device data for the plurality of legal claims from at least a subset of the plurality of users, wherein the device data for the respective legal claim comprises data corresponding to one or more locations associated with the respective legal claim; andgenerate a legal claim exchange for a plurality of legal claim units based on the claim attribute data and the device data, wherein a respective legal claim unit corresponds to a contractual right to the respective legal claim available for purchase by the plurality of users.

18. The non-transitory computer-readable medium of claim 17, wherein the device data comprises data acquired using one or more mobile computing devices of at least the subset of the plurality of users.

19. The non-transitory computer-readable medium of claim 17, wherein the device data comprises accelerometer data, satellite navigation data, recorded video data, photographic data, audio data, or combinations thereof.

20. The non-transitory computer-readable medium of claim 17, wherein the device data comprises data acquired at a time proximate to a time associated with the legal claim, data acquired after the time associated with the legal claim, or combinations thereof.