Block #260,635

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/14/2013, 1:14:54 PM · Difficulty 9.9768 · 6,549,915 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
58aaeeb780808506db1dc0cbf27304b315910c46183b8f1129bb50d7905af6d0

Height

#260,635

Difficulty

9.976774

Transactions

4

Size

1.09 KB

Version

2

Bits

09fa0de4

Nonce

24,345

Timestamp

11/14/2013, 1:14:54 PM

Confirmations

6,549,915

Merkle Root

2443c7791e30a7ebae4c8dba8346e5281bba70b659813812a357fb7673aabca8
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.813 × 10⁹⁴(95-digit number)
18132678901682557325…87296772105796471079
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.813 × 10⁹⁴(95-digit number)
18132678901682557325…87296772105796471079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.626 × 10⁹⁴(95-digit number)
36265357803365114650…74593544211592942159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.253 × 10⁹⁴(95-digit number)
72530715606730229300…49187088423185884319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.450 × 10⁹⁵(96-digit number)
14506143121346045860…98374176846371768639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.901 × 10⁹⁵(96-digit number)
29012286242692091720…96748353692743537279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.802 × 10⁹⁵(96-digit number)
58024572485384183440…93496707385487074559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.160 × 10⁹⁶(97-digit number)
11604914497076836688…86993414770974149119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.320 × 10⁹⁶(97-digit number)
23209828994153673376…73986829541948298239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.641 × 10⁹⁶(97-digit number)
46419657988307346752…47973659083896596479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.283 × 10⁹⁶(97-digit number)
92839315976614693505…95947318167793192959
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,728,488 XPM·at block #6,810,549 · 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