Block #355,928

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2014, 11:13:20 AM · Difficulty 10.3669 · 6,470,332 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
85650e9e2dcc36953245c255e123b7ca50fdc5f495b278ef4ff76916b45b468b

Height

#355,928

Difficulty

10.366897

Transactions

15

Size

3.80 KB

Version

2

Bits

0a5decf8

Nonce

137,688

Timestamp

1/12/2014, 11:13:20 AM

Confirmations

6,470,332

Merkle Root

2bfb31ef407a76e5ef2aedbe821386c20e701e60aef12b5fd5aed1da164eb897
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.

6.896 × 10⁹⁶(97-digit number)
68965078362017613803…47045457322818111999
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
6.896 × 10⁹⁶(97-digit number)
68965078362017613803…47045457322818111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.379 × 10⁹⁷(98-digit number)
13793015672403522760…94090914645636223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.758 × 10⁹⁷(98-digit number)
27586031344807045521…88181829291272447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.517 × 10⁹⁷(98-digit number)
55172062689614091042…76363658582544895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.103 × 10⁹⁸(99-digit number)
11034412537922818208…52727317165089791999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.206 × 10⁹⁸(99-digit number)
22068825075845636417…05454634330179583999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.413 × 10⁹⁸(99-digit number)
44137650151691272834…10909268660359167999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.827 × 10⁹⁸(99-digit number)
88275300303382545668…21818537320718335999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.765 × 10⁹⁹(100-digit number)
17655060060676509133…43637074641436671999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.531 × 10⁹⁹(100-digit number)
35310120121353018267…87274149282873343999
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,854,214 XPM·at block #6,826,259 · 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