Block #676,725

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/13/2014, 9:18:21 PM · Difficulty 10.9651 · 6,139,542 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c58c117d190ea9a2d1dc410e8b7c5f17d27b293b537b73315012af301c1bb391

Height

#676,725

Difficulty

10.965091

Transactions

1

Size

242 B

Version

2

Bits

0af7102c

Nonce

1,995,225,445

Timestamp

8/13/2014, 9:18:21 PM

Confirmations

6,139,542

Merkle Root

f28a56a3af30071a6f40b5c9d3de0f6da22b136e3c869753608af41c352eaa6a
Transactions (1)
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.

3.644 × 10⁹⁵(96-digit number)
36447968909786842773…15331276269132991001
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
3.644 × 10⁹⁵(96-digit number)
36447968909786842773…15331276269132991001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.289 × 10⁹⁵(96-digit number)
72895937819573685546…30662552538265982001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.457 × 10⁹⁶(97-digit number)
14579187563914737109…61325105076531964001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.915 × 10⁹⁶(97-digit number)
29158375127829474218…22650210153063928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.831 × 10⁹⁶(97-digit number)
58316750255658948437…45300420306127856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.166 × 10⁹⁷(98-digit number)
11663350051131789687…90600840612255712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.332 × 10⁹⁷(98-digit number)
23326700102263579374…81201681224511424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.665 × 10⁹⁷(98-digit number)
46653400204527158749…62403362449022848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.330 × 10⁹⁷(98-digit number)
93306800409054317499…24806724898045696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.866 × 10⁹⁸(99-digit number)
18661360081810863499…49613449796091392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.732 × 10⁹⁸(99-digit number)
37322720163621726999…99226899592182784001
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,774,250 XPM·at block #6,816,266 · 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