Block #2,139,399

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/31/2017, 4:27:48 PM · Difficulty 10.8792 · 4,705,652 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
74998075e2dfa15bb07971aa48f2547eb261c9ce720ee1cf21d33162f4365af5

Height

#2,139,399

Difficulty

10.879212

Transactions

3

Size

1.36 KB

Version

2

Bits

0ae11407

Nonce

455,632,417

Timestamp

5/31/2017, 4:27:48 PM

Confirmations

4,705,652

Merkle Root

93015628283d844b401d76c4febdc25e1fec136322c191a166c103f1d688dce9
Transactions (3)
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.403 × 10⁹⁶(97-digit number)
14037079008881993698…65374762107519999999
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.403 × 10⁹⁶(97-digit number)
14037079008881993698…65374762107519999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.807 × 10⁹⁶(97-digit number)
28074158017763987396…30749524215039999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.614 × 10⁹⁶(97-digit number)
56148316035527974793…61499048430079999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.122 × 10⁹⁷(98-digit number)
11229663207105594958…22998096860159999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.245 × 10⁹⁷(98-digit number)
22459326414211189917…45996193720319999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.491 × 10⁹⁷(98-digit number)
44918652828422379834…91992387440639999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.983 × 10⁹⁷(98-digit number)
89837305656844759669…83984774881279999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.796 × 10⁹⁸(99-digit number)
17967461131368951933…67969549762559999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.593 × 10⁹⁸(99-digit number)
35934922262737903867…35939099525119999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.186 × 10⁹⁸(99-digit number)
71869844525475807735…71878199050239999999
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:58,004,831 XPM·at block #6,845,050 · 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