Block #380,842

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/29/2014, 1:30:03 PM · Difficulty 10.4107 · 6,429,286 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7e0fb29214baf021405d0a2b21d16b346d4781681999c269d541b5829434ab0b

Height

#380,842

Difficulty

10.410690

Transactions

3

Size

588 B

Version

2

Bits

0a6922f3

Nonce

95,005

Timestamp

1/29/2014, 1:30:03 PM

Confirmations

6,429,286

Merkle Root

8b7eefc755c32890365acd6c2e1e0659022fbc2b9ae4565879123e0ec9f95e09
Transactions (3)
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.840 × 10¹⁰²(103-digit number)
18402790545099028696…71599155979604915199
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.840 × 10¹⁰²(103-digit number)
18402790545099028696…71599155979604915199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.680 × 10¹⁰²(103-digit number)
36805581090198057393…43198311959209830399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.361 × 10¹⁰²(103-digit number)
73611162180396114787…86396623918419660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.472 × 10¹⁰³(104-digit number)
14722232436079222957…72793247836839321599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.944 × 10¹⁰³(104-digit number)
29444464872158445915…45586495673678643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.888 × 10¹⁰³(104-digit number)
58888929744316891830…91172991347357286399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.177 × 10¹⁰⁴(105-digit number)
11777785948863378366…82345982694714572799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.355 × 10¹⁰⁴(105-digit number)
23555571897726756732…64691965389429145599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.711 × 10¹⁰⁴(105-digit number)
47111143795453513464…29383930778858291199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.422 × 10¹⁰⁴(105-digit number)
94222287590907026928…58767861557716582399
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,725,097 XPM·at block #6,810,127 · 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