Block #475,590

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/5/2014, 7:59:49 AM · Difficulty 10.4595 · 6,320,584 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a2bc7cb9f12968fad95a3f589f158963eb7554e81eea5eddda9a5edbb34b4cde

Height

#475,590

Difficulty

10.459488

Transactions

2

Size

435 B

Version

2

Bits

0a75a0fd

Nonce

9,524

Timestamp

4/5/2014, 7:59:49 AM

Confirmations

6,320,584

Merkle Root

b85e6532a6d427ff3e5e786977946e3a91f96caa55e0f8e9e8cf88e082bc8665
Transactions (2)
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.

8.011 × 10¹⁰²(103-digit number)
80115087204280765572…83307399727665126401
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
8.011 × 10¹⁰²(103-digit number)
80115087204280765572…83307399727665126401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.602 × 10¹⁰³(104-digit number)
16023017440856153114…66614799455330252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.204 × 10¹⁰³(104-digit number)
32046034881712306228…33229598910660505601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.409 × 10¹⁰³(104-digit number)
64092069763424612457…66459197821321011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.281 × 10¹⁰⁴(105-digit number)
12818413952684922491…32918395642642022401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.563 × 10¹⁰⁴(105-digit number)
25636827905369844983…65836791285284044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.127 × 10¹⁰⁴(105-digit number)
51273655810739689966…31673582570568089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.025 × 10¹⁰⁵(106-digit number)
10254731162147937993…63347165141136179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.050 × 10¹⁰⁵(106-digit number)
20509462324295875986…26694330282272358401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.101 × 10¹⁰⁵(106-digit number)
41018924648591751973…53388660564544716801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.203 × 10¹⁰⁵(106-digit number)
82037849297183503946…06777321129089433601
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,613,391 XPM·at block #6,796,173 · 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.