Block #2,130,423

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2017, 10:17:49 AM · Difficulty 10.9096 · 4,694,867 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
615cff7a6d409d5caeb7e8ff994f6d580e6c53c3f86cbe6f20233b6bea4a4912

Height

#2,130,423

Difficulty

10.909574

Transactions

4

Size

12.56 KB

Version

2

Bits

0ae8d9de

Nonce

1,419,198,551

Timestamp

5/24/2017, 10:17:49 AM

Confirmations

4,694,867

Merkle Root

a27231e25e1e871672fb4081a0eb479089e6760797736fe6243d81e3c51a6c8d
Transactions (4)
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.

9.159 × 10⁹³(94-digit number)
91590923168849503322…79570232897920170421
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
9.159 × 10⁹³(94-digit number)
91590923168849503322…79570232897920170421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.831 × 10⁹⁴(95-digit number)
18318184633769900664…59140465795840340841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.663 × 10⁹⁴(95-digit number)
36636369267539801328…18280931591680681681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.327 × 10⁹⁴(95-digit number)
73272738535079602657…36561863183361363361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.465 × 10⁹⁵(96-digit number)
14654547707015920531…73123726366722726721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.930 × 10⁹⁵(96-digit number)
29309095414031841063…46247452733445453441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.861 × 10⁹⁵(96-digit number)
58618190828063682126…92494905466890906881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.172 × 10⁹⁶(97-digit number)
11723638165612736425…84989810933781813761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.344 × 10⁹⁶(97-digit number)
23447276331225472850…69979621867563627521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.689 × 10⁹⁶(97-digit number)
46894552662450945700…39959243735127255041
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,846,420 XPM·at block #6,825,289 · 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