Block #338,381

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/1/2014, 9:56:09 AM · Difficulty 10.1186 · 6,476,670 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
27e4fabab8e9f7d8ac8b380482953a12d0a7815f113c92427b4992ba0f1cb86f

Height

#338,381

Difficulty

10.118632

Transactions

4

Size

3.07 KB

Version

2

Bits

0a1e5ead

Nonce

54,762

Timestamp

1/1/2014, 9:56:09 AM

Confirmations

6,476,670

Merkle Root

67652490765465c15ddb4c217b8628f041a405b37bc35174deddaca4b02d12fd
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.092 × 10⁹⁰(91-digit number)
10921213844294416419…62927700216942691401
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.092 × 10⁹⁰(91-digit number)
10921213844294416419…62927700216942691401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.184 × 10⁹⁰(91-digit number)
21842427688588832839…25855400433885382801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.368 × 10⁹⁰(91-digit number)
43684855377177665679…51710800867770765601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.736 × 10⁹⁰(91-digit number)
87369710754355331358…03421601735541531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.747 × 10⁹¹(92-digit number)
17473942150871066271…06843203471083062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.494 × 10⁹¹(92-digit number)
34947884301742132543…13686406942166124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.989 × 10⁹¹(92-digit number)
69895768603484265086…27372813884332249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.397 × 10⁹²(93-digit number)
13979153720696853017…54745627768664499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.795 × 10⁹²(93-digit number)
27958307441393706034…09491255537328998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.591 × 10⁹²(93-digit number)
55916614882787412069…18982511074657996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.118 × 10⁹³(94-digit number)
11183322976557482413…37965022149315993601
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,764,499 XPM·at block #6,815,050 · 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