Block #2,287,490

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/8/2017, 7:12:26 AM · Difficulty 10.9555 · 4,557,837 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
818938f5cc3e152be47d553af98fbab938feab07075e0af2201b13bd12a7cfc3

Height

#2,287,490

Difficulty

10.955528

Transactions

4

Size

1.00 KB

Version

2

Bits

0af49d7f

Nonce

1,061,454,636

Timestamp

9/8/2017, 7:12:26 AM

Confirmations

4,557,837

Merkle Root

3e9817a205c3c658e3d5e2df5f0ed3eb9e8d76682fd85182eb30a4a2191c04d8
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.387 × 10⁹⁴(95-digit number)
13875410806956542702…92248323064962399701
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.387 × 10⁹⁴(95-digit number)
13875410806956542702…92248323064962399701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.775 × 10⁹⁴(95-digit number)
27750821613913085405…84496646129924799401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.550 × 10⁹⁴(95-digit number)
55501643227826170811…68993292259849598801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.110 × 10⁹⁵(96-digit number)
11100328645565234162…37986584519699197601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.220 × 10⁹⁵(96-digit number)
22200657291130468324…75973169039398395201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.440 × 10⁹⁵(96-digit number)
44401314582260936649…51946338078796790401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.880 × 10⁹⁵(96-digit number)
88802629164521873298…03892676157593580801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.776 × 10⁹⁶(97-digit number)
17760525832904374659…07785352315187161601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.552 × 10⁹⁶(97-digit number)
35521051665808749319…15570704630374323201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.104 × 10⁹⁶(97-digit number)
71042103331617498639…31141409260748646401
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:58,007,056 XPM·at block #6,845,326 · 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