Block #646,299

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/24/2014, 6:28:13 PM · Difficulty 10.9524 · 6,171,487 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aed1b79fa9a9f79fe408367d9c74a82ad1cb081cc9ffe45b761b858f75ab0188

Height

#646,299

Difficulty

10.952355

Transactions

2

Size

434 B

Version

2

Bits

0af3cd84

Nonce

1,822,543,649

Timestamp

7/24/2014, 6:28:13 PM

Confirmations

6,171,487

Merkle Root

716217cbb561b74cd99d8ffd9dfcdeaf042f51afa74a9e683105d7a92ddf7acd
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.228 × 10⁹⁷(98-digit number)
22287633579621047580…30592976551221350401
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.228 × 10⁹⁷(98-digit number)
22287633579621047580…30592976551221350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.457 × 10⁹⁷(98-digit number)
44575267159242095161…61185953102442700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.915 × 10⁹⁷(98-digit number)
89150534318484190323…22371906204885401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.783 × 10⁹⁸(99-digit number)
17830106863696838064…44743812409770803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.566 × 10⁹⁸(99-digit number)
35660213727393676129…89487624819541606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.132 × 10⁹⁸(99-digit number)
71320427454787352259…78975249639083212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.426 × 10⁹⁹(100-digit number)
14264085490957470451…57950499278166425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.852 × 10⁹⁹(100-digit number)
28528170981914940903…15900998556332851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.705 × 10⁹⁹(100-digit number)
57056341963829881807…31801997112665702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.141 × 10¹⁰⁰(101-digit number)
11411268392765976361…63603994225331404801
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,786,346 XPM·at block #6,817,785 · 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