Block #537,059

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/11/2014, 4:45:32 PM · Difficulty 10.9140 · 6,289,516 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e3b4e28e6610eaf07a69a339009f5e50121d0623d1e2a9ca924a693d3dad1eeb

Height

#537,059

Difficulty

10.913977

Transactions

6

Size

2.03 KB

Version

2

Bits

0ae9fa63

Nonce

168,496,380

Timestamp

5/11/2014, 4:45:32 PM

Confirmations

6,289,516

Merkle Root

577963feded551589c18a7c62a31fd76768118c1f2baea318b09ea476208ae36
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.439 × 10¹⁰⁰(101-digit number)
14390874738063541063…91858231315116216319
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.439 × 10¹⁰⁰(101-digit number)
14390874738063541063…91858231315116216319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.878 × 10¹⁰⁰(101-digit number)
28781749476127082127…83716462630232432639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.756 × 10¹⁰⁰(101-digit number)
57563498952254164254…67432925260464865279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.151 × 10¹⁰¹(102-digit number)
11512699790450832850…34865850520929730559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.302 × 10¹⁰¹(102-digit number)
23025399580901665701…69731701041859461119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.605 × 10¹⁰¹(102-digit number)
46050799161803331403…39463402083718922239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.210 × 10¹⁰¹(102-digit number)
92101598323606662807…78926804167437844479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.842 × 10¹⁰²(103-digit number)
18420319664721332561…57853608334875688959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.684 × 10¹⁰²(103-digit number)
36840639329442665123…15707216669751377919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.368 × 10¹⁰²(103-digit number)
73681278658885330246…31414433339502755839
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,856,749 XPM·at block #6,826,574 · 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