Block #361,331

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2014, 12:04:20 AM · Difficulty 10.4062 · 6,448,367 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7d08bba79c6f7ee92ce22c905f7a8e3eedcb34fca55d5537f7ed64f0b8502d71

Height

#361,331

Difficulty

10.406184

Transactions

2

Size

1.93 KB

Version

2

Bits

0a67fba9

Nonce

1,826

Timestamp

1/16/2014, 12:04:20 AM

Confirmations

6,448,367

Merkle Root

8193e0b5a6d8c1af81deb27029c761fcd15a7fffb98a92058b94566f5fa50693
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.

3.544 × 10⁸⁹(90-digit number)
35440816847016204111…20093566729619527679
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
3.544 × 10⁸⁹(90-digit number)
35440816847016204111…20093566729619527679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.088 × 10⁸⁹(90-digit number)
70881633694032408223…40187133459239055359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.417 × 10⁹⁰(91-digit number)
14176326738806481644…80374266918478110719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.835 × 10⁹⁰(91-digit number)
28352653477612963289…60748533836956221439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.670 × 10⁹⁰(91-digit number)
56705306955225926578…21497067673912442879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.134 × 10⁹¹(92-digit number)
11341061391045185315…42994135347824885759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.268 × 10⁹¹(92-digit number)
22682122782090370631…85988270695649771519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.536 × 10⁹¹(92-digit number)
45364245564180741263…71976541391299543039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.072 × 10⁹¹(92-digit number)
90728491128361482526…43953082782599086079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.814 × 10⁹²(93-digit number)
18145698225672296505…87906165565198172159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.629 × 10⁹²(93-digit number)
36291396451344593010…75812331130396344319
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 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
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 1CC formula:

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