Block #323,258

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2013, 12:59:38 PM · Difficulty 10.2029 · 6,501,672 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
09826a6e4bb678359e9ae11fc0a009e4569e1dc9fec9157264ca43cbe3747323

Height

#323,258

Difficulty

10.202879

Transactions

4

Size

1.82 KB

Version

2

Bits

0a33efdf

Nonce

41,831

Timestamp

12/21/2013, 12:59:38 PM

Confirmations

6,501,672

Merkle Root

b61bc54cda5f1bab29e77ae9206498b4653d38230bc35c01af37b935d29a91be
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.534 × 10¹⁰¹(102-digit number)
45347301840057527559…93378347487854709761
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.534 × 10¹⁰¹(102-digit number)
45347301840057527559…93378347487854709761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.069 × 10¹⁰¹(102-digit number)
90694603680115055118…86756694975709419521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.813 × 10¹⁰²(103-digit number)
18138920736023011023…73513389951418839041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.627 × 10¹⁰²(103-digit number)
36277841472046022047…47026779902837678081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.255 × 10¹⁰²(103-digit number)
72555682944092044094…94053559805675356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.451 × 10¹⁰³(104-digit number)
14511136588818408818…88107119611350712321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.902 × 10¹⁰³(104-digit number)
29022273177636817637…76214239222701424641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.804 × 10¹⁰³(104-digit number)
58044546355273635275…52428478445402849281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.160 × 10¹⁰⁴(105-digit number)
11608909271054727055…04856956890805698561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.321 × 10¹⁰⁴(105-digit number)
23217818542109454110…09713913781611397121
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,843,516 XPM·at block #6,824,929 · 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