Block #2,169,364

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/20/2017, 9:06:30 PM · Difficulty 10.8996 · 4,667,619 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4335c8b0d6d7cb548807ed8c7dce6959d334c3bf1a7ca0edec29f0a1bd2e6cac

Height

#2,169,364

Difficulty

10.899610

Transactions

2

Size

868 B

Version

2

Bits

0ae64cd4

Nonce

907,625,040

Timestamp

6/20/2017, 9:06:30 PM

Confirmations

4,667,619

Merkle Root

ef4c77d2f4b215edf0b305cca7340ecd1ef4da1f3e1050b0528e575ca2ce9afe
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.

6.304 × 10⁹⁵(96-digit number)
63047586684136721421…67802267071938232321
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
6.304 × 10⁹⁵(96-digit number)
63047586684136721421…67802267071938232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.260 × 10⁹⁶(97-digit number)
12609517336827344284…35604534143876464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.521 × 10⁹⁶(97-digit number)
25219034673654688568…71209068287752929281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.043 × 10⁹⁶(97-digit number)
50438069347309377137…42418136575505858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.008 × 10⁹⁷(98-digit number)
10087613869461875427…84836273151011717121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.017 × 10⁹⁷(98-digit number)
20175227738923750854…69672546302023434241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.035 × 10⁹⁷(98-digit number)
40350455477847501709…39345092604046868481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.070 × 10⁹⁷(98-digit number)
80700910955695003419…78690185208093736961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.614 × 10⁹⁸(99-digit number)
16140182191139000683…57380370416187473921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.228 × 10⁹⁸(99-digit number)
32280364382278001367…14760740832374947841
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,940,164 XPM·at block #6,836,982 · 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