A blockchain payment channel is effected based on a series of spending transactions exchanged between parties, in which each transaction of the series of spending transactions has a future lock time, before which it cannot be committed to the blockchain, and comprises at least two spendable transaction outputs having respective digital asset values. At computer equipment of the party, a previous transaction of the series of spending transactions is received, and a function is applied to one or more function variables contained in the previous transaction to at least partially determine the current transaction. A portion of the current transaction is cryptographically signed, the signed portion comprising the at least two spendable transaction outputs, using a private key counterpart to the public key of the party, thereby computing a transaction signature for inclusion in the transaction input of the current transaction.

A system for “tagging” funds identified on a blockchain and associating a weight value therewith. The tagging profile is developed into a propagation profile wherein weight values are inherited from the tagging profile s. Propagation profile funds may be diluted by combining with non-tagged funds, similar to how ink dilutes through water. A spending history of funds of interest is developed based on replaying the funds of interest against the global transaction history of the blockchain. It is determined whether the spending history intersects with the propagation profile, thus determining how closely the two sources of funds are economically to one another. Intersection triggers actions including alert notifications or transfer of funds on the blockchain.

In one embodiment, a payment service system may receive a request to split a bill between two or more peer users. The request may include information identifying at least the two or more peer users and an amount of the bill to be split. The two or more peer users may be identified based on determining a presence of two or more mobile devices that are respectively associated with the two or more peer users. The payment service system may send a payment request to each mobile device associated with the two or more peer users. The payment service system may receive a response, which may indicate the respective user's approval of a specified amount for payment of a portion of the bill associated with the user. The payment service system may cause a funds transfer based on specified amounts approved by the two or more peer users.

Disclosed herein is digital object generator that builds unique digital objects based on the user specific input. The unique digital objects are part of a graphic presentation to users. The user specific input is positioned on pre-configured regions of a 3D object such as a polygon. Examples of the pre-configured regions include faces of the 3D object, orbits around the 3D object, or identifiable regions associated with the 3D object. The 3D object is rendered as a part of a social media page and enables social interactions between users. In the social media page, the 3D object rotates displaying regions/faces to page visitors. In some embodiments, the 3D object is implemented as a pet or companion of a user avatar in a virtual, augmented, or extended reality space.

A control method is executed by a first node holding a first distributed ledger in which a first blockchain is managed, and includes: obtaining, from a second node, a second blockchain managed by a second distributed ledger held by the second node, and comparing the second blockchain with the first blockchain; updating the first blockchain by adding the greater of at least one first different block contained in the first blockchain but not the second blockchain and at least one second different block contained in the second blockchain but not the first blockchain, after at least one common block, and adding at least one additional block containing at least one instance of transaction data contained in the lesser; and determining whether at least two instances of transaction data each containing at least two instances of contract information that conflict with each other are contained in the updated first blockchain.

Various embodiments are related to apparatuses and methods for enabling a sender to perform monetary transactions for a requestor. A sender can use, for example, a payment application associated with a payment processing system to perform a monetary transaction for a requestor. The payment processing system can send information related to the monetary transaction to, for example, a sender-requestor association component. When the monetary transaction is a deposit, the sender can receive funds for the deposit from the requestor. The platform can debit the requestor's financial account for the deposit amount and credit the sender's financial account with the debit account as a physical cash transaction occurs between the sender and the requestor.

A system and method for establishing a verified computing environment for executing data-driven contracts, comprising a cryptographic directed acyclic graph object model of a data-driven contract, wherein at least a subset of the objects in the MDAG correspond to clause state of at least one programmable clause of the data-driven contract; at a computing environment, administrating the data-driven contract in accordance with the MDAG which can include at least one execution instance comprised of: receiving a contract input to contract logic of the data-driven contract, processing the input according to the clause logic, in response to the contract input, generating at least one updated state object and generating at least one output object, and for each generated object, hash-linking the generated object to an object associated with the creation of the generated object.

A method includes acquiring, at a node server, blockchain data for a blockchain address on a blockchain network. The blockchain data includes a plurality of transactions for the blockchain address. The method includes generating a local node trust score for the blockchain address based on the blockchain data. The local node trust score indicates a likelihood that the blockchain address is involved in fraudulent activity. The method includes receiving, from a plurality of remote servers, a plurality of additional local trust scores for the blockchain address. The method includes determining a consensus trust score based on the local node trust score and the plurality of additional local trust scores. Additionally, the method includes receiving a trust request for the blockchain address from a requesting device and sending the consensus trust score for the specified blockchain address to the requesting device.

Systems and methods are described herein for facilitating access to a telecommunications network by a third-party device via one or more available subscriber devices. The network-based systems enable devices associated with subscribers of the telecommunications networks to establish connections with other mobile devices (e.g., third-party mobile devices of users that are not subscribers) over peer to peer (P2P) communication protocols. For example, a subscriber device can, over a P2P connection, act as a Hotspot, Wi-Fi tether, or bridge for a third-party or other device requesting access to the networks.

An example apparatus includes an account information circuit structured to interpret identifying information for a seller blockchain account and for each one of at least one buyer blockchain account, the identifying information for each one of the at least one buyer blockchain account including an attribute interest value. An apparatus further includes an asset attribute circuit structured to interpret an asset attribute value for an asset associated with the seller blockchain account. An apparatus further includes a buyer interest circuit structured to determine a buyer interest value for each one of the at least one buyer blockchain account in response to each corresponding attribute interest value and the asset attribute value. An apparatus includes a buyer identification execution circuit structured to perform a buyer identification operation in response to the buyer interest value.