Block #677,342

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/14/2014, 8:41:08 AM · Difficulty 10.9647 · 6,136,670 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5b156790b2ddc0ee0d12e2963a9babed4e110975af05e1e6440159a4ae516570

Height

#677,342

Difficulty

10.964658

Transactions

1

Size

243 B

Version

2

Bits

0af6f3d2

Nonce

2,318,064,472

Timestamp

8/14/2014, 8:41:08 AM

Confirmations

6,136,670

Merkle Root

2c6d79516cd2937b83a7723e228fc13f15892e58541f213a69f60372a296ff80
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.

9.519 × 10⁹⁵(96-digit number)
95190246410254083420…06776479095085851521
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
9.519 × 10⁹⁵(96-digit number)
95190246410254083420…06776479095085851521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.903 × 10⁹⁶(97-digit number)
19038049282050816684…13552958190171703041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.807 × 10⁹⁶(97-digit number)
38076098564101633368…27105916380343406081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.615 × 10⁹⁶(97-digit number)
76152197128203266736…54211832760686812161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.523 × 10⁹⁷(98-digit number)
15230439425640653347…08423665521373624321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.046 × 10⁹⁷(98-digit number)
30460878851281306694…16847331042747248641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.092 × 10⁹⁷(98-digit number)
60921757702562613389…33694662085494497281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.218 × 10⁹⁸(99-digit number)
12184351540512522677…67389324170988994561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.436 × 10⁹⁸(99-digit number)
24368703081025045355…34778648341977989121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.873 × 10⁹⁸(99-digit number)
48737406162050090711…69557296683955978241
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,756,179 XPM·at block #6,814,011 · 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