Block #2,178,390

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/26/2017, 2:09:42 AM · Difficulty 10.9260 · 4,660,116 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3684963586e48aab3887f54e2ac75b61c3d1f1b3ce5cfc9b27c40f426bb1a6df

Height

#2,178,390

Difficulty

10.925994

Transactions

13

Size

5.51 KB

Version

2

Bits

0aed0dec

Nonce

215,216,511

Timestamp

6/26/2017, 2:09:42 AM

Confirmations

4,660,116

Merkle Root

a37b6b5539cf0ce72b70641e0a60bf0ad89c7280e1133890f3200418a1d98ef3
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.467 × 10⁹⁴(95-digit number)
14678306219113835351…98070460052574533419
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.467 × 10⁹⁴(95-digit number)
14678306219113835351…98070460052574533419
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.935 × 10⁹⁴(95-digit number)
29356612438227670702…96140920105149066839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.871 × 10⁹⁴(95-digit number)
58713224876455341404…92281840210298133679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.174 × 10⁹⁵(96-digit number)
11742644975291068280…84563680420596267359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.348 × 10⁹⁵(96-digit number)
23485289950582136561…69127360841192534719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.697 × 10⁹⁵(96-digit number)
46970579901164273123…38254721682385069439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.394 × 10⁹⁵(96-digit number)
93941159802328546246…76509443364770138879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.878 × 10⁹⁶(97-digit number)
18788231960465709249…53018886729540277759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.757 × 10⁹⁶(97-digit number)
37576463920931418498…06037773459080555519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.515 × 10⁹⁶(97-digit number)
75152927841862836997…12075546918161111039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.503 × 10⁹⁷(98-digit number)
15030585568372567399…24151093836322222079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,952,323 XPM·at block #6,838,505 · 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