Block #536,973

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2014, 3:41:34 PM · Difficulty 10.9136 · 6,273,253 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8c505e3ea189043f7a5df8c6d62569fbb6be4a3821033ea8c88b902ae8cef30d

Height

#536,973

Difficulty

10.913600

Transactions

8

Size

5.19 KB

Version

2

Bits

0ae9e1b0

Nonce

17,406,576

Timestamp

5/11/2014, 3:41:34 PM

Confirmations

6,273,253

Merkle Root

4e35332fb13e0b85e8fdf84344b1447459e52e9f96d6820bd5aeb1655239f023
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.

7.740 × 10⁹⁸(99-digit number)
77406815045561314845…74394421086183241119
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
7.740 × 10⁹⁸(99-digit number)
77406815045561314845…74394421086183241119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.548 × 10⁹⁹(100-digit number)
15481363009112262969…48788842172366482239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.096 × 10⁹⁹(100-digit number)
30962726018224525938…97577684344732964479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.192 × 10⁹⁹(100-digit number)
61925452036449051876…95155368689465928959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.238 × 10¹⁰⁰(101-digit number)
12385090407289810375…90310737378931857919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.477 × 10¹⁰⁰(101-digit number)
24770180814579620750…80621474757863715839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.954 × 10¹⁰⁰(101-digit number)
49540361629159241500…61242949515727431679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.908 × 10¹⁰⁰(101-digit number)
99080723258318483001…22485899031454863359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.981 × 10¹⁰¹(102-digit number)
19816144651663696600…44971798062909726719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.963 × 10¹⁰¹(102-digit number)
39632289303327393200…89943596125819453439
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,725,884 XPM·at block #6,810,225 · 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