The Leibniz Calendar: Dot-Row Time, Machine-Verified

In 1716 Leibniz sketched a clock read by touch: rows of dots, hollow for 0, filled for 1, the weights doubling outward — his own worked example: "4 und 8 macht 12" (4 and 8 make 12). This paper places that dot-row encoding on the face of LogicLock, a thirteen-module thermal calendar, and proves in the Lean 4 kernel that the reading is exact: every seat (0–12, on four dots) and every counted day (0–363, on nine dots) reads back to itself, and the seam seat 12 is filled at exactly positions 2 and 3 — weights 4 and 8, Leibniz's example recovered as a theorem. One day carries no row: Zero.zero, the Boundary Day, outside the count by ruling. The calendar is a design study (T5, NO CLAIM); the pin theorems stand at T1 — kernel-verified in Lean 4, not yet human-refereed.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24328822
Primary Topic
Logic, programming, and type systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Leibniz Calendar: Dot-Row Time, Machine-Verified

Jeffrey Michael Gurd
1 links
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
preprint

The Leibniz Calendar: Dot-Row Time, Machine-Verified

Jeffrey Michael Gurd
preprint en

Abstract

In 1716 Leibniz sketched a clock read by touch: rows of dots, hollow for 0, filled for 1, the weights doubling outward — his own worked example: "4 und 8 macht 12" (4 and 8 make 12). This paper places that dot-row encoding on the face of LogicLock, a thirteen-module thermal calendar, and proves in the Lean 4 kernel that the reading is exact: every seat (0–12, on four dots) and every counted day (0–363, on nine dots) reads back to itself, and the seam seat 12 is filled at exactly positions 2 and 3 — weights 4 and 8, Leibniz's example recovered as a theorem. One day carries no row: Zero.zero, the Boundary Day, outside the count by ruling. The calendar is a design study (T5, NO CLAIM); the pin theorems stand at T1 — kernel-verified in Lean 4, not yet human-refereed.

Zenodo (CERN European Organization for Nuclear Research)
Nexus Research (IE)
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon