Block #382,346

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/30/2014, 3:32:34 PM · Difficulty 10.4044 · 6,424,744 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a26f62ba0c7dbe0778d9fe74aeb5bb3f50f319e34917178977b74b1392e3442c

Height

#382,346

Difficulty

10.404444

Transactions

6

Size

5.92 KB

Version

2

Bits

0a67899d

Nonce

235,104

Timestamp

1/30/2014, 3:32:34 PM

Confirmations

6,424,744

Merkle Root

b5db3daf8aa4572d5291281ff42c76f41d0b9063bcc179c4a24a766728fb99c1
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.

4.713 × 10¹⁰²(103-digit number)
47137988160856453159…50588842326696671999
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
4.713 × 10¹⁰²(103-digit number)
47137988160856453159…50588842326696671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.427 × 10¹⁰²(103-digit number)
94275976321712906319…01177684653393343999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.885 × 10¹⁰³(104-digit number)
18855195264342581263…02355369306786687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.771 × 10¹⁰³(104-digit number)
37710390528685162527…04710738613573375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.542 × 10¹⁰³(104-digit number)
75420781057370325055…09421477227146751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.508 × 10¹⁰⁴(105-digit number)
15084156211474065011…18842954454293503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.016 × 10¹⁰⁴(105-digit number)
30168312422948130022…37685908908587007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.033 × 10¹⁰⁴(105-digit number)
60336624845896260044…75371817817174015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.206 × 10¹⁰⁵(106-digit number)
12067324969179252008…50743635634348031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.413 × 10¹⁰⁵(106-digit number)
24134649938358504017…01487271268696063999
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,700,818 XPM·at block #6,807,089 · 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