Block #502,982

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 6:53:25 PM · Difficulty 10.8085 · 6,314,956 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f783404d3dd5540f4d80ade8bff55e92c2a5882ac144b8dd5dbdc556dff19a5c

Height

#502,982

Difficulty

10.808483

Transactions

8

Size

1.75 KB

Version

2

Bits

0acef8bd

Nonce

1,041,386

Timestamp

4/20/2014, 6:53:25 PM

Confirmations

6,314,956

Merkle Root

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

3.512 × 10⁹⁸(99-digit number)
35129127959085850748…92882268888950893441
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
3.512 × 10⁹⁸(99-digit number)
35129127959085850748…92882268888950893441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.025 × 10⁹⁸(99-digit number)
70258255918171701496…85764537777901786881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.405 × 10⁹⁹(100-digit number)
14051651183634340299…71529075555803573761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.810 × 10⁹⁹(100-digit number)
28103302367268680598…43058151111607147521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.620 × 10⁹⁹(100-digit number)
56206604734537361196…86116302223214295041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.124 × 10¹⁰⁰(101-digit number)
11241320946907472239…72232604446428590081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.248 × 10¹⁰⁰(101-digit number)
22482641893814944478…44465208892857180161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.496 × 10¹⁰⁰(101-digit number)
44965283787629888957…88930417785714360321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.993 × 10¹⁰⁰(101-digit number)
89930567575259777914…77860835571428720641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.798 × 10¹⁰¹(102-digit number)
17986113515051955582…55721671142857441281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.597 × 10¹⁰¹(102-digit number)
35972227030103911165…11443342285714882561
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,787,569 XPM·at block #6,817,937 · 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