Block #677,092

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/14/2014, 4:27:20 AM · Difficulty 10.9647 · 6,137,760 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2c24b264e2e1953c5c147aaf94619fdf8167c71a6290eee2d79314100ec29b0b

Height

#677,092

Difficulty

10.964670

Transactions

1

Size

243 B

Version

2

Bits

0af6f4a0

Nonce

2,229,246,882

Timestamp

8/14/2014, 4:27:20 AM

Confirmations

6,137,760

Merkle Root

7608e123fb1e3ad62c38317290bd9e8adcc10ca3a445352157a6d2bd97577172
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.

1.291 × 10⁹⁶(97-digit number)
12912624098202369295…15395056833929855521
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.291 × 10⁹⁶(97-digit number)
12912624098202369295…15395056833929855521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.582 × 10⁹⁶(97-digit number)
25825248196404738590…30790113667859711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.165 × 10⁹⁶(97-digit number)
51650496392809477180…61580227335719422081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.033 × 10⁹⁷(98-digit number)
10330099278561895436…23160454671438844161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.066 × 10⁹⁷(98-digit number)
20660198557123790872…46320909342877688321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.132 × 10⁹⁷(98-digit number)
41320397114247581744…92641818685755376641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.264 × 10⁹⁷(98-digit number)
82640794228495163488…85283637371510753281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.652 × 10⁹⁸(99-digit number)
16528158845699032697…70567274743021506561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.305 × 10⁹⁸(99-digit number)
33056317691398065395…41134549486043013121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.611 × 10⁹⁸(99-digit number)
66112635382796130790…82269098972086026241
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,762,899 XPM·at block #6,814,851 · 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