Block #281,989

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/29/2013, 5:47:19 AM · Difficulty 9.9781 · 6,543,517 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6b00c1ab30b01e33e076e30b3c1035f10e6ba2161f2af27d653a1ec6f081994e

Height

#281,989

Difficulty

9.978148

Transactions

8

Size

10.67 KB

Version

2

Bits

09fa67e9

Nonce

52,807

Timestamp

11/29/2013, 5:47:19 AM

Confirmations

6,543,517

Merkle Root

437eb7654da65b45e706978ae82e4b80eb2567387066734201859a14a1d406d8
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.675 × 10⁹⁷(98-digit number)
36755456577188240623…18058275477098943999
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.675 × 10⁹⁷(98-digit number)
36755456577188240623…18058275477098943999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.351 × 10⁹⁷(98-digit number)
73510913154376481246…36116550954197887999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.470 × 10⁹⁸(99-digit number)
14702182630875296249…72233101908395775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.940 × 10⁹⁸(99-digit number)
29404365261750592498…44466203816791551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.880 × 10⁹⁸(99-digit number)
58808730523501184997…88932407633583103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.176 × 10⁹⁹(100-digit number)
11761746104700236999…77864815267166207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.352 × 10⁹⁹(100-digit number)
23523492209400473998…55729630534332415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.704 × 10⁹⁹(100-digit number)
47046984418800947997…11459261068664831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.409 × 10⁹⁹(100-digit number)
94093968837601895995…22918522137329663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.881 × 10¹⁰⁰(101-digit number)
18818793767520379199…45837044274659327999
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,848,145 XPM·at block #6,825,505 · 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