Block #384,371

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/1/2014, 1:44:58 AM · Difficulty 10.4020 · 6,432,071 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
16e0934673c0afceb1fc925cd6f9238b4ce20720dfdd04ec83d9cd43fbdae931

Height

#384,371

Difficulty

10.402031

Transactions

8

Size

2.61 KB

Version

2

Bits

0a66eb7b

Nonce

85,237

Timestamp

2/1/2014, 1:44:58 AM

Confirmations

6,432,071

Merkle Root

30db5d588e1ea20303a724932ed0031c90e3012c56bca5ae59a819e9123d7131
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.

8.979 × 10⁹⁶(97-digit number)
89794692038230617088…02071964857776217599
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
8.979 × 10⁹⁶(97-digit number)
89794692038230617088…02071964857776217599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.795 × 10⁹⁷(98-digit number)
17958938407646123417…04143929715552435199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.591 × 10⁹⁷(98-digit number)
35917876815292246835…08287859431104870399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.183 × 10⁹⁷(98-digit number)
71835753630584493670…16575718862209740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.436 × 10⁹⁸(99-digit number)
14367150726116898734…33151437724419481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.873 × 10⁹⁸(99-digit number)
28734301452233797468…66302875448838963199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.746 × 10⁹⁸(99-digit number)
57468602904467594936…32605750897677926399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.149 × 10⁹⁹(100-digit number)
11493720580893518987…65211501795355852799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.298 × 10⁹⁹(100-digit number)
22987441161787037974…30423003590711705599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.597 × 10⁹⁹(100-digit number)
45974882323574075949…60846007181423411199
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,775,662 XPM·at block #6,816,441 · 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