Block #360,885

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/15/2014, 5:26:22 PM · Difficulty 10.4004 · 6,457,076 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
23c7de56f161900d6206e5fad342911f04b39bb15c140234934954ad7bf5ee70

Height

#360,885

Difficulty

10.400433

Transactions

7

Size

5.27 KB

Version

2

Bits

0a6682cb

Nonce

21,389

Timestamp

1/15/2014, 5:26:22 PM

Confirmations

6,457,076

Merkle Root

511e34def15b8eaa30e5e710e778116077f71bb3d31c5669c7bdd5a9d3d403e2
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.736 × 10¹⁰¹(102-digit number)
17368137293099767457…35350752651167662079
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.736 × 10¹⁰¹(102-digit number)
17368137293099767457…35350752651167662079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.473 × 10¹⁰¹(102-digit number)
34736274586199534914…70701505302335324159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.947 × 10¹⁰¹(102-digit number)
69472549172399069828…41403010604670648319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.389 × 10¹⁰²(103-digit number)
13894509834479813965…82806021209341296639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.778 × 10¹⁰²(103-digit number)
27789019668959627931…65612042418682593279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.557 × 10¹⁰²(103-digit number)
55578039337919255862…31224084837365186559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.111 × 10¹⁰³(104-digit number)
11115607867583851172…62448169674730373119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.223 × 10¹⁰³(104-digit number)
22231215735167702345…24896339349460746239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.446 × 10¹⁰³(104-digit number)
44462431470335404690…49792678698921492479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.892 × 10¹⁰³(104-digit number)
88924862940670809380…99585357397842984959
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,787,757 XPM·at block #6,817,960 · 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