Block #356,369

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/12/2014, 5:06:22 PM · Difficulty 10.3781 · 6,450,790 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8b8aae014864edcbaad0a1bf2eea98f0014b8cdde15543dac56056ce691b165a

Height

#356,369

Difficulty

10.378110

Transactions

2

Size

429 B

Version

2

Bits

0a60cbc9

Nonce

30,508

Timestamp

1/12/2014, 5:06:22 PM

Confirmations

6,450,790

Merkle Root

d8e347db53a2a92e5d7e25831d7239d8144fe4c8166b7fb7ac9f0cf0db2d8466
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.

1.214 × 10¹⁰²(103-digit number)
12148411529364234864…61098027565966737239
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.214 × 10¹⁰²(103-digit number)
12148411529364234864…61098027565966737239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.429 × 10¹⁰²(103-digit number)
24296823058728469729…22196055131933474479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.859 × 10¹⁰²(103-digit number)
48593646117456939459…44392110263866948959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.718 × 10¹⁰²(103-digit number)
97187292234913878918…88784220527733897919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.943 × 10¹⁰³(104-digit number)
19437458446982775783…77568441055467795839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.887 × 10¹⁰³(104-digit number)
38874916893965551567…55136882110935591679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.774 × 10¹⁰³(104-digit number)
77749833787931103135…10273764221871183359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.554 × 10¹⁰⁴(105-digit number)
15549966757586220627…20547528443742366719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.109 × 10¹⁰⁴(105-digit number)
31099933515172441254…41095056887484733439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.219 × 10¹⁰⁴(105-digit number)
62199867030344882508…82190113774969466879
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,701,280 XPM·at block #6,807,158 · 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