Block #475,020

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2014, 11:08:19 PM · Difficulty 10.4554 · 6,333,939 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7479a0226e43499ca0afe714fd18e60363cbc09583d9388037692d187e9d01a3

Height

#475,020

Difficulty

10.455362

Transactions

7

Size

5.76 KB

Version

2

Bits

0a74929f

Nonce

42,547

Timestamp

4/4/2014, 11:08:19 PM

Confirmations

6,333,939

Merkle Root

122cdfe6f4ccaa65a5103c7d41e82bf429ca19d178caf0518df249a294cc43bf
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.

2.266 × 10¹⁰⁰(101-digit number)
22660611886997675665…24510769154214911999
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
2.266 × 10¹⁰⁰(101-digit number)
22660611886997675665…24510769154214911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.532 × 10¹⁰⁰(101-digit number)
45321223773995351331…49021538308429823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.064 × 10¹⁰⁰(101-digit number)
90642447547990702662…98043076616859647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.812 × 10¹⁰¹(102-digit number)
18128489509598140532…96086153233719295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.625 × 10¹⁰¹(102-digit number)
36256979019196281064…92172306467438591999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.251 × 10¹⁰¹(102-digit number)
72513958038392562129…84344612934877183999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.450 × 10¹⁰²(103-digit number)
14502791607678512425…68689225869754367999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.900 × 10¹⁰²(103-digit number)
29005583215357024851…37378451739508735999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.801 × 10¹⁰²(103-digit number)
58011166430714049703…74756903479017471999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.160 × 10¹⁰³(104-digit number)
11602233286142809940…49513806958034943999
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,715,725 XPM·at block #6,808,958 · 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