Block #672,066

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/10/2014, 4:46:44 PM · Difficulty 10.9645 · 6,158,667 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f7fd2a3689c5b14e9bb29e70faeeb6e2efc36d8492e8565ff518586f06c2af40

Height

#672,066

Difficulty

10.964471

Transactions

7

Size

2.25 KB

Version

2

Bits

0af6e794

Nonce

109,408,773

Timestamp

8/10/2014, 4:46:44 PM

Confirmations

6,158,667

Merkle Root

90aee4a78135a2baaa72c8feaa0bde9efc16c6b67e5a486a0850e45cf50ab5a5
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.

5.085 × 10⁹⁵(96-digit number)
50851978875582392468…42005506164659658241
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
5.085 × 10⁹⁵(96-digit number)
50851978875582392468…42005506164659658241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.017 × 10⁹⁶(97-digit number)
10170395775116478493…84011012329319316481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.034 × 10⁹⁶(97-digit number)
20340791550232956987…68022024658638632961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.068 × 10⁹⁶(97-digit number)
40681583100465913974…36044049317277265921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.136 × 10⁹⁶(97-digit number)
81363166200931827949…72088098634554531841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.627 × 10⁹⁷(98-digit number)
16272633240186365589…44176197269109063681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.254 × 10⁹⁷(98-digit number)
32545266480372731179…88352394538218127361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.509 × 10⁹⁷(98-digit number)
65090532960745462359…76704789076436254721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.301 × 10⁹⁸(99-digit number)
13018106592149092471…53409578152872509441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.603 × 10⁹⁸(99-digit number)
26036213184298184943…06819156305745018881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.207 × 10⁹⁸(99-digit number)
52072426368596369887…13638312611490037761
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,890,000 XPM·at block #6,830,732 · 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