Block #281,504

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/29/2013, 1:20:47 AM · Difficulty 9.9772 · 6,534,781 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f5f0ab40956c2dfbf9828519e95413b60a5e1e96d806f1347ba3ba6a178c2fcc

Height

#281,504

Difficulty

9.977170

Transactions

3

Size

5.26 KB

Version

2

Bits

09fa27d1

Nonce

288,461

Timestamp

11/29/2013, 1:20:47 AM

Confirmations

6,534,781

Merkle Root

cc3802611d59cee66a0e5a4a9378f65d1066cf4b7b46c89f87fa5f10eb52df04
Transactions (3)
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.427 × 10⁹⁶(97-digit number)
14275580034156367664…66600867876691215999
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.427 × 10⁹⁶(97-digit number)
14275580034156367664…66600867876691215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.855 × 10⁹⁶(97-digit number)
28551160068312735329…33201735753382431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.710 × 10⁹⁶(97-digit number)
57102320136625470659…66403471506764863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.142 × 10⁹⁷(98-digit number)
11420464027325094131…32806943013529727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.284 × 10⁹⁷(98-digit number)
22840928054650188263…65613886027059455999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.568 × 10⁹⁷(98-digit number)
45681856109300376527…31227772054118911999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.136 × 10⁹⁷(98-digit number)
91363712218600753055…62455544108237823999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.827 × 10⁹⁸(99-digit number)
18272742443720150611…24911088216475647999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.654 × 10⁹⁸(99-digit number)
36545484887440301222…49822176432951295999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.309 × 10⁹⁸(99-digit number)
73090969774880602444…99644352865902591999
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,774,396 XPM·at block #6,816,284 · 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