Block #367,262

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2014, 11:03:26 PM · Difficulty 10.4358 · 6,459,288 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
60fbe0689ef336d6f3fb572621d92fc2322706efd5648959603b6fe28574584b

Height

#367,262

Difficulty

10.435795

Transactions

4

Size

58.89 KB

Version

2

Bits

0a6f903e

Nonce

2,582

Timestamp

1/19/2014, 11:03:26 PM

Confirmations

6,459,288

Merkle Root

ca017dac73cfb59283bcf9241d2e5a1f3297f6e2072d0694eb11f51e11951f2b
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.875 × 10⁹⁷(98-digit number)
18755482216059094415…63708707234852410879
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.875 × 10⁹⁷(98-digit number)
18755482216059094415…63708707234852410879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.751 × 10⁹⁷(98-digit number)
37510964432118188831…27417414469704821759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.502 × 10⁹⁷(98-digit number)
75021928864236377662…54834828939409643519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.500 × 10⁹⁸(99-digit number)
15004385772847275532…09669657878819287039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.000 × 10⁹⁸(99-digit number)
30008771545694551065…19339315757638574079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.001 × 10⁹⁸(99-digit number)
60017543091389102130…38678631515277148159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.200 × 10⁹⁹(100-digit number)
12003508618277820426…77357263030554296319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.400 × 10⁹⁹(100-digit number)
24007017236555640852…54714526061108592639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.801 × 10⁹⁹(100-digit number)
48014034473111281704…09429052122217185279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.602 × 10⁹⁹(100-digit number)
96028068946222563408…18858104244434370559
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,856,549 XPM·at block #6,826,549 · 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