Block #530,143

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/7/2014, 5:06:22 PM · Difficulty 10.8913 · 6,277,952 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1e14e6829f74c26e7c3263f7d815fe175607098e4a60d6f4534c3d7925d69f02

Height

#530,143

Difficulty

10.891263

Transactions

1

Size

561 B

Version

2

Bits

0ae429d1

Nonce

152,661

Timestamp

5/7/2014, 5:06:22 PM

Confirmations

6,277,952

Merkle Root

ea237c6b9c71ba87b0fc8d13a73a59498e8b477f2698482ef51768d192dcc05f
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.

5.056 × 10⁹⁴(95-digit number)
50563766209800709385…27826439511032764801
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
5.056 × 10⁹⁴(95-digit number)
50563766209800709385…27826439511032764801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.011 × 10⁹⁵(96-digit number)
10112753241960141877…55652879022065529601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.022 × 10⁹⁵(96-digit number)
20225506483920283754…11305758044131059201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.045 × 10⁹⁵(96-digit number)
40451012967840567508…22611516088262118401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.090 × 10⁹⁵(96-digit number)
80902025935681135016…45223032176524236801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.618 × 10⁹⁶(97-digit number)
16180405187136227003…90446064353048473601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.236 × 10⁹⁶(97-digit number)
32360810374272454006…80892128706096947201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.472 × 10⁹⁶(97-digit number)
64721620748544908013…61784257412193894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.294 × 10⁹⁷(98-digit number)
12944324149708981602…23568514824387788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.588 × 10⁹⁷(98-digit number)
25888648299417963205…47137029648775577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.177 × 10⁹⁷(98-digit number)
51777296598835926410…94274059297551155201
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,708,806 XPM·at block #6,808,094 · 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