Block #273,450

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/25/2013, 7:36:04 PM · Difficulty 9.9549 · 6,516,632 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1f3f495e98fe18dfde0286554240764d26a920f96fb4fe278a35bdb0b544bb78

Height

#273,450

Difficulty

9.954897

Transactions

4

Size

1.40 KB

Version

2

Bits

09f47420

Nonce

26,136

Timestamp

11/25/2013, 7:36:04 PM

Confirmations

6,516,632

Merkle Root

044249afdb74a844c3baf340a31035d11f03cee43b38357509e545513af4f5ad
Transactions (4)
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.

1.475 × 10¹⁰³(104-digit number)
14755610190242778741…33480316428915847999
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
1.475 × 10¹⁰³(104-digit number)
14755610190242778741…33480316428915847999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.951 × 10¹⁰³(104-digit number)
29511220380485557483…66960632857831695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.902 × 10¹⁰³(104-digit number)
59022440760971114966…33921265715663391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.180 × 10¹⁰⁴(105-digit number)
11804488152194222993…67842531431326783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.360 × 10¹⁰⁴(105-digit number)
23608976304388445986…35685062862653567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.721 × 10¹⁰⁴(105-digit number)
47217952608776891973…71370125725307135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.443 × 10¹⁰⁴(105-digit number)
94435905217553783946…42740251450614271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.888 × 10¹⁰⁵(106-digit number)
18887181043510756789…85480502901228543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.777 × 10¹⁰⁵(106-digit number)
37774362087021513578…70961005802457087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.554 × 10¹⁰⁵(106-digit number)
75548724174043027157…41922011604914175999
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,564,628 XPM·at block #6,790,081 · updates every 60s