Block #610,968

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/1/2014, 11:14:34 PM · Difficulty 10.9197 · 6,199,263 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d28c09a6bcaa7fd16759a20a86575f7c93081872d3c455722e033a11e77e602c

Height

#610,968

Difficulty

10.919746

Transactions

7

Size

2.79 KB

Version

2

Bits

0aeb7478

Nonce

331,230,806

Timestamp

7/1/2014, 11:14:34 PM

Confirmations

6,199,263

Merkle Root

542ecfc1942895bb93c14d2bf16e2491cefef36eeb436d4b5bd5c9a8e078ac4b
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.

1.445 × 10⁹⁵(96-digit number)
14452519862847897892…71319206179152632801
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
1.445 × 10⁹⁵(96-digit number)
14452519862847897892…71319206179152632801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.890 × 10⁹⁵(96-digit number)
28905039725695795784…42638412358305265601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.781 × 10⁹⁵(96-digit number)
57810079451391591569…85276824716610531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.156 × 10⁹⁶(97-digit number)
11562015890278318313…70553649433221062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.312 × 10⁹⁶(97-digit number)
23124031780556636627…41107298866442124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.624 × 10⁹⁶(97-digit number)
46248063561113273255…82214597732884249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.249 × 10⁹⁶(97-digit number)
92496127122226546511…64429195465768499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.849 × 10⁹⁷(98-digit number)
18499225424445309302…28858390931536998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.699 × 10⁹⁷(98-digit number)
36998450848890618604…57716781863073996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.399 × 10⁹⁷(98-digit number)
73996901697781237209…15433563726147993601
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,725,925 XPM·at block #6,810,230 · 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