Block #2,090,060

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/27/2017, 11:16:54 AM · Difficulty 10.8757 · 4,750,276 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
57c2a67346c74ada719c5c83beef034b245365850da43d13aa6bcd6a9f52ac90

Height

#2,090,060

Difficulty

10.875715

Transactions

3

Size

1.15 KB

Version

2

Bits

0ae02ee0

Nonce

1,780,964,234

Timestamp

4/27/2017, 11:16:54 AM

Confirmations

4,750,276

Merkle Root

446ba05c1632d01eb6a98a173d8ea54ceb095260c8d7e03dcc1f1dd7abba6041
Transactions (3)
1 in → 1 out8.4600 XPM109 B
5 in → 1 out1018.2700 XPM785 B
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.510 × 10⁹⁴(95-digit number)
15103585729035795528…21193797043403009211
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.510 × 10⁹⁴(95-digit number)
15103585729035795528…21193797043403009211
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.020 × 10⁹⁴(95-digit number)
30207171458071591057…42387594086806018421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.041 × 10⁹⁴(95-digit number)
60414342916143182115…84775188173612036841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.208 × 10⁹⁵(96-digit number)
12082868583228636423…69550376347224073681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.416 × 10⁹⁵(96-digit number)
24165737166457272846…39100752694448147361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.833 × 10⁹⁵(96-digit number)
48331474332914545692…78201505388896294721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.666 × 10⁹⁵(96-digit number)
96662948665829091384…56403010777792589441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.933 × 10⁹⁶(97-digit number)
19332589733165818276…12806021555585178881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.866 × 10⁹⁶(97-digit number)
38665179466331636553…25612043111170357761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.733 × 10⁹⁶(97-digit number)
77330358932663273107…51224086222340715521
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,967,009 XPM·at block #6,840,335 · 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