Block #559,433

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2014, 4:57:37 AM · Difficulty 10.9644 · 6,267,571 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
abad5417edf14ae5e55cc5f2520d73f6b59577217f38e98ab69d0ec76ef51baa

Height

#559,433

Difficulty

10.964368

Transactions

10

Size

14.33 KB

Version

2

Bits

0af6e0cf

Nonce

43,742,223

Timestamp

5/24/2014, 4:57:37 AM

Confirmations

6,267,571

Merkle Root

1ea24ccf5027b74faafdf960b8d097840ab0cd81ebfa657fe81206a0c3621ba8
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.

5.555 × 10⁹⁶(97-digit number)
55558040743808060169…56189806908851711621
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
5.555 × 10⁹⁶(97-digit number)
55558040743808060169…56189806908851711621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.111 × 10⁹⁷(98-digit number)
11111608148761612033…12379613817703423241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.222 × 10⁹⁷(98-digit number)
22223216297523224067…24759227635406846481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.444 × 10⁹⁷(98-digit number)
44446432595046448135…49518455270813692961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.889 × 10⁹⁷(98-digit number)
88892865190092896271…99036910541627385921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.777 × 10⁹⁸(99-digit number)
17778573038018579254…98073821083254771841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.555 × 10⁹⁸(99-digit number)
35557146076037158508…96147642166509543681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.111 × 10⁹⁸(99-digit number)
71114292152074317017…92295284333019087361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.422 × 10⁹⁹(100-digit number)
14222858430414863403…84590568666038174721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.844 × 10⁹⁹(100-digit number)
28445716860829726806…69181137332076349441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.689 × 10⁹⁹(100-digit number)
56891433721659453613…38362274664152698881
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,860,208 XPM·at block #6,827,003 · 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