Block #559,995

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2014, 1:27:36 PM · Difficulty 10.9648 · 6,283,836 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fea1d08e889291c4a19f3db44d67c773bb25ee77671a34db935e16e5435d6cdb

Height

#559,995

Difficulty

10.964758

Transactions

11

Size

2.55 KB

Version

2

Bits

0af6fa63

Nonce

29,253,127

Timestamp

5/24/2014, 1:27:36 PM

Confirmations

6,283,836

Merkle Root

d34ce9ca9df37a85c533a5babff59c1176d897f3af647da967a0f83c8e74ccac
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.014 × 10⁹⁹(100-digit number)
10142708854568805286…51786929218451559999
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.014 × 10⁹⁹(100-digit number)
10142708854568805286…51786929218451559999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.028 × 10⁹⁹(100-digit number)
20285417709137610572…03573858436903119999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.057 × 10⁹⁹(100-digit number)
40570835418275221145…07147716873806239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.114 × 10⁹⁹(100-digit number)
81141670836550442291…14295433747612479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.622 × 10¹⁰⁰(101-digit number)
16228334167310088458…28590867495224959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.245 × 10¹⁰⁰(101-digit number)
32456668334620176916…57181734990449919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.491 × 10¹⁰⁰(101-digit number)
64913336669240353832…14363469980899839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.298 × 10¹⁰¹(102-digit number)
12982667333848070766…28726939961799679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.596 × 10¹⁰¹(102-digit number)
25965334667696141533…57453879923599359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.193 × 10¹⁰¹(102-digit number)
51930669335392283066…14907759847198719999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,995,024 XPM·at block #6,843,830 · 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