Block #746,250

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/29/2014, 3:22:40 PM · Difficulty 10.9788 · 6,080,588 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
319a13292320441c9e2eeb4893e46b13d316f04fd2998621d001adda1c27f147

Height

#746,250

Difficulty

10.978801

Transactions

3

Size

57.89 KB

Version

2

Bits

0afa92b6

Nonce

346,324,336

Timestamp

9/29/2014, 3:22:40 PM

Confirmations

6,080,588

Merkle Root

e800352a15c53bb3a59e8510092405c65acbc47f7b377cdc0401bfe86745d3ae
Transactions (3)
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.

6.157 × 10⁹⁵(96-digit number)
61576823160508544030…90728877400349292321
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
6.157 × 10⁹⁵(96-digit number)
61576823160508544030…90728877400349292321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.231 × 10⁹⁶(97-digit number)
12315364632101708806…81457754800698584641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.463 × 10⁹⁶(97-digit number)
24630729264203417612…62915509601397169281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.926 × 10⁹⁶(97-digit number)
49261458528406835224…25831019202794338561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.852 × 10⁹⁶(97-digit number)
98522917056813670449…51662038405588677121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.970 × 10⁹⁷(98-digit number)
19704583411362734089…03324076811177354241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.940 × 10⁹⁷(98-digit number)
39409166822725468179…06648153622354708481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.881 × 10⁹⁷(98-digit number)
78818333645450936359…13296307244709416961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.576 × 10⁹⁸(99-digit number)
15763666729090187271…26592614489418833921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.152 × 10⁹⁸(99-digit number)
31527333458180374543…53185228978837667841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.305 × 10⁹⁸(99-digit number)
63054666916360749087…06370457957675335681
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,858,871 XPM·at block #6,826,837 · 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