Block #530,745

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/8/2014, 1:39:19 AM · Difficulty 10.8930 · 6,286,996 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f338f8d63010ab2afee9080c3ce2f6ff41d73251fc8ad5e9e08949471e810737

Height

#530,745

Difficulty

10.892977

Transactions

11

Size

2.81 KB

Version

2

Bits

0ae49a25

Nonce

67,725,255

Timestamp

5/8/2014, 1:39:19 AM

Confirmations

6,286,996

Merkle Root

198dc8d3a01827ba900036da3c91d91257bdd9e14824e3a55897d02c3857b6dc
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.355 × 10¹⁰¹(102-digit number)
13559882099323412609…67457968152200683519
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.355 × 10¹⁰¹(102-digit number)
13559882099323412609…67457968152200683519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.711 × 10¹⁰¹(102-digit number)
27119764198646825218…34915936304401367039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.423 × 10¹⁰¹(102-digit number)
54239528397293650436…69831872608802734079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.084 × 10¹⁰²(103-digit number)
10847905679458730087…39663745217605468159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.169 × 10¹⁰²(103-digit number)
21695811358917460174…79327490435210936319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.339 × 10¹⁰²(103-digit number)
43391622717834920348…58654980870421872639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.678 × 10¹⁰²(103-digit number)
86783245435669840697…17309961740843745279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.735 × 10¹⁰³(104-digit number)
17356649087133968139…34619923481687490559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.471 × 10¹⁰³(104-digit number)
34713298174267936279…69239846963374981119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.942 × 10¹⁰³(104-digit number)
69426596348535872558…38479693926749962239
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,785,982 XPM·at block #6,817,740 · 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