# **[Proposal] Hyperfiles Funding Request (March 2024)** --- **Project Name:** Hyperfiles **Description:** a self-organizing on-chain knowledge graph leveraging the scientific method for sense-making through empirical hypothesis testing. **Scope:** build a toolkit & consumer-facing app to easily leverage Near data availability between any two sources, whether on or off-chain. **Strategy:** define a system of types and a conceptual framework to satisfy requirements for different object types in the Hyperfiles knowledge graph [Hyperfiles Documentation](https://www.notion.so/opencann/Hyperfiles-52cdfb892aff4d0ebe2178436c5edf6d) # Strategic Goals --> Expected Impact ## Problem Statement - Developing a universal reputation layer based on empirical hypothesis testing requires automated provenance and contribution tracking of objects at the atomic level during publication and subsequent modification (e.g. via reference, analysis, recombination, etc). - Creating liquidity for data requires enabling explicit composability between different types of objects via a coherent knowledge graph. ## Long Term Goals - Become the standard for data composability tooling on Near Protocol, the most robust and scalable multi-chain data availability layer. - Create an objective method for evaluating subjective truth and impact of scientific theories that more accurately represents the objectivity of evidence (individual facts) interpreted collectively and iteratively via the scientific method. - Observations (data, objects, events) - Statements (references/attestations) - Facts (statements supported by observations) - Hypothesis (testable and falsifiable proposed explanations of the world) - Theories (collections of facts that have gathered extensive evidence through hypothesis testing and whose predictions are logically consistent with observations of the natural world) ## Immediate Objectives - Create an app that serves as a general-purpose tool for publishing attestation objects verified by cryptographically secured private key signatures using the Near blockchain. - Deploy attestation schemas that can be used by donors, projects, and chefs (round managers) on Potlock during impact evaluation and funding allocation. - Create a unified type library that relates a wide variety of data types from independent sources - Index data that can be used for creating attestation schemas and references - Develop impact evaluation scoring systems for: - Social Graphs - Sources: Near Social, Farcaster, Lens Protocol, Web2 Social: Twitter, LinkedIn, Instagram, Web2 Chat: Telegram, Discord, Slack - Types: follow, like, repost, bookmark/star, comment - Decentralized Science - Research Hub - DeSci Labs - DeSci World & NerdBrain - LabDAO - OpenCann & Copyleft Cultivars - Claims, Facts and Statements (Attestations) - Trust - Identity - Opinion - Public Goods - Open Source - Fundraising - Grants - Donations - Equity & Venture Capital - Debt, Loans, Lines of Credit # Total USD ($) Amount Required Funding Request: $3,000 USD - A full estimate of project cost has not yet been calculated. The project has been developed to its current state on an ad-hoc basis. Elijah began contributing to the project full-time in January 2024 with the support of Build DAO, under the guidance of James Waugh and Elliot Braem. - Funding will be used to support developer hours for one (1) full-time contributor, Elijah, for March 2024. # Cost Breakdown and Timeline (Milestones) 1. Build a library of attestation schemas for: 1. Potlock (decentralized retroactive public goods funding platform), and, 2. OpenCann (tripartite DAO-governed data marketplace encompassing data, algorithm, and impact markets). 2. Build BOS frontend components to enable non-technical users to interact with the Hyperfiles knowledge graph 1. Create: publish a Hyperfile (dataset, algorithm, or impact certificate) 2. Explore/Query: sort/filter and text search to find data, algorithms, and impact certificates (three separate marketplaces on the frontend but the graphs are linked via references specified during object creation/update) 3. Run: run a job, use an algorithm to transform existing data into new object(s), output can be fed to the create component after job is completed to create new objects ### Success Criteria - Total data publish and consume volume (MB) - Number of fileformats/schemas created - Number of objects created - “Data”: events, transactions, strings, integers, CSV/TSV, etc. - Algorithms: instructions and parameters to execute containerized apps - Attestations (explicit): objects following the Hyperfiles attestation schema ### Monitoring and Evaluation - Monthly evaluation and reporting of success criteria # Team Experience / Organization Details I’m a molecular biologist and entrepreneur who taught myself Python and R in 2012 to pursue research that leveraged advanced multivariate statistics and complex network analysis of genetic interactions. I’ve published peer-reviewed research articles in organic chemistry and molecular evolution of tissue regeneration in animals. I also started a commercial biotech lab out of my garage while in grad school, then went on to grow that as a successful business for nearly 6 years. I became interested in web3 to apply learnings about cryptography, digital identity, data sovereignty, and decentralized governance in my research and entrepreneurship. I like to consider myself a highly specialized generalist when it comes to working in DAOs and startups. My formal training as a life scientist informs the majority of my interests and perspectives. My insatiable curiosity has helped me learn the ins and outs of every part of an organization. ## Recent Progress ### **Potlock** Over a dozen unique fields have been mapped to custom types that can be used in creating attestation schemas for events on Potlock. Eight additional schemas have been developed that can be used to reference objects and events during the donation process. We have also begun creating a scoring system to integrate relevant attestations into a trust or impact evaluation algorithm for both individual contributors and projects registered on Potlock. - [Profile Editor Widget for Nada.bot](https://near.social/flowscience.near/widget/ProfileEditor.Validate) - Type Definitions: [Potlock Attestation Schemas & Fields](https://www.notion.so/Potlock-Attestation-Framework-032a653b329c43a6ac04aa74e39c968d?pvs=21) - Scoping Doc: [Potlock Impact Evaluation Flow](https://www.notion.so/Potlock-Impact-Evaluation-Flow-2706782ffc3d4283b70de42251c56ecf?pvs=21) - Scoping Doc: [Potlock Impact Scoring System](https://www.notion.so/Potlock-Impact-Scoring-System-efce7048bc374299bbb51e9555fe2a21?pvs=21) - Forum Post: [Potlock Attestation Framework For Impact Evaluation](https://gov.near.org/t/potlock-attestation-framework-for-impact-evaluation/37753) ### **Schema Registry** Attestation schemas are currently being deployed to attestations.near instead of potlock.hyperfiles.near. In the future, schemas may be registered to a fork of socialDB with custom permissions (e.g. to enable optional non-revocability). - Scoping Doc: [Hyperfiles Registry Contract](https://www.notion.so/Hyperfiles-Registry-Contract-d910a0dd0e114acdab7aebec6c016f80?pvs=21) ### **Near Attestation Service** Tremendous progress has been made toward completing [Near Attestation Service (NAS)](https://near.social/flowscience.near/widget/NAS). This will enable anyone to easily create new schemas and publish attestations with a UX similar to Ethereum Attestation Service. Hyperfiles is exploring implementations of the attestation primitive that leverage the unique benefits of the Near account model and open social graph. These include collaborative type definition, categorization, and use of types in standardizing references (attestations). Implementing conditional logic on top of attestation schemas traditionally requires independently deployed [resolver contracts](https://www.notion.so/Resolver-Contracts-0f0d5001e75f4afc9ad2a2c483caf73b?pvs=21) to validate the content of an attestation before granting a user permission to publish a related object using the schema in question. This makes it hard to deploy schemas with conditional logic and creates a large amount of redundant effort by schema deployers whose needs could be addressed by a basic resolver toolkit to choose from. We’ve identified two options to develop reusable and composable attestation “schema resolvers”: 1. Resolver factory contracts: e.g. allow users to deploy custom “attester resolvers” where users specify an allowlist of accounts that can use a schema they deployed 2. BOS feed components that render “attestations” meeting specific conditions (e.g. Near social posts mentioning @Potlock using the hashtag #isMilestone or #isProgress). Implementing conditional logic based on input data in frontend components compared to smart contracts can be achieved on BOS because the code itself is still publicly auditable and verifiable on-chain. To that end, we’re developing a suite of reusable and composable resolver components instead of single-use resolver contracts. The goal is to pre-populate NAS with optional “resolver components” that users can select from and input relevant parameters (e.g. allowlist, deposit required, etc) directly while creating schemas. **NAS components** 1. https://near.social/flowscience.near/widget/NAS (UI wrapper) 2. https://near.social/flowscience.near/widget/attest (takes selectedSchema and schemaSrc down from NAS as props, handles attestation input data & saving the final composed data) 3. https://near.social/flowscience.near/widget/SchemaSelector (handles selectedSchema + schemaSrc state, then passes them up to NAS before being passed back down to attest) 4. https://near.social/flowscience.near/widget/schema.editor (still lots of work to be done dis/re-integrating schemas w/ types, and aligning props w other NAS components) 5. https://near.social/flowscience.near/widget/generateUID (used in creating schemas & attestations - but might not be needed because of existing namespace on socialDB) ### **On-chain updates** [1-19-24](https://near.social/mob.near/widget/MainPage.N.Post.Page?accountId=flowscience.near&blockHeight=110822377) [1-26-24](https://near.social/mob.near/widget/MainPage.N.Post.Page?accountId=flowscience.near&blockHeight=111391760) [2-4-24](https://near.social/mob.near/widget/MainPage.N.Post.Page?accountId=flowscience.near&blockHeight=112135899) ## Conclusion Hyperfiles is a self-organizing on-chain knowledge graph leveraging the scientific method for sense-making through empirical hypothesis testing. Developing a universal reputation layer based on empirical hypothesis testing requires automated provenance and contribution tracking of objects at the atomic level during publication and subsequent modification (e.g. via reference, analysis, recombination, etc). Data is potentially the most valuable real-world asset that can easily be represented on-chain due to being digital. Creating liquidity for data requires enabling explicit composability between different types of objects via a coherent knowledge graph. Hyperfiles aims to become the standard for data composability tooling on Near Protocol, the most well-positioned multi-chain data availability layer. We’re building an objective method for evaluating subjective truth and the impact of scientific theories that more accurately represents the objectivity of evidence (individual facts) interpreted collectively and iteratively via the scientific method. The Hyperfiles knowledge graph can be universally generalized and is meant to be a proof of concept system for decentralized data governance. Decentralized coordination requires reputation layers to automate value creation & attribution in the pending world of ubiquitous and powerful AIs.