Block #384,829

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/1/2014, 9:24:08 AM · Difficulty 10.4021 · 6,431,882 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
be7fa5fbcb15f333365dd6e7d8ba6b60cf4d8452fdff02750f9833752acab089

Height

#384,829

Difficulty

10.402107

Transactions

6

Size

1.41 KB

Version

2

Bits

0a66f079

Nonce

74,406

Timestamp

2/1/2014, 9:24:08 AM

Confirmations

6,431,882

Merkle Root

76048ef9d6295e0d1a8e301332b1f80d40cdcc6879d1d076f3258666b04c8a8e
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.944 × 10⁹⁵(96-digit number)
49441053082660024032…81322448044960767999
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.944 × 10⁹⁵(96-digit number)
49441053082660024032…81322448044960767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.888 × 10⁹⁵(96-digit number)
98882106165320048064…62644896089921535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.977 × 10⁹⁶(97-digit number)
19776421233064009612…25289792179843071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.955 × 10⁹⁶(97-digit number)
39552842466128019225…50579584359686143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.910 × 10⁹⁶(97-digit number)
79105684932256038451…01159168719372287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.582 × 10⁹⁷(98-digit number)
15821136986451207690…02318337438744575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.164 × 10⁹⁷(98-digit number)
31642273972902415380…04636674877489151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.328 × 10⁹⁷(98-digit number)
63284547945804830761…09273349754978303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.265 × 10⁹⁸(99-digit number)
12656909589160966152…18546699509956607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.531 × 10⁹⁸(99-digit number)
25313819178321932304…37093399019913215999
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,812 XPM·at block #6,816,710 · 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