PaperProof Protocol is a verifiable artifact publishing protocol built on Sui and Walrus. This slide deck introduces the core motivation, architecture, and product positioning of PaperProof. It explains how PaperProof models long-form digital artifacts such as preprints, technical reports, blog posts, datasets, software releases, and related discussion layers as protocol-native, versioned, and verifiable objects. The presentation also outlines PaperProof’s position in the Sui + Walrus stack, its relationship to SDKs and agent-facing skills, and its differences from traditional content platforms and web3 social protocols. The deck is intended for developers, researchers, ecosystem participants, investors, and infrastructure teams who want to understand why artifact versioning, content-addressed storage, and protocol-level verification matter for durable knowledge publishing. Official website: https://paperproof.site/ GitHub organization: https://github.com/PaperProofLabs
ADDENDUM v1.3: COMPREHENSIVE SYSTEM AUDIT EXECUTIVE SUMMARY This audit assesses the Summa Generativarum in its current state (v1.2.1, January 2026) following the major reconceptualization in v1.2 and the addition of Document 11 (Contributions inventory). The framework has matured from monolithic metaphysical system to stratified formal toolkit with bounded scope and honest limitation acknowledgment. Current Status: The corpus comprises 11 technical documents totaling approximately 950,000 words, implementing three independent formal systems (LPL, PCM, PGI), 79 stratified invariants (3 universal + 76 domain-specific), rigorous fixed-point proofs (~90/100 rigor assessment), computational specifications, theological applications, independent critical review, and comprehensive contributions catalogue. Key Finding: The v1.2 stratification successfully resolved the ten critical flaws identified in v1.1 by disaggregating conflated domains (formal logic, metaphysical ontology, phenomenological description). The system now operates as a philosophically ambitious yet mathematically honest research program rather than a self-grounding universal framework. Primary Recommendation: Focus development efforts on (1) completing Lean 4 mechanization of core proofs, (2) empirical validation of generativity indices, (3) operational definitions for applicability predicates, and (4) extending the presupposition lattice to include non-Western philosophical traditions. SECTION I: ARCHITECTURE OVERVIEW I.1 Document Structure Assessment Current Corpus (11 Documents): Additional Components: SGA (Super-Generative Automaton): ~35,000 words (prototype specification) PGI (Phenomenological Generativity Index): ~25,000 words (measurement framework) Cost Propagation Map: ~15,000 words (visualization protocols) Summa Encyclopedia: ~180,000 words (category-indexed invariant documentation) Research Documents: ~75,000 words (v2.1 Metaformalist topology, active development) Total System: ~1,225,000 words across 20+ documents I.2 Architectural Strengths ✓ Modularity: Each document can be evaluated independently; falsification localized ✓ Versioning: Git-based version control enables transparent evolution ✓ Cross-Referencing: Internal hyperlinks create navigable knowledge graph ✓ Progressive Disclosure: Multiple reading paths accommodate diverse audiences ✓ Built-In Critique: Documents 10-11 provide honest self-assessment and contributions inventory ✓ Computational Grounding: LPL, PCM, PGI specifications enable mechanization ✓ Citation Precision: APA/MLA/Chicago/BibTeX formats provided with DOI ✓ Layered Necessity: Three-tier stratification (Universal/Contextual/Performance) prevents inflation I.3 Architectural Gaps ⚠Redundancy: Significant overlap between Documents 5 (Invariants), Summa Encyclopedia categories, and individual category files ⚠Consistency Maintenance: 1.2M+ words across 20+ documents creates synchronization challenges ⚠Accessibility: Average reading path requires 55-75 hours; no executive summary document for non-specialists ⚠Empirical Validation: Generativity indices (OGI, XGI, SGI, PGI) proposed but not yet measured on real systems ⚠Cultural Scope: Framework primarily engages Western philosophy; minimal treatment of non-Western traditions ⚠Formalization Gap: Some proofs in Document 6 rely on informal topological reasoning pending mechanization SECTION II: PHILOSOPHICAL ASSESSMENT II.1 Core Thesis Evaluation The Generativity Claim: Systems produce new intelligible structure through metabolic coherence regulation; 79 invariants specify prerequisites for intelligibility across domains. Strengths: Novel Primitive: Generativity as metaphysical primitive distinct from substance/process/structure ontologies provides fresh explanatory framework Metabolic Coherence Innovation: Reframing PNC as boundary-regulating mechanism rather than absolute prohibition successfully integrates paraconsistent logic without contradiction Cross-Domain Unification: Single framework explains physical (phase transitions), biological (morphogenesis), cognitive (concept formation), and social (institutional evolution) phenomena Transcendental Methodology: Presuppositional analysis reveals conditions for possibility of intelligibility itself Cost-of-Denial Framework: Conservation-law approach to normativity makes denial costs measurable and structurally significant Weaknesses: Primitive Justification: Why prioritize generativity over alternatives (emergence, complexity, information)? Answer given but not universally compelling Formal-Ontological Gap: Mathematical decomposability requirements don't self-evidently map to metaphysical necessities Metabolic Mechanism: While intuitively powerful, the precise mechanism of "contradiction metabolism" requires clearer formalization (partially addressed in PCM) Universality Scope: Claims about "any intelligible system" difficult to falsify—what would count as counterexample? Transcendental Remainder: Leap from "naturalism cannot ground conditions" to "theism must ground conditions" requires more argumentation II.2 Theological Argument Evaluation The Five-Stage Cascade: Classical Theism → Personal Theism → Trinitarianism → Christianity → Catholicism Strengths: Systematic Structure: Cascading elimination shows internal logical connections between stages Cost-of-Denial Application: Demonstrates how denial at later stages undermines earlier commitments Novel Theodicy: Cost-of-denial provides alternative to traditional theodicy frameworks Coherence-Maximality Thesis: Formal audit of Catholic doctrine against 79 invariants is unprecedented Historical Integration: Combines transcendental philosophy with empirical historical claims (Resurrection) Weaknesses: Stage Transitions: Some transitions rely on controversial philosophical assumptions (e.g., divine simplicity requires Trinitarianism) Alternative Groundings: Other religious traditions (Judaism, Islam, Buddhism) not fully audited with same rigor Historical Claims: Presuppositional analysis doesn't independently establish historical facts (Resurrection, apostolic succession) Denominational Specificity: Move from Christianity to Catholicism specifically (vs. Orthodoxy, Protestantism) relies heavily on ecclesiological arguments that presuppose Roman Catholic premises Circularity Risk: Using CFPE framework (developed within Christian context) to validate Christianity raises potential circularity concerns II.3 Metaphysics of Cost Evaluation Conservation Theorems: Denial costs are redistributed/compounded, not eliminated Strengths: Measurable Framework: Provides quantitative approach to philosophical normativity Predictive Power: Successfully predicts ideological collapse patterns (Woke ideology case study) Institutional Applications: Explains organizational decay through entropy accumulation Non-Rhetorical: Formalizes costs as structural/mathematical rather than merely persuasive Integration with Fixed-Points: Connects cost propagation to substrate divergence proofs Weaknesses: Operationalization: While formulas provided, actual measurement requires operational definitions still in development Baseline Problem: What counts as "zero cost" state? Need reference point for cost calculation Cross-System Comparison: Comparing costs across radically different systems (e.g., classical logic vs. quantum mechanics) faces incommensurability challenges Temporal Dynamics: Cost accumulation rates not yet empirically validated Value-Loading: Framework assumes coherence/intelligibility are goods to be preserved—itself a normative commitment requiring justification SECTION III: MATHEMATICAL RIGOR ASSESSMENT III.1 Fixed-Point Proofs (Document 6) Current Rigor Score: 90/100 (up from 72/100 in v1.2.0) Achievements: ✓ Topological Foundations: Complete metric spaces properly defined with d-metric satisfying triangle inequality, non-negativity, symmetry ✓ Banach Fixed-Point Theorem: Correctly applied to substrate iteration $\mathcal{R}^n$ with contraction mapping $L < 1$ ✓ Presupposition Lattice: Proven to be DAG (directed acyclic graph) via acyclicity proof and condensation algorithm ✓ Categorical Formalization: Domain-indexed applicability formalized using category-theoretic functors ✓ Convergence Analysis: Substrate oscillation, divergence, and presupposition violation formally characterized ✓ Non-Triviality Proofs: Explicit demonstrations that $\neg C_i$ leads to measurable degradation Remaining Gaps: ⚠Applicability Predicates: $\phi_i(D) \in [0,1]$ functions lack operational definitions for most domains ⚠Metric Space Structure: State space $\mathcal{S}$ completeness assumed but not proven for all 76 contextual invariants ⚠Contraction Constant: Value of $L$ varies by domain but not empirically measured ⚠Computational Complexity: Fixed-point iteration convergence rates not analyzed ⚠Edge Cases: Some proofs (especially $C_{76}$-$C_{79}$ phenomenological invariants) rely more on philosophical intuition than mathematical derivation III.2 Presupposition Lattice (LPL System) Current Rigor Score: 85/100 Achievements: ✓ Graph-Theoretic Formalization: Dependency structure $C_i \preceq C_j$ properly defined as partial order ✓ DAG Verification: Acyclicity proven via topological sort algorithm ✓ Cascade Computation: Cost propagation along edges mechanically computable ✓ Transitive Closure: Indirect dependencies automatically derived ✓ Falsifiability: Dependency claims can be refuted by providing counterexamples Remaining Gaps: ⚠Completeness: Are all dependency edges identified? Methodology for discovering new edges not fully specified ⚠Edge Weights: Some dependency relations stronger than others; weighting scheme informal ⚠Dynamic Updates: When new invariants added or dependencies revised, lattice consistency checking not automated ⚠Cross-Tradition Validation: Dependency structure reflects Western philos
Pierpaolo Della Monica, Ivan Visconti, Andrea Vitaletti, Marco Zecchini
An essential requirement for the large-scale adoption of Web3 is enabling users to benefit from their data even within already deployed systems. This raises an important open question: how can existing, widely adopted software verify that a user has retrieved specific data from a TLS server? Impressive scientific results (e.g., DECO [CCS20] and the work of Xie et al. [USENIX24]) and industrial products (TLSNotary) have recently made progress in the above challenging direction. However, while they nicely leave TLS servers untouched, the retrieved data is then used in computations with verifiers that are required to run some advanced non-standardized cryptographic schemes (e.g., ZK-SNARKs), which clearly limits the large-scale adoption of the proposed technologies. In this paper, building on top of previous approaches and relying on the recent concept of Predicate Blind Signatures of Fuchsbauer and Wolf [Eurocrypt24], we bypass the limits of prior work by presenting ACTS a distributed architecture that, while still leaving TLS servers untouched, it allows a user to show possession of data retrieved from TLS servers simply requiring that the software of the verifier can check a standard signature. Our contributions include a round-optimal predicate blind signature protocol that produces standard RSA-PSS signatures. We show how this primitive can be integrated into the DECO architecture (and its successors) to certify data retrieved from TLS servers. Furthermore, we have optimized our construction to make it practical on commodity hardware for a large and significant class of policies implemented by the notary (i.e., the actor that is in charge of obliviously certifying TLS data, therefore preserving data confidentiality). We provide an experimental evaluation on the simple but powerful enough use case of a PDF document downloaded from a TLS server and encoded into an AES-GCM ciphertext. The user will then get a certified PDF through a standard PADES signature added obliviously to the PDF along with some metadata by a notary service. The resulting standard signed PDF document can be transparently verified using off-the-shelf PDF readers. Our experimental validation demonstrates that our architecture is suitable for real-world deployment in concrete scenarios.
Ben Biedermann, Matthew Scerri, Victoria Kozlova, Joshua Ellul
The terms self-sovereign identity (SSI) and decen-tralised identity are often used interchangeably, which results in increasing ambiguity when solutions are being investigated and compared. This article aims to provide a clear distinction between the two concepts in relation to the revised Regulation as Regards establishing the European Digital Identity Framework (eIDAS 2.0) by providing a systematisation of knowledge of technological developments that led up to implementation of eIDAS 2.0. Applying an inductive exploratory approach, relevant literature was selected iteratively in waves over a nine months time frame and covers literature between 2005 and 2024. The review found that the decentralised identity sector emerged adjacent to the OpenID Connect (OIDC) paradigm of Open Authentication, whereas SSI denotes the sector's shift towards blockchain-based solutions. In this study, it is shown that the interchangeable use of SSI and decentralised identity coincides with novel protocols over OIDC. While the first part of this paper distinguishes OIDC from decentralised identity, the second part addresses the incompatibility between OIDC under eIDAS 2.0 and Web3. The paper closes by suggesting further research for establishing a digital identity bridge for connecting applications on public-permissionless ledgers with data originating from eIDAS 2.0 and being presented using OIDC.
Non-fungible tokens (NFTs) have transformed digital ownership by using blockchain technology to authenticate unique digital assets, enabling artists to monetize directly. This paper introduces an automated method to create 1,000 NFTs using scalable vector graphics (SVG) and image generation techniques, significantly enhancing production efficiency and scalability. We illustrate this through a sumo-themed NFT collection, which is programmatically generated and converted to JPEG for broader platform compatibility. Hosted on the Polygon blockchain, known for its low transaction costs and high efficiency, this method proves ideal for expansive NFT projects and can be scaled up to meet increasing demand. This study offers insights into the scalability and technical execution of automated NFT creation, providing a valuable resource for artists and developers in the digital art sector.
This thesis questions the recurring absence of technological art collections that use the most diverse technologies in their production, in the historical scenario of contemporary society, from the perspective of memory institutions. It also provides evidence of the intrinsic characteristics of this type of collection, based on its information regime, production, and management model, which amplify a scenario of loss or constant modes of data, information, and knowledge transfer in the context of a post-digital society. A central actor paradigm is constructed. Various types of agents from one or more ecosystems centralize demands, and actions and place themselves in a precarious position in their public or private attributions, in the face of a complex scenario of material and immaterial production in an immanent digital culture and under an accelerationist digital economy and policy. The thesis is presented in a multidisciplinary way, given the context of related fields of knowledge, digital ontology, political economy of information, digital art and culture, digital humanities, economic accelerationist theory, as well as thematic subfields such as digitization, decentralization, blockchain, artificial intelligence, autonomous systems, peer-to-peer networks, among others. The research is exploratory and empirical observation, which applied the qualitative method, assigned in two main stages through the review of scientific literature, use of methods of content analysis of available databases, and discourse analysis through structured interviews with agents in different scenarios. Local knowledge (national scenario) that relates to the international context of some (theoretical-practical) examples, also justified by the absence or restriction of similar models for analysis in Brazil. The aim was to understand the ways, processes, regimes and uses of information in the implementation, organization and retrieval of art and digital heritage archives through autonomous agents, machine learning and the use of new technologies such as blockchain in decentralized networks (P2P) based on technical-theoretical, scientific and transdisciplinary models in the field of information science interfacing with the digital humanities. As a result, the thesis proposes the implementation of a decentralized theoretical-technical accelerationist model, made up of five stages of action and under guiding principles such as the digital information regime in the post-digital society, the use of new technologies and autonomous systems, the decentralization of collections, the constitution of a sharing economy in a P2P society model, and the introduction and incorporation into ongoing socio-technical accelerationist models, which allows the application of a physical, digital, semantic, pragmatic informational method.
This paper provides an update on the Canadian Humanities and Social Sciences (HSS) Commons, an in-development online hub for open social scholarship in Canada and beyond, and considers the next steps for the platform in an ever-evolving digital landscape. It outlines various recent outreach and engagement events intended to introduce the Canadian HSS Commons to the larger communities to which it belongs. Because the Canadian HSS Commons is committed to supporting the growth and evolving needs of these communities, this paper also considers how increasingly popular internet technologies such as Web3 and blockchain might play a part in the future of digital research infrastructure and the Canadian HSS Commons specifically. It concludes that while Web3 and blockchain currently raise important questions and concerns about governance, accountability, and commercialization, in the near future, these same technologies could also help engender new forms of functionality and participation on the Commons.