Block #340,883

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2014, 2:22:09 AM · Difficulty 10.1329 · 6,467,377 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c9a73ebb4e137a6e4b55bb92189d1a6b70c34a80caf7fbde5f0ccb1fc864a754

Height

#340,883

Difficulty

10.132943

Transactions

4

Size

2.43 KB

Version

2

Bits

0a220889

Nonce

49,762

Timestamp

1/3/2014, 2:22:09 AM

Confirmations

6,467,377

Merkle Root

e450f97104462d2d6274dd95e00d9dd5a4539d774b5e248e347475e007073e3e
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.002 × 10⁹⁵(96-digit number)
10021617715231214821…43928937663106734081
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.002 × 10⁹⁵(96-digit number)
10021617715231214821…43928937663106734081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.004 × 10⁹⁵(96-digit number)
20043235430462429643…87857875326213468161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.008 × 10⁹⁵(96-digit number)
40086470860924859286…75715750652426936321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.017 × 10⁹⁵(96-digit number)
80172941721849718573…51431501304853872641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.603 × 10⁹⁶(97-digit number)
16034588344369943714…02863002609707745281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.206 × 10⁹⁶(97-digit number)
32069176688739887429…05726005219415490561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.413 × 10⁹⁶(97-digit number)
64138353377479774858…11452010438830981121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.282 × 10⁹⁷(98-digit number)
12827670675495954971…22904020877661962241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.565 × 10⁹⁷(98-digit number)
25655341350991909943…45808041755323924481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.131 × 10⁹⁷(98-digit number)
51310682701983819886…91616083510647848961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.026 × 10⁹⁸(99-digit number)
10262136540396763977…83232167021295697921
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,710,127 XPM·at block #6,808,259 · 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.

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