Block #277,289

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/27/2013, 12:36:41 PM · Difficulty 9.9658 · 6,540,471 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
096741551e4a8488633f2fdc1d552cc658d760ce911fd3f027e1917121ad0a06

Height

#277,289

Difficulty

9.965810

Transactions

7

Size

12.20 KB

Version

2

Bits

09f73f53

Nonce

893

Timestamp

11/27/2013, 12:36:41 PM

Confirmations

6,540,471

Merkle Root

fa23dcdbc3d4468d7e29633a3601337e27c4af514ec04380ba15ee9cc09800b0
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.230 × 10¹⁰⁴(105-digit number)
32307847866476497407…55885116673642150399
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.230 × 10¹⁰⁴(105-digit number)
32307847866476497407…55885116673642150399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.461 × 10¹⁰⁴(105-digit number)
64615695732952994815…11770233347284300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.292 × 10¹⁰⁵(106-digit number)
12923139146590598963…23540466694568601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.584 × 10¹⁰⁵(106-digit number)
25846278293181197926…47080933389137203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.169 × 10¹⁰⁵(106-digit number)
51692556586362395852…94161866778274406399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.033 × 10¹⁰⁶(107-digit number)
10338511317272479170…88323733556548812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.067 × 10¹⁰⁶(107-digit number)
20677022634544958341…76647467113097625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.135 × 10¹⁰⁶(107-digit number)
41354045269089916682…53294934226195251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.270 × 10¹⁰⁶(107-digit number)
82708090538179833364…06589868452390502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.654 × 10¹⁰⁷(108-digit number)
16541618107635966672…13179736904781004799
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,786,135 XPM·at block #6,817,759 · 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