Motion that stops

Two pins and no dwell at all

Put a second pin on a Geneva's crank and the wheel indexes twice a turn instead of once, at a quarter of the acceleration for the same output rate. Put a third on a six-slot wheel and it never rests; put a third on an eight-slot wheel and two pins meet in two slots and it jams. Both of those look like separate conditions and are one, and the boundary between them is an equation in integers with exactly three solutions.

Assumes The mechanism that waits and The resolution is the pitch.

The mechanism that waits fixed the Geneva’s own arithmetic and corrected a number that had been wrong. A six-slot wheel indexes by 60° at a time, and the fraction of the driver’s turn during which it is being driven is not one sixth but one third: the pin is in a slot while the driver sweeps 180°360°/n180° - 360°/n, so the driven fraction is (n2)/2n(n-2)/2n and the two expressions agree at four slots and nowhere else.

That is what one pin costs. A driver can carry more than one, and the mechanism is then indexing several times a turn — which is what a machine wanting a fast index and a slow driver would ask for.

Everything about whether it works is arithmetic in two integers.

One pin and two, on the same wheelA 6-slot Geneva wheel at one instant of its index, driven by a crank carrying one pin and by the same crank carrying two. The wheel, the slots and the centre distance are identical; only the pin count differs. Each pin drives the wheel through one slot pitch while the driver sweeps 120°, so 1 pin gives 1 index a driver turn and leaves 67% of it at rest, 2 pins give 2 indexes a driver turn and leave 33% of it at rest. Nothing else about the mechanism changes, which is why the whole question is arithmetic.1 pindriving67% at rest, 1 index a turn2 pinsdriving33% at rest, 2 indexes a turn6 slots, pins on one crankthe same wheel, driven twice as often
Fig. 1 A six-slot wheel at one instant, driven by a crank carrying one pin and by the same crank carrying two. The wheel, the slots and the centre distance are identical.

One line

With pp pins equally spaced round the driver there are pp engagements in a turn and each costs (n2)/2n(n-2)/2n of it, so the wheel is being driven for

p(n2)2n\frac{p\,(n-2)}{2n}

of the turn and resting for the rest. The pins do not interact and the geometry of each engagement is exactly the single-pin geometry: the centre distance is still crank ÷ sin(180°/n), the pin still enters along the slot, the wheel still starts and stops from rest.

The one line a multi-pin Geneva must stay under. The share of the driver's turn during which the wheel is being driven, against the number of pins, for four slot counts. Each line is p times that slot count's own (n − 2)/2n, so all four are straight through the origin and the only thing that differs is the slope. Above the rule at one there is no dwell left to have and two pins are in slots at once, which is a jam rather than a fast indexer. Where each line crosses is a question about integers: 3 slots can take 5 pins, 4 slots can take 3 pins, 6 slots can take 2 pins, 12 slots can take 2 pins.
Fig. 2 The share of the driver’s turn the wheel is being driven, against the pin count, for four slot counts, with the rule the machine must stay under.

Each line is straight through the origin, because the pins are independent, and the only thing that differs between slot counts is the slope. Above one there is nothing left of the turn to rest in.

The independence is worth a sentence because it is what makes the arithmetic legitimate rather than a first approximation. Two pins on one crank are two rigid points on one body, so while one is in a slot the other is somewhere on its own circle and is doing nothing; there is no force path between them and no interaction to model. The wheel’s motion during an engagement is the function the Geneva’s own sweep integrates, and it is the same function whichever pin is doing the driving. So the only thing the pin count does is count.

The two conditions that are one

A multi-pin Geneva looks as though it needs two things. There must be a dwell, which is the line above. And two pins must never be in slots at the same time, because two pins in two slots is two constraints on a wheel with one freedom and the machine seizes.

Two conditions that are the same condition. A multi-pin Geneva appears to need two things: a share of the turn left over for the dwell, and pins far enough apart that two are never in slots at once. The middle columns are the second test — the driver arc one engagement occupies, and the driver arc between consecutive pins — and the fourth is the first test. Every row agrees: the arc is shorter than the spacing exactly when the driven share is under one, because the two inequalities are the same one multiplied out. All 56 pairs checked agree, over slot counts from 3 to 37 and pin counts from 1 to 9.
Fig. 3 The engagement arc and the arc between consecutive pins, beside the driven share, for a selection of slot and pin counts.

The second condition is that the engagement arc 180°360°/n180° - 360°/n be shorter than the 360°/p360°/p between pins. Multiply that out:

p(180°360°n)<360°p(n2)2n<1.p\left(180° - \frac{360°}{n}\right) < 360° \quad\Longleftrightarrow\quad \frac{p\,(n-2)}{2n} < 1 .

It is the first condition. Checked over fifty-six pairs, from three to thirty-seven slots and one to nine pins, the two tests agree in every row — which they must, and which is worth measuring because a designer who believes there are two conditions will go looking for the second after satisfying the first and will not find it.

So a multi-pin Geneva has exactly one thing that can go wrong.

There is a reading of that identity worth keeping, because it explains why the two tests looked different. One is a statement about time — how much of the cycle is left over — and the other is a statement about space, about where two pins are relative to each other. They coincide because a Geneva’s driver turns at a constant rate, so an arc of the driver and a share of its cycle are the same quantity in different units. A mechanism whose driver did not turn steadily would have two genuinely different conditions, and the identity here is a consequence of the one thing about a Geneva that is never in question.

Three machines that never stop

The boundary is the equality, and the equality is a Diophantine condition:

p(n2)=2nn(p2)=2pn=2pp2.p\,(n - 2) = 2n \quad\Longleftrightarrow\quad n\,(p - 2) = 2p \quad\Longleftrightarrow\quad n = \frac{2p}{p-2}.

The three Genevas that never stop. The boundary between a machine with a dwell and one that jams is p(n − 2) = 2n, which rearranges to n(p − 2) = 2p. Searched over every slot count to 400 and every pin count to 400, it has exactly three solutions with at least three slots: 3 slots with 6 pins, 4 slots with 4 pins, 6 slots with 3 pins. Each of those drives its wheel for the whole of the driver's turn — one pin leaves a slot as the next enters — so the wheel turns continuously at a varying rate and is not an intermittent mechanism at all. Beyond three solutions there are none, because n = 2p/(p − 2) falls below three as soon as p exceeds six.
Fig. 4 Every slot count to four hundred and every pin count to four hundred, searched for the equality.

There are three solutions with at least three slots: six slots with three pins, four slots with four pins, and three slots with six pins. And there is no fourth, because 2p/(p2)2p/(p-2) falls below three as soon as pp exceeds six, and p=1p = 1 and p=2p = 2 give no solution at all.

Each of those three drives its wheel for the whole of the driver’s turn: one pin leaves a slot exactly as the next enters, and the wheel never stops. They are not fast indexers. They are continuous drives with a varying ratio — mechanisms of a different kind, sitting on the boundary of this one, and a designer who arrives at six slots and three pins by adding pins one at a time has walked out of the family without being told.

The three of them are a small, closed list, which is the shape this field’s results keep taking. A clock is a factorisation reduces a gear train to an arithmetic of integers; the resolution is the pitch reduces an indexer’s accuracy to a count. Here a mechanism’s whole viability reduces to whether two integers satisfy an inequality, and the boundary between the viable and the impossible turns out to be inhabited by exactly three machines.

What a wheel can take

Putting the condition to every reasonable pair gives a table rather than a formula, and the table is short.

Every slot count against every pin count. For seven slot counts and six pin counts, what the machine does: it indexes with a dwell, it indexes with no dwell at all, or two pins meet in two slots and it jams. The right-hand column is the most pins each wheel can take. A wheel of six slots or more can take two and no more; three, four and five slots can take three; only a three-slot wheel can take five. So the multi-pin Geneva is not a family with a parameter to tune — it is a short list, and most of the list is two pins.
Fig. 5 Seven slot counts against six pin counts, sorted into indexing with a dwell, indexing with no dwell, and jamming.

A wheel of six slots or more can take two pins and no more. Three, four and five slots can take three. Only a three-slot wheel can take five.

That is a strong restriction and it is worth seeing why. The driven fraction per pin, (n2)/2n(n-2)/2n, rises towards a half as the slot count grows — a twelve-slot wheel is being driven for 42% of the turn by a single pin, and a twenty-slot wheel for 45%. So the dwell a single-pin Geneva leaves is already barely more than half the turn at large slot counts, and a second pin consumes almost all of what is left. The finer the index, the less room there is for pins, which is the opposite of the intuition that a fine index leaves the wheel more idle.

So the multi-pin Geneva is not a family with a parameter to tune. It is a short list, and most of the list is two pins.

That restriction has a consequence for how the mechanism is usually met. Textbook Genevas have four or six slots, and a six-slot wheel is at the edge of what a second pin allows: it drives for two thirds of the turn and rests for a third. Eight slots with two pins drives for three quarters and rests for a quarter; twelve slots with two pins rests for a sixth. Somewhere along that sequence the dwell stops being long enough to do anything in, and where that is depends on the machine the wheel is carrying rather than on the wheel. So the table’s “most pins it can take” is an upper bound on a quantity a designer will usually want smaller.

What the second pin buys

Two pins is the case that matters, and it is worth pricing properly.

What the pins buy and what they cost. For a 3-slot wheel asked to index at a fixed rate, two quantities as fractions of their one-pin values: the peak angular acceleration the wheel is given, and the share of the cycle it spends at rest. More pins mean a slower driver for the same indexing, and the acceleration goes as the square of the driver's speed, so it falls as the square of the pin count — 1.000 at 1, 0.250 at 2, 0.111 at 3, 0.063 at 4, 0.040 at 5. The dwell falls in a straight line, from 83.3% to 16.7%. So the pins are bought with dwell and paid for in acceleration, and the exchange rate improves as they are added: the second pin costs a sixth of the cycle and saves three quarters of the acceleration.
Fig. 6 For a wheel asked to index at a fixed rate: the peak angular acceleration and the dwell, each as a fraction of its one-pin value, against the pin count.

The index itself is unchanged — the wheel still advances one slot pitch, still starts and stops from rest, and the shape of its motion through the index is a property of the slot count alone. What changes is how fast the driver has to turn. Asking for a stated number of indexes a second with pp pins needs a driver turning pp times slower, and the wheel’s angular acceleration is the shape’s own second derivative times the square of the driver’s speed.

So the acceleration falls as 1/p21/p^2: to 0.250 at two pins, 0.111 at three, 0.063 at four. The dwell falls linearly: 83.3% to 16.7% over the same range on a three-slot wheel.

The second pin costs a sixth of the cycle and saves three quarters of the acceleration. That is a good exchange, and it is why the arrangement exists — the Geneva’s standing complaint, the one the mechanism that waits ends on, is that its acceleration is finite but large and is what tears film sprocket holes. Halving the driver’s speed is the only way to attack it that does not change the mechanism, and a second pin is how a driver is halved without halving the output.

It is also the answer to a question the gear with its teeth cut away raises from the other side. A mutilated gear indexes by having teeth over part of its circumference and none over the rest, and its driven fraction is whatever the designer cuts — there is no arithmetic limiting how often it may index, because the driving and the dwelling are the same body doing two things. A Geneva’s engagement is a fixed arc it cannot shorten, which is why its pin count is bounded and a mutilated gear’s tooth count is not. The Geneva buys its exact start and stop with a constraint on how often it may be asked for one.

What the pins are not

They are not resolution. The resolution is the pitch: a Geneva’s index is 360°/n360°/n and it is exact, and adding pins changes how often that index happens rather than how large it is. A machine wanting a finer step still needs more slots, and more slots is exactly what leaves no room for pins.

They are not a second mechanism. Each engagement is the same engagement. Nothing about the entry, the exit, the starting acceleration or the locking arc depends on how many pins the driver carries, which is what makes the whole question arithmetic rather than geometric.

They are not a finer index in disguise. A wheel indexing twice a turn is not a wheel with twice as many slots. Two pins on a six-slot wheel index by 60° twice a driver turn; one pin on a twelve-slot wheel indexes by 30° once. The first advances the wheel 120° per driver turn and the second 30°, and the two motions have nothing in common but the number of events.

They do not change the ratio. The wheel still turns once for every nn indexes. What changes is that nn indexes now take n/pn/p driver turns rather than nn, so the overall ratio between driver and wheel is n/pn/p to one — and there is the second reason to want them, which is a reduction without a gear.

The same question asked of a ratchet

A ratchet is the other mechanism in this field that indexes, and the pin count has an analogue there that behaves in exactly the opposite way.

The resolution is the pitch measured what several pawls buy a ratchet: with mm pawls offset by a fraction of a tooth, the lost motion falls to a pitch divided by mm, and there is no upper limit on mm but the room to mount them. A ratchet’s pawls do not have to take turns — they are all riding the same teeth all the time, and only one of them happens to be the one that catches.

A Geneva’s pins do have to take turns, because a pin in a slot is the constraint, and two constraints on one freedom is a seizure rather than a redundancy. So the two mechanisms give opposite answers to the same design move. Adding a second holding element to a ratchet improves it with no arithmetic to satisfy; adding a second driving element to a Geneva improves it only while an inequality in two integers holds, and past that boundary it destroys it.

That is the same trade the resolution is the pitch drew between the two mechanisms, arriving one level down: the ratchet has every proportion free and a resolution it cannot improve, and the Geneva has an exact index and almost nothing free.

Where a designer lands

Reading the three results together gives a short procedure, which is worth writing out because the arithmetic above is easy to admire and easy to misapply.

Start from the index the machine needs, which fixes the slot count: n=360°/indexn = 360°/\text{index}, and it must be an integer. That decides everything else. The driven fraction per pin is (n2)/2n(n-2)/2n and is not negotiable. The most pins the wheel can take is the largest pp with p(n2)<2np(n-2) < 2n, which is two for any wheel of six slots or more, three for four or five slots, and five for three.

Then the choice is between one pin and the maximum. One pin gives the longest dwell and the fastest driver; the maximum gives the shortest dwell and the gentlest acceleration. There is nothing in between to tune, because the pin count is an integer and the list is two or three items long.

And if the dwell the maximum leaves is not long enough for whatever the machine does during it, the pins cannot help and the mechanism has to change. A cam indexer’s dwell is a programme and can be made any length; a Geneva’s is 1p(n2)/2n1 - p(n-2)/2n and is arithmetic. That is the price of an index that is exact without being measured.

What this does not settle

The locking disc. A Geneva’s wheel is held during the dwell by a disc on the driver with a cut-away that admits the wheel’s own locking arcs. With pp pins there must be pp cut-aways, and whether the disc has enough material left between them is a condition on the widths of those cut-aways that nothing here computes. It is a plausible place for a second condition genuinely to exist, and it would be a condition on the locking geometry rather than on the counts.

Nothing here is a force. The acceleration quoted is angular acceleration of the wheel, not a torque, a contact stress or a pin bending load. A driver with two pins carries the same peak torque at half the speed, so the pin loads fall too — but by how much depends on what is being indexed and its inertia, which is a dynamics question.

The pins are all the same radius. Two pins at different radii would enter different slots at different driver angles and would need different centre distances for a tangential entry, which the one centre distance cannot provide — so the arrangement is impossible rather than merely unmeasured, and saying so is worth more than sweeping it.

The pins are equally spaced. Unequal spacing is available and changes the problem entirely: the engagements no longer come at regular intervals, the dwells between them differ, and the single condition above becomes one condition per gap. Whether unequal spacing can fit more pins in is not asked.

Reversal is not asked about. Where the input stops deciding shows that an escapement’s output depends on which contact it is on rather than on the input angle alone. A Geneva’s does not: give the driver its angle and the wheel is somewhere definite, and adding pins does not change that, because only one pin is ever engaged. What does change is that there are now pp driver angles giving each wheel position, which is a statement about the map’s many-to-oneness and not about its determinacy.

Internal Genevas are absent. The mechanism that waits draws the external Geneva, whose driven fraction is under a half. An internal Geneva’s is over a half, so it has less room for pins, and the boundary equation would have a different form.

Still open: the locking disc as the real limit

The condition measured here is about the pins and the slots, and it is complete as far as it goes. The mechanism has a third part that has not been counted: the locking disc, which holds the wheel still through the dwell and must be cut away wherever a pin is engaging.

Its distinct argument would be that geometry as a second inequality — the angular width each cut-away must have for the wheel’s locking arc to pass, against the 360°/p360°/p available between pins — and whether it ever bites before the pin condition does. Two things would come out of it. A number: the largest pin count a real Geneva can carry, which may be smaller than the arithmetic above allows and would then be the answer a designer actually needs. And a statement about the three continuous-drive machines: at the boundary the dwell is nought and the locking disc has nothing to do, so it should vanish entirely — and whether it vanishes smoothly, or whether there is a range of pin counts just short of the boundary where the disc is impossible while the pins are fine, is what would decide whether the family’s real edge is where the arithmetic puts it.

What this makes readable

Essays that name this one as a prerequisite.

About the same objects

Not linked from either essay — found by the objects both name.

What links here

Essays that link to this one from their own argument.

The objects this essay names

Each one links to every other essay that touches it.

AccelerationDesign ruleDwellEnumerationthe Geneva mechanismIndexingIntegerIntermittent motion