Block #333,373

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/28/2013, 5:59:59 PM · Difficulty 10.1625 · 6,493,615 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3fda5a485f992c752df8741a180e205c09b079e21b1a80081085c3cf36ce7aa7

Height

#333,373

Difficulty

10.162465

Transactions

5

Size

1.51 KB

Version

2

Bits

0a299750

Nonce

204,116

Timestamp

12/28/2013, 5:59:59 PM

Confirmations

6,493,615

Merkle Root

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

7.011 × 10⁹⁹(100-digit number)
70114440710295240644…15581686406929520131
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
7.011 × 10⁹⁹(100-digit number)
70114440710295240644…15581686406929520131
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.402 × 10¹⁰⁰(101-digit number)
14022888142059048128…31163372813859040261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.804 × 10¹⁰⁰(101-digit number)
28045776284118096257…62326745627718080521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.609 × 10¹⁰⁰(101-digit number)
56091552568236192515…24653491255436161041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.121 × 10¹⁰¹(102-digit number)
11218310513647238503…49306982510872322081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.243 × 10¹⁰¹(102-digit number)
22436621027294477006…98613965021744644161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.487 × 10¹⁰¹(102-digit number)
44873242054588954012…97227930043489288321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.974 × 10¹⁰¹(102-digit number)
89746484109177908024…94455860086978576641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.794 × 10¹⁰²(103-digit number)
17949296821835581604…88911720173957153281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.589 × 10¹⁰²(103-digit number)
35898593643671163209…77823440347914306561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.179 × 10¹⁰²(103-digit number)
71797187287342326419…55646880695828613121
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,860,079 XPM·at block #6,826,987 · 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