Apr 28, 2025

Redistributing the AI Dividend: Modeling Data as Labor in a Transformative Economy

Sneha Maria Rozario, Srishti Dutta,

The economic transformations induced by artificial intelligence (AI) raise pressing distributional concerns. This paper examines the allocation of the AI Dividend—the surplus value generated through AI advancements—and proposes mechanisms to ensure equitable redistribution. Anchoring our analysis in the Distribution track, we focus on the Data as Labor (DaL) framework, inspired by Lanier and Weyl, wherein individuals' data contributions are treated as productive labor. We simulate and compare two paradigms: Data as Capital (DaC), in which data is aggregated as corporate capital, and DaL, wherein individuals are compensated for their data. Using comparative economic simulations, we highlight systemic inequalities emerging under DaC and demonstrate the stabilizing potential of DaL structures. We further subdivide the DaL paradigm into two mechanisms: a corporate taxation regime and an individualized data compensation model, proposing a novel formula for micro-level redistribution. The implications of these models for labor markets, inequality, and societal stability are discussed, with a focus on designing incentive-compatible and scalable economic policies. Our findings suggest that recognizing data as labor not only promotes distributive justice but also enhances the long-term sustainability of the AI-driven economy.Message @vi

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

The paper tackles the pressing question of how to share the surplus from advanced AI by contrasting two ownership regimes for data: data as capital, where firms capture most value, and data as labor, where individuals receive compensation. The authors adapt the Lanier and Weyl vision into two concrete redistribution mechanisms, a collective data dividend and an individualized Future Economic Value formula, then run synthetic twenty-year simulations in R. The projected Gini trajectories on page 3 and the top ten percent wealth share plot on page 5 visually convey the distributional gap between the two regimes. The work adds to the sprint by moving beyond abstract discussion and offering parameterized formulas that policymakers could in principle legislate.

Yet the contribution remains largely conceptual. All numeric inputs are hypothetical and chosen for illustrative purposes, so the headline result that a California resident might earn 1 538 dollars a year from her data, shown in the worked example on page 7, has no empirical grounding. Key parameters such as the data labor multiplier, the allocation ratio, and the displacement rate are asserted rather than calibrated to existing studies on data markets, big-tech margins, or labor share trends. The Future Economic Value equation on page 2 combines macro aggregates and micro weights in a way that mixes units and double counts growth effects; no sensitivity analysis or code repository is provided to let readers test robustness. The literature review cites only two sources and omits the fast-growing empirical and legal scholarship on data trusts, data unions, and digital public infrastructure, limiting the theoretical foundation.

AI safety links are mentioned but thin. The authors claim that fair compensation stabilizes society and thus lowers systemic risk, yet they do not trace specific pathways from redistribution to alignment incentives, compute governance, or reduction in catastrophic misuse. Including a discussion of how data labor contracts could improve dataset provenance, reduce poisoning incentives, or finance safety research would make the impact clearer.

Technical documentation is partial. Figures are clear but the appendix supplies only a plotting link, not the full simulation script, and several symbols in Table 1 are undefined in the text. Without public code or real data the study is not reproducible and policymakers cannot assess fiscal feasibility.

Future work should calibrate parameters to real balance-sheet and household survey data, run Monte Carlo sensitivity tests, benchmark the formulas against existing wealth and carbon dividend schemes, and integrate safety-specific channels such as red-team bounties funded by the dividend pool. A richer literature review and full code release would substantially raise both credibility and reuse potential.

This felt like a useful and ambitious project which builds on existing work in the literature. This kind of work has clear policy impact through evaluating methods of redistribution (which could be implemented by governments). When building on this work, I would like to see better explanation of modelling methods and assumptions and a comparison with existing methods of redistribution (it wasn't clear to me how much this was considered in the DaC scenario).

How does the Collective Data Dividend Model have different impacts in practice compared to more standard methods of economic redistribution, namely corporation taxation?

The FEV equation/Table 1 was a little hard to read; I found the version in the appendix with actual numbers very useful for interpreting it. It would have been better to have a some discussion talking through the formula (e.g. the first half vs second half).

I thought the questions you try to answer in Section 4 (plus additional graphs in the appendix) are absolutely the right questions to be asking. It would be better to have an explanation of how you generated these graphs and what assumptions you needed to use (even if just a sketch). Similarly, numbers in table on page 7 were useful but please give sources. In particular, I would like to see what assumptions you use about the population (e.g. what percentage of the population owns shares in AI companies). I would also compare to a standard method of redistribution like existing (or increased) taxation.

Section 5 and 6 sketched some really useful ideas. In particular, the last paragraph of section 6 highlight some important considerations which would be worth investigating further.

Other considerations might include: how do you consider data from people in other countries vs. cross country coordination (this has implications for wealth transfer/inequality between the US and other parts of the world). Should quality of data matter, e.g. forum posts (which are easy to automate and generates incentives to do so) vs. published novels or papers. You mention privacy - should individuals be able to opt out, and how onerous would this be to implement?

The paper pushes forward the discussion on the policy implications of significant worker displacement by AI. The paper highlights the role of data and humans' role in generating (valuable) data, which is a distinct approach relative to alternative methods to guarantee income such as UBI. The comparison of DaK and DaL paradigms is useful. Also, the paper pushes even further by discussing concrete policy proposals. I would like to appreciate the authors' efforts on these and it would be great to see them make further progress along these lines.

It is worth mentioning that the paper assumes human-generated data will remain as a valuable input to AI development. However, it is also possible that algorithms become so advanced that they don't require large amounts of data. While the authors acknowledge this possibility, the analysis could be expanded by taking into account how algorithmic improvements allow increasingly data-efficient development of AI.

Also, it may be useful to compare the dividends with UBI. Should everyone receive the same amount of dividends? Or should the distribution depend on individual characteristics such as the quantity or quality of data generated?

Cite this work

@misc {

title={

Redistributing the AI Dividend: Modeling Data as Labor in a Transformative Economy

},

author={

Sneha Maria Rozario, Srishti Dutta,

},

date={

4/28/25

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

Apr 27, 2026

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

Apr 27, 2026

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

Apr 27, 2026

PROTEUS (PROTein Evaluation for Unusual Sequences): Structure-Informed Safety Screening for de novo and Evasion-Prone Protein-Coding Sequences

AI protein design tools like RFdiffusion, ProteinMPNN, and Bindcraft make it trivial to produce low-homology sequences that fold into active, potentially hazardous architectures. However, sequence homology-based biosafety screening tools cannot detect proteins that pose functional risk through structurally novel mechanisms with no sequence precedent. We present a tiered computational pipeline that addresses this gap by combining MMseqs2 sequence alignment with structure-based comparison via FoldSeek and DALI against curated toxin databases totaling ~34,000 entries. AlphaFold2-predicted structures are screened for both global fold similarity (FoldSeek) and local active/allosteric site geometry (DALI), capturing convergent functional hazards that sequence screening misses. The pipeline was validated against a panel of toxins, benign proteins, structural mimics, and de novo-designed Munc13 binders, as well as modified ricin variants with residue substitutions. We additionally tested robustness to partial-synthesis evasion, where a bad actor submits multiple shorter coding sequences intended for downstream reassembly into a full toxin-coding gene. We found that while sequence-based screening did not identify any de novo ricin analogues with high certainty, the combined pipeline with FoldSeek and DALI identified all 24 tested de novo ricins as toxic.

Read More

Apr 27, 2026

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

Apr 27, 2026

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.