Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
  • H04L9/321—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving a third party or a trusted authority
  • H04L9/3213—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving a third party or a trusted authority using tickets or tokens, e.g. Kerberos
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
  • G06F21/60—Protecting data
  • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q20/00—Payment architectures, schemes or protocols
  • G06Q20/04—Payment circuits
  • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
  • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
  • G06Q20/0655—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash e-cash managed centrally
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q20/00—Payment architectures, schemes or protocols
  • G06Q20/08—Payment architectures
  • G06Q20/12—Payment architectures specially adapted for electronic shopping systems
  • G06Q20/123—Shopping for digital content
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q20/00—Payment architectures, schemes or protocols
  • G06Q20/38—Payment protocols; Details thereof
  • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
  • G06Q20/3821—Electronic credentials
  • G06Q20/38215—Use of certificates or encrypted proofs of transaction rights
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q20/00—Payment architectures, schemes or protocols
  • G06Q20/38—Payment protocols; Details thereof
  • G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
  • G06Q20/401—Transaction verification
  • G06Q20/4016—Transaction verification involving fraud or risk level assessment in transaction processing
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q30/00—Commerce
  • G06Q30/02—Marketing; Price estimation or determination; Fundraising
  • G06Q30/0241—Advertisements
  • G06Q30/0273—Determination of fees for advertising
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
  • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
  • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
  • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
  • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
  • H04N21/24—Monitoring of processes or resources, e.g. monitoring of server load, available bandwidth, upstream requests
  • H04N21/2407—Monitoring of transmitted content, e.g. distribution time, number of downloads
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
  • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
  • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
  • H04N21/442—Monitoring of processes or resources, e.g. detecting the failure of a recording device, monitoring the downstream bandwidth, the number of times a movie has been viewed, the storage space available from the internal hard disk
  • H04N21/44204—Monitoring of content usage, e.g. the number of times a movie has been viewed, copied or the amount which has been watched
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
  • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
  • H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
  • H04N21/83—Generation or processing of protective or descriptive data associated with content; Content structuring
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q2220/00—Business processing using cryptography
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L2463/00—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00
  • H04L2463/102—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00 applying security measure for e-commerce

Definitions

• the present disclosure is directed to an automated system and method for providing (e.g., ensuring) integrity of views of online content.
• Embodiments of the present invention generate and ensure proof of views (PoV) of content by leveraging blockchain to verify the veracity of content views.
• Generating proof of views of content may be utilized to determine the integrity of a content provider channel value, and thereby the integrity of a content market exchange, or channel stake marketplace (CSM).
• CSM channel stake marketplace
• NFTs non-fungible tokens
• problems exist in existing conventional systems regarding verifiability and clear attribution of authors rights for NFT content.
• fraud often results from an inability to verify authenticity of NFTs.
• conventional systems often fail to adequately prevent or protect, when appropriate, NFT content from being viewed and/or copied by any party except its owner.
• conventional systems typically fail to provide clear attribution for events, actions, and other non-material and/or non-digital subjects.
• conventional systems often fail to provide availability of actual content. For example, an image link contained in an NFT using conventional systems often becomes invalid over time.
• the exemplary disclosed system and method of the present disclosure is directed to overcoming one or more of the shortcomings set forth above and/or other deficiencies in existing technology.
• the present disclosure is directed to a Proof of View verification system.
• the Proof of View verification system includes a Non-Fungible Token smart contract module, comprising computer-executable code stored in non-volatile memory, a Proof of View smart contract module, comprising computer-executable code stored in non-volatile memory, a processor, and a verifier network.
• the Non-Fungible Token smart contract module, the Proof of View smart contract module, the processor, and the verifier network are configured to transfer a data of a non-fungible token to the Non-Fungible Token smart contract module and generate an event metadata based on the data of the non-fungible token, transfer the event metadata to the Proof of View smart contract module, and generate an event hash using the verifier network and transferring the event hash from the verifier network to the Proof of View smart contract module.
• Generating the event hash includes generating a hashed database chunk and appending the hashed database chunk to a block on a blockchain.
• the present disclosure is directed to a method.
• the method includes providing a Non-Fungible Token smart contract module, comprising computer- executable code stored in non-volatile memory, providing a Proof of View smart contract module, comprising computer-executable code stored in non-volatile memory, providing a verifier network, transferring a data of a non-fungible token to the Non-Fungible Token smart contract module and generating an event metadata based on the data of the non-fungible token, transferring the event metadata to the Proof of View smart contract module, and generating an event hash using the verifier network and transferring the event hash from the verifier network to the Proof of View smart contract module.
• Generating the event hash includes generating a hashed database chunk and appending the hashed database chunk to a block on a blockchain.
• the present disclosure is directed to a Proof of View verification system.
• the Proof of View verification system includes a Proof of View verification module, comprising computer-executable code stored in non-volatile memory, and a processor.
• the Proof of View verification module and the processor are configured to receive a request for a content view to view a piece of content, record a content view data in a database chunk, hash the database chunk into a hashed database chunk, append the hashed database chunk to a block on a blockchain of the Proof of View verification system, and compare the content view data with the block on the blockchain.
• the blockchain is publicly available.
• the present disclosure is directed to a method.
• the method includes receiving a request to sell a stake of a channel of the channel stake marketplace, determining a value of the channel, generating a stake offering based on the value of the channel, and updating the value of the channel.
• Determining the value of the channel includes determining the amount of verified content views of the channel.
• Determining the amount of verified content views of the channel includes recording a content view data in a database chunk, hashing the database chunk into a hashed database chunk, appending the hashed database chunk to a block on a blockchain, and comparing the content view data with the block on the blockchain.
• FIG. 1 is a schematic illustration of an exemplary computing device, in accordance with at least some exemplary embodiments of the present invention
• FIG. 2 is a schematic illustration of an exemplary network, in accordance with at least some exemplary embodiments of the present invention.
• FIG. 3 is an illustration of an exemplary hashing of a chunked database utilized in conjunction with the PoV blockchain, in accordance with an embodiment of the present invention;
• FIG.4 is an illustration of an exemplary method for providing proof of view via blockchain, in accordance with an embodiment of the present invention.
• FIG. 5 is an illustration of an exemplary method for providing a channel stake marketplace, leveraging proof of view via blockchain, in accordance with an embodiment of the present invention.
• FIG. 6 is a schematic illustration of an exemplary operation of at least some exemplary embodiments of the present invention.
• exemplary systems and methods described herein work to ensure the integrity and transparency of views of online content for the purpose of determining the value of a content provider’s channel.
• the Proof of View (PoV) methodology is used to provide a transparent system for determining the integrity of such views.
• Proof of View is utilized within the system to determine the integrity of a content provider channel value and therefore the integrity of an offered Content Market Exchange.
• the system implements publicly auditable logs. These logs may contain, for instance, data associated with views of the content, content recommendations, anonymized information on the user who viewed the content, other relevant data points, or any combination thereof.
• data points may contain, for instance, data associated with views of the content, content recommendations, anonymized information on the user who viewed the content, other relevant data points, or any combination thereof.
• a Merkle hash tree will be used to minimize the volume of data to be stored, while still maintaining a guarantee that the database has never been altered.
• each view is hashed before being combined with other hashes until a final top hash is reached.
• Each Top Hash may represent all of the data stored in the specific log of data.
• the system utilizes a database that is split into chunks.
• a new chunk may be created each time a new block is created in the PoV Blockchain.
• a top hash of a current chunk is added to each new block in the PoV Blockchain.
• An exemplary embodiment is illustrated for example in FIG. 3.
• the entire database may be a single file or the entire database may be stored in the blockchain.
• the database may be published to the PoV blockchain less often than each time a block is created.
• the entire database may be stored in the blockchain.
• Each view log entry may be stored as a separate transaction or data entry in the blockchain.
• the view log entry transaction may also serve as a view reward transfer transaction.
• the view log entry may be published to the blockchain by the viewer and/or by the system so that, for example, neither party can censor the log entry.
• the entire PoV chunk may be stored in the blockchain as a single transaction or data entry.
• the database may be published to the PoV blockchain less often than each time a block is created. Any suitable technique may be used to format and record the database on the blockchain.
• the exemplary embodiments disclosed herein may be used with any appropriate formats and/or recordation methods.
• the system may be configured to use advanced methods to ensure only views verified by the PoV methodology are counted.
• views that are considered to be verified will be added to a publicly accessible database containing anonymized data regarding the views.
• the system may be configured with open-source tools to ensure the transparency and accountability of the system. With these tools, users and third parties are able to review the data to ensure its accuracy and credibility.
• the view data may be anonymous, individual users can generate their own unique ID to verify that the views recorded for their ID are accurate and not manipulated.
• some or substantially all view data may be sent both to the verifying system as well as to the servers hosting the content. This allows the system to automatically check that the data on the servers’ view database is accurate and has not been altered.
• the system further comprises an application that automatically checks that the views on the blockchain are verified and matches the views on the public database. If there is any corruption or change to the data detected, an alert notice may be automatically provided by the system.
• the system prevents multiple methods that users may attempt to manipulate view counts and audience metrics such as: (i) automated repeated viewing of videos (looping views); (ii) attempting to load multiple videos in parallel; (iii) loading videos in hidden windows/tabs; and (iv) attempting to manipulate analytics without actually watching the videos.
• the exemplary disclosed PoV database may be stored using computing devices for example as described herein regarding Figs. 1 and 2.
• the computing devices as described herein regarding Figs. 1 and 2 may allow or block (e.g., not allow) free access to the exemplary disclosed PoV database and proof of view data.
• the system provides an internal market exchange for stakes in content channels.
• This system thereby enables content creators/publishers to finance additional growth and development of their content via offering stakes in their channels and future content offerings.
• creators/publishers can sell a part in their channel to stakeholders at a price set by Creators/publishers. The sale may be conducted in a cryptocurrency, fractional ownership offering, or other currency or similar offering.
• participation in the channel may provide the same % share of future earnings back to stakeholders in the channel based on their ownership in the channel.
• stakeholders in a channel can resell their stake through the Content Market Exchange based on the current market value of the stake.
• current market value of a stake in a channel is calculated by the system.
• the system calculates the value of a stake in the channel by taking into account one or more data points, selected from the group comprising, but not limited to, verified views (PoV) of the content, the revenue stream of the channel, the recommendation engine and other key parameters.
• PoV verified views
• One of ordinary skill in the art would understand that there are numerous key parameters and other data points that could be utilized in calculating the value of a stake in a channel, and the overall channel value, and embodiments of the present invention are contemplated for use with any such data points and key parameters.
• the exchange presented by the system will work much like online spot exchanges where buyers can bid/offer and set limits for purchasing or selling stakes that are available on the exchange index.
• the computing device 100 can generally be comprised of a Central Processing Unit (CPU, 101), optional further processing units including a graphics processing unit (GPU), a Random Access Memory (RAM, 102), a mother board 103, or alternatively/additionally a storage medium (e.g., hard disk drive, solid state drive, flash memory, cloud storage), an operating system (OS, 104), one or more application software 105, a display element (e.g., monitor, capacitive touchscreen) 106, and one or more input/output devices/means 107, including one or more communication interfaces (e.g., RS232, Ethernet, Wifi, Bluetooth, USB).
• CPU Central Processing Unit
• GPU graphics processing unit
• RAM Random Access Memory
• mother board 103 or alternatively/additionally a storage medium (e.g., hard disk drive, solid state drive, flash memory, cloud storage), an operating system (OS, 104), one or more application software 105, a display element (e.g., monitor, capacitive touchscreen)
• Useful examples include, but are not limited to, personal computers, servers, tablet PCs, smartphones, or other computing devices.
• multiple computing devices can be operably linked to form a computer network in a manner as to distribute and share one or more resources, such as clustered computing devices and server banks/farms.
• data may be transferred to the system, stored by the system and/or transferred by the system to users of the system across local area networks (LANs) or wide area networks (WANs).
• LANs local area networks
• WANs wide area networks
• the system may be comprised of numerous servers, mining hardware, computing devices, or any combination thereof, communicatively connected across one or more LANs and/or WANs.
• LANs local area networks
• WANs wide area networks
• FIG. 2 a schematic overview of a system in accordance with an embodiment of the present disclosure is shown.
• the system is comprised of one or more application servers 203 for electronically storing information used by the system.
• Applications in the server 203 may retrieve and manipulate information in storage devices and exchange information through a WAN 201 (e.g., the Internet).
• Applications in server 203 may also be used to manipulate information stored remotely and process and analyze data stored remotely across a WAN 201 (e.g., the Internet).
• exchange of information through the WAN 201 or other network may occur through one or more high speed connections.
• high speed connections may be over-the-air (OTA), passed through networked systems, directly connected to one or more WANs 201 or directed through one or more routers 202.
• Router(s) 202 are completely optional and other embodiments in accordance with the present disclosure may or may not utilize one or more routers 202.
• server 203 may connect to WAN 201 for the exchange of information, and embodiments of the present disclosure are contemplated for use with any method for connecting to networks for the purpose of exchanging information. Further, while this application refers to high speed connections, embodiments of the present disclosure may be utilized with connections of any speed.
• Components or modules of the system may connect to server 203 via WAN 201 or other network in numerous ways.
• a component or module may connect to the system i) through a computing device 212 directly connected to the WAN 201, ii) through a computing device 205, 206 connected to the WAN 201 through a routing device 204, or iii) through a computing device 208, 210 connected to a wireless access point 207.
• server 203 could be comprised of a personal computing device, such as a smartphone, acting as a host for other computing devices to connect to.
• the communications means of the system may be any circuitry or other means for communicating data over one or more networks or to one or more peripheral devices attached to the system, or to a system module or component.
• Appropriate communications means may include, but are not limited to, wireless connections, wired connections, cellular connections, data port connections, Bluetooth ® connections, near field communications (NFC) connections, or any combination thereof.
• NFC near field communications
• the exemplary disclosed system and method may be used in any suitable application for providing a Proof of View (PoV) of online content.
• PoV Proof of View
• the exemplary disclosed system and method may be used in any suitable application for ensuring that content such as internet content available on the internet has actually been viewed by a user such as a consumer.
• the exemplary disclosed system and method may for example be used in any application in which providing PoV (e.g., verifying that a user actually viewed content) affects a valuation or compensation (e.g., based on advertising revenue tied to a number of users viewing content) for a given website or platform.
• FIG. 4 an exemplary method for providing proof of view via blockchain, in accordance with an embodiment of the present invention, is shown.
• the process starts at 400 with the system being engaged to provide PoV for one or more pieces of online content.
• the system receives a content view event, generally via a user requesting to view a piece of content.
• Content may be any form of textual, graphical, multimedia, or other audio/visual or other digital or analog work.
• One of ordinary skill in the art would appreciate that there are numerous types of content that could be used with embodiments of the present invention, and embodiments of the present invention are contemplated for use with any appropriate type of content.
• the exemplary disclosed content view may include content viewed using any desired web browser (e.g., Google Chrome, Apple Safari, Microsoft Internet Explorer, Mozilla Firefox, Opera, or any other suitable web browser).
• the exemplary disclosed content view may also include content viewed using any suitable application programming interface (API) or app such as mobile device apps, web apps, hybrid apps, or any other suitable type of app.
• API application programming interface
• the exemplary disclosed content view may further include content viewed on any suitable device such as, for example, smart tv or any other suitable type of streaming device.
• the content view is recorded by the system and those associated with the system in that the system comprises those mining and recording transactions (e.g., views) on the system’s associated blockchain.
• the view record may be digitally signed by the viewer and/or by the system.
• chunks of a database in which the views may be recorded are then hashed (step 406).
• Any suitable digital signature scheme may be used with exemplary embodiments of the present invention, and exemplary embodiments of the present invention may be used with any appropriate type of digital signature.
• each of the hashed database chunks will be appended to a block on the blockchain ledger.
• each of the recorded views can be verified at any time as the PoV blockchain is available for review. Since the data is stored in a decentralized manner, any third party is able to prove that each top hash added to the PoV blockchain is accurate and unchanged. This allows any third party to verify that the logs added within each new block on the blockchain have not been tampered with, changed, branched or forked. At this point, the process terminates at step 410.
• FIG. 5 an illustration of an exemplary method for providing a channel stake marketplace, leveraging proof of view via blockchain in accordance with an embodiment of the present invention, is shown.
• the process starts at step 500 with a user implementing a request to sell stake in a channel.
• the system receives the request to sell a stake at step 502, and parses the information in the request for use in the generation of a stake offering.
• Information associated with the request may include, but is not limited to, size of the stake offered (e.g., total $ in currency, cryptocurrency, or other compensation desired from sale, or maximum % of channel to offer).
• the system generates a value of the channel involved in the stake offering.
• the value of the channel may be based on the number of verified content views retrieved from the PoV blockchain associated with the system or the channel.
• Other data points may also be used to generate this value, including, but not limited to, growth rate of a channel, number of subscribers to a channel, history of channel and stake offerings, or any combination thereof.
• the system generates the stake offering, based at least in part on the channel value and/or the information associated with the request. Once generated, the system offers the generated stake offering for sale to users (step 508). The stake offering may be purchased at step 510.
• the system may re-offer the stake for sale.
• the stake offering may be recalculated on one or more points, for instance, by recalculating a sale price of each share in the channel, or by re assessing the channel value.
• the system will issue the relevant stakes to those who invested or otherwise purchased a stake in the channel (step 512). Rights and revenues may then be conveyed to the purchasing users as provided for in the stake offering.
• the system continues to monitor and update the channel value. As long as permissible under the rules of the stake offering, the users that purchased into the stake may offer their portion of the stake for sale to others. Generally, this offering will be at the current value priced by the system. However, in other embodiments, the system may allow for more complex trading means (e.g., offers, options). At this point, the process terminates at step 516.
• complex trading means e.g., offers, options
• the exemplary Proof of View verification system may include a Proof of View verification module, comprising computer-executable code stored in non-volatile memory, and a processor.
• the Proof of View verification module and the processor may be configured to receive a request for a content view to view a piece of content, record a content view data in a database chunk, hash the database chunk into a hashed database chunk, append the hashed database chunk to a block on a blockchain of the Proof of View verification system, and compare the content view data with the block on the blockchain.
• the blockchain may be publicly available.
• the blockchain may be available for review by any third party.
• Each top hash added to the blockchain may be auditable by any third party.
• the piece of content may be textual data, graphical data, multimedia data, audio data, and/or visual data.
• the content view may be an internet webpage view.
• the Proof of View verification system may include a plurality of parties engaged in mining and recording transactions on the blockchain.
• the Proof of View verification module and the processor may be configured to provide a unique ID to a user, the unique ID being associated with data on the blockchain corresponding to that user’s content view data.
• the user may use the unique ID to ensure (e.g., compare_ that the data on the blockchain corresponding to that user’s content view data is accurate.
• the Proof of View verification system may automatically compare the content view data with the block on the blockchain.
• the Proof of View verification system may automatically provide an alert notice when the content view data does not match the block.
• the Proof of View verification system may be detached (e.g., substantially completely detached) from any entities or parties.
• the Proof of View verification system may be a decentralized finance system that may operate without central financial entities.
• the Proof of View verification system may utilize smart contracts on blockchain similarly to for example the exemplary disclosed blockchains described herein.
• the Proof of View verification system may utilize decentralized applications that use blockchain such as described herein to perform financial functions.
• the Proof of View verification system may utilize smart contracts on blockchains to capture, verify, and validate (e.g., and enforce) agreed-upon contractual terms between multiple parties.
• the Proof of View verification system may thereby provide agreements and transactions to be performed among entities (e.g., anonymous entities) without use of a central entity or external legal enforcement.
• the Proof of View verification system may allow for data of a smart contract to be encrypted and to exist on the blockchain (e.g., the data recorded in the blockchain may not be modified, lost, or deleted).
• the exemplary method may include receiving a request to sell a stake of a channel of the channel stake marketplace, determining a value of the channel, generating a stake offering based on the value of the channel, and updating the value of the channel. Determining the value of the channel may include determining the amount of verified content views of the channel.
• Determining the amount of verified content views of the channel may include recording a content view data in a database chunk, hashing the database chunk into a hashed database chunk, appending the hashed database chunk to a block on a blockchain, and comparing the content view data with the block on the blockchain.
• the value of the channel may be based on the number of verified content views retrieved from the blockchain.
• the exemplary method may also include issuing the stake of the channel to a user who purchased the stake of the channel based on the stake offering.
• the method may include receiving a request for a content view to view a piece of content, recording a content view data in a database chunk, hashing the database chunk into a hashed database chunk, appending the hashed database chunk to a block on a blockchain, and comparing the content view data with the block on the blockchain.
• Each new block added to the blockchain may be auditable by any third party.
• the content view may be an internet webpage view.
• the exemplary method may further include providing a unique ID to a user, the unique ID being associated with data on the blockchain corresponding to that user’s content view data. The user may use the unique ID to ensure (e.g., compare) that the data on the blockchain corresponding to that user’s content view data is accurate.
• the exemplary disclosed Proof of View verification system may include a Proof of View verification module, comprising computer- executable code stored in non-volatile memory, a processor, and a plurality of computing devices.
• the Proof of View verification module, the processor, and the plurality of computing devices may be configured to receive a request to sell a stake of a channel, determine a value of the channel, generate a stake offering based on the value of the channel, and update the value of the channel. Determining the value of the channel may include determining the amount of verified content views of the channel. Determining the amount of verified content views may include transferring data of a piece of content between the plurality of computing devices.
• Determining the amount of verified content views of the channel may include providing a unique ID data for a user, recording a content view data, which corresponds to the transferred data of the piece of content, in a database chunk, hashing the database chunk into a hashed database chunk, appending the hashed database chunk to a block on a blockchain, and comparing the content view data with the block on the blockchain by determining whether or not the unique ID data is included in both the content view data and the block.
• the blockchain may be publicly available and accessible via a third party computing device.
• the Proof of View verification module, the processor, and the plurality of computing devices may also be configured to issue the stake of the channel to a user who purchased the stake of the channel based on the stake offering, and utilize smart contracts on the blockchain.
• the blockchain may be available for review by any third party. Each top hash added to the blockchain may be auditable by any third party. Each new block added to the blockchain may be auditable by any third party.
• the data of the piece of content may be selected from the group consisting of textual data, graphical data, multimedia data, audio data, and visual data.
• the verified content views may be selected from the group of internet webpage views, app views, streaming device views including smart tv views, and combinations thereof. Transferring the data of the piece of content between the plurality of computing devices may include streaming video data between the plurality of computing devices via a local area network or a wide area network.
• the Proof of View verification system may include a plurality of parties engaged in mining and recording transactions on the blockchain.
• the Proof of View verification module, the processor, and the plurality of computing devices may be configured to compare the content view data with the unique ID data to ensure that the data on the blockchain corresponding to the user’s content view data is accurate.
• the Proof of View verification system may automatically compare the content view data with the block on the blockchain.
• the Proof of View verification system may provide an alert notice when the content view data does not include the unique ID data.
• Determining the amount of verified content views of the channel may include providing a unique ID data for a user, recording a content view data, which corresponds to the transferred data of the piece of content, in a database chunk, hashing the database chunk into a hashed database chunk, appending the hashed database chunk to a block on a blockchain, and comparing the content view data with the block on the blockchain by determining whether or not the unique ID data is included in both the content view data and the block.
• the blockchain may be publicly available and accessible via a third party computing device.
• the exemplary disclosed method may also include issuing the stake of the channel to a user who purchased the stake of the channel based on the stake offering, and utilizing smart contracts on the blockchain.
• the value of the channel may be based on the number of verified content views retrieved from the blockchain.
• the value of the channel may be based on data points selected from the group consisting of growth rate of the channel, number of subscribers to the channel, history of the channel, and history of stake offerings. Updating the value of the channel may include determining an updated amount of verified content views of the channel.
• Determining the amount of verified content views of the channel may include providing a unique ID data for a user, recording a content view data, which corresponds to the transferred data of the piece of content, in a database chunk, hashing the database chunk into a hashed database chunk, appending the hashed database chunk to a block on a blockchain, and comparing the content view data with the block on the blockchain by determining whether or not the unique ID data is included in both the content view data and the block.
• the exemplary disclosed method may also include issuing the stake of the channel to a user who purchased the stake of the channel based on the stake offering.
• the blockchain may be publicly available and accessible via a third party computing device.
• the content view data may be stored on a computing device that blocks public access to the content view data.
• the value of the channel may be based on the number of verified content views retrieved from the blockchain.
• the value of the channel may be based on data points selected from the group consisting of growth rate of the channel, number of subscribers to the channel, history of the channel, and history of stake offerings.
• FIG. 6 illustrates another exemplary embodiment of the exemplary disclosed system and method.
• FIG. 6 illustrates an exemplary process for providing PoV of non-fungible tokens (NFTs).
• NFT may be represented by a token, a record, and/or any other suitable type of blockchain item.
• An NFT may operate in conjunction with (e.g., be manipulated via) a smart contract executed in the blockchain using a smart contract module.
• the exemplary disclosed system and method may include an NFT smart contract module and a PoV smart contract module.
• An NFT may also be implemented via a blockchain network such as a proprietary blockchain network (e.g., the NFT may be an integral part of the blockchain network without involving a smart contract).
• an NFT may be used in conjunction with a non-blockchain use case such as a centralized storage.
• the centralized storage may be operated by a trusted organization or one or more entities (e.g., multiple parties) that may be responsible for integrity and accessibility of some or substantially all NFT content data (e.g., that may be stored in a CDN, database, file server, and/or any other suitable technique for storing data).
• the exemplary disclosed NFT may be a unique token that may be recorded in a blockchain and that may include metadata describing content, authorship, ownership, and/or any other suitable data or details of the NFT.
• NFTs may be included in (e.g., may exist in) a dedicated blockchain (e.g., serving a purpose related to PoV of NFT).
• NFTs may be included in (e.g., may exist in) in any suitable blockchain for supporting smart contracts (e.g., Ethereum) or any other suitable type of executable that may interact with the blockchain.
• an NFT proxy smart contract may be deployed to Ethereum blockchain.
• an NFT proxy smart contract may represent a core entry point for interacting with (e.g., dealing with) NFTs on a blockchain.
• An NFT proxy smart contract may pass any suitable function calls to its subordinary smart contracts (e.g., containing actual scripts for providing functionality). Having a proxy smart contract may allow efficient (e.g., easy) security and feature upgrades for NFTs (e.g., in the future) by maintaining or keeping the original smart contract address the same while changing underlying smart contracts representing NFT logic.
• DeFi NFTs may operate similarly to as described above for NFT proxy smart contracts, but may not include or involve a centralized smart contract managing the NFTs (e.g., some or all of the NFTs).
• decentralized short life cycle smart contracts may be used to manage NFT operation.
• an NFT may be included or exist outside of blockchain using strong cryptography that may protect contents of the NFT.
• the exemplary disclosed NFT may include any suitable metadata.
• the exemplary disclosed NFT may include metadata of a token type and/or a token version.
• the exemplary disclosed NFT may also include author metadata such as, for example, author name, author address, author contact information, and/or author signature.
• the exemplary disclosed NFT may include metadata including license information, current owner metadata, content hash metadata, and/or extensions metadata.
• the exemplary disclosed NFT may include any suitable type of NFT content.
• the exemplary disclosed NFT may include one or more data files including image data, audio recording data, video data, program source code, executable script, compiled program executable, digital item, data set, and/or any other suitable data files.
• the exemplary disclosed NFT content may include one or more events, a chain of events, an independent set of events, and/or any other suitable event.
• the exemplary disclosed NFT content may also include rank or title information, trophy information, achievement information, web page information, address or other identifier information, information associated with commercial secrets, information regarding know-how, invention or research information, industrial project information, research information, and/or information regarding a physical object.
• the exemplary disclosed NFT content may include information regarding technical drawings, charts, plans, processes, and/or methods.
• the exemplary disclosed NFT content may further include information regarding rights such as, for example, right of ownership, admittance permission, right of priority, author rights, and/or any other suitable rights.
• the exemplary disclosed NFT may include any suitable type of attribution.
• the NFT attribution may include an author and/or creator attribution such as digitally-signed, biometrically- signed, virtually-signed, unsigned, and/or any other suitable author and/or creator attribution type.
• the NFT attribution may include an owner attribution such as exclusive owner, fractional owner, renter, licensee, and/or any other suitable owner attribution type.
• the NFT attribution may also include a viewer or a user attribution type.
• the exemplary disclosed system and method may involve or include any suitable type of NFT action such as, for example, creating an NFT, transferring or selling (e.g., assigning) an NFT, editing or modifying an NFT, renting an NFT, leasing an NFT, viewing an NFT, revealing hidden NFT content, locking an NFT, and/or destroying or invalidating an NFT.
• any suitable type of NFT action such as, for example, creating an NFT, transferring or selling (e.g., assigning) an NFT, editing or modifying an NFT, renting an NFT, leasing an NFT, viewing an NFT, revealing hidden NFT content, locking an NFT, and/or destroying or invalidating an NFT.
• the exemplary disclosed system and method may include any suitable features, processes, and/or characteristics relating to NFT life cycle.
• the exemplary disclosed system and method may include any suitable features, processes, and/or characteristics relating to creating NFTs.
• An author or delegated creator may mint NFTs for desired content (e.g., particular content) by using any suitable technique.
• the exemplary disclosed system and method may use open source programs or applications (e.g., a minting app) or an online minting resource (e.g., minting website) that may be dedicated to the purpose of minting NFTs.
• an NFT may be minted based on direct interaction (e.g., a user directly interacting with) an NFT smart contract on a blockchain.
• minting may be provided (e.g., may be held) based on direct interaction with the blockchain (e.g., based on a user interacting with the blockchain directly) and/or via a minting program or application such as a minting app or a minting website.
• a creator of the NFT may provide metadata and/or content of an NFT.
• the NFT metadata and/or content may then be processed by any suitable technique such as a program or application (e.g., minting app), a minting website, a smart contract, and/or a blockchain.
• a new token may be recorded in a blockchain and stored under a desired (e.g., particular) blockchain address (e.g., wallet) having attached metadata including information provided during the creation process.
• the metadata may include a unique NFT content hash that may be used to identify the NFT content.
• NFT content may be transferred (e.g., data sent) to a data storage (e.g., secure data storage such as a secure vault) for example as illustrated in FIG. 6 (e.g., to confirm or ensure its existence according to terms of the secure vault).
• NFT creation (e.g., successful NFT creation) may be recorded to a PoV network (e.g., similar to the exemplary disclosed PoV system described herein, which may operate with the exemplary disclosed NFT system and method as a PoV of NFT system), and may be used for future reference and verification.
• a PoV network e.g., similar to the exemplary disclosed PoV system described herein, which may operate with the exemplary disclosed NFT system and method as a PoV of NFT system
• the exemplary disclosed NFTs may be immutable (e.g., immutable by design). For example, changes (e.g., any changes) made to the NFT’s metadata may trigger issuing the NFT’s copy with changed metadata and/or burning the original NFT. These changes may be recorded via PoV (e.g., similar to the exemplary disclosed PoV system described herein, which may operate with the exemplary disclosed NFT system and method as a PoV of NFT system) for future reference and verifiability.
• PoV e.g., similar to the exemplary disclosed PoV system described herein, which may operate with the exemplary disclosed NFT system and method as a PoV of NFT system
• the exemplary disclosed system and method may include any suitable features, processes, and/or characteristics related to selling NFTs.
• a sale e.g., NFT ownership sale
• Ownership of an NFT may also be sold, assigned, licensed, or otherwise transferred using third party entities or platforms such as auctions, escrow services, and/or any suitable marketplace.
• Current ownership of an NFT may be verified by checking one or more corresponding records in a PoV network (e.g., similar to the exemplary disclosed PoV system described herein, which may operate with the exemplary disclosed NFT system and method as a PoV of NFT system) by use of verification software, a verification website, and/or any other suitable technique.
• a PoV network e.g., similar to the exemplary disclosed PoV system described herein, which may operate with the exemplary disclosed NFT system and method as a PoV of NFT system
• a buyer may pay a price for the NFT and the seller may send an NFT token to the buyer's wallet or transfer payment via any other suitable technique.
• the new owner or a third party assisting in the sale may update the owner metadata of the NFT being exchanged via a selling API, via directly interacting with the NFT smart contract, and/or via any other suitable technique.
• a successful sale may be recorded via the PoV system (e.g., similar to the exemplary disclosed PoV system described herein, which may operate with the exemplary disclosed NFT system and method as a PoV of NFT system) for future reference and verifiability.
• the transfer may be an automatic sale via smart contract method, an automatic sale via a third party service, or a manual sale via smart contract methods.
• the exemplary disclosed system and method may include any suitable features, processes, and/or characteristics relating to editing metadata of an NFT.
• an author of the NFT content and/or the current owner of the NFT may update metadata of the NFT.
• An author may update authoring information using the author's signature used during NFT creation.
• an owner e.g., any owner
• a current owner or owners may update metadata regarding ownership of the NFT.
• a current owner or owners may update extended metadata of the NFT token.
• the exemplary disclosed system and method may include any suitable features, processes, and/or characteristics relating to viewing content of an NFT.
• NFT metadata may contain an http link and a hash of the content data. Any party or entity (e.g., anyone) may read the link and view and/or download the content. The content may for example be validated using a content hash record from the NFT metadata.
• the metadata of the NFT may contain both content hash and a secure vault link. Any party or entity (e.g., anyone) may read the link and view and/or download the content.
• the content may be validated using a content hash record from the NFT metadata. Availability of the content may be provided for (e.g., guaranteed) by one or more secure vaults.
• the metadata of the NFT may contain both content hash and a secure vault link.
• the owner of the NFT token e.g., and no other party or entity
• Decoded content may be validated using a content hash record from the NFT metadata.
• Availability of the content may be provided for (e.g., guaranteed) by one or more secure vaults.
• the exemplary disclosed system and method may utilize mixed content including both open and encrypted parts.
• the exemplary disclosed system and method may include any suitable features, processes, and/or characteristics relating to locking NFTs. Entities such as trusted authorities may lock or unlock NFTs (e.g., certain NFTs) during investigation if fraudulent activity is suspected. For example, an NFT may be locked if an author claims that his or her original work was copied and another NFT including the author’s work has been created. For example, the exemplary disclosed system and method may provide for review of related facts and PoV records so that the entity such as the trusted authority may identify the original NFT (e.g., for example based on the exemplary processes disclosed herein) and lock one or more fraudulent NFTs to prevent usage of the one or more fraudulent NFTs. The exemplary disclosed system and method may also provide an unlock functionality that may be utilized in cases or situations in which the NFT has been locked by mistake, investigation has shown or proven the suspect NFT is legal or legitimate, and/or any other suitable case or situation.
• NFTs e.g., certain NFTs
• an NFT may be locked if
• the exemplary disclosed system and method may include any suitable features, processes, and/or characteristics relating to destroying and/or invalidating NFTs.
• An owner of an NFT e.g., any exclusive owner of the NFT
• Destruction of the NFT may also be recorded via PoV (e.g., similar to the exemplary disclosed PoV system described herein, which may operate with the exemplary disclosed NFT system and method as a PoV of NFT system) to confirm or ensure that further copies (e.g., any possible further copies) of the NFT may be identified (e.g., easily identified) as fakes.
• PoV e.g., similar to the exemplary disclosed PoV system described herein, which may operate with the exemplary disclosed NFT system and method as a PoV of NFT system
• the exemplary disclosed system and method may include a secure vault.
• the exemplary disclosed PoV network may store and maintain (e.g., keep) records of hashed NFT content and NFT interactions using any suitable technique (e.g., in form of Merkle tree).
• the exemplary disclosed system and method may utilize (e.g., assign) secure vaults to store the actual content of the NFTs.
• One or more secure vaults may be assigned for each content hash record. Also for example, some content records may not have a secure vault assigned to them. Any desired number of secure vaults may be connected to the exemplary disclosed PoV network.
• Each secure vault may have its own storage terms.
• a secure vault may be (e.g., or may include) a blockchain that may be capable of storing data or may be or may include any suitable data storage such as file servers, databases, cloud storages, and/or any other suitable storage.
• Each secure vault may accept one or more types of NFT content.
• the secure vault may be accredited for NFT content storage.
• NFT content may or may not utilize encryption when stored.
• the secure vault may be associated with benefits from participating in NFT content storage for example by receiving rewards from stored NFT sales, charging a fee (e.g., one-time or recurring price or fee) for storage, charging an annual fee for storage, receiving storage for free, and/or any other suitable benefits.
• FIG. 6 illustrates an exemplary operation of the exemplary disclosed PoV of NFT system and method.
• the exemplary disclosed PoV system may provide PoV of NFT by operating with the exemplary disclosed NFT system.
• the exemplary disclosed system and method may provide for creating NFTs, recording an NFT event via PoV, providing an event hash, and assigning a secure vault to a secure vault.
• the exemplary disclosed system and method may verify an NFT event via PoV without a secure vault or with a secure vault.
• creating NFTs may include converting existing NFTs into PoV-enabled NFTs.
• the exemplary disclosed system and method may include any suitable software module for communicating with a desired blockchain network to access, send, and receive NFTs such as, for example, a wallet (e.g., a warp wallet).
• the exemplary disclosed warp wallet may be included in the exemplary disclosed Non-Fungible Token smart contract module, the exemplary disclosed Proof of View smart contract module, the exemplary disclosed verifier network, and/or a stand-alone wallet module of the exemplary disclosed system and method.
• any suitable blockchain (e.g., that operates with the exemplary disclosed system and method) operating NFTs of other (e.g., third party) standards and/or specifications may include software (e.g., wallets) that may be automated by NFT converter software and/or Warp Smart Contracts that operate individually and that may be monitored by NFT converter software of the exemplary disclosed system and method.
• the NFT converter software may be included in the exemplary disclosed warp wallet of the exemplary disclosed system and method.
• the exemplary disclosed NFT converter software may be part of the exemplary disclosed verifier network or may exist as a separate module (e.g., a stand-alone module or solution).
• An owner of an existing NFT may send the existing NFT to the exemplary disclosed Warp Wallet or Warp Smart Contract of the exemplary disclosed system and method, and may provide data of a valid receiving wallet address to the exemplary disclosed Warp Wallet or Warp Smart Contract of the exemplary disclosed system and method. In doing so, the owner of the existing NFT may convert the existing NFT to a Proof of View enabled NFT (POV-enabled NFT).
• an existing NFT e.g., an external or foreign NFT
• POV-enabled NFT e.g., a Proof of View enabled NFT
• the exemplary disclosed converter software may store some or substantially all of the data from the existing NFT (e.g., original foreign NFT), and may initiate creation of a copy of the new NFT (e.g., PoV-enabled NFT) in the Proof Of View enabled environment.
• the exemplary disclosed system and method may also burn, delete, or invalidate the existing NFT (e.g., the original NFT) to ensure that no duplicates of the NFT are made (e.g., no duplicates are possible).
• Data e.g., a record
• a verification hash may be recorded to the PoV by the exemplary disclosed system and method.
• the exemplary disclosed converter software may operate multiple wallets and smart contracts across a plurality of blockchains (e.g., different blockchains) simultaneously.
• the exemplary disclosed system and method may thereby provide NFT conversion to PoV-enabled NFTs and also transition of NFTs between blockchains or any other suitable NFT-enabled media.
• the exemplary disclosed Proof of View verification system may include a Non-Fungible Token smart contract module, comprising computer-executable code stored in non-volatile memory, a Proof of View smart contract module, comprising computer-executable code stored in non-volatile memory, a processor, and a verifier network.
• the Non-Fungible Token smart contract module, the Proof of View smart contract module, the processor, and the verifier network may be configured to transfer a data of a non-fungible token to the Non-Fungible Token smart contract module and generate an event metadata based on the data of the non-fungible token, transfer the event metadata to the Proof of View smart contract module, and generate an event hash using the verifier network and transferring the event hash from the verifier network to the Proof of View smart contract module.
• Generating the event hash may include generating a hashed database chunk and appending the hashed database chunk to a block on a blockchain.
• the exemplary disclosed system may also include a secure data storage.
• the Non-Fungible Token smart contract module, the Proof of View smart contract module, the processor, the verifier network, and the secure data storage may be configured to transfer the event metadata and the event hash to the secure data storage and store the event metadata and the event hash in the secure data storage.
• the Non- Fungible Token smart contract module, the Proof of View smart contract module, the processor, the verifier network, and the secure data storage may be configured to retrieve a metadata using the event hash stored in the secure data storage.
• the Non-Fungible Token smart contract module, the Proof of View smart contract module, the processor, the verifier network, and the secure data storage may be configured to assign a storage identification data to the event hash stored in the secure data storage.
• the Non-Fungible Token smart contract module, the Proof of View smart contract module, the processor, and the verifier network may be configured to verify a proposed event metadata by using the Proof of View smart contract module and the verifier network to compare the proposed event metadata to the event metadata.
• the Non-Fungible Token smart contract module, the Proof of View smart contract module, the processor, and the verifier network may be configured to transfer a verification result data to a user based on comparing the proposed event metadata to the event metadata.
• the proposed event metadata may be data of ownership of the non-fungible token.
• the data of the non-fungible token may be non-fungible token creation data that may be recorded to the Proof of View smart contract module as the event hash.
• the data of the non-fungible token may be data of changes to the metadata of the non-fungible token that may be recorded to the Proof of View smart contract module as the event hash.
• the data of the non-fungible token may be data of a sale or a destruction of the non-fungible token that is recorded to the Proof of View smart contract module as the event hash.
• the exemplary disclosed method may include providing a Non-Fungible Token smart contract module, comprising computer-executable code stored in non-volatile memory, providing a Proof of View smart contract module, comprising computer-executable code stored in non volatile memory, providing a verifier network, transferring a data of a non-fungible token to the Non-Fungible Token smart contract module and generating an event metadata based on the data of the non-fungible token, transferring the event metadata to the Proof of View smart contract module, and generating an event hash using the verifier network and transferring the event hash from the verifier network to the Proof of View smart contract module.
• Generating the event hash may include generating a hashed database chunk and appending the hashed database chunk to a block on a blockchain.
• the exemplary disclosed method may also include transferring the event metadata and the event hash to a secure data storage and storing the event metadata and the event hash in the secure data storage.
• the exemplary disclosed method may further include retrieving a metadata using the event hash stored in the secure data storage.
• the exemplary disclosed method may also include assigning a storage identification data to the event hash stored in the secure data storage.
• the exemplary disclosed method may further include verifying a proposed event metadata by using the Proof of View smart contract module and the verifier network to compare the proposed event metadata to the event metadata.
• the exemplary disclosed method may also include transferring a verification result data to a user based on comparing the proposed event metadata to the event metadata.
• the exemplary disclosed Proof of View verification system may include a Non-Fungible Token smart contract module, comprising computer-executable code stored in non-volatile memory, a Proof of View smart contract module, comprising computer-executable code stored in non-volatile memory, a processor, a verifier network, and a secure data storage.
• the Non-Fungible Token smart contract module, the Proof of View smart contract module, the processor, the verifier network, and the secure data storage may be configured to transfer a data of a non-fungible token to the Non-Fungible Token smart contract module and generate an event metadata based on the data of the non-fungible token, transfer the event metadata to the Proof of View smart contract module, generate an event hash using the verifier network and transfer the event hash from the verifier network to the Proof of View smart contract module, transfer the event metadata and the event hash to the secure data storage and store the event metadata and the event hash in the secure data storage, and assign a storage identification data to the event hash stored in the secure data storage.
• Generating the event hash may include generating a hashed database chunk and appending the hashed database chunk to a block on a blockchain.
• the Non-Fungible Token smart contract module, the Proof of View smart contract module, the processor, the verifier network, and the secure data storage may be configured to retrieve a metadata using the event hash stored in the secure data storage.
• the Non-Fungible Token smart contract module, the Proof of View smart contract module, the processor, the verifier network, and the secure data storage may be configured to verify a proposed event metadata by using the Proof of View smart contract module and the verifier network to compare the proposed event metadata to the event metadata.
• the exemplary disclosed system and method may provide an efficient technique for verifying views of content such as internet content that may be viewed by internet users.
• the exemplary disclosed system and method may provide a transparent technique for users to utilize a public ledger to verify that online content has actually been viewed.
• the exemplary disclosed system and method may thereby provide an effective technique for determining the value of a content provider’ s channel (e.g., for the purposes of compensation based on advertising or other criteria dependent on how much given content is viewed by users such as consumers).
• the exemplary disclosed system and method may verify whether an intended targeted audience has actually viewed content of a given provider (e.g., as well as advertisements that may be co-located with the content).
• the exemplary disclosed system and method may provide an efficient technique for providing attribution, content, and viewing of NFTs.
• a computer program includes a finite sequence of computational instructions or program instructions. It will be appreciated that a programmable apparatus or computing device can receive such a computer program and, by processing the computational instructions thereof, produce a technical effect.
• a programmable apparatus or computing device includes one or more microprocessors, microcontrollers, embedded microcontrollers, programmable digital signal processors, programmable devices, programmable gate arrays, programmable array logic, memory devices, application specific integrated circuits, or the like, which can be suitably employed or configured to process computer program instructions, execute computer logic, store computer data, and so on.
• a computing device can include a computer-readable storage medium and that this medium may be internal or external, removable and replaceable, or fixed.
• a computing device can include a Basic Input/Output System (BIOS), firmware, an operating system, a database, or the like that can include, interface with, or support the software and hardware described herein.
• BIOS Basic Input/Output System
• Embodiments of the system as described herein are not limited to applications involving conventional computer programs or programmable apparatuses that run them. It is contemplated, for example, that embodiments of the disclosure as claimed herein could include an optical computer, quantum computer, analog computer, or the like.
• a computer program can be loaded onto a computing device to produce a particular machine that can perform any and all of the depicted functions.
• This particular machine (or networked configuration thereof) provides a technique for carrying out any and all of the depicted functions.
• Any combination of one or more computer readable medium(s) may be utilized.
• the computer readable medium may be a computer readable signal medium or a computer readable storage medium.
• a computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing.
• Illustrative examples of the computer readable storage medium may include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
• a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
• a data store may be comprised of one or more of a database, file storage system, relational data storage system or any other data system or structure configured to store data.
• the data store may be a relational database, working in conjunction with a relational database management system (RDBMS) for receiving, processing and storing data.
• RDBMS relational database management system
• a data store may comprise one or more databases for storing information related to the processing of moving information and estimate information as well one or more databases configured for storage and retrieval of moving information and estimate information.
• Computer program instructions can be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner.
• the instructions stored in the computer-readable memory constitute an article of manufacture including computer-readable instructions for implementing any and all of the depicted functions.
• a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro magnetic, optical, or any suitable combination thereof.
• a computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
• Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
• computer program instructions may include computer executable code.
• languages for expressing computer program instructions are possible, including without limitation C, C++, Java, JavaScript, assembly language, Lisp, HTML, Perl, and so on. Such languages may include assembly languages, hardware description languages, database programming languages, functional programming languages, imperative programming languages, and so on.
• computer program instructions can be stored, compiled, or interpreted to run on a computing device, a programmable data processing apparatus, a heterogeneous combination of processors or processor architectures, and so on.
• embodiments of the system as described herein can take the form of web-based computer software, which includes client/server software, software-as-a-service, peer-to-peer software, or the like.
• a computing device enables execution of computer program instructions including multiple programs or threads.
• the multiple programs or threads may be processed more or less simultaneously to enhance utilization of the processor and to facilitate substantially simultaneous functions.
• any and all methods, program codes, program instructions, and the like described herein may be implemented in one or more thread.
• the thread can spawn other threads, which can themselves have assigned priorities associated with them.
• a computing device can process these threads based on priority or any other order based on instructions provided in the program code.
• process and “execute” are used interchangeably to indicate execute, process, interpret, compile, assemble, link, load, any and all combinations of the foregoing, or the like. Therefore, embodiments that process computer program instructions, computer-executable code, or the like can suitably act upon the instructions or code in any and all of the ways just described.
• block diagrams and flowchart illustrations depict methods, apparatuses (e.g., systems), and computer program products.
• Each element of the block diagrams and flowchart illustrations, as well as each respective combination of elements in the block diagrams and flowchart illustrations, illustrates a function of the methods, apparatuses, and computer program products.
• Any and all such functions (“depicted functions”) can be implemented by computer program instructions; by special-purpose, hardware -based computer systems; by combinations of special purpose hardware and computer instructions; by combinations of general purpose hardware and computer instructions; and so on - any and all of which may be generally referred to herein as a “component”, “module,” or “system.”
• each element in flowchart illustrations may depict a step, or group of steps, of a computer- implemented method. Further, each step may contain one or more sub-steps. For the purpose of illustration, these steps (as well as any and all other steps identified and described above) are presented in order. It will be understood that an embodiment can contain an alternate order of the steps adapted to a particular application of a technique disclosed herein. All such variations and modifications are intended to fall within the scope of this disclosure. The depiction and description of steps in any particular order is not intended to exclude embodiments having the steps in a different order, unless required by a particular application, explicitly stated, or otherwise clear from the context.

Landscapes

• Engineering & Computer Science (AREA)
• Business, Economics & Management (AREA)
• Computer Security & Cryptography (AREA)
• Accounting & Taxation (AREA)
• Signal Processing (AREA)
• Theoretical Computer Science (AREA)
• Physics & Mathematics (AREA)
• Finance (AREA)
• Strategic Management (AREA)
• General Physics & Mathematics (AREA)
• Computer Networks & Wireless Communication (AREA)
• General Business, Economics & Management (AREA)
• Multimedia (AREA)
• Databases & Information Systems (AREA)
• Development Economics (AREA)
• Computer Hardware Design (AREA)
• General Engineering & Computer Science (AREA)
• Software Systems (AREA)
• General Health & Medical Sciences (AREA)
• Bioethics (AREA)
• Health & Medical Sciences (AREA)
• Entrepreneurship & Innovation (AREA)
• Game Theory and Decision Science (AREA)
• Economics (AREA)
• Marketing (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
• Storage Device Security (AREA)
• Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Applications Claiming Priority (2)

Publications (1)

Family

ID=81877729

Family Applications (1)

Country Status (7)

Family Cites Families (3)

• 2022
  • 2022-05-13 CN CN202280050338.0A patent/CN117678189A/zh active Pending
  • 2022-05-13 WO PCT/IB2022/054503 patent/WO2022248965A1/en active Application Filing
  • 2022-05-13 CA CA3219456A patent/CA3219456A1/en active Pending
  • 2022-05-13 AU AU2022279661A patent/AU2022279661A1/en active Pending
  • 2022-05-13 EP EP22726526.1A patent/EP4348916A1/en active Pending
  • 2022-05-13 JP JP2023572174A patent/JP2024521134A/ja active Pending
  • 2022-05-13 KR KR1020237044218A patent/KR20240024108A/ko unknown

Also Published As

Similar Documents

Legal Events