Block #521,335

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2014, 10:01:00 AM · Difficulty 10.8618 · 6,285,470 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9840ab6df29a95d8824e751421747210913f224693d2c682418de1e21f37b892

Height

#521,335

Difficulty

10.861768

Transactions

3

Size

955 B

Version

2

Bits

0adc9cd4

Nonce

138,763,035

Timestamp

5/2/2014, 10:01:00 AM

Confirmations

6,285,470

Merkle Root

672a94a9c88f493ac5ea92adc2e233d12ac4314fd855f8470bff6f10f3f89a7c
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.240 × 10⁹⁸(99-digit number)
42403522418515854372…14042127932974082839
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.240 × 10⁹⁸(99-digit number)
42403522418515854372…14042127932974082839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.480 × 10⁹⁸(99-digit number)
84807044837031708745…28084255865948165679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.696 × 10⁹⁹(100-digit number)
16961408967406341749…56168511731896331359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.392 × 10⁹⁹(100-digit number)
33922817934812683498…12337023463792662719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.784 × 10⁹⁹(100-digit number)
67845635869625366996…24674046927585325439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.356 × 10¹⁰⁰(101-digit number)
13569127173925073399…49348093855170650879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.713 × 10¹⁰⁰(101-digit number)
27138254347850146798…98696187710341301759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.427 × 10¹⁰⁰(101-digit number)
54276508695700293596…97392375420682603519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.085 × 10¹⁰¹(102-digit number)
10855301739140058719…94784750841365207039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.171 × 10¹⁰¹(102-digit number)
21710603478280117438…89569501682730414079
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,698,540 XPM·at block #6,806,804 · 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