Block #678,211

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/15/2014, 12:51:56 AM · Difficulty 10.9640 · 6,131,127 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e16d0263feac271247fc20592b44f8517a0d40932e8c5a666df31258e18027a8

Height

#678,211

Difficulty

10.963982

Transactions

10

Size

3.06 KB

Version

2

Bits

0af6c781

Nonce

144,829,910

Timestamp

8/15/2014, 12:51:56 AM

Confirmations

6,131,127

Merkle Root

fb36c844f92938810e23d32ebf4e93fac38bf999441a1214b1ed80c6bc0cd46e
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.454 × 10⁹⁷(98-digit number)
24546881536545168020…02611484123250606081
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.454 × 10⁹⁷(98-digit number)
24546881536545168020…02611484123250606081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.909 × 10⁹⁷(98-digit number)
49093763073090336041…05222968246501212161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.818 × 10⁹⁷(98-digit number)
98187526146180672083…10445936493002424321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.963 × 10⁹⁸(99-digit number)
19637505229236134416…20891872986004848641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.927 × 10⁹⁸(99-digit number)
39275010458472268833…41783745972009697281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.855 × 10⁹⁸(99-digit number)
78550020916944537667…83567491944019394561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.571 × 10⁹⁹(100-digit number)
15710004183388907533…67134983888038789121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.142 × 10⁹⁹(100-digit number)
31420008366777815066…34269967776077578241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.284 × 10⁹⁹(100-digit number)
62840016733555630133…68539935552155156481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.256 × 10¹⁰⁰(101-digit number)
12568003346711126026…37079871104310312961
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,718,769 XPM·at block #6,809,337 · 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.

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