Block #263,071

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/17/2013, 11:22:58 AM · Difficulty 9.9671 · 6,544,842 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2b6d6544181c1efd89b786a94d151ca7b08026711d671befe03cbb754ebbf0cb

Height

#263,071

Difficulty

9.967078

Transactions

2

Size

1.68 KB

Version

2

Bits

09f7926d

Nonce

95,196

Timestamp

11/17/2013, 11:22:58 AM

Confirmations

6,544,842

Merkle Root

6e79c04dc46ddc352f47b2e234829ba45c742d974fb68afbba2dfdaa85c2d3ce
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.

4.154 × 10⁸⁸(89-digit number)
41540428760555662018…34294859375157590621
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
4.154 × 10⁸⁸(89-digit number)
41540428760555662018…34294859375157590621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.308 × 10⁸⁸(89-digit number)
83080857521111324036…68589718750315181241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.661 × 10⁸⁹(90-digit number)
16616171504222264807…37179437500630362481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.323 × 10⁸⁹(90-digit number)
33232343008444529614…74358875001260724961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.646 × 10⁸⁹(90-digit number)
66464686016889059228…48717750002521449921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.329 × 10⁹⁰(91-digit number)
13292937203377811845…97435500005042899841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.658 × 10⁹⁰(91-digit number)
26585874406755623691…94871000010085799681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.317 × 10⁹⁰(91-digit number)
53171748813511247383…89742000020171599361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.063 × 10⁹¹(92-digit number)
10634349762702249476…79484000040343198721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.126 × 10⁹¹(92-digit number)
21268699525404498953…58968000080686397441
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,707,339 XPM·at block #6,807,912 · 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