Block #260,631

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/14/2013, 1:08:37 PM · Difficulty 9.9768 · 6,554,477 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f0abc9f124bdb87bdc50655a8c141ce8720038d455b486b6f323f061795c9fd5

Height

#260,631

Difficulty

9.976791

Transactions

1

Size

2.01 KB

Version

2

Bits

09fa0efa

Nonce

138,668

Timestamp

11/14/2013, 1:08:37 PM

Confirmations

6,554,477

Merkle Root

7ffb02f1f81d0d6c1264734ad79d27310bc33fed647814bd5ef3816712d5960d
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.

5.501 × 10⁹⁶(97-digit number)
55010107461455844257…93759322399723079041
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
5.501 × 10⁹⁶(97-digit number)
55010107461455844257…93759322399723079041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.100 × 10⁹⁷(98-digit number)
11002021492291168851…87518644799446158081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.200 × 10⁹⁷(98-digit number)
22004042984582337703…75037289598892316161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.400 × 10⁹⁷(98-digit number)
44008085969164675406…50074579197784632321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.801 × 10⁹⁷(98-digit number)
88016171938329350812…00149158395569264641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.760 × 10⁹⁸(99-digit number)
17603234387665870162…00298316791138529281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.520 × 10⁹⁸(99-digit number)
35206468775331740324…00596633582277058561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.041 × 10⁹⁸(99-digit number)
70412937550663480649…01193267164554117121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.408 × 10⁹⁹(100-digit number)
14082587510132696129…02386534329108234241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.816 × 10⁹⁹(100-digit number)
28165175020265392259…04773068658216468481
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,764,954 XPM·at block #6,815,107 · 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