Block #521,105

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2014, 6:50:35 AM · Difficulty 10.8607 · 6,309,398 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bf0bb7949720c937e2a7039f265475825491c02a6d74493c5fd24b6895fe7d40

Height

#521,105

Difficulty

10.860665

Transactions

3

Size

4.69 KB

Version

2

Bits

0adc5488

Nonce

76,065

Timestamp

5/2/2014, 6:50:35 AM

Confirmations

6,309,398

Merkle Root

70bb365be167d7ac2b1d13337447e403b2418c74324c38f514aed0926c38b002
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.

3.278 × 10¹⁰¹(102-digit number)
32789230288115987860…47561060525723583999
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
3.278 × 10¹⁰¹(102-digit number)
32789230288115987860…47561060525723583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.557 × 10¹⁰¹(102-digit number)
65578460576231975720…95122121051447167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.311 × 10¹⁰²(103-digit number)
13115692115246395144…90244242102894335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.623 × 10¹⁰²(103-digit number)
26231384230492790288…80488484205788671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.246 × 10¹⁰²(103-digit number)
52462768460985580576…60976968411577343999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.049 × 10¹⁰³(104-digit number)
10492553692197116115…21953936823154687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.098 × 10¹⁰³(104-digit number)
20985107384394232230…43907873646309375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.197 × 10¹⁰³(104-digit number)
41970214768788464461…87815747292618751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.394 × 10¹⁰³(104-digit number)
83940429537576928922…75631494585237503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.678 × 10¹⁰⁴(105-digit number)
16788085907515385784…51262989170475007999
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,888,274 XPM·at block #6,830,502 · 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