Block #616,440

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/4/2014, 1:06:55 PM · Difficulty 10.9436 · 6,199,782 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c3392d3ee8d341463114a4b5fa35eeb444256d30117edd97969411e7ee63af23

Height

#616,440

Difficulty

10.943595

Transactions

2

Size

1018 B

Version

2

Bits

0af18f6a

Nonce

634,608

Timestamp

7/4/2014, 1:06:55 PM

Confirmations

6,199,782

Merkle Root

df1f55b02118372ab1c1dd50c8ddc12e03be9afb80b0282c084a642212ca3cb5
Transactions (2)
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.271 × 10⁹⁷(98-digit number)
12712705596314322531…71881677272759099361
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.271 × 10⁹⁷(98-digit number)
12712705596314322531…71881677272759099361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.542 × 10⁹⁷(98-digit number)
25425411192628645063…43763354545518198721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.085 × 10⁹⁷(98-digit number)
50850822385257290126…87526709091036397441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.017 × 10⁹⁸(99-digit number)
10170164477051458025…75053418182072794881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.034 × 10⁹⁸(99-digit number)
20340328954102916050…50106836364145589761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.068 × 10⁹⁸(99-digit number)
40680657908205832101…00213672728291179521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.136 × 10⁹⁸(99-digit number)
81361315816411664203…00427345456582359041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.627 × 10⁹⁹(100-digit number)
16272263163282332840…00854690913164718081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.254 × 10⁹⁹(100-digit number)
32544526326564665681…01709381826329436161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.508 × 10⁹⁹(100-digit number)
65089052653129331362…03418763652658872321
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,773,904 XPM·at block #6,816,221 · 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