Block #575,880

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/4/2014, 5:48:33 AM · Difficulty 10.9686 · 6,239,163 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f6ea41a681cceeaaacb7aaaec6bf9e4202a8af3e7e1fb917cbb44b1b6efe2890

Height

#575,880

Difficulty

10.968572

Transactions

7

Size

2.25 KB

Version

2

Bits

0af7f453

Nonce

44,671,340

Timestamp

6/4/2014, 5:48:33 AM

Confirmations

6,239,163

Merkle Root

1d1b970b8ebff51d7d6e8c73e53432fadf077c619faac1e7a8f440c1143e8449
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.648 × 10⁹⁹(100-digit number)
16488187483918704700…87191015762012098561
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.648 × 10⁹⁹(100-digit number)
16488187483918704700…87191015762012098561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.297 × 10⁹⁹(100-digit number)
32976374967837409401…74382031524024197121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.595 × 10⁹⁹(100-digit number)
65952749935674818802…48764063048048394241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.319 × 10¹⁰⁰(101-digit number)
13190549987134963760…97528126096096788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.638 × 10¹⁰⁰(101-digit number)
26381099974269927520…95056252192193576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.276 × 10¹⁰⁰(101-digit number)
52762199948539855041…90112504384387153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.055 × 10¹⁰¹(102-digit number)
10552439989707971008…80225008768774307841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.110 × 10¹⁰¹(102-digit number)
21104879979415942016…60450017537548615681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.220 × 10¹⁰¹(102-digit number)
42209759958831884033…20900035075097231361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.441 × 10¹⁰¹(102-digit number)
84419519917663768066…41800070150194462721
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,764,433 XPM·at block #6,815,042 · 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