Block #480,285

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/8/2014, 5:26:50 AM · Difficulty 10.5145 · 6,328,601 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6a1aa4860a67cfa77a13078ae69cf79fdd34380d43a55daba2e98b3ddf0df267

Height

#480,285

Difficulty

10.514464

Transactions

7

Size

1.58 KB

Version

2

Bits

0a83b3e4

Nonce

28,506

Timestamp

4/8/2014, 5:26:50 AM

Confirmations

6,328,601

Merkle Root

11d8642f24ec8469cf3b2a97cbd1af5a7531d2b8759e5856f39b6f25907438d9
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.790 × 10¹⁰²(103-digit number)
37904443573609117244…82218353597468303361
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.790 × 10¹⁰²(103-digit number)
37904443573609117244…82218353597468303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.580 × 10¹⁰²(103-digit number)
75808887147218234489…64436707194936606721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.516 × 10¹⁰³(104-digit number)
15161777429443646897…28873414389873213441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.032 × 10¹⁰³(104-digit number)
30323554858887293795…57746828779746426881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.064 × 10¹⁰³(104-digit number)
60647109717774587591…15493657559492853761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.212 × 10¹⁰⁴(105-digit number)
12129421943554917518…30987315118985707521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.425 × 10¹⁰⁴(105-digit number)
24258843887109835036…61974630237971415041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.851 × 10¹⁰⁴(105-digit number)
48517687774219670073…23949260475942830081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.703 × 10¹⁰⁴(105-digit number)
97035375548439340146…47898520951885660161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.940 × 10¹⁰⁵(106-digit number)
19407075109687868029…95797041903771320321
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,715,138 XPM·at block #6,808,885 · 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