Block #679,082

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/15/2014, 5:06:29 PM · Difficulty 10.9633 · 6,147,266 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd913e05b8cb144ea42402d5ee0c131cd24c0c8428f783c61f72ac746bb7b027

Height

#679,082

Difficulty

10.963265

Transactions

3

Size

626 B

Version

2

Bits

0af6988c

Nonce

764,380,301

Timestamp

8/15/2014, 5:06:29 PM

Confirmations

6,147,266

Merkle Root

a2032bf8ce0d72596a3dd323ce1a7d4c2cfb8e6b0504e9128e68278b345b24a8
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.280 × 10⁹⁶(97-digit number)
32806490873949748785…35777455808152934401
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.280 × 10⁹⁶(97-digit number)
32806490873949748785…35777455808152934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.561 × 10⁹⁶(97-digit number)
65612981747899497570…71554911616305868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.312 × 10⁹⁷(98-digit number)
13122596349579899514…43109823232611737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.624 × 10⁹⁷(98-digit number)
26245192699159799028…86219646465223475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.249 × 10⁹⁷(98-digit number)
52490385398319598056…72439292930446950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.049 × 10⁹⁸(99-digit number)
10498077079663919611…44878585860893900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.099 × 10⁹⁸(99-digit number)
20996154159327839222…89757171721787801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.199 × 10⁹⁸(99-digit number)
41992308318655678445…79514343443575603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.398 × 10⁹⁸(99-digit number)
83984616637311356890…59028686887151206401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.679 × 10⁹⁹(100-digit number)
16796923327462271378…18057373774302412801
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,854,928 XPM·at block #6,826,347 · 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