Block #2,278,903

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/2/2017, 7:02:33 AM · Difficulty 10.9558 · 4,554,477 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
edbea53c1e3e527ca9e7232c57dcf0dc4995ab630ee47187cdac8065410b6ccf

Height

#2,278,903

Difficulty

10.955816

Transactions

2

Size

870 B

Version

2

Bits

0af4b057

Nonce

467,067,950

Timestamp

9/2/2017, 7:02:33 AM

Confirmations

4,554,477

Merkle Root

c412d1b9492c3b9cdafb0b40eb812b925bd3f496c6102b2a86f5648c20dce224
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.

2.352 × 10⁹⁶(97-digit number)
23529207414800713736…92816413658872284801
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
2.352 × 10⁹⁶(97-digit number)
23529207414800713736…92816413658872284801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.705 × 10⁹⁶(97-digit number)
47058414829601427473…85632827317744569601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.411 × 10⁹⁶(97-digit number)
94116829659202854946…71265654635489139201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.882 × 10⁹⁷(98-digit number)
18823365931840570989…42531309270978278401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.764 × 10⁹⁷(98-digit number)
37646731863681141978…85062618541956556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.529 × 10⁹⁷(98-digit number)
75293463727362283956…70125237083913113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.505 × 10⁹⁸(99-digit number)
15058692745472456791…40250474167826227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.011 × 10⁹⁸(99-digit number)
30117385490944913582…80500948335652454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.023 × 10⁹⁸(99-digit number)
60234770981889827165…61001896671304908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.204 × 10⁹⁹(100-digit number)
12046954196377965433…22003793342609817601
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,911,238 XPM·at block #6,833,379 · 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