Block #850,560

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 2:35:42 PM · Difficulty 10.9713 · 5,989,408 confirmations

1CC
Cunningham Chain of the First Kind

A sequence where each prime is double the previous prime plus one.

Block Header
Block Hash
69c8c1cbf9aedfc0a1b57a7b8828c239bef4af3997b751a8ec2650af5c353d5a

Height

#850,560

Difficulty

10.971337

Transactions

2

Size

433 B

Version

2

Bits

0af8a986

Nonce

385,271,180

Timestamp

12/12/2014, 2:35:42 PM

Confirmations

5,989,408

Merkle Root

855105f8c0cd2f0b519d0f87801f27383bda061d374855f8aa22e3a3f74d5c5e
Transactions (2)
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.649 × 10⁹⁶(97-digit number)
16490094182011870423…19536008883085029119
Discovered Prime Numbers
p_k = 2^k × origin − 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin − 1
1.649 × 10⁹⁶(97-digit number)
16490094182011870423…19536008883085029119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.298 × 10⁹⁶(97-digit number)
32980188364023740847…39072017766170058239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.596 × 10⁹⁶(97-digit number)
65960376728047481695…78144035532340116479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.319 × 10⁹⁷(98-digit number)
13192075345609496339…56288071064680232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.638 × 10⁹⁷(98-digit number)
26384150691218992678…12576142129360465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.276 × 10⁹⁷(98-digit number)
52768301382437985356…25152284258720931839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.055 × 10⁹⁸(99-digit number)
10553660276487597071…50304568517441863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.110 × 10⁹⁸(99-digit number)
21107320552975194142…00609137034883727359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.221 × 10⁹⁸(99-digit number)
42214641105950388285…01218274069767454719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.442 × 10⁹⁸(99-digit number)
84429282211900776570…02436548139534909439
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,964,048 XPM·at block #6,839,967 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy