Block #380,785

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/29/2014, 12:38:33 PM · Difficulty 10.4100 · 6,435,916 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8ae7088d4bf5f40a2c058fc6b44fc8acc55de798c949d6f1dfa79b66d35b41bf

Height

#380,785

Difficulty

10.409958

Transactions

3

Size

660 B

Version

2

Bits

0a68f2fd

Nonce

7,519

Timestamp

1/29/2014, 12:38:33 PM

Confirmations

6,435,916

Merkle Root

1a0909254f9839ab199baff69a0eed1b7861dba01c94516ed64ecae03b5347fc
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.723 × 10⁹⁹(100-digit number)
17238968667516352915…37829637700555673599
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.723 × 10⁹⁹(100-digit number)
17238968667516352915…37829637700555673599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.447 × 10⁹⁹(100-digit number)
34477937335032705830…75659275401111347199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.895 × 10⁹⁹(100-digit number)
68955874670065411661…51318550802222694399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.379 × 10¹⁰⁰(101-digit number)
13791174934013082332…02637101604445388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.758 × 10¹⁰⁰(101-digit number)
27582349868026164664…05274203208890777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.516 × 10¹⁰⁰(101-digit number)
55164699736052329328…10548406417781555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.103 × 10¹⁰¹(102-digit number)
11032939947210465865…21096812835563110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.206 × 10¹⁰¹(102-digit number)
22065879894420931731…42193625671126220799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.413 × 10¹⁰¹(102-digit number)
44131759788841863463…84387251342252441599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.826 × 10¹⁰¹(102-digit number)
88263519577683726926…68774502684504883199
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,777,730 XPM·at block #6,816,700 · 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