Block #536,299

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2014, 8:47:33 AM · Difficulty 10.9090 · 6,297,180 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bd1b73fdca8b5ccd1b90887ce500266cb0a0c2edb8f57bc68bf6b35522466504

Height

#536,299

Difficulty

10.908998

Transactions

8

Size

1.89 KB

Version

2

Bits

0ae8b412

Nonce

39,106,683

Timestamp

5/11/2014, 8:47:33 AM

Confirmations

6,297,180

Merkle Root

3ef0589b3d5a393ee3551bf3fd2835158a2a956cf4e50b43d42c01545379c27c
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.881 × 10¹⁰⁰(101-digit number)
18816327227467095943…22919366569567027199
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.881 × 10¹⁰⁰(101-digit number)
18816327227467095943…22919366569567027199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.763 × 10¹⁰⁰(101-digit number)
37632654454934191887…45838733139134054399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.526 × 10¹⁰⁰(101-digit number)
75265308909868383774…91677466278268108799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.505 × 10¹⁰¹(102-digit number)
15053061781973676754…83354932556536217599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.010 × 10¹⁰¹(102-digit number)
30106123563947353509…66709865113072435199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.021 × 10¹⁰¹(102-digit number)
60212247127894707019…33419730226144870399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.204 × 10¹⁰²(103-digit number)
12042449425578941403…66839460452289740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.408 × 10¹⁰²(103-digit number)
24084898851157882807…33678920904579481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.816 × 10¹⁰²(103-digit number)
48169797702315765615…67357841809158963199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.633 × 10¹⁰²(103-digit number)
96339595404631531231…34715683618317926399
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,912,035 XPM·at block #6,833,478 · 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