Block #337,009

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2013, 9:04:40 AM · Difficulty 10.1393 · 6,490,295 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bd82761fe66520ff3c4faa38ff2e83e91e255aa52f525e68fbcf4c008d27272a

Height

#337,009

Difficulty

10.139254

Transactions

7

Size

1.80 KB

Version

2

Bits

0a23a626

Nonce

20,554

Timestamp

12/31/2013, 9:04:40 AM

Confirmations

6,490,295

Merkle Root

029ba4514d8716639402534668612036dd0996412d824d7137f87232cd1219aa
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.528 × 10⁹⁷(98-digit number)
15284917977462859508…02993933619141178721
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.528 × 10⁹⁷(98-digit number)
15284917977462859508…02993933619141178721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.056 × 10⁹⁷(98-digit number)
30569835954925719017…05987867238282357441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.113 × 10⁹⁷(98-digit number)
61139671909851438035…11975734476564714881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.222 × 10⁹⁸(99-digit number)
12227934381970287607…23951468953129429761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.445 × 10⁹⁸(99-digit number)
24455868763940575214…47902937906258859521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.891 × 10⁹⁸(99-digit number)
48911737527881150428…95805875812517719041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.782 × 10⁹⁸(99-digit number)
97823475055762300857…91611751625035438081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.956 × 10⁹⁹(100-digit number)
19564695011152460171…83223503250070876161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.912 × 10⁹⁹(100-digit number)
39129390022304920343…66447006500141752321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.825 × 10⁹⁹(100-digit number)
78258780044609840686…32894013000283504641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.565 × 10¹⁰⁰(101-digit number)
15651756008921968137…65788026000567009281
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,862,543 XPM·at block #6,827,303 · 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