遇见数据集

GCD Datasets for Self-Proving Models

收藏
Zenodo2024-07-16 更新2026-04-07 收录
官方服务:

资源简介:

Transcripts and annotated transcripts for training Self-Proving Models to compute the Greatest Common Divisor (GCD) of two integers. Integers are encoded in base 210. Full details of the tokenization scheme can be found in the paper.

创建时间:
2024-07-16
二维码
社区交流群
二维码
科研交流群
商业服务