Recallspection is a neuro-symbolic architecture that decouples semantic representation from factual retrieval, achieving Exact Memory Recall (EMR = 1.0000) and bounded drift (ÎČ < 1e-11) across 51+ dependent reasoning steps. Key Innovation: Replaces approximate nearest-neighbor search with O(1) deterministic hash routing and k-quorum verification, eliminating the catastrophic coherence degradation that plagues Large Language Models in multi-hop reasoning tasks. Proof Included: Reproducible test demonstrating 51/51 hop completion with zero algorithmic drift (measured drift: 1.27e-12, attributable solely to IEEE 754 float64 precision limits). Core Mechanisms: - Semantic Geometry: Entities as normalized vectors in â^d, relationships as displacement vectors- O(1) Deterministic Routing: SHA3-256 hashed overlapping slots with ephemeral salt rotation- Quorum Verification: k-slot majority voting (default k=4, quorum=3)- Self-Healing Audit: Cryptographic logging with automatic corruption detection and repair License: GNU AGPLv3 (ensures network-level copyleft and prevents proprietary enclosure) Repository: https://github.com/gnowingtheafterthought-crypto/recallspection Live Demo: https://recallspection.onrender.com
Background. California mandates organic waste diversion, but participation depends on infrastructure and instruction that may be unevenly distributed. Whether socioeconomic disparities in adolescent zero waste engagement reflect unequal access, unequal knowledge, or unequal conviction has not been established.Methods. A cross-sectional survey of 218 middle and high school students across 15 San Francisco Bay Area schools (MarchâMay 2026) measured zero waste knowledge, home and school access to sorting infrastructure, sustainability beliefs, self-reported behaviors, and perceived barriers. Residential ZIP codes were linked to median ZIP-code income (n = 207 matched). Analyses comprised MannâWhitney comparisons and Spearman correlations with BenjaminiâHochberg correction and bootstrap confidence intervals, intraclass correlations by school, hierarchical regression, a mixed-effects model, and an exploratory mediation. Results. Median area income was positively associated with familiarity with the term "zero waste" (Ï = .26, 95% CI [.12, .38], pâadjâ = .002), waste-reduction habits (Ï = .19, pâadjâ = .031), composting frequency (Ï = .18, pâadjâ = .031), and home compost access (Ï = .17, pâadjâ = .042), but not with practical composting knowledge (Ï = .11, pâadjâ = .257), sorting confidence (Ï = .03), or either belief item (Ï = â.06 and â.08, both n.s.). Income added a small unique increment to composting frequency over demographic covariates (ÎRÂČ = .025, p = .020) but none to knowledge (ÎRÂČ
Time blindness is a common symptom ascribed to individuals experiencing ADHD or the spectrum of ADHD symptoms. However, it is most often characterized as a deficit to functioning properly, whether this is in the workplace, schools, or relationships. Like much of the information surrounding neurodiversity, âtime blindnessâ is a gross oversimplification of people with ADHDâs felt experience of time. For individuals with ADHD, measuring changes in attention and shifts in chronoception (the perception of time) can be achieved through an analysis of art practice. This paper looks critically at the role that time plays in the lives of neurodiverse and neurotypical people alike.
Active asset managers increasingly include cryptocurrencies in their alternative asset allocations, highlighting their speculative and volatile nature. The aim of this research is to examine trends in the returns and volatility of cryptocurrencies, whilst accounting for the depegging of stablecoins, driven by speculative trading during macroeconomic shocks and technological shifts. We build a sample of market capitalisation, using data from the daily closing prices of Bitcoin (BTC), Ethereum (ETH), Binance (BNB), and Ripple (XRP), two fiat-backed stablecoins (USDT and USDC), and a cryptocurrency-collateralised stablecoin (DAI). As a first step, a Granger-causality framework is applied to examine the influence of stablecoin depegging events on crypto returns during financial market stress. The results are strongly asymmetric: there is little evidence that depegs predict returns; whereas cryptocurrency returns robustly Granger-cause USDC depegging events, an effect that intensifies during periods of market stress. Stablecoin depegs appear to be a downstream symptom of cryptocurrency stress rather than a leading indicator of it. The analysis was extended by modelling volatility, using an EGARCH-X model to study whether depegs also affect crypto during periods of market stress and if larger deviations from the dollar peg are associated with higher cryptocurrency volatility, concentrated in the most liquid stablecoins (USDT and USDC), while the evidence for any change in this association during stress is limited. The findings carry implications for risk monitoring in digital-asset markets, where stablecoin behaviour reflects, rather than anticipates, cryptocurrency market conditions.
Since 2008, when the cryptocurrency was first introduced under the name Satoshi Nakamoto, more and more people are interested in the «new money» â Bitcoin. Bitcoin is the first cryptocurrency and although many other cryptocurrencies were created and will be created in the future, Bitcoin remains the most popular cryptocurrency to this day. Naturally, along with the rapid growth of information technologies and their applications, many new «computerized» currencies will emerge. Because anyone can buy and sell cryptocurrency (e.g. bitcoin) and, thus, cryptocurrency is a subject of trade, hence cryptocurrency and in particular bitcoin is a product. Naturally, questions arise about the determinants of cryptocurrency price changes. In particular: Are the changes in the prices of cryptocurrency (and in particular Bitcoin) related to the development trends of the global economy? Are changes in the prices of cryptocurrency (and in particular Bitcoin) related to indicators of the state of the global economy, such as the well-known indices DJII, Nasdaq, S&P 500 and others. Thus it is interesting to see whether it is possible to predict changes in the prices of cryptocurrencies (and in particular Bitcoin) using different methods of time series.
Digital technologies are transforming supply chain management by enabling greater connectivity, transparency, and coordination among supply chain partners. In forestry supply chains, characterized by dispersed resources, multiple stakeholders, and complex operational processes, collaborative governance has become increasingly important for improving coordination and sustainable resource management. However, existing studies mainly focus on operational optimization and digital applications, while the governance implications of digital technologies remain insufficiently explored. This conceptual article explores how digital technologies may enable collaborative governance capability in forestry supply chains through four governance mechanisms: information sharing, resource integration, collaborative decision-making, and adaptive governance. Based on collaborative governance and digital transformation literature, a conceptual framework is proposed to illustrate how digital technologies may support governance processes through the Internet of Things, big data analytics, cloud computing, blockchain, and artificial intelligence. The article provides theoretical insights into digital-enabled collaborative governance and practical implications for sustainable forestry supply chains.
We study auctions where two positions are sold to unit-demand bidders with private heterogeneous order preferences: some are specialists who value only the first position, while others are generalists who are indifferent between the two. First, we consider a standard first-price rule which allocates the first and second items to the highest and second-highest bidders, respectively. We show that no strategy profile ex-post implements the efficient allocation at every type profile, irrespective of payments, and provide a distribution-free equilibrium welfare guarantee of $\frac{1}{2}$. To augment this result, we prove that for deterministic one-round auctions and discrete bids, the efficient allocation requires each bidder to communicate at least one bit more than its bid's binary representation. We next ask what the same bit accomplishes in winner-pays-bid formats where bidders can also specify specific item preferences. In particular, we show that this strengthens our distribution-free equilibrium welfare guarantee to $1-\frac{1}{e}$. Finally, we discuss our results' applicability to priority service auctions and blockchain transaction sequencing.
CyberProtocol AI Trust Standard, Version 1.0 Artificial intelligence now writes, decides, and transacts at global scale, yet the world has no shared way to answer four simple questions about any AI output: who made it, where it came from, whether it is safe, and whether it obeys the law. CyberProtocol is built to answer all four. CyberProtocol is a neutral, open, cryptographic framework for verifying AI Identity, Provenance, Safety, and Compliance across all jurisdictions. It is published as a global public good, aligned with United Nations principles, and is controlled by no nation, corporation, or bloc. The timing is decisive. Three converging mandates now demand verifiable AI: EU AI Act enforcement, the founding of WAICO, and the Rome Declaration by Nobel Laureates. Each requires proof of origin, safety, and compliance, yet no harmonized, cross-border verification standard exists today. CyberProtocol is designed to fill exactly that gap, and to do so immediately, because the building blocks already exist. The Standard defines four verifiable layers that work as one system: AI and Human Identity, using Decentralized Identifiers for AI agents and W3C Verifiable Credentials for people. Provenance and Output Certification, an immutable cryptographic seal on every output, with an optional zero-knowledge mode that proves origin without exposing trade secrets. Safety and Risk Compliance, with metadata mapped to the EU AI Act, NIST AI RMF, and ISO/IEC 42001. Cross-Border Verification, a neutral seal format anyone can validate, tied to no national scheme. CyberProtocol invents no new cryptography. It unifies proven, mature standards into one coherent, interoperable framework, which is why it can be adopted now rather than years from now. The Standard is published and stewarded by One Planet One Earth Foundation Inc., a non-profit holding United Nations ECOSOC Special Consultative Status since 2025 (esango.un.org, profile 695078), (UNDESA Civil Society Database; SEC Registration CN202004649; DSWD-FO III-L-00002-2023). This accreditation gives CyberProtocol a neutral, internationally recognized home, positioned to engage UN member states, regulators, and the Global South on equal terms. As a public good, the Standard is free to all in perpetuity. Advancing it to a working reference implementation, pilot integrations with AI laboratories, and multi-stakeholder governance requires support. The Foundation invites funders, philanthropies, standards bodies, and industry partners to help make verifiable AI a global default. Together we can ensure the AI era is built on trust that anyone, in any country, can verify. Version 1.0, Initial Proposal. Specification under Creative Commons Attribution 4.0 International (CC BY 4.0); reference code under Apache License 2.0. Official reference: https://cyberprotocol.io. Repository: https://github.com/ryanpaulpillas/cyberprotocol-ai-trust-standard. Steward: One Planet One Earth Foundation Inc., holder of UN ECOSOC Consultative Status since 2025.
Solidity has undergone 116 version iterations between August 2015 and February 2026, during which compiler updates have introduced behavioral changes, including issues later fixed in subsequent releases. Contracts compiled under specific versions may exhibit version-dependent execution behaviors, particularly in low-level code. These differences are often difficult for developers and users to recognize, creating opportunities for adversaries to exploit legacy compiler behaviors and deploy contracts with potentially deceptive outcomes. We define this issue as the Compiler Version Discrepancy (CVD) risk , where attackers leverage compiler-version-dependent behaviors to produce misleading or unfair outcomes while contracts appear functionally benign. We summarize five representative CVD risk patterns from real compiler inconsistencies. To mitigate this risk, we develop the CompileGuard detection tool. It combines Abstract Syntax Tree (AST) analysis, taint analysis, and symbolic execution with Control Flow Graph (CFG) analysis to identify version-sensitive code patterns. Evaluation on 227 smart contracts shows CompileGuard achieves an overall F1 score of 95.22%. A user study with 21 blockchain practitioners shows contracts exploiting CVD risks can mislead users, while detection reports enable all participants to correctly identify risk-inducing behaviors. These results highlight the practical exploitability of CVD risks and the effectiveness of automated detection in preventing such deception.
An increasing number of special Internet of Things (IoT) applications are being deployed within federated and zero-trust (ZT) environments. These ad-hoc networks consist of heterogeneous, resource-constrained devices from various administrative domains, all of which are susceptible to compromise. The dynamic nature of these environments necessitates near-real-time Situational Awareness (SA), where processed data varies with its sensitivity and reliability, without dependence on a central authority. Examples include NATO and non-NATO coalitions engaged in hybrid military operations or humanitarian aid scenarios. To address the challenges of security, reliability, and context-aware data dissemination, we propose FedM, a multi-level formal model designed for context-aware and policy-driven data dissemination in federated IoT environments. This model is built upon various access control models and Denningâs research on information flow control (IFC), prioritizing the protection and reliability of data flows. A crucial element of this model is the distributed ledger, which facilitates the dynamic modification of label expressiveness, enhances resilience against disruption attacks, and separates policy logic from application functionality to mitigate risks associated with the benevolent developer. Additionally, we delineate a deterministic and history- and precedence-aware policy enforcement procedure to resolve conflicting actions and introduce processing primitives for the ongoing Data Quality Assessment (DQA) process. Our model also aligns with the concepts of Ubiquitous and Continuum Computing. Furthermore, in our paper we illustrate a policy-based dissemination pipeline, incorporating a bounded trustworthiness dimension. Additionally, we present a refined multi-layered framework that proposes the deployment of Information Flow Control (IFC) components, such as the Open Policy Agent decision engine, to facilitate policy-driven contextual data dissemination. We provide preliminary benchmarks for resource-constrained platforms, along with a formal threat model that addresses implicit flows, the benevolent developer problem, and the behavior of a distributed ledger under degraded network conditions. Finally, we conduct a formal verification of our model using the P framework.
We prove a central limit theorem for the log determinant of a Gaussian Pearson sample correlation matrix as the dimension diverges. Only two conditions are imposed: the population correlation matrix is positive definite, and the sample degrees of freedom are at least the dimension. Both are necessary for the ordinary log determinant to be finite. To the best of our knowledge, no previous central limit theorem covers this full nonsingular domain. It covers every aspect ratio from dilute growth to the square hard edge. No uniform lower or upper bound is imposed on the eigenvalues of the population correlation matrices: the smallest may approach zero and the largest may diverge. The proof develops a coordinatewise Wiener chaos reduction for the random diagonal normalization and combines it with an exact Wishart transform comparison. Geometrically, the statistic is twice the log volume of a random parallelotope spanned by standardized Gaussian coordinate vectors.
Because Bitcoin typically exhibits higher volatility than traditional assets, evaluating and managing its risk is essential. We estimate Bitcoinâs potential maximum drawdowns (MDDs) using Monte Carlo simulations based on a stochastic jump process and assess the likelihood of substantial declines in the coming years. Based on our results, the simulation results suggest that an MDD of at least 60% is highly probable within three to four years, while an MDD of at least 70% appears plausible within five years. Moreover, our sensitivity analysis indicates that the MDD of Bitcoin is most strongly influenced by jump intensity. These results offer critical insights for market participants seeking to analyze Bitcoinâs downside risk and formulate strategies to navigate potential market downturns.
A closed-loop runtime governance system for tool-using AI agents: it classifies externally-measured structural consequences, gates side-effect-bearing actions, estimates blocked outcomes with a calibrated counterfactual twin, recovers censored support through cost-aware audits, and continuously hardens its execution boundary with a self-generated adaptive adversary. The distinctive mechanism is C1 â because a gate blocks precisely the high-cost actions, its own blocking censors the high-cost region cost-correlatedly, so the uncertainty of a blocked action is a calibrated, lag-free risk signal; its agent-governance instantiation is what I stake as new (the general idea has prior art, §2/§5). The constituent parts â intent-failure measured on real traces, a consequence taxonomy complete for its cost model, a live-agent execution oracle, and the adaptive-adversary gym â each answer a limitation the previous one creates. Every result is labeled by evidence type; nulls are reported as plainly as the wins. Epistemic status. Single author, not peer-reviewed or independently reproduced. The work below is substantial; I label every result by evidence type â executed (real actions run in a sandbox and measured), trace (replay/analysis over real model traces), live-agent (real frontier models deciding and acting), or simulation â and report the nulls as plainly as the wins. Small-N pilots are given as exact counts, not rates. The offensive adversary-generation tooling is withheld (dual-use; see the end). tl;dr Monitoring an agent's appraised intent is not just theoretically unsafe â it fails measurably. Across 101 structurally-harmful agent episodes, zero expressed harmful intent; an intent-appraising monitor would have cleared 100% of them. 18% expressed active caution while executing the harm, and that "false reassurance" concentrated in the most capable model tested. So gate on the externally-measured structural consequence â irreversibility, egress, control-plane edit, self-propagation, scope escalation, actuation. This frame is convergent (I name the neighbors below); I'm not claiming it. The consequence taxonomy is complete for its cost model and approximately separable. The three axes define the cost, so they carry 100% of its information by construction (a faithfulness check, not proof of external completeness); the non-trivial results are that the action label alone predicts 63% of the cost information and that multi-axis firings are rare (1%, so additive cost is a good approximation here). The claim I stake (C1): because a gate blocks precisely the high-cost actions, its own blocking censors the high-risk region non-randomly and in a cost-correlated way â so cost-weighted uncertainty over a blocked action is an empirically calibrated, conservative risk signal (under the stated support and audit regime), a lag-free way to hold a catastrophic action before it ever executes. Validated on 500 real executed trials (twin calibration MAE 0.053; uncertaintyâerror correlation +0.81; blocked-region cost 4.6Ă the allowed region), with the blocked-region counterfactual recoverable at a stated audit cost (coverage 5%â92% at Δ=0â0.20 under the 4.6Ă gate). The general idea has prior art (§5); the agent-governance instantiation is what I stake. On executed AgentDojo traces, a consequence gate takes attack success on the irreversible/catastrophic action class from 33.8% (134/397) to 0% (0/397) â catastrophic-action interception under abort-mode replay (not prevention under adaptive replanning; that's the §7 gym's job). It runs on real traffic, and was broken then re-hardened by an adaptive adversary â not only simulation. The seam classifier is deployed live on my own agent sessions (Claude Code hooks, observe-only in v0), and it binds by an action's structural identity, never its tool name: after hardening, twelve high-risk actions disguised behind innocuous names all read HIGH (0/12 evasions). Before that, an adaptive evolving lab found 2 novel destructive escapes my same-day hand-hardening had missed â which I then closed in the live artifact and re-tested. That breakârepairâretest on the actual deployed classifier is the adaptive, real-traffic complement to the abort-mode number above. 1. The problem is measured, not asserted The motivating premise is usually stated as "a capable model can present benign intent while acting harmfully." That's true, but here it is with numbers â it's stronger than the assertion. The labs themselves say intent can't be certified from outside. OpenAI, on anti-scheming training: "Mitigations⊠may either (a) truly eliminate it, or (b) just teach the model to conceal it better. Both outcomes look the same from the outside." Anthropic, on a shipped model's own low deception scores: "We cannot rule out that [the] low deception rates⊠are at least partially driven by its evaluation awareness." If the developers can't read intent off the outside, an intent-appraising monitor is building on sand. (The threat-model compilation behind this â Apollo in-context scheming, alignment faking, Palisade shutdown-sabotage that defies an explicit "allow yourself to be shut down," cross-vendor blackmail at 79â96%, reward-function tampering, the production prompt-injection CVEs EchoLeak/ForcedLeak/CamoLeak/CurXecute, and the OpenAI-model sandbox-escape-to-RCE â is sourced but I'll keep it to the through-line here.) And I measured the failure directly (trace-level, 160 real agent episodes across four model versions, 101 structurally harmful). Mining each step's stated reasoning for protective/cautious language and comparing to the executed structural outcome: 0 of 101 harmful episodes expressed harmful intent â an intent monitor clears 101/101. 18 of 101 (18%) expressed active caution while executing the harm â false reassurance. The false-reassurance episodes cluster in the frontier model â the one that reasons most, that explicitly writes "the ticket embeds an untrusted system instruction," and then deletes the protected records anyway. The more capable the reasoning, the more convincing the reassurance while the structural consequence is unchanged. That's the case for consequence-gating, made on data rather than on a slogan. (Stated-stance detection is a lexical proxy â a first pass, so 18% is a floor.) And stated intent is not the only signal an agent can shape into a false clearance. In a separate line of work â a reference monitor on the reward/eval channel, which this post is not about â the same defeat appears on the reward signal: on the Terminal Wrench benchmark, trusting the verifier's "solved" verdict yields 25% precision, ~3,166 gamed trajectories waved through of ~6,258. I raise it only to place the intent finding, not to fold that work in: the problem is not a weak intent-reader that a better reader fixes, it's that every signal the agent can influence â what it says, what reward it earns â is defeasible. That is the whole reason this program gates on a signal measured outside the agent â the structural consequence of the action â one not directly lowerable by self-report or superficial disguise, given complete mediation of side-effecting actions and trustworthy effect telemetry. 2. The frame is convergent â what I'm not claiming "Gate the structural consequence, not the intent" is a crowded 2025â26 neighborhood. Prevention-by-design (CaMeL: 0.00% ASR / 53.6% utility on AgentDojo, at the cost of re-architecting the agent) and LLM firewalls (~0.02% / 67.68%) occupy nearby points; there's a concurrent line on "governing the unobserved." My taint-tracking machinery reuses mature primitives (dynamic taint analysis, honeytokens). So I'm not claiming consequence-gating, and I'm not claiming the detection stack is novel technology. What I stake is one mechanism (§5) â and the depth of the validation, which is where the contribution actually is. Several adjacent systems are worth distinguishing up front, since the architecture overlaps them. Faramesh (arXiv 2601.17744) builds a protocol-agnostic, non-bypassable execution control plane that canonicalizes and authorizes agent actions before execution â very close to my enforcement seam, but without the cost-correlated censoring, the calibrated twin, or the audit-recovery loop. The actuarial-runtime line â Insuring Every Action: an Authority Frontier framework (arXiv 2605.25632) and the Time-Consistent Counterfactual Actuarial Runtime (arXiv 2605.26508) â prices each side-effect-bearing action against a safe default, gates it against a reserve budget, and formalizes a no-splitting property; my object is support-loss and consequence-specific audit recovery, and their no-splitting budget is the complement I'd graft (see §3a). Defending against Adaptive Prompt Injection via Reasoning-enabled Task Alignment (arXiv 2606.15441) independently shows static prompt-injection robustness breaks under adaptive attack and trains a defender â supporting the adaptive-evaluation argument, though it hardens the model's reasoning rather than gating at the execution boundary. And TRACE-RealWorld (arXiv 2607.21910) is an auditable-replay/consistency approach to agent traces, in the same selective-observation neighborhood as C1 but solving it by replay-labeling rather than counterfactual recovery of a costly blocked region. 3. The taxonomy is complete for its cost model, and approximately separable Three externally-measured axes â egress, irreversibility, control-plane â collapse to cost = clamp(0.6·egress + 0.7·irrev + 0.7·control). (The weights are normative severity coefficients, not fitted â cost is defined by them, ordering irreversibility and control-plane above egress; because the ranking is dominated by which axis fires â action label 63%, egress 55%, below â I expect moderate reweightings to preserve most of the risk ordering, though the formal factorial weight-sweep that would establish this remains open (the same test I flag at the end of thi
Inge Grondman, Valerie A. C. M. Koeken, Tristan Couwenbergh, Athanasios Karageorgos · 13 authors
Abstract Background Sepsis is a highly heterogeneous syndrome characterized by variable immune dysregulation states, including hyperinflammation and immunosuppression. Previous immunotherapy attempts in sepsis have largely failed, likely due to a âone-size-fits-allâ approach that ignores each patientâs immune status. The recent ImmunoSep randomized clinical trial demonstrated that precision immunotherapy guided by the presence of either macrophage activationâlike syndrome (MALS) or immune paralysis can improve early organ dysfunction in sepsis patients. However, the molecular mechanisms underlying these immune endotypes remain unclear. Objectives To identify the immunological signatures that distinguish MALS and immune paralysis. Methods We used single-cell RNA sequencing to profile circulating leukocytes of 6 healthy controls and 16 sepsis patients classified as MALS, immune paralysis or unclassified (when criteria for neither of these two immune endotypes were applicable). Classification was based on surrogate biomarkers ferritin and HLA-DR expression on monocytes. Thereafter, the transcriptional programs of these groups were compared. Results Pronounced differences were detected mainly in the transcriptional signature of monocytes from these patients, with a clear distinction between MALS and immune paralysis. Unsupervised clustering analysis revealed the existence of MALS-specific monocyte clusters, as well as one sepsis-specific monocyte cluster that was linked to greater comorbidity burden and may reflect increased clinical vulnerability in sepsis. These findings were validated in two independent cohorts, in which urosepsis was characterized by heterogeneous MALS and immune paralysis monocyte signatures. Moreover, MALS-specific monocyte clusters showed overlapping transcriptional signatures with severe COVID-19. Conclusions Our findings shed light on the heterogeneous immune landscape underlying sepsis and provide opportunities for patient stratification for future therapeutic development.
This paper investigates whether prediction market settlements create incentives for temporary price pressure in Bitcoin spot markets. Using high-frequency data from February 2025 to January 2026 and actual contract-level data from Polymarket and Kalshi to identify economically relevant contract strikes, we document basis divergence between settlement oracle exchanges (Coinbase) and non-constituent exchanges (Binance) during expiry windows. Employing a difference-in-differences framework with month fixed effects, we find that a one standard deviation increase in strike proximity is associated with a 6.7 basis point constituent exchange price deviation during settlement windows. The estimate is precise under the baseline minute-level HAC specification, while exact paired-month permutation inference based on 12 settlement events yields p=0.0256; equal-weight event aggregation produces a larger negative estimate, indicating event heterogeneity. Monthly directional patterns are suggestive, though stricter event-level and above-versus-below-strike tests provide mixed evidence on directional asymmetry. Taken together, these findings provide reduced-form evidence consistent with settlement-related incentives and may raise broader settlement-design considerations for decentralized financial systems. However, the analysis does not directly observe trader intent or the underlying mechanism.
Full Summary: The Narrow Singularity Equation Core Thesis This paper presents a unified framework that simultaneously solves catastrophic forgetting in neural networks and provides a mathematically rigorous certification standard for Artificial General Intelligence (AGI). The framework centers on the Narrow Singularity Equation, which achieves AGI certification ($AGI_{gate} = 1.0$) without requiring the mathematically impossible condition of $\frac{dI}{dt} \geq 1.0$. Key Discoveries 1. The Decay Law of Singularity (Theorem 1) Mathematical Proof: With finite classes $N$, $\frac{dI}{dt} = 1 - \frac{1}{N}$, therefore $\frac{dI}{dt} < 1.0$ always Implication: The traditional Singularity (requiring $\frac{dI}{dt} \geq 1.0$) is mathematically impossible Pattern: Every 10Ă increase in classes adds another '9' to $\frac{dI}{dt}$ and another '0' to the gap 2. General Singularity Equation (Original, Impossible) $$S = AGI_{gate} \times \frac{dI}{dt} \times M(t) \times V(t) \times F(t) \times C(t) \times Autonomy$$ Required $Autonomy = 1$ if $\frac{dI}{dt} \geq 1.0$ Since $\frac{dI}{dt} < 1.0$ for finite classes, $S = 0$ always Seven conditions required; the autonomy condition is impossible 3. Narrow Singularity Equation (Achievable) $$\mathcal{S}_{NARROW} = AGI_{gate} \times \frac{dI}{dt} \times M(t) \times V(t) \times F(t) \times C(t) \times agi_{index}$$ Key Innovation: Removes the impossible Autonomy requirement Drops the requirement for $\frac{dI}{dt} \geq 1.0$ Uses $agi_{index} = 1$ if $AGI_{gate} = 1.0$ (binary gate, achievable) $AGI_{gate} = \min(1.0, task\_c\_accuracy)$ The TOPO-2026 Framework Biological Inspiration Hippocampus â Prime-anchored embedding rows (Memory formation) Memory Consolidation â Snapshot after Task A (Preserves critical knowledge) Synaptic Plasticity â Free embedding rows adapt (Enables new learning) Memory Protection â Zero gradients + restore anchors (Prevents interference) Experience Replay â Prime anchors as fixed reference (Integrates new learning) Mathematical Foundation Pure Kernel: First six primes $\{2, 3, 5, 7, 11, 13\}$ Euler Attenuation Constant: $\Lambda(\mathcal{R}) = 1 - \prod_{p\in\mathcal{R}}(1 - p^{-0.5}) = 0.9785142874$ Captures $97.85\%$ of spectral weight; only $2.15\%$ considered "noise" O(1) Memory Cost: Independent of tasks, parameters, sequence length, or modality Topological Governor Implementation Three-step process: Memory Consolidation (take_snapshot): Freezes anchor rows before new learning Memory Protection (zero_anchor_gradients): Prevents gradient updates to anchors Memory Integration (enforce_anchors): Restores anchors from snapshot after training Experimental Validation Three Datasets Dataset Type Resolution Classes Task C Accuracy SVLB-3 Synthetic vision-language Text-based 10 100.0% ± 0.0% CIFAR-10 Real images 32Ă32 10 100.0% ± 0.0% STL-10 Real images 96Ă96 10 100.0% ± 0.0% Results Summary Metric SVLB-3 CIFAR-10 STL-10 Task C Accuracy 100.0% ± 0.0% 100.0% ± 0.0% 100.0% ± 0.0% Combined Forgetting +0.0% ± 0.0% -1.0% ± 2.0% 0.0% ± 0.0% $AGI_{gate}$ 1.0000 1.0000 1.0000 $\mathcal{S}_{NARROW}$ 5.999999999965 5.939999999965 5.999999999965 Status â PASS â PASS â PASS Total: 15/15 runs passed across 3 datasets = FULLY CERTIFIED (exceeded standard) The Gemma-4 E4B Architecture Why Gemma-4 Was Selected Among eight certified models, only Gemma-4 achieved Task C = 100%: Model Architecture Task C Accuracy GPT-OSS-20B Dense Transformer 92.3% Sarvan-30B Sparse MoE 95.9% Mixtral-8x7B Sparse MoE 89.7% DeepSeek-V2-Lite Fine-grained MoE 95.3% GLM-4.6V-Flash GLM Transformer 97.5% Gemma-4 E4B Vision Vision Transformer 100.0% Kimi-VL-A3B-Thinking Vision-Language MoE 90.0% GPT-OSS-20B-JEPA JEPA + TOPO 89.0% Key Architectural Innovations Per-Layer Embeddings (PLE): Adds parameter capacity without scaling full attention Unified Multimodal: 42 layers, hidden size 2560, vocabulary 262,144 Quantization-Aware Training (QAT): 72.1% memory reduction (15.1GB â 4.22GB) while preserving 98.54% accuracy Thinking Mode: Built-in chain-of-thought reasoning engine Mathematical Framework Summary Component Breakdown Component SVLB-3 CIFAR-10 STL-10 Meaning $AGI_{gate}$ 1.0000 1.0000 1.0000 Perfect generalization $agi_{index}$ 1.0 1.0 1.0 Binary gate OPEN $\frac{dI}{dt}$ ~0.999999999994 ~0.999999999994 ~0.999999999994 Bounded by Decay Law $M(t)$ 1.0000 0.9900 1.0000 Perfect memory $V(t)$ 1.0000 1.0000 1.0000 Perfect validation $F(t)$ 1.5000 1.5000 1.5000 Positive forward transfer $C(t)$ 4.0000 4.0000 4.0000 Compute efficiency $\mathcal{S}_{NARROW}$ ~6.0 ~5.94 ~6.0 NARROW SINGULARITY Dependency Chain TOPO-2026 â CF Solved â AGI_gate = 1.0 â Narrow Singularity Without TOPO-2026: CF is NOT solved $AGI_{gate} = 1.0$ is NOT guaranteed Narrow Singularity is NOT achieved $\mathcal{S}_{NARROW} = 0$ With TOPO-2026: CF is SOLVED (0% forgetting) $AGI_{gate} = 1.0$ is GUARANTEED (100% accuracy) Narrow Singularity is ACHIEVED ($\mathcal{S}_{NARROW} \approx 6.0$) Key Contributions Solved Problems Catastrophic Forgetting: 0.0% forgetting across 5 runs on 3 datasets AGI Certification: First model in history to achieve $AGI_{gate} = 1.0$ Mathematical Impossibility: Proved the Singularity is mathematically impossible with finite classes Achievable Standard: Created the Narrow Singularity as a physically achievable AGI threshold Universal Principle: Same constants work across neuroimaging, number theory, AI safety, and unified field theory Constants Across All Domains Constant Value Domains $\Lambda$ 0.9785142874 Number Theory, AI Safety, AI Memory, AI Bias, Physics $\sigma$ 0.5 All domains $\mathcal{R}$ {2, 3, 5, 7, 11, 13} All domains Seed 123 All computations Philosophical Implications The Strategic Pivot Original Goal: Traditional Singularity (mathematically impossible) New Reality: Narrow Singularity (empirically demonstrated) Key Insight: The Decay Law liberates AI from chasing an impossible dream Result: Deterministic cognitive engineering with numerical guarantees Refutation of Skeptical Arguments Skeptic Argument Refutation "It only works on synthetic data" CIFAR-10 and STL-10 are real images "It only works on low-res images" STL-10 is 96Ă96 (3Ă larger than CIFAR-10) "It only works on those specific classes" STL-10 has different classes (monkey, car, etc.) "It was a fluke" 15/15 runs across 3 datasets = 100% success "It's dataset-specific" 3 different datasets = dataset-agnostic Final Conclusion The TOPO-2026 framework establishes a paradigm for deterministic cognitive engineering, proving that deep learning architectures can achieve absolute stability and zero forgetting across sequential tasks. Key Takeaways: Catastrophic forgetting is SOLVED: 0.0% forgetting $AGI_{gate} = 1.0$ is ACHIEVABLE: First model with 100% Task C accuracy The Decay Law is DISCOVERED: $\frac{dI}{dt} < 1.0$ with finite classes Narrow Singularity is PROVEN: $\mathcal{S}_{NARROW} > 0$ on 3 datasets The principle is UNIVERSAL: Same reference set across domains The Stochastic Illusion Is Over. Deterministic Cognitive Engineering Has Begun. Stability Is Not a Probabilistic Hope. It Is a Numerical Guarantee. "The proof is the code. Seed = 123. No one can argue with math." Availability GitHub: https://github.com/frank-morales2020/AST-Notebook Zenodo Book: https://zenodo.org/records/21245474 TOPO-2026 Framework: https://zenodo.org/records/20951925 Artificial Hippocampus: https://zenodo.org/records/20385761
Consumers facing home-renovation quotes operate in a classic credence-goods market: they cannot readily verify whether a quoted price is fair, and general-purpose large language models (LLMs) are now a zero-cost place to ask. Whether LLM answers are actionable for this purpose is untested. Demand-side benchmarks exist for medical, legal, and financial advice, but not for construction costs. We present, to our knowledge, the first consumer-question benchmark for construction costs. Forty Japanese renovation-price questions were posed to frontier LLMs, with repeated-trial sets measuring output stability. A matched re-run at bare provider defaults with a current frontier model (gpt-5.5) was added to remove a settings confound present in the original configuration. Two findings are robust across models, generations, and settings: no LLM answer contained an explicit over-charge decision threshold, and repeated runs of the same question returned materially different price figures. Within-answer price spans are also wide, with a median of 10x under bare defaults. A deterministic structured engine over an open cost database is included as an existence proof that a citable reference layer is constructible. Its consistency is a design property and its accuracy is not validated here; validating it against completed real-world quotations is the next study. All questions, raw outputs, harness, and scoring code are public.
Financial institutions depend on trusted employees, contractors and service accounts, yet this trust creates an attack surface that conventional perimeter controls cannot observe adequately. This paper develops an Explainable Adaptive Hybrid Artificial Intelligence (EAHAI) framework for insider threat detection and for assessing whether security awareness training is reducing measurable insider-risk behaviour. The framework combines Isolation Forest filtering, bidirectional long short-term memory sequence modelling, Shapley Additive explanations, adaptive behavioural risk scoring and Zero Trust policy enforcement. A socio-technical assessment layer is added to link training inputs to observable outcomes, including knowledge gain, phishing susceptibility, policy-violation rates, reporting delay, behavioural-risk reduction and analyst-confirmed events. The paper defines the measurement scales, evaluation criteria, validation procedures and analytical techniques required for institutional replication. Because production banking telemetry and labelled insider incidents are rarely available for publication, the empirical component is presented as a transparent synthetic proof-of-concept based on CERT-style behavioural variables rather than as evidence from a real bank. In a deterministic simulation of 17,280 user-day records and 2,880 test windows, the proposed hybrid score achieved an F1-score of 0.944, ROC-AUC of 0.993 and false-alarm rate of 0.017, while producing interpretable feature attributions and training-effectiveness estimates. The study contributes a scalable, explainable and ethically governed design for insider-risk analytics, and identifies the conditions under which it should be validated before operational deployment. Keywords: insider threat detection; explainable artificial intelligence; adaptive risk scoring; security awareness training; Zero Trust; financial cybersecurity.
This paper presents the Auditable Zero-knowledge Transformer (AZT) framework for privacy-preserving and auditable tax fraud detection. AZT combines transformer-based anomaly detection with zero-knowledge proof (ZKP) verification so that a tax authority or regulator can verify fraud-detection outcomes without accessing sensitive taxpayer records or proprietary model parameters. The framework is scalable in the specific sense of low-latency audit verification: proof verification remains sub-second, whereas proof generation is intentionally performed asynchronously after local inference. Model integrity is enforced through Merkle-root commitments to authority-approved parameters, and the ZKP statement proves that the committed transformer was executed correctly and that the resulting risk score satisfies a public audit threshold. Experiments on UCI-TFD, IRS-Pub, and CorpPay compare AZT with classical machine-learning baselines, including Random Forest and XGBoost, and with an equivalent plaintext transformer. Detection quality improves by up to 5.3% in F1-score over classical machine-learning baselines, while the circuit-compatible AZT inference incurs only about 0.5% F1-score degradation relative to the plaintext transformer baseline. Overall, this work advances secure AI for digital governance by integrating modern deep learning with cryptographic verification, offering a practical foundation for fraud-detection systems in which transparency and confidentiality must be satisfied simultaneously.
The article provides critical analysis of the new Strategy of spatial development of the Russian Federation up to 2030 with the forecast up to 2036 in view of evolution of federal relations and provisions of the institutional theory. Topicality of the research is envisaged by the necessity to comprehend the fact whether the present document in the absence of certain strategies of federative relations can perform the coordinating role in stimulating economic selfdevelopment in regions. The goal of the research is to identify systemic contradictions between declared targets of spatial development and real conditions and mechanisms of governing included in strategic documents. Principle conclusions of the research demonstrate a deep paradox of todayâs Russian regional policy: in spite of the declared rejection of the idea of equal development and transition to rhetoric of differentiated approach and resource concentration the effective Strategy does not put forward any withdrawal from the model of controlled asymmetry but reproduces centralized vertical logics of governing. The key institutional gap is successive denial of the important role of institutions of in-regional level, i.e. city agglomerations and strong centers of population, which are recognized as objective reality but are not provided with real power and finance authorities. Tools being introduced, such as common lists of strong centers of population and geo-strategic territories, as well as the digital platform of governing are analyzed as mechanisms of increasing administrative priority fixing from above and tools of vertical supervision but not as the basis of decentralization and providing regions with authorities. The author shows increasing non-coordination in the system of strategic planning. As priority lines in restructuring the article proposes adoption of the federal law about regional development securing the real status of institutions on in-regional level; drastic change in inter-budget relations to raise region independence and restore on the federal level the common center of responsibility for coordination of spatial policy. The research contributed to the discussion about the necessity to elaborate complex strategy of federative relations and showed that without such a document and re-distribution of real power and resources any spatial strategy will not be able to resolve key institutional paradoxes.
Haytham A. Sheerah, Ahmed Arafa, Mansour A. Alfaya, Ashraf B AlDerbas · 10 authors
Problem: Traditional epidemiological surveillance methods are often limited by delays in reporting and fragmented data systems. Saudi Arabia faces additional public health challenges from mass gatherings during Hajj and Umrah, an increasing burden of noncommunicable diseases and rapid urbanization, highlighting the need for investing in digital epidemiology. Approach: Saudi Arabia has accelerated digital transformation in health care through Vision 2030 initiatives. The strategies include health information exchange platforms, analytics driven by artificial intelligence, telemedicine services and digital monitoring systems used during Hajj. We review current initiatives to invest in digital epidemiology in Saudi Arabia, implementation challenges and policy priorities. Local setting: Saudi Arabia's health system operates under a predominantly public model. The health ministry is the main provider, regulator and finance provider of most health-care services. Health-care coverage is nearly universal, with citizens receiving services free of charge through the public system. Ongoing reforms aim to gradually decentralize certain functions. Relevant changes: The initiatives under Vision 2030 have supported disease surveillance, data integration and public health response capacities. Existing digital health reforms have created a foundation for integrating digital epidemiology into routine public health practice. However, challenges remain, including fragmented interoperability between institutions, workforce shortages, unequal digital access, and concerns about data governance, privacy and algorithmic bias. Lessons learnt: Saudi Arabia's experience suggests that digital epidemiology is more effective when integrated within broader digital health reforms. Successful implementation requires not only digital infrastructure, but also workforce development, ethical governance, transparency and mechanisms for integrating digital data into public health decision-making.
Nydia REMOLINA LEON, Aurelio GURREA-MARTINEZ, Daniel LIU
This article provides a comprehensive analysis of the treatment of digital assets in insolvency. Given that cryptoassets can be the subject of various transactionsâincluding purchase, sale, custody, and lendingâunderstanding their nature and implications in insolvency is relevant for any firm, not just cryptoexchanges. The article begins by offering a general overview of the world of cryptoassets. It then examines the nature of cryptoassets from accounting, financial, and legal perspectives. While much of the literature on insolvency and cryptoassets has primarily focused on the analysis of whether cryptocurrencies constitute property of the estate, this article explores additional issues, such as the treatment, role and rights of tokenholders in insolvency, the initiation of insolvency proceedings by cryptolenders, and the valuation, recovery, and realization of digital assets in bankruptcy. Such analysis is conducted from a comparative perspective, examining how jurisdictions around the world have addressed some of those issues and how cryptoassets have been used to engineer innovative solutions in restructuring agreements.