Block #379,787

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2014, 6:35:38 PM · Difficulty 10.4197 · 6,427,401 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ea4bd805c89f2b345dea22384477ba9ca807f75cfc76e330fa922b64895ce40e

Height

#379,787

Difficulty

10.419668

Transactions

6

Size

2.31 KB

Version

2

Bits

0a6b6f61

Nonce

202,696

Timestamp

1/28/2014, 6:35:38 PM

Confirmations

6,427,401

Merkle Root

acf246a1d14cd328058c2b3b840157252e60b1e92b5d8519bb9be2aac873ae66
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.757 × 10¹⁰¹(102-digit number)
27576220164610203473…05895711608114245119
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.757 × 10¹⁰¹(102-digit number)
27576220164610203473…05895711608114245119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.515 × 10¹⁰¹(102-digit number)
55152440329220406947…11791423216228490239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.103 × 10¹⁰²(103-digit number)
11030488065844081389…23582846432456980479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.206 × 10¹⁰²(103-digit number)
22060976131688162779…47165692864913960959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.412 × 10¹⁰²(103-digit number)
44121952263376325558…94331385729827921919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.824 × 10¹⁰²(103-digit number)
88243904526752651116…88662771459655843839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.764 × 10¹⁰³(104-digit number)
17648780905350530223…77325542919311687679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.529 × 10¹⁰³(104-digit number)
35297561810701060446…54651085838623375359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.059 × 10¹⁰³(104-digit number)
70595123621402120893…09302171677246750719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.411 × 10¹⁰⁴(105-digit number)
14119024724280424178…18604343354493501439
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,701,516 XPM·at block #6,807,187 · 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