Block #2,286,589

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/7/2017, 4:21:05 PM · Difficulty 10.9554 · 4,552,089 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
942ed6efadeb92b34da333ec0676fd3c0ce81444c08487b20f825cb2125466b6

Height

#2,286,589

Difficulty

10.955399

Transactions

2

Size

872 B

Version

2

Bits

0af49506

Nonce

287,433,762

Timestamp

9/7/2017, 4:21:05 PM

Confirmations

4,552,089

Merkle Root

1c511d8f00af489a6543014e96bda012055d500990ba44bbd977c1611de9ad21
Transactions (2)
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.076 × 10⁹⁵(96-digit number)
10767112597532595076…47486434803690133601
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.076 × 10⁹⁵(96-digit number)
10767112597532595076…47486434803690133601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.153 × 10⁹⁵(96-digit number)
21534225195065190152…94972869607380267201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.306 × 10⁹⁵(96-digit number)
43068450390130380304…89945739214760534401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.613 × 10⁹⁵(96-digit number)
86136900780260760608…79891478429521068801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.722 × 10⁹⁶(97-digit number)
17227380156052152121…59782956859042137601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.445 × 10⁹⁶(97-digit number)
34454760312104304243…19565913718084275201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.890 × 10⁹⁶(97-digit number)
68909520624208608486…39131827436168550401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.378 × 10⁹⁷(98-digit number)
13781904124841721697…78263654872337100801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.756 × 10⁹⁷(98-digit number)
27563808249683443394…56527309744674201601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.512 × 10⁹⁷(98-digit number)
55127616499366886789…13054619489348403201
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,953,685 XPM·at block #6,838,677 · 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