Block #379,799

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2014, 6:44:54 PM · Difficulty 10.4201 · 6,429,684 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
32c9abba105916ec6bccb5ae9f42d08d8fec85734e69b95b584dd9d04a03493b

Height

#379,799

Difficulty

10.420142

Transactions

2

Size

2.01 KB

Version

2

Bits

0a6b8e73

Nonce

301,993,982

Timestamp

1/28/2014, 6:44:54 PM

Confirmations

6,429,684

Merkle Root

cd1b011559b33f855e40b044612f16cd75dcca7f078e033a06b4f5b3c68fd226
Transactions (2)
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.

3.951 × 10⁹⁵(96-digit number)
39511029240055344574…87138381295615462239
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
3.951 × 10⁹⁵(96-digit number)
39511029240055344574…87138381295615462239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.902 × 10⁹⁵(96-digit number)
79022058480110689148…74276762591230924479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.580 × 10⁹⁶(97-digit number)
15804411696022137829…48553525182461848959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.160 × 10⁹⁶(97-digit number)
31608823392044275659…97107050364923697919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.321 × 10⁹⁶(97-digit number)
63217646784088551319…94214100729847395839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.264 × 10⁹⁷(98-digit number)
12643529356817710263…88428201459694791679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.528 × 10⁹⁷(98-digit number)
25287058713635420527…76856402919389583359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.057 × 10⁹⁷(98-digit number)
50574117427270841055…53712805838779166719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.011 × 10⁹⁸(99-digit number)
10114823485454168211…07425611677558333439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.022 × 10⁹⁸(99-digit number)
20229646970908336422…14851223355116666879
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,719,935 XPM·at block #6,809,482 · 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