Block #473,771

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/4/2014, 3:47:35 AM · Difficulty 10.4454 · 6,342,515 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9285667dd4603832ca1e38fd4f449e006fc17aa1b45fb0eea6b5ed2ec2b6f9b5

Height

#473,771

Difficulty

10.445399

Transactions

2

Size

1.23 KB

Version

2

Bits

0a7205ad

Nonce

510,825

Timestamp

4/4/2014, 3:47:35 AM

Confirmations

6,342,515

Merkle Root

abb7b58173f76dcd1ce5ea39692cbe58b555f471dea812736bbcdd479f5b7155
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.693 × 10¹⁰³(104-digit number)
26933166990568410438…79662598401565667841
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.693 × 10¹⁰³(104-digit number)
26933166990568410438…79662598401565667841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.386 × 10¹⁰³(104-digit number)
53866333981136820877…59325196803131335681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.077 × 10¹⁰⁴(105-digit number)
10773266796227364175…18650393606262671361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.154 × 10¹⁰⁴(105-digit number)
21546533592454728350…37300787212525342721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.309 × 10¹⁰⁴(105-digit number)
43093067184909456701…74601574425050685441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.618 × 10¹⁰⁴(105-digit number)
86186134369818913403…49203148850101370881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.723 × 10¹⁰⁵(106-digit number)
17237226873963782680…98406297700202741761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.447 × 10¹⁰⁵(106-digit number)
34474453747927565361…96812595400405483521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.894 × 10¹⁰⁵(106-digit number)
68948907495855130722…93625190800810967041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.378 × 10¹⁰⁶(107-digit number)
13789781499171026144…87250381601621934081
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,774,405 XPM·at block #6,816,285 · 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