Block #506,533

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 4:03:53 AM · Difficulty 10.8135 · 6,320,834 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
547ecf091c8716ceb3502c6583f25d82d81a20bb8446cc927a0fa2b6dc4d6200

Height

#506,533

Difficulty

10.813460

Transactions

4

Size

886 B

Version

2

Bits

0ad03eeb

Nonce

11,666,047

Timestamp

4/23/2014, 4:03:53 AM

Confirmations

6,320,834

Merkle Root

3b7f33e9bedeed88faec7409da246582bd28852dc64a5ed5aa03cd85701d4112
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.

9.829 × 10¹⁰⁰(101-digit number)
98298428913025273439…35138892270530580481
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
9.829 × 10¹⁰⁰(101-digit number)
98298428913025273439…35138892270530580481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.965 × 10¹⁰¹(102-digit number)
19659685782605054687…70277784541061160961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.931 × 10¹⁰¹(102-digit number)
39319371565210109375…40555569082122321921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.863 × 10¹⁰¹(102-digit number)
78638743130420218751…81111138164244643841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.572 × 10¹⁰²(103-digit number)
15727748626084043750…62222276328489287681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.145 × 10¹⁰²(103-digit number)
31455497252168087500…24444552656978575361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.291 × 10¹⁰²(103-digit number)
62910994504336175001…48889105313957150721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.258 × 10¹⁰³(104-digit number)
12582198900867235000…97778210627914301441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.516 × 10¹⁰³(104-digit number)
25164397801734470000…95556421255828602881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.032 × 10¹⁰³(104-digit number)
50328795603468940001…91112842511657205761
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,863,037 XPM·at block #6,827,366 · 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