Block #529,638

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2014, 9:10:16 AM · Difficulty 10.8904 · 6,278,422 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e9b0a6838a12f51450f6027bf369e227b63b5c83f4c9dff9ece56dde35db48e

Height

#529,638

Difficulty

10.890400

Transactions

3

Size

662 B

Version

2

Bits

0ae3f13e

Nonce

21,739,165

Timestamp

5/7/2014, 9:10:16 AM

Confirmations

6,278,422

Merkle Root

1774e2396a991325610d26060545343eca7ff05f878b4ec515f8aa083600963d
Transactions (3)
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.

4.646 × 10⁹⁸(99-digit number)
46465518016936013252…87804096974000913679
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
4.646 × 10⁹⁸(99-digit number)
46465518016936013252…87804096974000913679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.293 × 10⁹⁸(99-digit number)
92931036033872026504…75608193948001827359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.858 × 10⁹⁹(100-digit number)
18586207206774405300…51216387896003654719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.717 × 10⁹⁹(100-digit number)
37172414413548810601…02432775792007309439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.434 × 10⁹⁹(100-digit number)
74344828827097621203…04865551584014618879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.486 × 10¹⁰⁰(101-digit number)
14868965765419524240…09731103168029237759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.973 × 10¹⁰⁰(101-digit number)
29737931530839048481…19462206336058475519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.947 × 10¹⁰⁰(101-digit number)
59475863061678096962…38924412672116951039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.189 × 10¹⁰¹(102-digit number)
11895172612335619392…77848825344233902079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.379 × 10¹⁰¹(102-digit number)
23790345224671238785…55697650688467804159
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,708,524 XPM·at block #6,808,059 · 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