Block #589,639

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/15/2014, 3:26:28 PM · Difficulty 10.9474 · 6,227,054 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4770fb91b68a97400263773818e91a391532352947bcf3d450c36b4ed0793d00

Height

#589,639

Difficulty

10.947353

Transactions

1

Size

564 B

Version

2

Bits

0af285bd

Nonce

92,204

Timestamp

6/15/2014, 3:26:28 PM

Confirmations

6,227,054

Merkle Root

afff18ad999cf8240b5bfc390e3b2702b620f63ef3f324387735d0583aba5449
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.

7.535 × 10¹⁰¹(102-digit number)
75350433663197450671…98935461228260776961
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
7.535 × 10¹⁰¹(102-digit number)
75350433663197450671…98935461228260776961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.507 × 10¹⁰²(103-digit number)
15070086732639490134…97870922456521553921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.014 × 10¹⁰²(103-digit number)
30140173465278980268…95741844913043107841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.028 × 10¹⁰²(103-digit number)
60280346930557960537…91483689826086215681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.205 × 10¹⁰³(104-digit number)
12056069386111592107…82967379652172431361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.411 × 10¹⁰³(104-digit number)
24112138772223184214…65934759304344862721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.822 × 10¹⁰³(104-digit number)
48224277544446368429…31869518608689725441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.644 × 10¹⁰³(104-digit number)
96448555088892736859…63739037217379450881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.928 × 10¹⁰⁴(105-digit number)
19289711017778547371…27478074434758901761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.857 × 10¹⁰⁴(105-digit number)
38579422035557094743…54956148869517803521
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,777,666 XPM·at block #6,816,692 · 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