Block #342,569

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/4/2014, 4:08:49 AM · Difficulty 10.1575 · 6,484,736 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6fed5778015bbd52073af4f488d1355072b3175b4616051d8287f8f253bd0615

Height

#342,569

Difficulty

10.157494

Transactions

2

Size

892 B

Version

2

Bits

0a285185

Nonce

130,906

Timestamp

1/4/2014, 4:08:49 AM

Confirmations

6,484,736

Merkle Root

f641f83ee84b16837d4b59299b6e0cfc1e6c72db7aa380d568537aab4c72c8af
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.103 × 10⁹⁵(96-digit number)
11038819964161630184…89514034246315204609
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.103 × 10⁹⁵(96-digit number)
11038819964161630184…89514034246315204609
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.207 × 10⁹⁵(96-digit number)
22077639928323260369…79028068492630409219
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.415 × 10⁹⁵(96-digit number)
44155279856646520738…58056136985260818439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.831 × 10⁹⁵(96-digit number)
88310559713293041476…16112273970521636879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.766 × 10⁹⁶(97-digit number)
17662111942658608295…32224547941043273759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.532 × 10⁹⁶(97-digit number)
35324223885317216590…64449095882086547519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.064 × 10⁹⁶(97-digit number)
70648447770634433181…28898191764173095039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.412 × 10⁹⁷(98-digit number)
14129689554126886636…57796383528346190079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.825 × 10⁹⁷(98-digit number)
28259379108253773272…15592767056692380159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.651 × 10⁹⁷(98-digit number)
56518758216507546545…31185534113384760319
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,862,551 XPM·at block #6,827,304 · 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