FISHER JUSTIN (US)
ROSZAK MATTHEW (US)
GARZIK JEFF (US)
US20210086084A1 | 2021-03-25 |
CLAIMS 1. A method comprising: receiving, by at least one processor, at least one event receiver request that requests at least one event between a first user on a computer platform and a second user on the computer platform, the at least one event comprising a transfer of data from the second user to the first user, and the at least one event receiver request comprising a first seed value generated by a first random number generator; receiving, by the at least one processor, at least one event provider request for providing the at least one event between the first user and the second user, the at least one event provider request comprising a second seed value generated by a second random number generator; instructing, by the at least one processor, at least one computing device associated with the second user to generate an event seed value based at least in part on a combination of the first seed value and the second seed value; instructing, by the at least one processor, at least one computing device associated with the second user to utilize a pseudorandom number generator (PRNG) to generate, based on an input of the event seed value, at least one output value defining at least one parameter of the at least one event; storing, by the at least one processor, an event entry in an event log, the event entry representing the at least one parameter of the at least one event based at least in part on the at least one output value; and executing, by the at least one processor, the transfer of data based at least in part on the event entry in the event log. 2. The method as recited in claim 1, further comprising: utilizing, by the at least one processor, a third random number generator to generate a third seed value for the at least one event; and instructing, by the at least one processor, at least one computing device associated with the second user profile to generate an event seed value based at least in part on a combination of the first seed value, the second seed value and the third seed value. 3. The method as recited in claim 1, further comprising: receiving, by the at least one processor, the first seed value; receiving, by the at least one processor, the second seed value; generating, by the at least one processor, the event seed value based at least in part on a combination of the first seed value and the second seed value; utilizing, by the at least one processor, a PRNG to generate, based on the event seed value, the at least one additional output value associated with the at least one event; and validating, by the at least one processor, the event entry based at least in part on the at least one parameter of the at least one event and the at least one additional output value. 4. The method as recited in claim 3, further comprising: receiving, by the at least one processor, the third seed value; and generating, by the at least one processor, the event seed value based at least in part on a combination of the first seed value, the second seed value and the third seed value. 5. The method as recited in claim 1, wherein the at least one parameter comprises at least one of: ordering of the at least one event, size of the transfer, price of the transfer, placement time of the transfer, or duration of the at least one event. 6. The method as recited in claim 1, wherein the at least one event comprises a transfer of liquidity. 7. The method as recited in claim 1, further comprising executing, by the at least one processor, the transfer of the liquidity via a blockchain platform. 8. A system comprising: at least one data storage that stores an event log; at least one processor configured to execute instructions stored in a non-transitory computer readable medium, the instruction, when executed, cause the at least one processor to perform steps to: receive at least one event receiver request that requests at least one event between a first user profile of a first user on a computer platform and a second user profile of a second user on the computer platform, the at least one event comprising a transfer of data from the second user profile to the first user profile, and the at least one event receiver request comprising a first seed value generated by a first random number generator; receive at least one event provider request for providing the at least one event between the first user profile of the first user and the second user profile of the second user, the at least one event provider request comprising a second seed value generated by a second random number generator; instruct at least one computing device associated with the second user profile to generate an event seed value based at least in part on a combination of the first seed value and the second seed value; instruct at least one computing device associated with the second user profile to utilize a pseudorandom number generator (PRNG) to generate, based on an input of the event seed value, at least one output value defining at least one parameter of the at least one event; store an event entry in an event log, the event entry representing the at least one parameter of the at least one event based at least in part on the at least one output value; and execute the transfer of data based at least in part on the event entry in the event log. 9. The system as recited in claim 8, wherein the instruction, when executed, further cause the at least one processor to perform steps to: utilize a third random number generator to generate a third seed value for the at least one event; and instruct at least one computing device associated with the second user profile to generate an event seed value based at least in part on a combination of the first seed value, the second seed value and the third seed value. 10. The system as recited in claim 8, wherein the instruction, when executed, further cause the at least one processor to perform steps to: receive the first seed value; receive the second seed value; generate the event seed value based at least in part on a combination of the first seed value and the second seed value; utilize a PRNG to generate, based on the event seed value, the at least one additional output value associated with the at least one event; and validate the event entry based at least in part on the at least one parameter of the at least one event and the at least one additional output value. 11. The system as recited in claim 10, wherein the instruction, when executed, further cause the at least one processor to perform steps to: receive the third seed value; and generate the event seed value based at least in part on a combination of the first seed value, the second seed value and the third seed value. 12. The system as recited in claim 8, wherein the at least one parameter comprises at least one of: ordering of the at least one event, size of the transfer, price of the transfer, placement time of the transfer, or duration of the at least one event. 13. The system as recited in claim 8, wherein the instruction, when executed, further cause the at least one processor to perform steps to: 14. The system as recited in claim 8, wherein the instruction, when executed, further cause the at least one processor to perform steps to execute the transfer of the liquidity via a blockchain platform. 15. A non-transitory computer-readable medium having software instruction stored thereon, wherein the software instructions are configured to be execution by at least one processor to cause the at least one processor to perform steps comprising: receiving at least one event receiver request that requests at least one event between a first user profile of a first user on a computer platform and a second user profile of a second user on the computer platform, the at least one event comprising a transfer of data from the second user profile to the first user profile, and the at least one event receiver request comprising a first seed value generated by a first random number generator; receiving at least one event provider request for providing the at least one event between the first user profile of the first user and the second user profile of the second user, the at least one event provider request comprising a second seed value generated by a second random number generator; instructing at least one computing device associated with the second user profile to generate an event seed value based at least in part on a combination of the first seed value and the second seed value; instructing at least one computing device associated with the second user profile to utilize a pseudorandom number generator (PRNG) to generate, based on an input of the event seed value, at least one output value defining at least one parameter of the at least one event; storing an event entry in an event log, the event entry representing the at least one parameter of the at least one event based at least in part on the at least one output value; and executing the transfer of data based at least in part on the event entry in the event log. 16. The non-transitory computer-readable medium as recited in claim 15, wherein the software instructions are further configured to be executed by at least one processor to cause the at least one processor to perform steps further comprising: utilizing a third random number generator to generate a third seed value for the at least one event; and instructing at least one computing device associated with the second user profile to generate an event seed value based at least in part on a combination of the first seed value, the second seed value and the third seed value. 17. The non-transitory computer-readable medium as recited in claim 15, wherein the software instructions are further configured to be executed by at least one processor to cause the at least one processor to perform steps further comprising: receiving the first seed value; receiving the second seed value; generating the event seed value based at least in part on a combination of the first seed value and the second seed value; utilizing a PRNG to generate, based on the event seed value, the at least one additional output value associated with the at least one event; and validating the event entry based at least in part on the at least one parameter of the at least one event and the at least one additional output value. 18. The non-transitory computer-readable medium as recited in claim 17, wherein the software instructions are further configured to be executed by at least one processor to cause the at least one processor to perform steps further comprising: receiving the third seed value; and generating the event seed value based at least in part on a combination of the first seed value, the second seed value and the third seed value. 19. The non-transitory computer-readable medium as recited in claim 15, wherein the at least one parameter comprises at least one of: ordering of the at least one event, size of the transfer, price of the transfer, placement time of the transfer, or duration of the at least one event. 20. The non-transitory computer-readable medium as recited in claim 15, wherein the software instructions are further configured to be executed by at least one processor to cause the at least one processor to perform steps further comprising execute the transfer of data via a blockchain platform, wherein the data comprises liquidity. |
Detailed Implementation Example [0075] The following parameters are passed into the order generation algorithm: [0076] The following data structures are used by the order generation algorithm:
Example Algorithm 1. A Linear Congruential PRNG is instantiated with the provided seed, referred to as “l_prng” for short. 2. A Gaussian Random PRNG is instantiated with the first 64-bits of randomness sourced from l_prng and is referred to as “g_prng” for short. 3. A random unsigned integer is generated from l_prng in the interval [0, averageStartTradeCount), is summed with 0.5*averageStartTradeCount, and the result is referred to as “numStartOrders”. 4. Local IEEE 754 32-bit float variable targetInitialPercentage is set to 1.00f / numStartOrders 5. Local IEEE 75432-bit float variables consumedBuyLiquidity and consumedSellLiquidity are set to 0, and local unsigned 32-bit integer variables buyMS and sellMS are also set to 0. 6. Local List (of expandable size) of GeneratedTradeOrder structs is instantiated and referred to as “generatedOrders” 7. A loop is executed numStartOrders times, each time: a. A local IEEE 75432-bit float variable distanceSell is set to the absolute value of the next gaussian float generated by g_prng multiplied by standardDeviation b. A local IEEE 754 32-bit float variable modifiedSaleTargetPercentage is set to (targetInitialPercentage + (targetInitialPercentage * 0.25) * (l_prng.nextDouble-0.5)*2 c. A local IEEE 754 32-bit float variable probabilitySell is set to erf(distanceSell/sqrt(2)) d. A local IEEE 754 32-bit float variable sellSize is set to the absolute value of ((probabilitySell + 0.4) * (l_prng.nextDouble + 0.5)) * modifiedSaleTargetPercentage e. If sellSize is greater than (1.00f - consumedSellLiquidity) then it is set to (1.00f – consumedSellLiquidity) f. A local IEEE 754 32-bit float variable sellStartOffset is set to l_prng.nextInt(initialOrderPeriodMaxMS / numStartOrders) g. sellMS is set to sellMS + sellStartOffset h. A local 32-bit unsigned integer sellDuration is set to averageOrderLengthMS / 2 + l_prng.nextInt(averageOrderLengthMS) i. A GeneratedTradeOrder struct sellOrder is created, with pricePercentage = distanceSell, liquidityPercentage = sellSize, startTimeMS = sellMS, durationMS = sellDuration, buyOrder = false j. consumedSellLiquidity is set to consumedSellLiquidity + sellSize k. sellOrder is added to the list generatedOrders l. A local IEEE 75432-bit float variable distanceBuy is set to the absolute value of the next gaussian float generated by g_prng multiplied by standardDeviation m. A local IEEE 754 32-bit float variable modifiedBuyTargetPercentage is set to (targetInitialPercentage + (targetInitialPercentage * 0.25) * (l_prng.nextDouble-0.5)*2 n. A local IEEE 754 32-bit float variable probabilityBuy is set to erf(distanceBuy/sqrt(2)) o. A local IEEE 754 32-bit float variable buySize is set to the absolute value of ((probabilityBuy + 0.4) * (l_prng.nextDouble + 0.5)) * modifiedBuyTargetPercentage p. If buySize is greater than (1.00f - consumedBuyLiquidity) then it is set to (1.00f – consumedBuyLiquidity) q. A local IEEE 754 32-bit float variable buyStartOffset is set to l_prng.nextInt(initialOrderPeriodMaxMS / numStartOrders) r. buyMS is set to buyMS + buyStartOffset s. A local 32-bit unsigned integer buyDuration is set to averageOrderLengthMS / 2 + l_prng.nextInt(averageOrderLengthMS) t. A GeneratedTradeOrder struct buyOrder is created, with pricePercentage = distanceBuy, liquidityPercentage = buySize, startTimeMS = buyMS, durationMS = buyDuration, buyOrder = true u. consumedBuyLiquidity is set to consumedBuyLiquidity + buySize v. buyOrder is added to the list generatedOrders 8. A local List (of expandable size) of GeneratedTradeOrder structs is instantiated and referred to as activeOrders. 9. A local List (of expandable size) of GeneratedTradeOrder structs is instantiated and referred to as closedOrders. 10. All structs in generatedOrders are moved to activeOrders 11. A local 32-bit unsigned integer variable lastOrderStart is set to the highest startTimeMS variable of all of the structs in generatedOrders 12. A loop is executed roundDurationMS- lastOrderStart times, each time: a. A local 32-bit unsigned integer variable clockTime is set to the loopIndex + lastOrderStart (where loopIndex refers to how many times this loop has executed) b. For each struct order in activeOrders: i. If clockTime >= (order.startTimeMS + order.durationMS): 1. Move order from activeOrders to closedOrders 2. If order.buyOrder is false, set consumedSellLiquidity to consumedSellLiquidity - order.liquidityPercentage 3. Else (if order.buyOrder is true), set consumedBuyLiquidity to consumedBuyLiquidity – order.liquidityPercentage c. If (1 – consumedBuyLiquidity) >= newOrderThreshold: i. A local IEEE 75432-bit float variable distanceBuy is set to the absolute value of the next gaussian float generated by g_prng multiplied by standardDeviation ii. A local IEEE 75432-bit float variable modifiedBuyTargetPercentage is set to (1 – consumedBuyLiquidity) iii. A local IEEE 754 32-bit float variable probabilityBuy is set to erf(distanceBuy/sqrt(2)) iv. A local IEEE 75432-bit float variable buySize is set to the absolute value of ((probabilityBuy + 0.4) * (l_prng.nextDouble + 0.5)) * modifiedBuyTargetPercentage v. If buySize is greater than (1.00f - consumedBuyLiquidity) then it is set to (1.00f – consumedBuyLiquidity) vi. A local 32-bit unsigned integer buyDuration is set to averageOrderLengthMS / 2 + l_prng.nextInt(averageOrderLengthMS) vii. A local 32-bit unsigned integer buyStartTimeMS is set to l_prng.nextInt(1000) + clockTime viii. A GeneratedTradeOrder struct buyOrder is created, with pricePercentage = distanceBuy, liquidityPercentage = buySize, startTimeMS = buyStartTimeMS, durationMS = buyDuration, buyOrder = true ix. consumedBuyLiquidity is set to consumedBuyLiquidity + buySize x. buyOrder is added to the list activeOrders d. If (1 – consumedSellLiquidity) >= newOrderThreshold: i. A local IEEE 75432-bit float variable distanceSell is set to the absolute value of the next gaussian float generated by g_prng multiplied by standardDeviation ii. A local IEEE 75432-bit float variable modifiedSellTargetPercentage is set to (1 – consumedSellLiquidity) iii. A local IEEE 754 32-bit float variable probabilitySell is set to erf(distanceSell/sqrt(2)) iv. A local IEEE 75432-bit float variable sellSize is set to the absolute value of ((probabilitySell + 0.4) * (l_prng.nextDouble + 0.5)) * modifiedSellTargetPercentage v. If sellSize is greater than (1.00f - consumedSellLiquidity) then it is set to (1.00f – consumedSellLiquidity) vi. A local 32-bit unsigned integer sellDuration is set to averageOrderLengthMS / 2 + l_prng.nextInt(averageOrderLengthMS) vii. A local 32-bit unsigned integer sellStartTimeMS is set to l_prng.nextInt(1000) + clockTime viii. A GeneratedTradeOrder struct sellOrder is created, with pricePercentage = distanceSell, liquidityPercentage = sellSize, startTimeMS = sellStartTimeMS, durationMS = sellDuration, buyOrder = false ix. consumedSellLiquidity is set to consumedSellLiquidity + sellSize x. sellOrder is added to the list activeOrders e. All orders in activeOrders and closedOrders are added to generatedOrders f. If generateBuyOrders = false, then remove all elements from generatedOrders where buyOrder = true g. If generateSellOrders = false, then remove all elements from generatedOrders where buyOrder = false h. generatedOrders is sorted ascending based on the startTime of each struct element i. generatedOrders is returned. [0077] The Order Generation Algorithm is used two times in the present disclosure: generating orders on a liquidity provider’s computer which they then place using industry-standard software that can communicate with cryptocurrency exchanges, and regenerating orders on a verifier’s computer (which may be all full-node blockchain validators on a network who all independently perform the same verification process) so that the orders a liquidity provider was supposed to place during a liquidity round can be verified by cross-referencing against orderbook data (see the Order Verification Process). [0078] Note that even when no buy and/or sell orders are desired as outputs from the algorithm, the detailed implementation example algorithm generates these unwanted orders anyway, and then removes them prior to returning the completed list of orders, which ensures that the same buy and sell orders are generated whether either or both were requested, because the Linear Congruential and Gaussian Random PRNGs are accessed in the same pattern. This could be optimized by generating two separate pairs of each PRNG, using one pair for buy and one pair for sell orders if desired. Order Verification [0079] Orders are re-generated by one or more third parties (e.g., with the event verification engine 140) using the order generation algorithm after the completion of a liquidity round. These re- generated orders are compared against historical orderbook data to verify that the liquidity provider successfully placed the prescribed orders at the correct times and left them up for a sufficient duration. [0080] For example, one party agrees to create a given amount of liquidity on a particular market in exchange for consideration from another party. Both parties are distrustful, so they collaborate on selecting a seed which neither party can influence, the liquidity provider uses the secure seed to generate orders, and places those orders on the orderbook. At the end, the liquidity provider reveals their portion of the secret seed, and a coordinator regenerates the orders that the liquidity provider should have placed, and verifies that they were correctly placed before releasing the consideration. If the order verification fails, the consideration is refunded to the liquidity subscriber. [0081] In some embodiments, to verify orders, a party combines all portions of the random seed agreement to recreate the original seed used by the liquidity provider, re-runs the deterministic order generation algorithm, and then compares the regenerated orders with historic market data, ensuring that each order that should have been placed at a particular time was correctly placed and left up for the prescribed duration (or filled prior to the conclusion of the order’s duration). [0082] In some embodiments, the coordinator uses the random seed to regenerate orders that a particular liquidity provider was required to place during a liquidity round and acquires historical orderbook data for the marketplace in question (ex: ETH-USD orderbook on Coinbase). This orderbook data may be acquired from a third-party provider (such as the exchange itself, or a market data collection service) or can be recorded in real-time during the liquidity round in preparation. [0083] The recorded or otherwise acquired data can be replayed, allowing a view of the orderbook and recently executed orders throughout the period during which liquidity was supposed to be provided on the given marketplace. By looking for the placement of orders based on orderbook data which the regenerated list of orders specifies, verifying that these orders were not taken down until their duration expires unless executed trades filled or partially filled the specified liquidity- providing orders, and keeping track of the remaining liquidity available to the liquidity provider in the event of fills or partial fills for correctly interpreting future order placement. Detailed Implementation Example [0084] The following parameters are passed into the order generation algorithm: [0085] The following data structures are used by the order generation algorithm: Example Algorithm 1. The Order Generation Algorithm is run (passing in the appropriate parameters that were passed to this process: seed, roundDurationMS, averageOrderLengthMS, initialOrderPeriodMaxMS, averageStartTradeCount, standardDeviation, newOrderThreshold, generateBuyOrders, generateSellOrders), and the generated List of GeneratedTradeOrder structs is stored as generatedOrders. (Note that the struct by the same name used in this algorithm has extra fields, so assume those additional fields are all set to zero initially when returned from the Order Generation Algorithm). 2. Historical market data is acquired (either from an external data source or a local recording agent outside the scope of this disclosure) for the given targetExchange and targetPair starting at liquidityRoundStartTime. 3. A local IEEE 75432-bit float variable consumedBuyLiquidityPercent is set to 0 4. A local IEEE 75432-bit float variable consumedSellLiquidityPercent is set to 0 5. A local IEEE 75432-bit float variable filledBuyLiquidity is set to 0 6. A local IEEE 75432-bit float variable filledSellLiquidity is set to 0 7. A local List (of expandable size) of GeneratedTradeOrder structs is instantiated and referred to as activeOrders. 8. A local List (of expandable size) of GeneratedTradeOrder structs is instantiated and referred to as closedOrders. 9. A loop is run roundDurationMS+(averageOrderLengthMS*2) times, each time: a. A local 32-bit unsigned integer variable clockTime is set to loopIndex (where loopIndex refers to how many times this loop has executed) b. Acquire the view of the orderbook (including recently executed trades) from the stored historical market data at clockTime and at each integer in the interval [clockTime-1, …, clockTime-orderPlacementAllowanceMS], refer to these slices as marketSlice[clockTime], marketSlice[clockTime-1], …, marketSlice[clockTime-orderPlacementAllowanceMS] c. A local IEEE 754 32-bit float variable highestBid is set to the highest bid in marketSlice[clockTime] d. A local IEEE 754 32-bit float variable lowestAsk is set to the lowest ask in marketSlice[clockTime] e. A local IEEE 754 32-bit float variable averagePrice is set to (highestBid + howestAsk)/2 f. For each struct order in generatedOrders: i. If clockTime > order.startTimeMS: 1. A local IEEE 754 32-bit float variable orderPrice is set to order.pricePercentage * averagePrice 2. A local IEEE 75432-bit float variable orderLiquidityPercentage is set to order.liquidityPercentage 3. If order.buyOrder = true: a. A local IEEE 754 32-bit float variable orderAllowedPercentage is set to (1- consumedBuyLiquidityPercent) 4. Else (if order.buyOrder = false): a. A local IEEE 754 32-bit float variable orderAllowedPercentage is set to (1- consumedSellLiquidityPercent) 5. If orderAllowedPercentage < order.liquidityPercentage then orderLiquidityPercentage is set to orderAllowedPercentage 6. If order.buyOrder = true: a. A local IEEE 754 32-bit float variable orderSize is set to (buyLiquidityQuantity- filledBuyLiquidity)*orderAllowedPercentage 7. Else (if order.buyOrder = false): a. A local IEEE 754 32-bit float variable orderSize is set to (sellLiquidityQuantity- filledSellLiquidity)*orderAllowedPercentage 8. A (sub)loop is run orderPlacementAllowanceMS times, each time: a. If the difference between marketSlice[clockTime – subLoopIndex-1] and marketSlice[clockTime – subLoopIndex] at the price level orderPrice in available liquidity is equivalent to orderSize, then: i. Set order.actualOrderPrice = orderPrice ii. Set order.actualOrderSize = orderSize iii. Move order from generatedOrders to activeOrders iv. If order.buyOrder = true: 1. Set consumedBuyLiquidityPercent to consumedBuyLiquidityPercent + orderAllowedPercentage v. Else (if order.buyOrder = false): 1. Set consumedSellLiquidityPercent to consumedSellLiquidityPercent + orderAllowedPercentage vi. Exit (sub)loop g. For each struct order in activeOrders: i. If clockTime > (order.startTimeMS + order.durationMS): ii. A (sub)loop is run orderPlacementAllowanceMS times, each time: 1. If the difference between marketSlice[clockTime – subLoopIndex] and marketSlice[clockTime – subLoopIndex - 1] at the price level order.orderPrice in available liquidity is equivalent to (order.orderSize-order.filledOrderSize) then: a. If this price level change has already been seen by a previous run of this same (sub)loop as corresponding to an order then continue to the next run of the (sub)loop. b. Move order from activeOrders to closedOrders c. If order.buyOrder = true: i. Set consumedBuyLiquidityPercent to consumedBuyLiquidityPercent – orderAllowedPercentage d. Else (if order.buyOrder = false): i. Set consumedSellLiquidityPercent to consumedSellLiquidityPercent – orderAllowedPercentage e. Exit (sub)loop iii. A (sub)loop is run orderPlacementAllowanceMS times, each time: 1. If an order executed between marketSlice[clockTime – subLoopIndex - 1] and marketSlice[clockTime – subLoopIndex] exists at the same price as order.actualOrderPrice, then record the order’s size as a local IEEE 75432-bit float variable orderSize: a. If order.buyOrder = true: i. A local IEEE 754 32-bit float variable currentUsedLiquidity = ((buyLiquidityQuantity - filledBuyLiquidity) * consumedBuyLiquidityPercent) ii. Set filledBuyLiquidity to filledBuyLiquidity + orderSize iii. Set consumedBuyLiquidityPercent = ((currentUsedLiquidity + orderSize) / (buyLiquidityQuantity - filledBuyLiquidity)) b. Else (if order.buyOrder = false): i. A local IEEE 754 32-bit float variable currentUsedLiquidity = ((sellLiquidityQuantity - filledSellLiquidity) * consumedSellLiquidityPercent) ii. Set filledSellLiquidity to filledSellLiquidity + orderSize iii. Set consumedSellLiquidityPercent = ((currentUsedLiquidity + orderSize) / (sellLiquidityQuantity - filledSellLiquidity)) 10. A local IEEE 75432-bit float variable totalOrderFailures is set equal to the number of elements in generatedOrders plus the number of elements in activeOrders 11. A local IEEE 75432-bit float variable totalOrderSuccesses is set equal to the number of elements in closedOrders 12. A local IEEE 754 32-bit float variable failureSuccessRatio is set equal to totalOrderFailures / (totalOrderFailures + totalOrderSuccesses) 13. If failureSuccessRatio < misbehaviorThreshold then the verification was successful and the liquidity was properly provided, otherwise the verification failed and the liquidity was not properly provided. [0086] This verification process is used by one or more verifiers to regenerate the orders that a particular liquidity provider was required to place (and later remove) on a particular orderbook on a particular exchange at particular times, and then to verify that the liquidity provider correctly placed and removed their orders when they were required to, without having to have access anything but public orderbook information. [0087] This verification process can be operated by a central coordinator (and repeated for transparency by any interested third party), or it can be embedded into a smart contract which references marketplace data provided to the smart contract by a market orderbook information oracle. In the even that multiple oracles are used, the verification process can be used for each oracle’s data, and a specific threshold of successes versus failures using different oracles’ data can be used for final verification approval. [0088] This verification process is used by one or more verifiers to regenerate the orders that a particular liquidity provider was required to place (and later remove) on a particular orderbook on a particular exchange at particular time, and then to verify that the liquidity provider correctly placed and removed their orders when they were required to, without having to have access to anything but public orderbook information. [0089] This verification process can be operated by a central coordinator (and repeated for transparency by any interested third party), or it can be embedded into a smart contract which references marketplace data provided to the smart contract by a market orderbook information oracle. In the even that multiple oracles are used, the verification process can be used for each oracle’s data, and a specific threshold of successes versus failures using different oracles’ data can be used for final verification approval. [0090] FIG.3 depicts a block diagram of an exemplary computer-based system and platform 300 in accordance with one or more embodiments of the present disclosure. However, not all of these components may be required to practice one or more embodiments, and variations in the arrangement and type of the components may be made without departing from the spirit or scope of various embodiments of the present disclosure. In some embodiments, the illustrative computing devices and the illustrative computing components of the exemplary computer-based system and platform 300 may be configured to manage a large number of members and concurrent transactions, as detailed herein. In some embodiments, the exemplary computer-based system and platform 300 may be based on a scalable computer and network architecture that incorporates varies strategies for assessing the data, caching, searching, and/or database connection pooling. An example of the scalable architecture is an architecture that is capable of operating multiple servers. [0091] In some embodiments, referring to FIG. 3, member computing device 302, member computing device 303 through member computing device 304 (e.g., clients) of the exemplary computer-based system and platform 300 may include virtually any computing device capable of receiving and sending a message over a network (e.g., cloud network), such as network 305, to and from another computing device, such as servers 306 and 307, each other, and the like. In some embodiments, the member devices 302-304 may be personal computers, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, and the like. In some embodiments, one or more member devices within member devices 302-304 may include computing devices that typically connect using a wireless communications medium such as cell phones, smart phones, pagers, walkie talkies, radio frequency (RF) devices, infrared (IR) devices, CBs citizens band radio, integrated devices combining one or more of the preceding devices, or virtually any mobile computing device, and the like. In some embodiments, one or more member devices within member devices 302-304 may be devices that are capable of connecting using a wired or wireless communication medium such as a PDA, POCKET PC, wearable computer, a laptop, tablet, desktop computer, a netbook, a video game device, a pager, a smart phone, an ultra- mobile personal computer (UMPC), and/or any other device that is equipped to communicate over a wired and/or wireless communication medium (e.g., NFC, RFID, NBIOT, 3G, 4G, 5G, GSM, GPRS, WiFi, WiMax, CDMA, OFDM, OFDMA, LTE, satellite, ZigBee, etc.). In some embodiments, one or more member devices within member devices 302-304 may run one or more applications, such as Internet browsers, mobile applications, voice calls, video games, videoconferencing, and email, among others. In some embodiments, one or more member devices within member devices 302-304 may be configured to receive and to send digital data constituting web pages, and the like. In some embodiments, an exemplary specifically programmed browser application of the present disclosure may be configured to receive and display graphics, text, multimedia, and the like, employing virtually any web based language, including, but not limited to Standard Generalized Markup Language (SMGL), such as HyperText Markup Language (HTML), a wireless application protocol (WAP), a Handheld Device Markup Language (HDML), such as Wireless Markup Language (WML), WMLScript, XML, JavaScript, and the like. In some embodiments, a member device within member devices 302-304 may be specifically programmed by either Java, .Net, QT, C, C++, Python, PHP and/or other suitable programming language. In some embodiment of the device software, device control may be distributed between multiple standalone applications. In some embodiments, software components/applications can be updated and redeployed remotely as individual units or as a full software suite. In some embodiments, a member device may periodically report status or send alerts over text or email. In some embodiments, a member device may contain a data recorder which produces data which is remotely downloadable by the user using network protocols such as FTP, SSH, or other file transfer mechanisms. In some embodiments, a member device may provide several levels of user interface, for example, advance user, standard user. In some embodiments, one or more member devices within member devices 302-304 may be specifically programmed to include or execute an application to perform a variety of possible tasks, such as, without limitation, messaging functionality, browsing, searching, playing, streaming or displaying various forms of content, including locally stored or uploaded messages, images and/or video, and/or games. [0092] In some embodiments, the exemplary network 305 may provide network access, data transport and/or other services to any computing device coupled to it. In some embodiments, the exemplary network 305 may include and implement at least one specialized network architecture that may be based at least in part on one or more standards set by, for example, without limitation, Global System for Mobile communication (GSM) Association, the Internet Engineering Task Force (IETF), and the Worldwide Interoperability for Microwave Access (WiMAX) forum. In some embodiments, the exemplary network 305 may implement one or more of a GSM architecture, a General Packet Radio Service (GPRS) architecture, a Universal Mobile Telecommunications System (UMTS) architecture, and an evolution of UMTS referred to as Long Term Evolution (LTE). In some embodiments, the exemplary network 305 may include and implement, as an alternative or in conjunction with one or more of the above, a WiMAX architecture defined by the WiMAX forum. In some embodiments and, optionally, in combination of any embodiment described above or below, the exemplary network 305 may also include, for instance, at least one of a local area network (LAN), a wide area network (WAN), the Internet, a virtual LAN (VLAN), an enterprise LAN, a layer 3 virtual private network (VPN), an enterprise IP network, or any combination thereof. In some embodiments and, optionally, in combination of any embodiment described above or below, at least one computer network communication over the exemplary network 305 may be transmitted based at least in part on one of more communication modes such as but not limited to: NFC, RFID, Narrow Band Internet of Things (NBIOT), ZigBee, 3G, 4G, 5G, GSM, GPRS, WiFi, WiMax, CDMA, OFDM, OFDMA, LTE, satellite and any combination thereof. In some embodiments, the exemplary network 305 may also include mass storage, such as network attached storage (NAS), a storage area network (SAN), a content delivery network (CDN) or other forms of computer or machine readable media. [0093] In some embodiments, the exemplary server 306 or the exemplary server 307 may be a web server (or a series of servers) running a network operating system with optional additional presence of executable software, examples of which may include but are not limited to Apache on Linux or Microsoft IIS (Internet Information Services). In some embodiments, the exemplary server 306 or the exemplary server 307 may be used for and/or provide cloud and/or network computing. Although not shown in FIG.3, in some embodiments, the exemplary server 306 or the exemplary server 307 may have connections to external systems like email, SMS messaging, text messaging, ad content providers, etc. Any of the features of the exemplary server 306 may be also implemented in the exemplary server 307 and vice versa. [0094] In some embodiments, one or more of the exemplary servers 306 and 307 may be specifically programmed to perform, in non-limiting example, as authentication servers, search servers, email servers, social networking services servers, Short Message Service (SMS) servers, Instant Messaging (IM) servers, Multimedia Messaging Service (MMS) servers, exchange servers, photo-sharing services servers, advertisement providing servers, financial/banking-related services servers, travel services servers, or any similarly suitable service-base servers for users of the member computing devices 301-304. [0095] In some embodiments and, optionally, in combination of any embodiment described above or below, for example, one or more exemplary computing member devices 302-304, the exemplary server 306, and/or the exemplary server 307 may include a specifically programmed software module that may be configured to send, process, and receive information using a scripting language, a remote procedure call, an email, a tweet, Short Message Service (SMS), Multimedia Message Service (MMS), instant messaging (IM), an application programming interface, Simple Object Access Protocol (SOAP) methods, Common Object Request Broker Architecture (CORBA), HTTP (Hypertext Transfer Protocol), REST (Representational State Transfer), SOAP (Simple Object Transfer Protocol), MLLP (Minimum Lower Layer Protocol), or any combination thereof. [0096] FIG.4 depicts a block diagram of another exemplary computer-based system and platform 400 in accordance with one or more embodiments of the present disclosure. However, not all of these components may be required to practice one or more embodiments, and variations in the arrangement and type of the components may be made without departing from the spirit or scope of various embodiments of the present disclosure. In some embodiments, the member computing device 402a, member computing device 402b through member computing device 402n shown each at least includes a computer-readable medium, such as a random-access memory (RAM) 408 coupled to a processor 410 or FLASH memory. In some embodiments, the processor 410 may execute computer-executable program instructions stored in memory 408. In some embodiments, the processor 410 may include a microprocessor, an ASIC, and/or a state machine. In some embodiments, the processor 410 may include, or may be in communication with, media, for example computer-readable media, which stores instructions that, when executed by the processor 410, may cause the processor 410 to perform one or more steps described herein. In some embodiments, examples of computer-readable media may include, but are not limited to, an electronic, optical, magnetic, or other storage or transmission device capable of providing a processor, such as the processor 410 of client 402a, with computer-readable instructions. In some embodiments, other examples of suitable media may include, but are not limited to, a floppy disk, CD-ROM, DVD, magnetic disk, memory chip, ROM, RAM, an ASIC, a configured processor, all optical media, all magnetic tape or other magnetic media, or any other medium from which a computer processor can read instructions. Also, various other forms of computer-readable media may transmit or carry instructions to a computer, including a router, private or public network, or other transmission device or channel, both wired and wireless. In some embodiments, the instructions may comprise code from any computer-programming language, including, for example, C, C++, Visual Basic, Java, Python, Perl, JavaScript, and etc. [0097] In some embodiments, member computing devices 402a through 402n may also comprise a number of external or internal devices such as a mouse, a CD-ROM, DVD, a physical or virtual keyboard, a display, or other input or output devices. In some embodiments, examples of member computing devices 402a through 402n (e.g., clients) may be any type of processor-based platforms that are connected to a network 406 such as, without limitation, personal computers, digital assistants, personal digital assistants, smart phones, pagers, digital tablets, laptop computers, Internet appliances, and other processor-based devices. In some embodiments, member computing devices 402a through 402n may be specifically programmed with one or more application programs in accordance with one or more principles/methodologies detailed herein. In some embodiments, member computing devices 402a through 402n may operate on any operating system capable of supporting a browser or browser-enabled application, such as Microsoft™, Windows™, and/or Linux. In some embodiments, member computing devices 402a through 402n shown may include, for example, personal computers executing a browser application program such as Microsoft Corporation's Internet Explorer™, Apple Computer, Inc.'s Safari™, Mozilla Firefox, and/or Opera. In some embodiments, through the member computing client devices 402a through 402n, user 412a, user 412b through user 412n, may communicate over the exemplary network 406 with each other and/or with other systems and/or devices coupled to the network 406. As shown in FIG. 4, exemplary server devices 404 and 413 may include processor 405 and processor 414, respectively, as well as memory 417 and memory 416, respectively. In some embodiments, the server devices 404 and 413 may be also coupled to the network 406. In some embodiments, one or more member computing devices 402a through 402n may be mobile clients. [0098] In some embodiments, at least one database of exemplary databases 407 and 415 may be any type of database, including a database managed by a database management system (DBMS). In some embodiments, an exemplary DBMS-managed database may be specifically programmed as an engine that controls organization, storage, management, and/or retrieval of data in the respective database. In some embodiments, the exemplary DBMS-managed database may be specifically programmed to provide the ability to query, backup and replicate, enforce rules, provide security, compute, perform change and access logging, and/or automate optimization. In some embodiments, the exemplary DBMS-managed database may be chosen from Oracle database, IBM DB2, Adaptive Server Enterprise, FileMaker, Microsoft Access, Microsoft SQL Server, MySQL, PostgreSQL, and a NoSQL implementation. In some embodiments, the exemplary DBMS-managed database may be specifically programmed to define each respective schema of each database in the exemplary DBMS, according to a particular database model of the present disclosure which may include a hierarchical model, network model, relational model, object model, or some other suitable organization that may result in one or more applicable data structures that may include fields, records, files, and/or objects. In some embodiments, the exemplary DBMS-managed database may be specifically programmed to include metadata about the data that is stored. [0099] In some embodiments, the exemplary inventive computer-based systems/platforms, the exemplary inventive computer-based devices, and/or the exemplary inventive computer-based components of the present disclosure may be specifically configured to operate in a cloud computing/architecture 425 such as, but not limited to: infrastructure a service (IaaS) 610, platform as a service (PaaS) 608, and/or software as a service (SaaS) 606 using a web browser, mobile app, thin client, terminal emulator or other endpoint 604. FIGs. 5 and 6 illustrate schematics of exemplary implementations of the cloud computing/architecture(s) in which the exemplary inventive computer-based systems/platforms, the exemplary inventive computer-based devices, and/or the exemplary inventive computer-based components of the present disclosure may be specifically configured to operate. [0100] It is understood that at least one aspect/functionality of various embodiments described herein can be performed in real-time and/or dynamically. As used herein, the term “real-time” is directed to an event/action that can occur instantaneously or almost instantaneously in time when another event/action has occurred. For example, the “real-time processing,” “real-time computation,” and “real-time execution” all pertain to the performance of a computation during the actual time that the related physical process (e.g., a user interacting with an application on a mobile device) occurs, in order that results of the computation can be used in guiding the physical process. [0101] As used herein, the term “dynamically” and term “automatically,” and their logical and/or linguistic relatives and/or derivatives, mean that certain events and/or actions can be triggered and/or occur without any human intervention. In some embodiments, events and/or actions in accordance with the present disclosure can be in real-time and/or based on a predetermined periodicity of at least one of: nanosecond, several nanoseconds, millisecond, several milliseconds, second, several seconds, minute, several minutes, hourly, several hours, daily, several days, weekly, monthly, etc. [0102] As used herein, the term “runtime” corresponds to any behavior that is dynamically determined during an execution of a software application or at least a portion of software application. [0103] In some embodiments, exemplary inventive, specially programmed computing systems and platforms with associated devices are configured to operate in the distributed network environment, communicating with one another over one or more suitable data communication networks (e.g., the Internet, satellite, etc.) and utilizing one or more suitable data communication protocols/modes such as, without limitation, IPX/SPX, X.25, AX.25, AppleTalk(TM), TCP/IP (e.g., HTTP), near-field wireless communication (NFC), RFID, Narrow Band Internet of Things (NBIOT), 3G, 4G, 5G, GSM, GPRS, WiFi, WiMax, CDMA, satellite, ZigBee, and other suitable communication modes. [0104] In some embodiments, the NFC can represent a short-range wireless communications technology in which NFC-enabled devices are “swiped,” “bumped,” “tapped” or otherwise moved in close proximity to communicate. In some embodiments, the NFC could include a set of short- range wireless technologies, typically requiring a distance of 10 cm or less. In some embodiments, the NFC may operate at 13.56 MHz on ISO/IEC 18000-3 air interface and at rates ranging from 106 kbit/s to 424 kbit/s. In some embodiments, the NFC can involve an initiator and a target; the initiator actively generates an RF field that can power a passive target. In some embodiment(s), this can enable NFC targets to take very simple form factors such as tags, stickers, key fobs, or cards that do not require batteries. In some embodiments, the NFC’s peer-to-peer communication can be conducted when a plurality of NFC-enable devices (e.g., smartphones) are within close proximity of each other. [0105] The material disclosed herein may be implemented in software or firmware or a combination of them or as instructions stored on a machine-readable medium, which may be read and executed by one or more processors. A machine-readable medium may include any medium and/or mechanism for storing or transmitting information in a form readable by a machine (e.g., a computing device). For example, a machine-readable medium may include read only memory (ROM); random access memory (RAM); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.), and others. [0106] As used herein, the terms “computer engine” and “engine” identify at least one software component and/or a combination of at least one software component and at least one hardware component which are designed/programmed/configured to manage/control other software and/or hardware components (such as the libraries, software development kits (SDKs), objects, etc.). [0107] Examples of hardware elements may include processors, microprocessors, circuits, circuit elements (e.g., transistors, resistors, capacitors, inductors, and so forth), integrated circuits, application specific integrated circuits (ASIC), programmable logic devices (PLD), digital signal processors (DSP), field programmable gate array devices (FPGA), logic gates, registers, semiconductor devices, chips, microchips, chip sets, and so forth. In some embodiments, the one or more processors may be implemented as a Complex Instruction Set Computer (CISC) or Reduced Instruction Set Computer (RISC) processors; x86 instruction set compatible processors, multi-core, or any other microprocessor or central processing unit (CPU). In various implementations, the one or more processors may be dual-core processor(s), dual-core mobile processor(s), and so forth. [0108] Computer-related systems, computer systems, and systems, as used herein, include any combination of hardware and software. Examples of software may include software components, programs, applications, operating system software, middleware, firmware, software modules, routines, subroutines, functions, methods, procedures, software interfaces, application program interfaces (API), instruction sets, computer code, computer code segments, words, values, symbols, or any combination thereof. Determining whether an embodiment is implemented using hardware elements and/or software elements may vary in accordance with any number of factors, such as desired computational rate, power levels, heat tolerances, processing cycle budget, input data rates, output data rates, memory resources, data bus speeds and other design or performance constraints. [0109] One or more aspects of at least one embodiment may be implemented by representative instructions stored on a machine-readable medium which represents various logic within the processor, which when read by a machine causes the machine to fabricate logic to perform the techniques described herein. Such representations, known as “IP cores” may be stored on a tangible, machine readable medium and supplied to various customers or manufacturing facilities to load into the fabrication machines that make the logic or processor. Of note, various embodiments described herein may, of course, be implemented using any appropriate hardware and/or computing software languages (e.g., C++, Objective-C, Swift, Java, JavaScript, Python, Perl, QT, etc.). [0110] In some embodiments, one or more of illustrative computer-based systems or platforms of the present disclosure may include or be incorporated, partially or entirely into at least one personal computer (PC), laptop computer, ultra-laptop computer, tablet, touch pad, portable computer, handheld computer, palmtop computer, personal digital assistant (PDA), cellular telephone, combination cellular telephone/PDA, television, smart device (e.g., smart phone, smart tablet or smart television), mobile internet device (MID), messaging device, data communication device, and so forth. [0111] As used herein, term “server” should be understood to refer to a service point which provides processing, database, and communication facilities. By way of example, and not limitation, the term “server” can refer to a single, physical processor with associated communications and data storage and database facilities, or it can refer to a networked or clustered complex of processors and associated network and storage devices, as well as operating software and one or more database systems and application software that support the services provided by the server. Cloud servers are examples. [0112] In some embodiments, as detailed herein, one or more of the computer-based systems of the present disclosure may obtain, manipulate, transfer, store, transform, generate, and/or output any digital object and/or data unit (e.g., from inside and/or outside of a particular application) that can be in any suitable form such as, without limitation, a file, a contact, a task, an email, a message, a map, an entire application (e.g., a calculator), data points, and other suitable data. In some embodiments, as detailed herein, one or more of the computer-based systems of the present disclosure may be implemented across one or more of various computer platforms such as, but not limited to: (1) FreeBSD, NetBSD, OpenBSD; (2) Linux; (3) Microsoft Windows™; (4) OpenVMS™; (5) OS X (MacOS™); (6) UNIX™; (7) Android; (8) iOS™; (9) Embedded Linux; (10) Tizen™; (11) WebOS™; (12) Adobe AIR™; (13) Binary Runtime Environment for Wireless (BREW™); (14) Cocoa™ (API); (15) Cocoa™ Touch; (16) Java™ Platforms; (17) JavaFX™; (18) QNX™; (19) Mono; (20) Google Blink; (21) Apple WebKit; (22) Mozilla Gecko™; (23) Mozilla XUL; (24) .NET Framework; (25) Silverlight™; (26) Open Web Platform; (27) Oracle Database; (28) Qt™; (29) SAP NetWeaver™; (30) Smartface™; (31) Vexi™; (32) Kubernetes™ and (33) Windows Runtime (WinRT™) or other suitable computer platforms or any combination thereof. In some embodiments, illustrative computer-based systems or platforms of the present disclosure may be configured to utilize hardwired circuitry that may be used in place of or in combination with software instructions to implement features consistent with principles of the disclosure. Thus, implementations consistent with principles of the disclosure are not limited to any specific combination of hardware circuitry and software. For example, various embodiments may be embodied in many different ways as a software component such as, without limitation, a stand-alone software package, a combination of software packages, or it may be a software package incorporated as a “tool” in a larger software product. [0113] For example, exemplary software specifically programmed in accordance with one or more principles of the present disclosure may be downloadable from a network, for example, a website, as a stand-alone product or as an add-in package for installation in an existing software application. For example, exemplary software specifically programmed in accordance with one or more principles of the present disclosure may also be available as a client-server software application, or as a web-enabled software application. For example, exemplary software specifically programmed in accordance with one or more principles of the present disclosure may also be embodied as a software package installed on a hardware device. [0114] In some embodiments, illustrative computer-based systems or platforms of the present disclosure may be configured to handle numerous concurrent users that may be, but is not limited to, at least 100 (e.g., but not limited to, 100-999), at least 1,000 (e.g., but not limited to, 1,000- 9,999), at least 10,000 (e.g., but not limited to, 10,000-99,999), at least 100,000 (e.g., but not limited to, 100,000-999,999), at least 1,000,000 (e.g., but not limited to, 1,000,000-9,999,999), at least 10,000,000 (e.g., but not limited to, 10,000,000-99,999,999), at least 100,000,000 (e.g., but not limited to, 100,000,000-999,999,999), at least 1,000,000,000 (e.g., but not limited to, 1,000,000,000-999,999,999,999), and so on. [0115] In some embodiments, illustrative computer-based systems or platforms of the present disclosure may be configured to output to distinct, specifically programmed graphical user interface implementations of the present disclosure (e.g., a desktop, a web app., etc.). In various implementations of the present disclosure, a final output may be displayed on a displaying screen which may be, without limitation, a screen of a computer, a screen of a mobile device, or the like. In various implementations, the display may be a holographic display. In various implementations, the display may be a transparent surface that may receive a visual projection. Such projections may convey various forms of information, images, or objects. For example, such projections may be a visual overlay for a mobile augmented reality (MAR) application. [0116] In some embodiments, illustrative computer-based systems or platforms of the present disclosure may be configured to be utilized in various applications which may include, but are not limited to, gaming, mobile-device games, video chats, video conferences, live video streaming, video streaming and/or augmented reality applications, mobile-device messenger applications, and others similarly suitable computer-device applications. [0117] As used herein, the term “mobile electronic device,” or the like, may refer to any portable electronic device that may or may not be enabled with location tracking functionality (e.g., MAC address, Internet Protocol (IP) address, cryptographic identity, or the like). For example, a mobile electronic device can include, but is not limited to, a mobile phone, Personal Digital Assistant (PDA), Blackberry ™, Pager, Smartphone, or any other reasonable mobile electronic device. [0118] As used herein, terms “proximity detection,” “locating,” “location data,” “location information,” and “location tracking” refer to any form of location tracking technology or locating method that can be used to provide a location of, for example, a particular computing device, system or platform of the present disclosure and any associated computing devices, based at least in part on one or more of the following techniques and devices, without limitation: accelerometer(s), gyroscope(s), Global Positioning Systems (GPS); GPS accessed using Bluetooth™; GPS accessed using any reasonable form of wireless and non-wireless communication; WiFi™ server location data; Bluetooth ™ based location data; triangulation such as, but not limited to, network based triangulation, WiFi™ server information based triangulation, Bluetooth™ server information based triangulation; Cell Identification based triangulation, Enhanced Cell Identification based triangulation, Uplink-Time difference of arrival (U-TDOA) based triangulation, Time of arrival (TOA) based triangulation, Angle of arrival (AOA) based triangulation; techniques and systems using a geographic coordinate system such as, but not limited to, longitudinal and latitudinal based, geodesic height based, Cartesian coordinates based; Radio Frequency Identification such as, but not limited to, Long range RFID, Short range RFID; using any form of RFID tag such as, but not limited to active RFID tags, passive RFID tags, battery assisted passive RFID tags; or any other reasonable way to determine location. For ease, at times the above variations are not listed or are only partially listed; this is in no way meant to be a limitation. [0119] As used herein, terms “cloud,” “Internet cloud,” “cloud computing,” “cloud architecture,” and similar terms correspond to at least one of the following: (1) a large number of computers connected through a real-time communication network (e.g., Internet); (2) providing the ability to run a program or application on many connected computers (e.g., physical machines, virtual machines (VMs)) at the same time; (3) network-based services, which appear to be provided by real server hardware, and are in fact served up by virtual hardware (e.g., virtual servers), simulated by software running on one or more real machines (e.g., allowing to be moved around and scaled up (or down) on the fly without affecting the end user). [0120] In some embodiments, the illustrative computer-based systems or platforms of the present disclosure may be configured to securely store and/or transmit data by utilizing one or more of encryption techniques (e.g., private/public key pair, Triple Data Encryption Standard (3DES), block cipher algorithms (e.g., IDEA, RC2, RC5, CAST and Skipjack), cryptographic hash algorithms (e.g., MD5, RIPEMD-160, RTR0, SHA-1, SHA-2, Tiger (TTH),WHIRLPOOL, RNGs). [0121] As used herein, the term “user” shall have a meaning of at least one user. In some embodiments, the terms “user”, “subscriber”, “consumer”, or “customer” should be understood to refer to a user of an application or applications as described herein and/or a consumer of data supplied by a data provider. By way of example, and not limitation, the term “user” can refer to a person who receives data provided by the data or service provider over the Internet in a browser session, or can refer to an automated software application which receives the data and stores or processes the data. [0122] The aforementioned examples are, of course, illustrative and not restrictive. [0123] At least some aspects of the present disclosure will now be described with reference to the following numbered clauses. 1. A method comprising: receiving, by at least one processor, at least one event receiver request that requests at least one event between a first user on a computer platform and a second user on the computer platform, the at least one event comprising a transfer of data from the second user to the first user, and the at least one event receiver request comprising a first seed value generated by a first random number generator; receiving, by the at least one processor, at least one event provider request for providing the at least one event between the first user and the second user, the at least one event provider request comprising a second seed value generated by a second random number generator; instructing, by the at least one processor, at least one computing device associated with the second user to generate an event seed value based at least in part on a combination of the first seed value and the second seed value; instructing, by the at least one processor, at least one computing device associated with the second user to utilize a pseudorandom number generator (PRNG) to generate, based on an input of the event seed value, at least one output value defining at least one parameter of the at least one event; storing, by the at least one processor, an event entry in an event log, the event entry representing the at least one parameter of the at least one event based at least in part on the at least one output value; and executing, by the at least one processor, the transfer of data based at least in part on the event entry in the event log. 2. A system comprising: at least one data storage that stores an event log; at least one processor configured to execute instructions stored in a non-transitory computer readable medium, the instruction, when executed, cause the at least one processor to perform steps to: receive at least one event receiver request that requests at least one event between a first user profile of a first user on a computer platform and a second user profile of a second user on the computer platform, the at least one event comprising a transfer of data from the second user profile to the first user profile, and the at least one event receiver request comprising a first seed value generated by a first random number generator; receive at least one event provider request for providing the at least one event between the first user profile of the first user and the second user profile of the second user, the at least one event provider request comprising a second seed value generated by a second random number generator; instruct at least one computing device associated with the second user profile to generate an event seed value based at least in part on a combination of the first seed value and the second seed value; instruct at least one computing device associated with the second user profile to utilize a pseudorandom number generator (PRNG) to generate, based on an input of the event seed value, at least one output value defining at least one parameter of the at least one event; store an event entry in an event log, the event entry representing the at least one parameter of the at least one event based at least in part on the at least one output value; and executing the transfer of data based at least in part on the event entry in the event log. 3. The methods and/or systems as recited in any of clauses 1 and/or 2, further comprising: utilizing, by the at least one processor, a third random number generator to generate a third seed value for the at least one event; and instructing, by the at least one processor, at least one computing device associated with the second user profile to generate an event seed value based at least in part on a combination of the first seed value, the second seed value and the third seed value. 4. The methods and/or systems as recited in any of clauses 1 and/or 2, further comprising: receiving, by the at least one processor, the first seed value; receiving, by the at least one processor, the second seed value; generating, by the at least one processor, the event seed value based at least in part on a combination of the first seed value and the second seed value; utilizing, by the at least one processor, a PRNG to generate, based on the event seed value, the at least one additional output value associated with the at least one event; and validating, by the at least one processor, the event entry based at least in part on the at least one parameter of the at least one event and the at least one additional output value. 5. The methods and/or systems as recited in any of clauses 1 and/or 2 and/or 4, further comprising: receiving, by the at least one processor, the third seed value; and generating, by the at least one processor, the event seed value based at least in part on a combination of the first seed value, the second seed value and the third seed value. 6. The methods and/or systems as recited in any of clauses 1 and/or 2, wherein the at least one parameter comprises at least one of: ordering of the at least one event, size of the transfer, price of the transfer, placement time of the transfer, or duration of the at least one event. [0124] While one or more embodiments of the present disclosure have been described, it is understood that these embodiments are illustrative only, and not restrictive, and that many modifications may become apparent to those of ordinary skill in the art, including that various embodiments of the inventive methodologies, the illustrative systems and platforms, and the illustrative devices described herein can be utilized in any combination with each other. Further still, the various steps may be carried out in any desired order (and any desired steps may be added and/or any desired steps may be eliminated).