Block #482,843

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/9/2014, 5:49:25 PM · Difficulty 10.5507 · 6,324,008 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
364bb94e98dde703c45a63c96fb1400a53c7f4176afd469e58246e1085b2d741

Height

#482,843

Difficulty

10.550744

Transactions

2

Size

1.68 KB

Version

2

Bits

0a8cfd87

Nonce

184,955

Timestamp

4/9/2014, 5:49:25 PM

Confirmations

6,324,008

Merkle Root

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

2.785 × 10⁹⁹(100-digit number)
27850638352153214889…31716209497086926241
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
2.785 × 10⁹⁹(100-digit number)
27850638352153214889…31716209497086926241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.570 × 10⁹⁹(100-digit number)
55701276704306429778…63432418994173852481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.114 × 10¹⁰⁰(101-digit number)
11140255340861285955…26864837988347704961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.228 × 10¹⁰⁰(101-digit number)
22280510681722571911…53729675976695409921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.456 × 10¹⁰⁰(101-digit number)
44561021363445143822…07459351953390819841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.912 × 10¹⁰⁰(101-digit number)
89122042726890287645…14918703906781639681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.782 × 10¹⁰¹(102-digit number)
17824408545378057529…29837407813563279361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.564 × 10¹⁰¹(102-digit number)
35648817090756115058…59674815627126558721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.129 × 10¹⁰¹(102-digit number)
71297634181512230116…19349631254253117441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.425 × 10¹⁰²(103-digit number)
14259526836302446023…38699262508506234881
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,698,913 XPM·at block #6,806,850 · 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.

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