Block #506,722

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 6:42:10 AM · Difficulty 10.8146 · 6,303,616 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
736a15d8254410b6d95b173a59c783e67d7c261fad68f1bef046f1caff6fbdbb

Height

#506,722

Difficulty

10.814646

Transactions

10

Size

2.74 KB

Version

2

Bits

0ad08ca8

Nonce

635,969,311

Timestamp

4/23/2014, 6:42:10 AM

Confirmations

6,303,616

Merkle Root

fec1bd12d18c1f2ea7d7b0afb9b149f107b0ba3b013c93d151fbea5f44c58285
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.842 × 10⁹⁷(98-digit number)
18427700873923518969…77667307728215051801
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.842 × 10⁹⁷(98-digit number)
18427700873923518969…77667307728215051801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.685 × 10⁹⁷(98-digit number)
36855401747847037938…55334615456430103601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.371 × 10⁹⁷(98-digit number)
73710803495694075877…10669230912860207201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.474 × 10⁹⁸(99-digit number)
14742160699138815175…21338461825720414401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.948 × 10⁹⁸(99-digit number)
29484321398277630351…42676923651440828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.896 × 10⁹⁸(99-digit number)
58968642796555260702…85353847302881657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.179 × 10⁹⁹(100-digit number)
11793728559311052140…70707694605763315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.358 × 10⁹⁹(100-digit number)
23587457118622104280…41415389211526630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.717 × 10⁹⁹(100-digit number)
47174914237244208561…82830778423053260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.434 × 10⁹⁹(100-digit number)
94349828474488417123…65661556846106521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.886 × 10¹⁰⁰(101-digit number)
18869965694897683424…31323113692213043201
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,726,785 XPM·at block #6,810,337 · 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