Block #673,910

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/11/2014, 9:32:15 PM · Difficulty 10.9654 · 6,136,230 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e3d74529cc8489bc1dd446717e58b3600e12762652bcae4480dea136fe8ba258

Height

#673,910

Difficulty

10.965358

Transactions

9

Size

2.26 KB

Version

2

Bits

0af721b8

Nonce

1,681,310,946

Timestamp

8/11/2014, 9:32:15 PM

Confirmations

6,136,230

Merkle Root

8ee8533850746b6de821ecea9f33b276be7ca46953641b87f70035522c528caa
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.081 × 10⁹⁸(99-digit number)
20811659666682579499…83750492364462008321
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.081 × 10⁹⁸(99-digit number)
20811659666682579499…83750492364462008321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.162 × 10⁹⁸(99-digit number)
41623319333365158998…67500984728924016641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.324 × 10⁹⁸(99-digit number)
83246638666730317996…35001969457848033281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.664 × 10⁹⁹(100-digit number)
16649327733346063599…70003938915696066561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.329 × 10⁹⁹(100-digit number)
33298655466692127198…40007877831392133121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.659 × 10⁹⁹(100-digit number)
66597310933384254397…80015755662784266241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.331 × 10¹⁰⁰(101-digit number)
13319462186676850879…60031511325568532481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.663 × 10¹⁰⁰(101-digit number)
26638924373353701758…20063022651137064961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.327 × 10¹⁰⁰(101-digit number)
53277848746707403517…40126045302274129921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.065 × 10¹⁰¹(102-digit number)
10655569749341480703…80252090604548259841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.131 × 10¹⁰¹(102-digit number)
21311139498682961407…60504181209096519681
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,725,188 XPM·at block #6,810,139 · 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