The Third Restructuring of Software Form: From the Three-Tier Architecture to Storage, Models, and Agents
Organizations: Nanjing Liancheng Intelligent Technology Group, Nanjing, China
Abstract
Software form has undergone two paradigm shifts since its inception: Software 1.0, in which instructions determine behavior, and Software 2.0, in which data determines behavior (machine learning). This paper argues that a third shift - Software 3.0, in which context and reasoning determine behavior - is now underway, and contends that its terminal form converges to three elements: a generalized database (the unified abstraction of all persistent state and memory), a large model (the intelligence core that performs reasoning and generation), and an agent (the execution loop connecting the first two). The core argument is as follows: in the traditional three-tier architecture, the user-interface layer will be absorbed by the model's ability to generate interfaces on demand, the business-logic layer will be re-partitioned along "expressibility x criticality" into model reasoning and storage constraints (with residual deterministic logic retained as tools), and only the data layer will be elevated into the sole persistent infrastructure. We formalize this convergence thesis, present a minimal reference architecture, report evidence from real prototypes and a live model, and systematically analyze both the conditions under which it holds and the boundaries where it fails - determinism, cost, security, and verifiability delimit the thesis's domain of applicability. We argue that the thesis holds in task domains that are expressible, verifiable, externally stateful, and tool-complete, and that it will reshape the roles of developers, the database industry, and the software-engineering discipline.
Figures & tables
| Kind | Example scheduling rule | Lands in |
|---|---|---|
| Expressible, non-critical | “Why is order #A delayed?”; summarize today’s plan | Model reasoning |
| Critical, declaratively expressible | One machine runs one operation at a time; an operation starts only after its predecessors; capacity is never exceeded | Storage constraints (uniqueness, precedence, CHECK) |
| Critical, not declaratively expressible | Minimize total tardiness / makespan; balance due dates against changeover cost | Deterministic solver tool (e.g., CP-SAT) |
| Traditional | Converged form |
|---|---|
| User interface layer | Generated on demand by the model |
| Business logic layer | Three-way split: model reasoning, storage constraints, residual deterministic tools |
| Data layer | Generalized database (sole persistent state, plus constraints and history) |
| Control flow (implicit) | Agent execution loop (plan–memory–tool) |
| Proposals | Rejected | Persisted | Feasible | Time (ms) | |
|---|---|---|---|---|---|
| 0.0 | 200 | 0 | 200 | yes | 1.23 |
| 0.1 | 200 | 16 | 184 | yes | 1.14 |
| 0.2 | 200 | 33 | 167 | yes | 1.11 |
| 0.3 | 200 | 45 | 155 | yes | 1.08 |
| Instance | Makespan | Time (s) | Status |
|---|---|---|---|
| 6 6 | 594 | 0.01 | optimal |
| 8 8 | 756 | 0.02 | optimal |
| 10 10 | 857 | 0.16 | optimal |
| 12 12 | 944 | 9.67 | optimal |
| 15 15 | 1143 | 0.56 | optimal |
| Metric | Value |
|---|---|
| Trials | 20 |
| Feasible schedules produced directly | 0 / 20 |
| Machine-exclusion violations | 20 / 20 |
| Precedence violations | 18 / 20 |
| Violating schedules rejected by storage | 20 / 20 |
| Apparent makespan, mean (optimum ) | 8.9 |
| Metric | Value |
|---|---|
| Requested the solver tool | 10 / 10 |
| Reported correct makespan ( ) | 10 / 10 |
| Stated the schedule is feasible | 10 / 10 |
| Mean latency per call | 4.82 s |
| Case | Hand-written | Hand-written (missing capacity) | Storage |
|---|---|---|---|
| valid | caught | caught | caught |
| overlap | caught | caught | caught |
| precedence | caught | caught | caught |
| capacity | caught | leaked | caught |
| Category | Why it is not replaced | Applicable form |
|---|---|---|
| Database / storage engine | Source of determinism, transactions, performance | Implementation of |
| OS / runtime / compiler | Demand correctness, nanosecond performance | Invoked by as tools |
| High-frequency transaction systems | Latency, determinism | Keep ; model offline only |
| Regulated / safety-critical systems | Accountability, auditability | Storage constraints + human-in-the-loop |
| Model training / inference frameworks | Carrier of | The thesis’s core, not replaceable |