Block #350,668

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/9/2014, 5:31:56 AM · Difficulty 10.2846 · 6,464,277 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2409cc7a6740e10cafc1fe46af45d4016a696c846b0632771acf7016cec63300

Height

#350,668

Difficulty

10.284599

Transactions

12

Size

5.78 KB

Version

2

Bits

0a48db7e

Nonce

84,027

Timestamp

1/9/2014, 5:31:56 AM

Confirmations

6,464,277

Merkle Root

c9e706988d7eef872d577fd9e5af4d189c2e7a1a36e6cecd1c733a40ce07deea
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.330 × 10⁹⁶(97-digit number)
13302383603011809573…20982226830962390719
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.330 × 10⁹⁶(97-digit number)
13302383603011809573…20982226830962390719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.660 × 10⁹⁶(97-digit number)
26604767206023619147…41964453661924781439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.320 × 10⁹⁶(97-digit number)
53209534412047238295…83928907323849562879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.064 × 10⁹⁷(98-digit number)
10641906882409447659…67857814647699125759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.128 × 10⁹⁷(98-digit number)
21283813764818895318…35715629295398251519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.256 × 10⁹⁷(98-digit number)
42567627529637790636…71431258590796503039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.513 × 10⁹⁷(98-digit number)
85135255059275581272…42862517181593006079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.702 × 10⁹⁸(99-digit number)
17027051011855116254…85725034363186012159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.405 × 10⁹⁸(99-digit number)
34054102023710232508…71450068726372024319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.810 × 10⁹⁸(99-digit number)
68108204047420465017…42900137452744048639
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the First 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,763,656 XPM·at block #6,814,944 · 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