Block #507,784

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2014, 11:06:13 PM · Difficulty 10.8175 · 6,317,510 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3e95fca77b953ab457908b21fc7789c234707dbb6febb010bd2be53da7a9c620

Height

#507,784

Difficulty

10.817466

Transactions

2

Size

1.98 KB

Version

2

Bits

0ad1456f

Nonce

80,953,697

Timestamp

4/23/2014, 11:06:13 PM

Confirmations

6,317,510

Merkle Root

f63dc3f687696bc5a2200463b401abe0e679bd343b397b26ce038135fd6d5983
Transactions (2)
1 in → 1 out8.5577 XPM116 B
12 in → 1 out3.5600 XPM1.78 KB
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.277 × 10⁹⁸(99-digit number)
22774164921281227476…19600474089070245801
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.277 × 10⁹⁸(99-digit number)
22774164921281227476…19600474089070245801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.554 × 10⁹⁸(99-digit number)
45548329842562454952…39200948178140491601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.109 × 10⁹⁸(99-digit number)
91096659685124909905…78401896356280983201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.821 × 10⁹⁹(100-digit number)
18219331937024981981…56803792712561966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.643 × 10⁹⁹(100-digit number)
36438663874049963962…13607585425123932801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.287 × 10⁹⁹(100-digit number)
72877327748099927924…27215170850247865601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.457 × 10¹⁰⁰(101-digit number)
14575465549619985584…54430341700495731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.915 × 10¹⁰⁰(101-digit number)
29150931099239971169…08860683400991462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.830 × 10¹⁰⁰(101-digit number)
58301862198479942339…17721366801982924801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.166 × 10¹⁰¹(102-digit number)
11660372439695988467…35442733603965849601
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,846,452 XPM·at block #6,825,293 · 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