Block #516,267

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 6:45:41 AM · Difficulty 10.8454 · 6,310,542 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
149b9bebcebc3ed921507035bbd1c7b8afbeaa180ef264bf4691889e3c298f39

Height

#516,267

Difficulty

10.845371

Transactions

2

Size

615 B

Version

2

Bits

0ad86a43

Nonce

39,902,627

Timestamp

4/29/2014, 6:45:41 AM

Confirmations

6,310,542

Merkle Root

05649fb7a31b744bedad2d594862e234cd08ed1d79b571884a4e804a7c212f25
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.526 × 10⁹⁹(100-digit number)
15263507423154002720…98084969228649866081
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.526 × 10⁹⁹(100-digit number)
15263507423154002720…98084969228649866081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.052 × 10⁹⁹(100-digit number)
30527014846308005441…96169938457299732161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.105 × 10⁹⁹(100-digit number)
61054029692616010882…92339876914599464321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.221 × 10¹⁰⁰(101-digit number)
12210805938523202176…84679753829198928641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.442 × 10¹⁰⁰(101-digit number)
24421611877046404352…69359507658397857281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.884 × 10¹⁰⁰(101-digit number)
48843223754092808705…38719015316795714561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.768 × 10¹⁰⁰(101-digit number)
97686447508185617411…77438030633591429121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.953 × 10¹⁰¹(102-digit number)
19537289501637123482…54876061267182858241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.907 × 10¹⁰¹(102-digit number)
39074579003274246964…09752122534365716481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.814 × 10¹⁰¹(102-digit number)
78149158006548493929…19504245068731432961
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,858,634 XPM·at block #6,826,808 · 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