Block #356,859

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2014, 12:42:04 AM · Difficulty 10.3828 · 6,453,873 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48fa35352a9df2b5bf62a6d2f7c8ed7dd0403a190406eba17cedeb3d124f4f39

Height

#356,859

Difficulty

10.382762

Transactions

19

Size

24.69 KB

Version

2

Bits

0a61fcad

Nonce

123,492

Timestamp

1/13/2014, 12:42:04 AM

Confirmations

6,453,873

Merkle Root

c462cdd096c1a63b2db618135db4c3e967f845db6c1f078324c23d5e0f402143
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.472 × 10⁹⁹(100-digit number)
14721755244062145859…71312331789829300399
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.472 × 10⁹⁹(100-digit number)
14721755244062145859…71312331789829300399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.944 × 10⁹⁹(100-digit number)
29443510488124291718…42624663579658600799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.888 × 10⁹⁹(100-digit number)
58887020976248583436…85249327159317201599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.177 × 10¹⁰⁰(101-digit number)
11777404195249716687…70498654318634403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.355 × 10¹⁰⁰(101-digit number)
23554808390499433374…40997308637268806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.710 × 10¹⁰⁰(101-digit number)
47109616780998866748…81994617274537612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.421 × 10¹⁰⁰(101-digit number)
94219233561997733497…63989234549075225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.884 × 10¹⁰¹(102-digit number)
18843846712399546699…27978469098150451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.768 × 10¹⁰¹(102-digit number)
37687693424799093399…55956938196300902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.537 × 10¹⁰¹(102-digit number)
75375386849598186798…11913876392601804799
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,729,946 XPM·at block #6,810,731 · 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