Block #507,870

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/24/2014, 12:43:25 AM · Difficulty 10.8171 · 6,306,352 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b529cee93b80349107f1364fa22bd19a887dbbc6d03a5b99ec6cc55ab8d2d4d5

Height

#507,870

Difficulty

10.817086

Transactions

7

Size

1.82 KB

Version

2

Bits

0ad12c94

Nonce

23,654,464

Timestamp

4/24/2014, 12:43:25 AM

Confirmations

6,306,352

Merkle Root

678c6330ee61581d4f4be0008cb8cb8ac92e51b018fb1926895b6046fd8b34ad
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.905 × 10⁹⁸(99-digit number)
29051584732782816922…90474167621442639361
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.905 × 10⁹⁸(99-digit number)
29051584732782816922…90474167621442639361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.810 × 10⁹⁸(99-digit number)
58103169465565633845…80948335242885278721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.162 × 10⁹⁹(100-digit number)
11620633893113126769…61896670485770557441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.324 × 10⁹⁹(100-digit number)
23241267786226253538…23793340971541114881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.648 × 10⁹⁹(100-digit number)
46482535572452507076…47586681943082229761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.296 × 10⁹⁹(100-digit number)
92965071144905014152…95173363886164459521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.859 × 10¹⁰⁰(101-digit number)
18593014228981002830…90346727772328919041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.718 × 10¹⁰⁰(101-digit number)
37186028457962005661…80693455544657838081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.437 × 10¹⁰⁰(101-digit number)
74372056915924011322…61386911089315676161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.487 × 10¹⁰¹(102-digit number)
14874411383184802264…22773822178631352321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.974 × 10¹⁰¹(102-digit number)
29748822766369604528…45547644357262704641
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,757,845 XPM·at block #6,814,221 · 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