Block #368,879

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/21/2014, 12:38:31 AM · Difficulty 10.4462 · 6,445,957 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9d05f232d4a145f16463d7b8aae7f04cdbf4a0dbe1a71e2197d166e5f59530c9

Height

#368,879

Difficulty

10.446157

Transactions

11

Size

4.06 KB

Version

2

Bits

0a723752

Nonce

450

Timestamp

1/21/2014, 12:38:31 AM

Confirmations

6,445,957

Merkle Root

2d98941c8504b6d7cc8f55f1de0b9d5ffdca514dcf6c6cecf04fc4657fb14dcf
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.

2.018 × 10¹⁰²(103-digit number)
20189142266745429261…17741895868135505919
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
2.018 × 10¹⁰²(103-digit number)
20189142266745429261…17741895868135505919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.037 × 10¹⁰²(103-digit number)
40378284533490858523…35483791736271011839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.075 × 10¹⁰²(103-digit number)
80756569066981717047…70967583472542023679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.615 × 10¹⁰³(104-digit number)
16151313813396343409…41935166945084047359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.230 × 10¹⁰³(104-digit number)
32302627626792686818…83870333890168094719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.460 × 10¹⁰³(104-digit number)
64605255253585373637…67740667780336189439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.292 × 10¹⁰⁴(105-digit number)
12921051050717074727…35481335560672378879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.584 × 10¹⁰⁴(105-digit number)
25842102101434149455…70962671121344757759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.168 × 10¹⁰⁴(105-digit number)
51684204202868298910…41925342242689515519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.033 × 10¹⁰⁵(106-digit number)
10336840840573659782…83850684485379031039
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,762,778 XPM·at block #6,814,835 · 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